| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| H A D | erase_iter_iter_db1.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| H A D | erase_iter_iter_db2.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| H A D | erase_iter_iter_db3.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| H A D | pop_back.pass.cpp | 10 // <list>
18 #include <list>
27 std::list<int> c(a, a+3);
29 assert(c == std::list<int>(a, a+2));
31 assert(c == std::list<int>(a, a+1));
42 std::list<int, min_allocator<int>> c(a, a+3);
44 assert((c == std::list<int, min_allocator<int>>(a, a+2)));
46 assert((c == std::list<int, min_allocator<int>>(a, a+1)));
|
| H A D | pop_front.pass.cpp | 10 // <list>
14 #include <list>
23 std::list<int> c(a, a+3);
25 assert(c == std::list<int>(a+1, a+3));
27 assert(c == std::list<int>(a+2, a+3));
34 std::list<int, min_allocator<int>> c(a, a+3);
36 assert((c == std::list<int, min_allocator<int>>(a+1, a+3)));
38 assert((c == std::list<int, min_allocator<int>>(a+2, a+3)));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| H A D | merge.pass.cpp | 10 // <list>
12 // void merge(list& x);
14 #include <list>
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
38 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| H A D | merge_comp.pass.cpp | 10 // <list>
12 // template <class Compare> void merge(list& x, Compare comp);
14 #include <list>
26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
29 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
39 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/ |
| H A D | assign_copy.pass.cpp | 10 // <list>
12 // list& operator=(const list& c);
14 #include <list>
22 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5));
23 std::list<int, test_allocator<int> > l2(l, test_allocator<int>(3));
29 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5));
30 std::list<int, other_allocator<int> > l2(l, other_allocator<int>(3));
37 std::list<int, min_allocator<int> > l(3, 2, min_allocator<int>());
38 std::list<in
[all...] |
| H A D | copy_alloc.pass.cpp | 10 // <list>
12 // list(const list& c, const allocator_type& a);
14 #include <list>
23 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5));
24 std::list<int, test_allocator<int> > l2(l, test_allocator<int>(3));
29 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5));
30 std::list<int, other_allocator<int> > l2(l, other_allocator<int>(3));
36 std::list<int, min_allocator<int> > l(3, 2, min_allocator<int>());
37 std::list<in
[all...] |
| H A D | move.pass.cpp | 10 // <list>
12 // list(list&& c);
14 #include <list>
24 std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5));
25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
31 std::list<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l);
37 std::list<MoveOnly, other_allocator<MoveOnly> > l(other_allocator<MoveOnly>(5));
38 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5));
44 std::list<MoveOnl
[all...] |
| H A D | default_stack_alloc.pass.cpp | 10 // <list>
12 // explicit list(const Alloc& = Alloc());
14 #include <list>
22 std::list<int> l;
27 std::list<int> l((std::allocator<int>()));
32 std::list<int, stack_allocator<int, 4> > l;
38 std::list<int, min_allocator<int>> l;
43 std::list<int, min_allocator<int>> l((min_allocator<int>()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
| H A D | erase_iter_db2.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::const_iterator i = l2.begin();
38 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>> l2(a1, a1+3);
40 std::list<int, min_allocator<int>>::const_iterator i = l2.begin();
|
| H A D | erase_iter_iter_db1.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| H A D | erase_iter_iter_db2.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| H A D | erase_iter_iter_db3.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| H A D | pop_back.pass.cpp | 10 // <list>
18 #include <list>
27 std::list<int> c(a, a+3);
29 assert(c == std::list<int>(a, a+2));
31 assert(c == std::list<int>(a, a+1));
42 std::list<int, min_allocator<int>> c(a, a+3);
44 assert((c == std::list<int, min_allocator<int>>(a, a+2)));
46 assert((c == std::list<int, min_allocator<int>>(a, a+1)));
|
| H A D | pop_front.pass.cpp | 10 // <list>
14 #include <list>
23 std::list<int> c(a, a+3);
25 assert(c == std::list<int>(a+1, a+3));
27 assert(c == std::list<int>(a+2, a+3));
34 std::list<int, min_allocator<int>> c(a, a+3);
36 assert((c == std::list<int, min_allocator<int>>(a+1, a+3)));
38 assert((c == std::list<int, min_allocator<int>>(a+2, a+3)));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/ |
| H A D | merge.pass.cpp | 10 // <list>
12 // void merge(list& x);
14 #include <list>
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
38 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| H A D | merge_comp.pass.cpp | 10 // <list>
12 // template <class Compare> void merge(list& x, Compare comp);
14 #include <list>
26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
29 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
39 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| H A D | std_list.i | 2 // std::list
9 %define %std_list_methods(list)
10 %std_sequence_methods(list)
20 %define %std_list_methods_val(list)
21 %std_sequence_methods_val(list)
31 void merge(list& x);
35 // std::list
40 // -- f(std::list<T>), f(const std::list<T>&):
42 // previously wrapped std::list<
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/ |
| H A D | move.pass.cpp | 10 // <list>
12 // list(list&& c);
14 #include <list>
24 std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5));
25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
31 std::list<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l);
37 std::list<MoveOnly, other_allocator<MoveOnly> > l(other_allocator<MoveOnly>(5));
38 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5));
44 std::list<MoveOnl
[all...] |
| H A D | default_stack_alloc.pass.cpp | 10 // <list>
12 // explicit list(const Alloc& = Alloc());
14 #include <list>
22 std::list<int> l;
27 std::list<int> l((std::allocator<int>()));
32 std::list<int, stack_allocator<int, 4> > l;
38 std::list<int, min_allocator<int>> l;
43 std::list<int, min_allocator<int>> l((min_allocator<int>()));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| H A D | move.pass.cpp | 10 // <list>
12 // list(list&& c);
14 #include <list>
24 std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5));
25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
31 std::list<MoveOnly, test_allocator<MoveOnly> > l2 = std::move(l);
37 std::list<MoveOnly, other_allocator<MoveOnly> > l(other_allocator<MoveOnly>(5));
38 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5));
44 std::list<MoveOnl
[all...] |
| H A D | default_stack_alloc.pass.cpp | 10 // <list>
12 // explicit list(const Alloc& = Alloc());
14 #include <list>
22 std::list<int> l;
27 std::list<int> l((std::allocator<int>()));
32 std::list<int, stack_allocator<int, 4> > l;
38 std::list<int, min_allocator<int>> l;
43 std::list<int, min_allocator<int>> l((min_allocator<int>()));
|
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.special/ |
| H A D | swap.pass.cpp | 10 // <list>
13 // void swap(list<T,Alloc>& x, list<T,Alloc>& y);
15 #include <list>
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
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])));
29 assert(c2 == std::list<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
34 std::list<int> c1(a1, a1);
35 std::list<in
[all...] |