| /external/eigen/unsupported/test/ |
| D | kronecker_product.cpp | 19 void check_dimension(const MatrixType& ab, const int rows, const int cols) in check_dimension() argument
21 VERIFY_IS_EQUAL(ab.rows(), rows); in check_dimension()
22 VERIFY_IS_EQUAL(ab.cols(), cols); in check_dimension()
27 void check_kronecker_product(const MatrixType& ab) in check_kronecker_product() argument
29 VERIFY_IS_EQUAL(ab.rows(), 6); in check_kronecker_product()
30 VERIFY_IS_EQUAL(ab.cols(), 6); in check_kronecker_product()
31 VERIFY_IS_EQUAL(ab.nonZeros(), 36); in check_kronecker_product()
32 VERIFY_IS_APPROX(ab.coeff(0,0), -0.4017367630386106); in check_kronecker_product()
33 VERIFY_IS_APPROX(ab.coeff(0,1), 0.1056863433932735); in check_kronecker_product()
34 VERIFY_IS_APPROX(ab.coeff(0,2), -0.7255206194554212); in check_kronecker_product()
[all …]
|
| /external/harfbuzz_ng/src/ |
| D | hb-ot-shape-complex-hebrew.cc | 34 hb_codepoint_t *ab) in compose_hebrew() argument
71 bool found = c->unicode->compose (a, b, ab); in compose_hebrew()
80 *ab = 0xFB1Du; in compose_hebrew()
86 *ab = 0xFB1Fu; in compose_hebrew()
89 *ab = 0xFB2Eu; in compose_hebrew()
95 *ab = 0xFB2Fu; in compose_hebrew()
101 *ab = 0xFB4Bu; in compose_hebrew()
107 *ab = sDageshForms[a - 0x05D0u]; in compose_hebrew()
108 found = (*ab != 0); in compose_hebrew()
110 *ab = 0xFB2Cu; in compose_hebrew()
[all …]
|
| /external/pcre/dist/testdata/ |
| D | testoutput12 | 73 ab\P
74 Partial match: ab (JIT)
75 ab\P\P
76 Partial match: ab (JIT)
83 ab\P
84 Partial match: ab (JIT)
85 ab\P\P
86 Partial match: ab (JIT)
93 ab\P
94 Partial match: ab
[all …]
|
| D | testinput12 | 29 ab\P
30 ab\P\P
35 ab\P
36 ab\P\P
41 ab\P
42 ab\P\P
48 ab\P
49 ab\P\P
54 ab\P
55 ab\P\P
[all …]
|
| D | testinput4 | 120 /\x{ab}/8
121 \x{ab}
124 \x00{ab}
271 ab> <cd
272 ab> <ce
274 ab> <cd
277 ab> <cd
278 ab> <ce
280 ab> <cd
288 ab cd
[all …]
|
| D | testinput9 | 7 /\x{100}ab/8
8 \x{100}ab
11 ab
19 ab
176 /\x{ab}/8
177 \x{ab}
180 \x00{ab}
327 ab> <cd
328 ab> <ce
330 ab> <cd
[all …]
|
| D | testoutput4 | 239 /\x{ab}/8
240 \x{ab}
241 0: \x{ab}
243 0: \x{ab}
246 \x00{ab}
390 0: ab
400 0: ab
402 0: ab
472 ab> <cd
475 ab> <ce
[all …]
|
| D | testinput8 | 10 /ab*c/
15 /ab+c/
20 ab
148 /ab?\w/
346 /^(a*\w|ab)=(a*\w|ab)/
347 ab=ab
349 /^(a*\w|ab)=(?1)/
350 ab=ab
425 /(ab|cd){3,4}/C
466 ab\P
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| D | move_alloc.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
56 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
|
| D | move_assign.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
42 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
45 for (int* p = ab; p < an; ++p) in main()
48 for (int* p = ab; p < an; ++p) in main()
57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
58 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
|
| D | copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), in main()
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)), in main()
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()), in main()
|
| D | move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
57 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
|
| D | iter_iter_alloc.pass.cpp | 39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); in main()
42 … test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); in main()
43 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocato… in main()
44 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocato… in main()
46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); in main()
47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); in main()
48 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator… in main()
49 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator… in main()
|
| D | copy.pass.cpp | 30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
32 test(std::deque<int>(ab, an)); in main()
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
52 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
|
| D | op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
33 test(std::deque<int>(ab, an)); in main()
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
53 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
|
| D | iter_iter.pass.cpp | 52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
53 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); in main()
55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); in main()
56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); in main()
57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); in main()
58 test<stack_allocator<int, 4096> >(ab, an); in main()
60 test<min_allocator<int> >(ab, an); in main()
|
| /external/icu/icu4c/source/test/testdata/ |
| D | re_tests.txt | 13 ab*c abc y $& abc
14 ab*c abc y $-[0] 0
15 ab*c abc y $+[0] 3
16 ab*bc abc y $& abc
17 ab*bc abc y $-[0] 0
18 ab*bc abc y $+[0] 3
19 ab*bc abbc y $& abbc
20 ab*bc abbc y $-[0] 0
21 ab*bc abbc y $+[0] 4
22 ab*bc abbbbc y $& abbbbc
[all …]
|
| /external/libvncserver/webclients/novnc/include/web-socket-js/ |
| D | swfobject.js | 4 …ab=null;if(typeof t.plugins!=D&&typeof t.plugins[S]==r){ab=t.plugins[S].description;if(ab&&!(typeo… argument
|
| /external/valgrind/memcheck/tests/amd64/ |
| D | fxsave-amd64.stdout.exp | 18 176 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
21 224 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
24 272 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
25 288 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
28 336 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
29 352 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
32 400 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
86 176 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
89 224 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
92 272 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
[all …]
|
| /external/v8/test/mjsunit/harmony/ |
| D | typedarrays.js | 31 var ab = new ArrayBuffer(param);
32 assertSame(expectedByteLength, ab.byteLength);
53 var ab = new ArrayBuffer();
54 assertSame(0, ab.byteLength);
60 var ab = new ArrayBuffer(1024);
61 assertSame(1024, ab.byteLength);
63 assertThrows(function() { "use strict"; ab.byteLength = 42; }, TypeError);
69 var ab = new ArrayBuffer(initialLen);
70 var a1 = new Uint8Array(ab);
74 var slice = ab.slice(start, end);
[all …]
|
| /external/compiler-rt/lib/builtins/ppc/ |
| D | gcc_qmul.c | 21 double ab, tmp, tau; in __gcc_qmul() local
23 ab = A * B; in __gcc_qmul()
26 if (ab == 0.0) { in __gcc_qmul()
27 dst.s.hi = ab; in __gcc_qmul()
32 const doublebits abBits = { .d = ab }; in __gcc_qmul()
34 dst.s.hi = ab; in __gcc_qmul()
45 tmp = LOWORDER(ab, aHi, aLo, bHi, bLo); in __gcc_qmul()
47 tau = ab + tmp; in __gcc_qmul()
49 dst.s.lo = (ab - tau) + tmp; in __gcc_qmul()
|
| /external/harfbuzz_ng/test/api/ |
| D | test-unicode.c | 788 gunichar a, b, ab; in test_unicode_normalization() local
795 g_assert (!hb_unicode_compose (uf, 0x0041, 0x0042, &ab) && ab == 0); in test_unicode_normalization()
796 g_assert (!hb_unicode_compose (uf, 0x0041, 0, &ab) && ab == 0); in test_unicode_normalization()
797 g_assert (!hb_unicode_compose (uf, 0x0066, 0x0069, &ab) && ab == 0); in test_unicode_normalization()
800 g_assert (!hb_unicode_compose (uf, 0x212B, 0, &ab) && ab == 0); in test_unicode_normalization()
801 g_assert (!hb_unicode_compose (uf, 0x00C5, 0, &ab) && ab == 0); in test_unicode_normalization()
802 g_assert (!hb_unicode_compose (uf, 0x2126, 0, &ab) && ab == 0); in test_unicode_normalization()
803 g_assert (!hb_unicode_compose (uf, 0x03A9, 0, &ab) && ab == 0); in test_unicode_normalization()
806 g_assert (!hb_unicode_compose (uf, 0x0308, 0x0301, &ab) && ab == 0); /* !0x0344 */ in test_unicode_normalization()
807 g_assert (!hb_unicode_compose (uf, 0x0F71, 0x0F72, &ab) && ab == 0); /* !0x0F73 */ in test_unicode_normalization()
[all …]
|
| /external/pcre/dist/ |
| D | pcre_valid_utf8.c | 120 register pcre_uchar ab, c, d; in PRIV() local
137 ab = PRIV(utf8_table4)[c & 0x3f]; /* Number of additional bytes */ in PRIV()
138 if (length < ab) in PRIV()
141 return ab - length; /* Codes ERR1 to ERR5 */ in PRIV()
143 length -= ab; /* Length remaining */ in PRIV()
157 switch (ab) in PRIV()
285 if (ab > 3) in PRIV()
287 *erroroffset = (int)(p - string) - ab; in PRIV()
288 return (ab == 4)? PCRE_UTF8_ERR11 : PCRE_UTF8_ERR12; in PRIV()
|
| /external/v8/test/mjsunit/regress/ |
| D | regress-319722-ArrayBuffer.js | 30 var ab; variable
33 for (k = 8; k >= 1 && ab == null; k = k/2) {
35 ab = new ArrayBuffer(maxSize * k); variable
37 ab = null;
41 assertTrue(ab != null);
45 new constr(ab, 0, maxSize);
|
| /external/regex-re2/re2/ |
| D | prefilter.cc | 316 Info *ab = new Info(); in Concat() local
318 CrossProduct(a->exact_, b->exact_, &ab->exact_); in Concat()
319 ab->is_exact_ = true; in Concat()
323 return ab; in Concat()
335 Info *ab = new Info(); in And() local
337 ab->match_ = Prefilter::And(a->TakeMatch(), b->TakeMatch()); in And()
338 ab->is_exact_ = false; in And()
341 return ab; in And()
346 Info *ab = new Info(); in Alt() local
349 CopyIn(a->exact_, &ab->exact_); in Alt()
[all …]
|