| /external/clang/test/Modules/Inputs/normal-module-map/ |
| a1.h | 1 int a1; variable
|
| /external/v8/test/mjsunit/regress/ |
| regress-927.js | 28 function a1() { function
33 assertEquals(a1(), -2147483648);
|
| regress-753.js | 34 var obj = {a1: {b1: [1,2,3,4], b2: {c1: 1, c2: 2}},a2: 'a2'};
|
| /external/libcxx/test/std/numerics/numarray/template.slice.array/slice.arr.fill/ |
| assign_value.pass.cpp | 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
22 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
|
| /external/v8/test/mjsunit/ |
| cyclic-array-to-string.js | 30 var a1 = [1,2]; variable
31 assertEquals("1,2", a1.toString());
32 assertEquals("1,2", a1.toLocaleString());
33 assertEquals("1,2", a1.join());
34 a1.push(a1);
35 assertEquals("1,2,", a1.toString());
36 assertEquals("1,2,", a1.toLocaleString());
37 assertEquals("1,2,", a1.join());
38 a1.push(1)
[all...] |
| /external/valgrind/memcheck/tests/x86-linux/ |
| bug133694.c | 7 void *a1; local
9 if ((a1 = mmap((void *)0x200000, 4096, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_FIXED|MAP_ANONYMOUS, -1, 0)) == MAP_FAILED)
15 if (munmap(a1, 4096) < 0)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.slice.array/slice.arr.fill/ |
| assign_value.pass.cpp | 21 int a1[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; local
22 std::valarray<int> v1(a1, sizeof(a1)/sizeof(a1[0]));
|
| /external/clang/test/CXX/expr/ |
| p8.cpp | 5 const volatile int a1 = 2; variable
16 f0(a1);
|
| /external/compiler-rt/test/asan/TestCases/ |
| memcmp_test.cc | 10 char a1[] = {argc, 2, 3, 4}; local
12 int res = memcmp(a1, a2, 4 + argc); // BOOM
|
| /external/eigen/doc/snippets/ |
| Tutorial_AdvancedInitialization_Zero.cpp | 2 Array33f a1 = Array33f::Zero(); variable
3 std::cout << a1 << "\n\n"; variable
|
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| erase_iter.pass.cpp | 22 int a1[] = {1, 2, 3}; local
23 std::list<int> l1(a1, a1+3);
44 int a1[] = {1, 2, 3}; local
45 std::list<int, min_allocator<int>> l1(a1, a1+3);
|
| erase_iter_db1.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
|
| erase_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
37 int a1[] = {1, 2, 3}; local
38 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter.pass.cpp | 21 int a1[] = {1, 2, 3}; local
23 std::list<int> l1(a1, a1+3);
30 std::list<int> l1(a1, a1+3);
35 assert(l1 == std::list<int>(a1+1, a1+3));
38 std::list<int> l1(a1, a1+3);
43 assert(l1 == std::list<int>(a1+2, a1+3))
[all...] |
| erase_iter_iter_db1.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db2.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db3.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3)
[all...] |
| erase_iter_iter_db4.pass.cpp | 28 int a1[] = {1, 2, 3}; local
29 std::list<int> l1(a1, a1+3);
35 int a1[] = {1, 2, 3}; local
36 std::list<int, min_allocator<int>> l1(a1, a1+3);
|
| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 22 int a1[] = {1, 3, 7, 9, 10}; local
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 int a1[] = {1, 3, 7, 9, 10}; local
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| merge_comp.pass.cpp | 23 int a1[] = {10, 9, 7, 3, 1}; local
26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
33 int a1[] = {10, 9, 7, 3, 1}; local
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| reverse.pass.cpp | 22 int a1[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
30 int a1[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| sort.pass.cpp | 22 int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9}; local
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
30 int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9}; local
32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| sort_comp.pass.cpp | 23 int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9}; local
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
31 int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9}; local
33 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| unique.pass.cpp | 22 int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3}; local
24 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
30 int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3}; local
32 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
| unique_pred.pass.cpp | 27 int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3}; local
29 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
35 int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3}; local
37 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0]))
[all...] |
