HomeSort by relevance Sort by last modified time
    Searched defs:a1 (Results 1 - 25 of 1613) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/Modules/Inputs/normal-module-map/
a1.h 1 int a1; variable
  /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/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)
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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/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/compiler-rt/test/msan/
memcmp_test.cc 8 char a1[4]; local
11 a2[i] = a1[i] = i;
12 int res = memcmp(a1, a2, 4);
  /external/eigen/doc/snippets/
Tutorial_AdvancedInitialization_Zero.cpp 2 Array33f a1 = Array33f::Zero(); variable
3 std::cout << a1 << "\n\n"; variable
  /external/eigen/test/
array_of_string.cpp 15 ArrayXs a1(3), a2(3), a3(3), a3ref(3);
16 a1 << "one", "two", "three";
20 s1 << a1; local
22 a3 = a1 + std::string(" (") + a2 + std::string(")");
25 a3 = a1;
29 a1.swap(a3);
30 VERIFY((a1==a3ref).all());
  /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_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...]
  /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...]
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...]
  /external/libcxx/test/std/containers/sequences/list/list.special/
swap.pass.cpp 23 int a1[] = {1, 3, 7, 9, 10}; local
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
29 assert(c2 == std::list<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
32 int a1[] = {1, 3, 7, 9, 10} local
42 int a1[] = {1, 3, 7, 9, 10}; local
52 int a1[] = {1, 3, 7, 9, 10}; local
63 int a1[] = {1, 3, 7, 9, 10}; local
75 int a1[] = {1, 3, 7, 9, 10}; local
88 int a1[] = {1, 3, 7, 9, 10}; local
97 int a1[] = {1, 3, 7, 9, 10}; local
107 int a1[] = {1, 3, 7, 9, 10}; local
117 int a1[] = {1, 3, 7, 9, 10}; local
128 int a1[] = {1, 3, 7, 9, 10}; local
    [all...]
  /external/libcxx/test/std/containers/sequences/vector/vector.special/
swap.pass.cpp 25 int a1[] = {1, 3, 7, 9, 10}; local
27 std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
33 assert(c2 == std::vector<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
38 int a1[] = {1, 3, 7, 9, 10} local
52 int a1[] = {1, 3, 7, 9, 10}; local
66 int a1[] = {1, 3, 7, 9, 10}; local
81 int a1[] = {1, 3, 7, 9, 10}; local
93 int a1[] = {1, 3, 7, 9, 10}; local
110 int a1[] = {1, 3, 7, 9, 10}; local
123 int a1[] = {1, 3, 7, 9, 10}; local
137 int a1[] = {1, 3, 7, 9, 10}; local
151 int a1[] = {1, 3, 7, 9, 10}; local
166 int a1[] = {1, 3, 7, 9, 10}; local
    [all...]
  /external/libcxx/test/std/containers/sequences/vector.bool/
erase_iter.pass.cpp 22 bool a1[] = {1, 0, 1}; local
24 std::vector<bool> l1(a1, a1+3);
45 std::vector<bool, min_allocator<bool>> l1(a1, a1+3);
erase_iter_iter.pass.cpp 22 bool a1[] = {1, 0, 1}; local
24 std::vector<bool> l1(a1, a1+3);
31 std::vector<bool> l1(a1, a1+3);
36 assert(l1 == std::vector<bool>(a1+1, a1+3));
39 std::vector<bool> l1(a1, a1+3);
44 assert(l1 == std::vector<bool>(a1+2, a1+3))
    [all...]
  /external/libcxx/test/std/containers/unord/unord.multiset/
erase_iter_db1.pass.cpp 24 int a1[] = {1, 2, 3}; local
25 std::unordered_multiset<int> l1(a1, a1+3);
erase_iter_db2.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
28 std::unordered_multiset<int> l2(a1, a1+3);
erase_iter_iter_db1.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
28 std::unordered_multiset<int> l2(a1, a1+3);
erase_iter_iter_db2.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
28 std::unordered_multiset<int> l2(a1, a1+3);

Completed in 798 milliseconds

1 2 3 4 5 6 7 8 91011>>