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

1 2 34 5 6 7 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
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);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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...]
remove.pass.cpp 22 int a1[] = {1, 2, 3, 4}; local
24 std::list<int> c(a1, a1+4);
30 int a1[] = {1, 2, 3, 4}; local
32 std::list<int, min_allocator<int>> c(a1, a1+4);
remove_if.pass.cpp 28 int a1[] = {1, 2, 3, 4}; local
30 std::list<int> c(a1, a1+4);
36 int a1[] = {1, 2, 3, 4}; local
38 std::list<int, min_allocator<int>> c(a1, a1+4);
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...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/
erase_iter.pass.cpp 23 int a1[] = {1, 2, 3}; local
24 std::vector<int> l1(a1, a1+3);
49 int a1[] = {1, 2, 3}; local
50 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 22 int a1[] = {1, 2, 3}; local
24 std::vector<int> l1(a1, a1+3);
33 std::vector<int> l1(a1, a1+3);
39 assert(l1 == std::vector<int>(a1+1, a1+3));
43 std::vector<int> l1(a1, a1+3);
49 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);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.special/
swap.pass.cpp 24 int a1[] = {1, 3, 7, 9, 10}; local
26 std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 assert(c2 == std::vector<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
37 int a1[] = {1, 3, 7, 9, 10} local
51 int a1[] = {1, 3, 7, 9, 10}; local
65 int a1[] = {1, 3, 7, 9, 10}; local
82 int a1[] = {1, 3, 7, 9, 10}; local
95 int a1[] = {1, 3, 7, 9, 10}; local
112 int a1[] = {1, 3, 7, 9, 10}; local
125 int a1[] = {1, 3, 7, 9, 10}; local
139 int a1[] = {1, 3, 7, 9, 10}; local
153 int a1[] = {1, 3, 7, 9, 10}; local
170 int a1[] = {1, 3, 7, 9, 10}; local
    [all...]

Completed in 284 milliseconds

1 2 34 5 6 7 8 91011>>