| /external/ImageMagick/PerlMagick/t/ |
| D | input_gray_lsb_double.mat | 1 …���.�����Pg�� ���f��9��8��?������?9��8���?q �q ��?�������?��8�#4�?�8���I�?UUUU��?�������?��8…
3 �?�8��8��?9��83�?�������?�8��85�?9��8�?����@ �?��8�ca�?r �q���?�������?��8��
4 …q ���?�q ���?����� �?q �q���?9��8��?UUUU� �?9��85�?�q ��4�?�����4�?�q ��^�?��8��^�?�������?�����…
|
| /external/libvpx/libvpx/vpx_dsp/arm/ |
| D | idct32x32_add_neon.c | 120 int32x4_t q[4]; in do_butterfly() local
132 q[0] = vmull_s16(d[0], d[4]); in do_butterfly()
133 q[1] = vmull_s16(d[1], d[4]); in do_butterfly()
134 q[0] = vmlsl_s16(q[0], d[2], d[5]); in do_butterfly()
135 q[1] = vmlsl_s16(q[1], d[3], d[5]); in do_butterfly()
137 q[2] = vmull_s16(d[0], d[5]); in do_butterfly()
138 q[3] = vmull_s16(d[1], d[5]); in do_butterfly()
139 q[2] = vmlal_s16(q[2], d[2], d[4]); in do_butterfly()
140 q[3] = vmlal_s16(q[3], d[3], d[4]); in do_butterfly()
142 *qOut0 = vcombine_s16(vrshrn_n_s32(q[0], DCT_CONST_BITS), in do_butterfly()
[all …]
|
| D | highbd_idct32x32_1024_add_neon.c | 92 int64x2x2_t q[4]; in do_butterfly() local
99 q[0].val[0] = vmull_s32(vget_low_s32(qIn0.val[0]), d[4]); in do_butterfly()
100 q[0].val[1] = vmull_s32(vget_high_s32(qIn0.val[0]), d[4]); in do_butterfly()
101 q[1].val[0] = vmull_s32(vget_low_s32(qIn0.val[1]), d[4]); in do_butterfly()
102 q[1].val[1] = vmull_s32(vget_high_s32(qIn0.val[1]), d[4]); in do_butterfly()
103 q[0].val[0] = vmlsl_s32(q[0].val[0], vget_low_s32(qIn1.val[0]), d[5]); in do_butterfly()
104 q[0].val[1] = vmlsl_s32(q[0].val[1], vget_high_s32(qIn1.val[0]), d[5]); in do_butterfly()
105 q[1].val[0] = vmlsl_s32(q[1].val[0], vget_low_s32(qIn1.val[1]), d[5]); in do_butterfly()
106 q[1].val[1] = vmlsl_s32(q[1].val[1], vget_high_s32(qIn1.val[1]), d[5]); in do_butterfly()
108 q[2].val[0] = vmull_s32(vget_low_s32(qIn0.val[0]), d[5]); in do_butterfly()
[all …]
|
| /external/llvm-project/libc/docs/ |
| D | header_gen_scheme.svg | 1 …q-0.15625 0.34375 -0.28125 0.453125q-0.171875 0.125 -0.421875 0.125q-0.265625 0 -0.46875 -0.203125…
|
| D | redirectors_schematic.svg | 1 …q-0.546875 -1.453125 -0.8125 -2.375q-0.21875 1.09375 -0.609375 2.1875l-1.265625 3.359375zm8.453125…
|
| /external/tensorflow/tensorflow/compiler/mlir/g3doc/images/ |
| D | mlir-infra.svg | 1 …q-0.359375 -0.125 -0.609375 -0.1875q-0.234375 -0.0625 -0.515625 -0.0625q-0.78125 0 -1.234375 0.562…
|
| /external/python/cpython3/Doc/library/ |
| D | pathlib-inheritance.svg | 1 …q-0.234375 0.21875 -0.8125 0.21875l-3.46875 0q-0.578125 0 -0.828125 -0.21875q-0.25 -0.234375 -0.25…
|
| /external/llvm-project/libcxx/src/ |
| D | hash.cpp | 200 const std::size_t q = n / p; in __next_prime() local
201 if (q < p) in __next_prime()
203 if (n == q * p) in __next_prime()
211 std::size_t q = n / i; in __next_prime() local
212 if (q < i) in __next_prime()
214 if (n == q * i) in __next_prime()
218 q = n / i; in __next_prime()
219 if (q < i) in __next_prime()
221 if (n == q * i) in __next_prime()
225 q = n / i; in __next_prime()
[all …]
|
| /external/libcxx/src/ |
| D | hash.cpp | 209 const std::size_t q = n / p; in __next_prime() local
210 if (q < p) in __next_prime()
212 if (n == q * p) in __next_prime()
220 std::size_t q = n / i; in __next_prime() local
221 if (q < i) in __next_prime()
223 if (n == q * i) in __next_prime()
227 q = n / i; in __next_prime()
228 if (q < i) in __next_prime()
230 if (n == q * i) in __next_prime()
234 q = n / i; in __next_prime()
[all …]
|
| /external/llvm-project/mlir/docs/includes/img/ |
| D | DefUseChains.svg | 1 …q-0.453125 0.75 -1.390625 1.203125q1.203125 0.359375 1.859375 1.21875q0.65625 0.85937595 0.65625 2…
|
| D | Use-list.svg | 1 …q-0.921875 0.765625 -1.765625 1.09375q-0.828125 0.3125 -1.796875 0.3125q-1.59375 0 -2.453125 -0.78…
|
| /external/libchrome/base/containers/ |
| D | circular_deque_unittest.cc | 115 circular_deque<DestructorCounter> q; in TEST() local
116 q.resize(5, DestructorCounter(&destruct_count)); in TEST()
125 circular_deque<DestructorCounter> q; in TEST() local
126 q.reserve(7); in TEST()
127 q.resize(5, DestructorCounter(&destruct_count)); in TEST()
132 q.emplace_back(&destruct_count); in TEST()
133 q.pop_front(); in TEST()
167 circular_deque<int> q = {1, 2, 3, 4, 5, 6}; in TEST() local
168 q = *&q; // The *& defeats Clang's -Wself-assign warning. in TEST()
169 EXPECT_EQ(6u, q.size()); in TEST()
[all …]
|
| /external/tensorflow/tensorflow/python/compiler/tensorrt/test/ |
| D | unary_test.py | 38 q = math_ops.abs(x)
39 q = q + 1.0
40 q = gen_math_ops.exp(q)
41 q = gen_math_ops.log(q)
42 q = array_ops.squeeze(q, axis=-2)
43 q = math_ops.abs(q)
44 q = q + 2.2
45 q = gen_math_ops.sqrt(q)
46 q = gen_math_ops.rsqrt(q)
47 q = math_ops.negative(q)
[all …]
|
| /external/tensorflow/tensorflow/lite/g3doc/inference_with_metadata/task_library/images/ |
| D | prebuilt_task_apis.svg | 1 …q-0.6875 0.546875 -2.015625 0.546875l-3.0 0l0 -0.859375l0.359375 -0.03125q0.296875 -0.03125 0.2968…
|
| /external/mesa3d/src/compiler/glsl/ |
| D | ast_type.cpp | 46 subroutine_only.flags.q.subroutine = 1; in has_qualifiers()
48 subroutine_only.flags.q.explicit_index = 1; in has_qualifiers()
55 return this->flags.q.smooth in has_interpolation()
56 || this->flags.q.flat in has_interpolation()
57 || this->flags.q.noperspective; in has_interpolation()
63 return this->flags.q.origin_upper_left in has_layout()
64 || this->flags.q.pixel_center_integer in has_layout()
65 || this->flags.q.depth_type in has_layout()
66 || this->flags.q.std140 in has_layout()
67 || this->flags.q.std430 in has_layout()
[all …]
|
| /external/tensorflow/tensorflow/lite/g3doc/r1/images/convert/ |
| D | workflow.svg | 1 …q-0.734375 0.53125 -2.078125 0.53125q-1.421875 0 -2.21875 -0.4375l0 -1.015625q0.515625 0.265625 1.…
|
| /external/tensorflow/tensorflow/lite/g3doc/images/convert/ |
| D | workflow.svg | 1 …q-0.734375 0.53125 -2.078125 0.53125q-1.421875 0 -2.21875 -0.4375l0 -1.015625q0.515625 0.265625 1.…
|
| /external/ImageMagick/MagickCore/ |
| D | quantum-export.c | 243 unsigned char *magick_restrict q,ExceptionInfo *exception) in ExportAlphaQuantum() argument
264 q=PopCharPixel(pixel,q); in ExportAlphaQuantum()
266 q+=quantum_info->pad; in ExportAlphaQuantum()
280 q=PopShortPixel(quantum_info->endian,pixel,q); in ExportAlphaQuantum()
282 q+=quantum_info->pad; in ExportAlphaQuantum()
289 q=PopShortPixel(quantum_info->endian,pixel,q); in ExportAlphaQuantum()
291 q+=quantum_info->pad; in ExportAlphaQuantum()
304 q=PopFloatPixel(quantum_info,(float) GetPixelAlpha(image,p),q); in ExportAlphaQuantum()
306 q+=quantum_info->pad; in ExportAlphaQuantum()
313 q=PopLongPixel(quantum_info->endian,pixel,q); in ExportAlphaQuantum()
[all …]
|
| /external/python/cpython3/Lib/test/ |
| D | test_queue.py | 17 def qfull(q): argument
18 return q.maxsize > 0 and q.qsize() == q.maxsize
92 def basic_queue_test(self, q): argument
93 if q.qsize():
95 self.assertTrue(q.empty())
96 self.assertFalse(q.full())
98 q.put(111)
99 q.put(333)
100 q.put(222)
104 actual_order = [q.get(), q.get(), q.get()]
[all …]
|
| /external/eigen/unsupported/test/ |
| D | cxx11_runqueue.cpp | 30 RunQueue<int, 4> q; in test_basic_runqueue() local
32 VERIFY(q.Empty()); in test_basic_runqueue()
33 VERIFY_IS_EQUAL(0u, q.Size()); in test_basic_runqueue()
34 VERIFY_IS_EQUAL(0, q.PopFront()); in test_basic_runqueue()
36 VERIFY_IS_EQUAL(0u, q.PopBackHalf(&stolen)); in test_basic_runqueue()
39 VERIFY_IS_EQUAL(0, q.PushFront(1)); in test_basic_runqueue()
40 VERIFY_IS_EQUAL(1u, q.Size()); in test_basic_runqueue()
41 VERIFY_IS_EQUAL(1, q.PopFront()); in test_basic_runqueue()
42 VERIFY_IS_EQUAL(0u, q.Size()); in test_basic_runqueue()
44 VERIFY_IS_EQUAL(0, q.PushFront(2)); in test_basic_runqueue()
[all …]
|
| /external/python/cpython2/Lib/test/ |
| D | test_queue.py | 90 def simple_queue_test(self, q): argument
91 if not q.empty():
94 q.put(111)
95 q.put(333)
96 q.put(222)
100 actual_order = [q.get(), q.get(), q.get()]
101 self.assertEqual(actual_order, target_order[q.__class__.__name__],
104 q.put(i)
105 self.assertTrue(not q.empty(), "Queue should not be empty")
106 self.assertTrue(not q.full(), "Queue should not be full")
[all …]
|
| /external/rust/crates/bstr/src/unicode/fsm/ |
| D | grapheme_break_rev.bigendian.dfa | 3 …�������������������������������������������������������qqq q,q:qHqRqXqbqlqRqvqRq�q�q�q�q�q�q�q�…
22 …q�p$q�^p$�`��`�����������������p p$q��p$�`��`�����������������p p$�^p$��`��`� �������������…
23 …���������������p p$q�p$q��p$�`��`�����������������p p$q��p$�`��`���������������p p$�p$�`��…
24 ��������������������p p$q��p$�`��`��`�
25 …�p p$�p$:��`�J�`�����������������p p$q��p$�`��`���������������p p$�p$�`��`� �����������…
|
| D | grapheme_break_rev.littleendian.dfa | 3 …������������������������������������������������������qq q,q:qHqRqXqbqlqRqvqRq�q�q�q�q�q�q�q�q�…
22 …q$p�q^�$p`��`������������������ p$p�q�$p`��`������������������ p$p^�$p�`��`� ��������������…
23 …�������������� p$p�q$p�q�$p`��`������������������ p$p�q�$p`��`���������������� p$p�$p`��`�…
24 ��������������������� p$p�q�$p`��`��`�
25 … p$p�$p:�`��J`������������������ p$p�q�$p`��`���������������� p$p�$p`��`� �������������…
|
| /external/mesa3d/src/gallium/drivers/iris/ |
| D | iris_query.c | 99 query_mem64(struct iris_query *q, uint32_t offset) in query_mem64() argument
102 .bo = iris_resource_bo(q->query_state_ref.res), in query_mem64()
103 .offset = q->query_state_ref.offset + offset, in query_mem64()
113 iris_is_query_pipelined(struct iris_query *q) in iris_is_query_pipelined() argument
115 switch (q->type) { in iris_is_query_pipelined()
130 mark_available(struct iris_context *ice, struct iris_query *q) in mark_available() argument
132 struct iris_batch *batch = &ice->batches[q->batch_idx]; in mark_available()
135 struct iris_bo *bo = iris_resource_bo(q->query_state_ref.res); in mark_available()
136 offset += q->query_state_ref.offset; in mark_available()
138 if (!iris_is_query_pipelined(q)) { in mark_available()
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/common/test/channels/ |
| D | RendezvousChannelTest.kt | 13 val q = Channel<Int>(Channel.RENDEZVOUS) in <lambda>() constant
14 check(q.isEmpty) in <lambda>()
18 q.send(1) // suspend -- the first to come to rendezvous in <lambda>()
20 q.send(2) // does not suspend -- receiver is there in <lambda>()
26 check(q.receive() == 1) // does not suspend -- sender was there in <lambda>()
28 check(q.receive() == 2) // suspends in <lambda>()
34 check(q.isEmpty) in <lambda>()
40 val q = Channel<Int>(Channel.RENDEZVOUS) in <lambda>() constant
41 check(q.isEmpty && !q.isClosedForSend && !q.isClosedForReceive) in <lambda>()
45 assertEquals(42, q.receiveOrNull()) in <lambda>()
[all …]
|
