| /external/clang/test/Modules/Inputs/normal-module-map/ |
| a2.h | 1 int a2; variable
|
| /external/chromium/chrome/browser/resources/shared/css/ |
| tree.css.js | 7 var a2 = a / 2; variable
8 var ctx = document.getCSSCanvasContext('2d', 'tree-triangle', a + 1, a2 + 2);
16 ctx.lineTo(a2, 1 + a2);
|
| /external/chromium_org/v8/test/mjsunit/ |
| cyclic-array-to-string.js | 48 var a2 = [3,4]; variable
49 a1.push(a2);
50 a1.push(a2);
54 a2.push(a1);
60 a2 = [a1];
61 a1.push(a2);
|
| /external/v8/test/mjsunit/ |
| cyclic-array-to-string.js | 48 var a2 = [3,4]; variable
49 a1.push(a2);
50 a1.push(a2);
54 a2.push(a1);
60 a2 = [a1];
61 a1.push(a2);
|
| /external/clang/test/CXX/expr/ |
| p8.cpp | 6 int a2[16]; variable
17 f1(a2);
|
| /external/compiler-rt/lib/asan/lit_tests/TestCases/ |
| memcmp_test.cc | 9 char a2[] = {1, 2*argc, 3, 4}; local
10 int res = memcmp(a1, a2, 4 + argc); // BOOM
|
| /external/eigen/doc/snippets/ |
| Tutorial_AdvancedInitialization_Zero.cpp | 7 ArrayXf a2 = ArrayXf::Zero(3); variable
8 std::cout << a2 << "\n\n"; variable
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 23 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]))
[all...] |
| merge_comp.pass.cpp | 24 int a2[] = {11, 8, 6, 5, 4, 2, 0}; local
27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
34 int a2[] = {11, 8, 6, 5, 4, 2, 0}; local
37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]))
[all...] |
| remove.pass.cpp | 23 int a2[] = {1, 2, 4}; local
26 assert(c == std::list<int>(a2, a2+3));
31 int a2[] = {1, 2, 4}; local
34 assert((c == std::list<int, min_allocator<int>>(a2, a2+3)));
|
| remove_if.pass.cpp | 29 int a2[] = {3, 4}; local
32 assert(c == std::list<int>(a2, a2+2));
37 int a2[] = {3, 4}; local
40 assert((c == std::list<int, min_allocator<int>>(a2, a2+2)));
|
| reverse.pass.cpp | 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
[all...] |
| sort.pass.cpp | 23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}; local
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
[all...] |
| sort_comp.pass.cpp | 24 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 int a2[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; local
35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))))
[all...] |
| unique.pass.cpp | 23 int a2[] = {2, 1, 4, 3}; local
26 assert(c == std::list<int>(a2, a2+4));
31 int a2[] = {2, 1, 4, 3}; local
34 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
| unique_pred.pass.cpp | 28 int a2[] = {2, 1, 4, 3}; local
31 assert(c == std::list<int>(a2, a2+4));
36 int a2[] = {2, 1, 4, 3}; local
39 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.special/ |
| swap.pass.cpp | 24 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11} local
43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
53 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
79 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
92 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
101 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
111 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
121 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
134 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.special/ |
| swap.pass.cpp | 24 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
26 std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::vector<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 int a2[] = {0, 2, 4, 5, 6, 8, 11} local
43 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
53 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
66 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
79 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
92 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
101 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
111 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
121 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
134 int a2[] = {0, 2, 4, 5, 6, 8, 11}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/class.gslice/gslice.cons/ |
| start_size_stride.pass.cpp | 23 std::size_t a2[] = {4, 5, 6}; local
25 std::valarray<std::size_t> stride(a2, sizeof(a2)/sizeof(a2[0]));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.slice.array/slice.arr.assign/ |
| slice_array.pass.cpp | 22 int a2[] = {-1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12}; local
24 const std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| valarray.pass.cpp | 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.slice.array/slice.arr.comp.assign/ |
| addition.pass.cpp | 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| and.pass.cpp | 22 int a2[] = {1, 2, 3, 4, 5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| divide.pass.cpp | 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| modulo.pass.cpp | 22 int a2[] = {-1, -2, -3, -4, -5}; local
24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
