| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| initializer_list_alloc.pass.cpp | 18 #include "../../../min_allocator.h"
34 std::deque<int, min_allocator<int>> d({3, 4, 5, 6}, min_allocator<int>());
35 assert(d.get_allocator() == min_allocator<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.capacity/ |
| resize_size_value.pass.cpp | 17 #include "../../../min_allocator.h"
38 std::list<double, min_allocator<double>> l(5, 2);
42 assert((l == std::list<double, min_allocator<double>>(2, 2)));
45 std::list<double, min_allocator<double>> l(5, 2);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| default_stack_alloc.pass.cpp | 17 #include "../../../min_allocator.h"
38 std::list<int, min_allocator<int>> l;
43 std::list<int, min_allocator<int>> l((min_allocator<int>()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 23 #include "../../../min_allocator.h"
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()));
|
| erase_iter_iter_db2.pass.cpp | 23 #include "../../../min_allocator.h"
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()));
|
| erase_iter_iter_db3.pass.cpp | 23 #include "../../../min_allocator.h"
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()));
|
| insert_iter_rvalue.pass.cpp | 22 #include "../../../min_allocator.h"
49 std::list<MoveOnly, min_allocator<MoveOnly>> l1;
61 std::list<int, min_allocator<int>> v1(3);
62 std::list<int, min_allocator<int>> v2(3);
|
| pop_back.pass.cpp | 21 #include "../../../min_allocator.h"
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)));
|
| clear.pass.cpp | 17 #include "../../../min_allocator.h"
30 std::list<int, min_allocator<int>> c(a, a+3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 17 #include "../../../min_allocator.h"
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]))));
|
| merge_comp.pass.cpp | 18 #include "../../../min_allocator.h"
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]))));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
| initializer_list_alloc.pass.cpp | 18 #include "../../../min_allocator.h"
34 std::vector<int, min_allocator<int>> d({3, 4, 5, 6}, min_allocator<int>());
35 assert(d.get_allocator() == min_allocator<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 23 #include "../../../min_allocator.h"
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
|
| erase_iter_iter_db2.pass.cpp | 23 #include "../../../min_allocator.h"
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
|
| erase_iter_iter_db3.pass.cpp | 23 #include "../../../min_allocator.h"
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>> l2(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l2.cbegin()+1);
|
| insert_iter_size_value.pass.cpp | 21 #include "../../../min_allocator.h"
61 std::vector<int, min_allocator<int>> v(100);
62 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, 5, 1);
74 std::vector<int, min_allocator<int>> v(100);
75 std::vector<int, min_allocator<int>>::iterator i = v.insert(v.cbegin() + 10, 5, 1);
88 std::vector<int, min_allocator<int>> c1(100);
89 std::vector<int, min_allocator<int>> c2;
90 std::vector<int, min_allocator<int>>::iterator i = c1.insert(c2.cbegin() + 10, 5, 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.access/ |
| max_size.pass.cpp | 19 #include "../../../min_allocator.h"
30 typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/ |
| max_size.pass.cpp | 19 #include "../../min_allocator.h"
30 typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| max_size.pass.cpp | 19 #include "../../min_allocator.h"
30 typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| default.pass.cpp | 19 #include "../../../min_allocator.h"
30 std::multiset<int, std::less<int>, min_allocator<int>> m;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| max_size.pass.cpp | 19 #include "../../min_allocator.h"
30 typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| default.pass.cpp | 19 #include "../../../min_allocator.h"
30 std::set<int, std::less<int>, min_allocator<int>> m;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
| default.pass.cpp | 17 #include "../../../min_allocator.h"
30 typedef std::forward_list<T, min_allocator<T>> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/ |
| max_size.pass.cpp | 17 #include "../../min_allocator.h"
30 typedef std::forward_list<T, min_allocator<T>> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/ |
| types.pass.cpp | 38 #include "../../min_allocator.h"
77 static_assert((std::is_same<std::vector<int, min_allocator<int>>::value_type, int>::value), "");
78 static_assert((std::is_same<std::vector<int, min_allocator<int>>::allocator_type, min_allocator<int> >::value), "");
79 static_assert((std::is_same<std::vector<int, min_allocator<int>>::reference, int&>::value), "");
80 static_assert((std::is_same<std::vector<int, min_allocator<int>>::const_reference, const int&>::value), "");
81 static_assert((std::is_same<std::vector<int, min_allocator<int>>::pointer, min_pointer<int>>::value), "");
82 static_assert((std::is_same<std::vector<int, min_allocator<int>>::const_pointer, min_pointer<const int>>::value), "");
|
