| /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 = (bool) 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/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 | 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()
42 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); in main()
43 … test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); in main()
44 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocato… in main()
45 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocato… in main()
47 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); in main()
48 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); in main()
49 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator… in main()
50 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator… in main()
|
| D | copy.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>(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 | 53 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
54 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
55 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); in main()
56 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); in main()
57 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); in main()
58 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); in main()
59 test<limited_allocator<int, 4096> >(ab, an); in main()
61 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 …]
|
| D | xsave-avx.stderr.exp | 123 176 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
126 224 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
129 272 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
130 288 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
133 336 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
134 352 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
137 400 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
177 176 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
180 224 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
183 272 01 ef cd ab dd cc bb aa 11 00 ff ee ba dc fe 10
[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/dist2/testdata/ |
| D | testoutput18 | 91 /(*ANY)ab.cd/
92 ab-cd
93 0: ab-cd
94 ab=cd
95 0: ab=cd
97 ab\ncd
100 /ab.cd/s
101 ab-cd
102 0: ab-cd
103 ab=cd
[all …]
|
| D | testinput6 | 12 /ab*c/
17 /ab+c/
22 ab
149 /ab?\w/
344 /^(a*\w|ab)=(a*\w|ab)/
345 ab=ab
347 /^(a*\w|ab)=(?1)/
348 ab=ab
423 /(ab|cd){3,4}/auto_callout
464 ab\=ps
[all …]
|
| D | testinput18 | 60 /(*ANY)ab.cd/
61 ab-cd
62 ab=cd
64 ab\ncd
66 /ab.cd/s
67 ab-cd
68 ab=cd
69 ab\ncd
|
| D | testoutput6 | 13 /ab*c/
21 /ab+c/
29 ab
253 /ab?\w/
256 1: ab
259 1: ab
384 0: ab
584 /^(a*\w|ab)=(a*\w|ab)/
585 ab=ab
586 0: ab=ab
[all …]
|
| D | testinput1 | 25 /a*abc?xyz+pqr{3}ab{2,}xy{4,5}pq{0,6}AB{0,}zz/
120 /^[ab\]cde]/
141 /^[^ab\]cde]/
257 ab-c.pq-r.
274 /^(?=ab(de))(abd)(e)/
277 /^(?!(ab)de|x)(abd)(f)/
280 /^(?=(ab(cd)))(ab)/
301 ab c
304 ab cde
307 ab c
[all …]
|
| D | testoutput1 | 34 /a*abc?xyz+pqr{3}ab{2,}xy{4,5}pq{0,6}AB{0,}zz/
227 /^[ab\]cde]/
263 /^[^ab\]cde]/
477 ab-c.pq-r.
478 0: ab-c.pq-r.
515 /^(?=ab(de))(abd)(e)/
522 /^(?!(ab)de|x)(abd)(f)/
529 /^(?=(ab(cd)))(ab)/
531 0: ab
534 3: ab
[all …]
|
| /external/pcre/dist2/src/ |
| D | pcre2_valid_utf.c | 136 register uint32_t ab, d; in PRIV() local
155 ab = PRIV(utf8_table4)[c & 0x3f]; /* Number of additional bytes (1-5) */ in PRIV()
156 if (length < ab) /* Missing bytes */ in PRIV()
159 switch(ab - length) in PRIV()
168 length -= ab; /* Length remaining */ in PRIV()
182 switch (ab) in PRIV()
310 if (ab > 3) in PRIV()
312 *erroroffset = (int)(p - string) - ab; in PRIV()
313 return (ab == 4)? PCRE2_ERROR_UTF8_ERR11 : PCRE2_ERROR_UTF8_ERR12; in PRIV()
|
| /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 …]
|
| /external/clang/test/Sema/ |
| D | string-plus-char.c | 5 const char *foo(const struct AB *ab) { in foo() argument
6 …return ab->a + 'b'; // expected-warning {{adding 'char' to a string pointer does not append to the… in foo()
23 struct AB ab; in f() local
24 …constStr = foo(&ab) + 'c'; // expected-warning {{adding 'char' to a string pointer does not append… in f()
|