HomeSort by relevance Sort by last modified time
    Searched defs:a1 (Results 26 - 50 of 1031) sorted by null

12 3 4 5 6 7 8 91011>>

  /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
65 int a1[] = {1, 3, 7, 9, 10}; local
78 int a1[] = {1, 3, 7, 9, 10}; local
91 int a1[] = {1, 3, 7, 9, 10}; local
100 int a1[] = {1, 3, 7, 9, 10}; local
110 int a1[] = {1, 3, 7, 9, 10}; local
120 int a1[] = {1, 3, 7, 9, 10}; local
133 int a1[] = {1, 3, 7, 9, 10}; local
    [all...]
  /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/
erase_iter.pass.cpp 24 int a1[] = {1, 2, 3}; local
25 std::vector<int> l1(a1, a1+3);
50 int a1[] = {1, 2, 3}; local
51 std::vector<int, min_allocator<int>> l1(a1, a1+3);
erase_iter_db1.pass.cpp 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
erase_iter_db2.pass.cpp 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
37 int a1[] = {1, 2, 3}; local
38 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>> l2(a1, a1+3)
    [all...]
erase_iter_iter.pass.cpp 23 int a1[] = {1, 2, 3}; local
25 std::vector<int> l1(a1, a1+3);
34 std::vector<int> l1(a1, a1+3);
40 assert(l1 == std::vector<int>(a1+1, a1+3));
44 std::vector<int> l1(a1, a1+3);
50 assert(l1 == std::vector<int>(a1+2, a1+3))
    [all...]
erase_iter_iter_db1.pass.cpp 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3)
    [all...]
erase_iter_iter_db2.pass.cpp 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3)
    [all...]
erase_iter_iter_db3.pass.cpp 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
30 std::vector<int> l2(a1, a1+3);
36 int a1[] = {1, 2, 3}; local
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3)
    [all...]
erase_iter_iter_db4.pass.cpp 28 int a1[] = {1, 2, 3}; local
29 std::vector<int> l1(a1, a1+3);
35 int a1[] = {1, 2, 3}; local
36 std::vector<int, min_allocator<int>> l1(a1, a1+3);
  /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
83 int a1[] = {1, 3, 7, 9, 10}; local
96 int a1[] = {1, 3, 7, 9, 10}; local
113 int a1[] = {1, 3, 7, 9, 10}; local
126 int a1[] = {1, 3, 7, 9, 10}; local
140 int a1[] = {1, 3, 7, 9, 10}; local
154 int a1[] = {1, 3, 7, 9, 10}; local
171 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);
erase_iter_iter_db3.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_db4.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_multiset<int> l1(a1, a1+3);
  /external/libcxx/test/std/containers/unord/unord.set/
erase_iter_db1.pass.cpp 24 int a1[] = {1, 2, 3}; local
25 std::unordered_set<int> l1(a1, a1+3);
erase_iter_db2.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
erase_iter_iter_db1.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
erase_iter_iter_db2.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
erase_iter_iter_db3.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
erase_iter_iter_db4.pass.cpp 26 int a1[] = {1, 2, 3}; local
27 std::unordered_set<int> l1(a1, a1+3);
  /external/libcxx/test/std/numerics/numarray/class.gslice/gslice.cons/
start_size_stride.pass.cpp 22 std::size_t a1[] = {1, 2, 3}; local
24 std::valarray<std::size_t> size(a1, sizeof(a1)/sizeof(a1[0]));

Completed in 850 milliseconds

12 3 4 5 6 7 8 91011>>