| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]);
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3))
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| iter_iter_alloc.pass.cpp | 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[0]);
42 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3));
43 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4));
44 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5));
45 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6));
47 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>());
48 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>())
[all...] |
| move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[0])
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| copy.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int>(ab, an));
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]);
52 test(std::deque<int, min_allocator<int>>(ab, an))
[all...] |
| op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]);
33 test(std::deque<int>(ab, an));
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]);
53 test(std::deque<int, min_allocator<int>>(ab, an))
[all...] |
| move_alloc.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[0])
55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| move_assign.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[0])
57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]);
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3))
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| iter_iter_alloc.pass.cpp | 39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]);
41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3));
42 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4));
43 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5));
44 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6));
46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>());
47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>())
[all...] |
| move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[0])
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| copy.pass.cpp | 30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]);
32 test(std::deque<int>(ab, an));
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]);
52 test(std::deque<int, min_allocator<int>>(ab, an))
[all...] |
| op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]);
33 test(std::deque<int>(ab, an));
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]);
53 test(std::deque<int, min_allocator<int>>(ab, an))
[all...] |
| move_alloc.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[0])
55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| move_assign.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[0])
57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/ |
| copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]);
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3))
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| iter_iter_alloc.pass.cpp | 39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]);
41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3));
42 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4));
43 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5));
44 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6));
46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>());
47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>())
[all...] |
| move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[0])
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...] |
| copy.pass.cpp | 30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]);
32 test(std::deque<int>(ab, an));
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]);
52 test(std::deque<int, min_allocator<int>>(ab, an))
[all...] |
| op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]);
33 test(std::deque<int>(ab, an));
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]);
53 test(std::deque<int, min_allocator<int>>(ab, an))
[all...] |
| /external/clang/test/Parser/ |
| cxx-member-init-missing-paren-crash.cpp | 7 bool ab() {
|
| /external/harfbuzz_ng/src/ |
| hb-ot-shape-complex-hebrew.cc | 34 hb_codepoint_t *ab)
71 bool found = (bool) c->unicode->compose (a, b, ab);
80 *ab = 0xFB1Du;
86 *ab = 0xFB1Fu;
89 *ab = 0xFB2Eu;
95 *ab = 0xFB2Fu;
101 *ab = 0xFB4Bu;
107 *ab = sDageshForms[a - 0x05D0u];
108 found = (*ab != 0);
110 *ab = 0xFB2Cu
[all...] |
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-srec/ |
| sr1.c | 9 static char ab[] = "This is a string constant"; variable
17 fn1 (ab);
|
| /external/clang/test/Sema/ |
| string-plus-char.c | 3 struct AB{const char *a; const char*b;};
5 const char *foo(const struct AB *ab) {
6 return ab->a + 'b'; // expected-warning {{adding 'char' to a string pointer does not append to the string}} expected-note {{use array indexing to silence this warning}}
23 struct AB ab; local
24 constStr = foo(&ab) + 'c'; // expected-warning {{adding 'char' to a string pointer does not append to the string}} expected-note {{use array indexing to silence this warning}}
|
| /external/compiler-rt/test/asan/TestCases/Helpers/ |
| initialization-nobug-extra.cc | 3 static int ab = getAB(); variable
|
| /external/eigen/unsupported/test/ |
| kronecker_product.cpp | 19 void check_dimension(const MatrixType& ab, const int rows, const int cols)
21 VERIFY_IS_EQUAL(ab.rows(), rows);
22 VERIFY_IS_EQUAL(ab.cols(), cols);
27 void check_kronecker_product(const MatrixType& ab)
29 VERIFY_IS_EQUAL(ab.rows(), 6);
30 VERIFY_IS_EQUAL(ab.cols(), 6);
31 VERIFY_IS_EQUAL(ab.nonZeros(), 36);
32 VERIFY_IS_APPROX(ab.coeff(0,0), -0.4017367630386106);
33 VERIFY_IS_APPROX(ab.coeff(0,1), 0.1056863433932735);
34 VERIFY_IS_APPROX(ab.coeff(0,2), -0.7255206194554212)
[all...] |
