| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/associative/set/set.special/ |
| swap_noexcept.pass.cpp | 101 C c1, c2; local
102 static_assert(noexcept(swap(c1, c2)), "");
106 C c1, c2; local
107 static_assert(noexcept(swap(c1, c2)), "");
111 C c1, c2; local
112 static_assert(noexcept(swap(c1, c2)), "");
116 C c1, c2; local
117 static_assert(!noexcept(swap(c1, c2)), "");
123 C c1, c2; local
124 static_assert(!noexcept(swap(c1, c2)), "")
128 C c1, c2; local
133 C c1, c2; local
138 C c1, c2; local
144 C c1, c2; local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/array/array.special/ |
| swap.pass.cpp | 44 C c1 = {1, 2, 3.5}; local
46 swap(c1, c2);
47 assert(c1.size() == 3);
48 assert(c1[0] == 4);
49 assert(c1[1] == 5);
50 assert(c1[2] == 6.5);
59 C c1 = {}; local
61 swap(c1, c2);
62 assert(c1.size() == 0);
81 typedef std::array<T, 42> C1;
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 46 test(C& c1, int size)
49 typename C::size_type c1_osize = c1.size();
50 c1.resize(size);
51 assert(c1.size() == size);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 CI i = c1.begin();
54 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
56 for (int j = c1_osize; j < c1.size(); ++j, ++i
64 C c1 = make<C>(N, start); local
[all...] |
| resize_size_value.pass.cpp | 46 test(C& c1, int size, int x)
49 typename C::size_type c1_osize = c1.size();
50 c1.resize(size, x);
51 assert(c1.size() == size);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 CI i = c1.begin();
54 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
56 for (int j = c1_osize; j < c1.size(); ++j, ++i
64 C c1 = make<C>(N, start); local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/ |
| assign_iter_iter.pass.cpp | 46 test(C& c1, const C& c2)
48 c1.assign(c2.begin(), c2.end());
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 assert(c1 == c2);
57 C c1 = make<C>(N, start); local
59 test(c1, c2);
64 testI(C& c1, const C& c2)
68 c1.assign(ICI(c2.begin()), ICI(c2.end()))
77 C c1 = make<C>(N, start); local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
| emplace.pass.cpp | 47 test(int P, C& c1)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
66 C c1 = make<C>(N, start) local
74 C c1 = make<C>(N, start); local
82 C c1 = make<C>(N, start); local
[all...] |
| emplace_back.pass.cpp | 46 test(C& c1)
49 std::size_t c1_osize = c1.size();
50 c1.emplace_back(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.end();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...] |
| emplace_front.pass.cpp | 46 test(C& c1)
49 std::size_t c1_osize = c1.size();
50 c1.emplace_front(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...] |
| erase_iter_iter.pass.cpp | 47 test(int P, C& c1, int size)
50 assert(P + size <= c1.size());
51 std::size_t c1_osize = c1.size();
52 I i = c1.erase(c1.cbegin() + P, c1.cbegin() + (P + size));
53 assert(i == c1.begin() + P);
54 assert(c1.size() == c1_osize - size);
55 assert(distance(c1.begin(), c1.end()) == c1.size())
74 C c1 = make<C>(N, start); local
[all...] |
| insert_rvalue.pass.cpp | 47 test(int P, C& c1, int x)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.insert(c1.begin() + P, MoveOnly(x));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
55 i = c1.begin()
72 C c1 = make<C>(N, start); local
80 C c1 = make<C>(N, start); local
88 C c1 = make<C>(N, start); local
[all...] |
| insert_size_value.pass.cpp | 46 test(int P, C& c1, int size, int x)
49 std::size_t c1_osize = c1.size();
50 CI i = c1.insert(c1.begin() + P, size, x);
51 assert(i == c1.begin() + P);
52 assert(c1.size() == c1_osize + size);
53 assert(distance(c1.begin(), c1.end()) == c1.size());
54 i = c1.begin()
71 C c1 = make<C>(N, start); local
79 C c1 = make<C>(N, start); local
87 C c1 = make<C>(N, start); local
95 C c1 = make<C>(N, start); local
103 C c1 = make<C>(N, start); local
[all...] |
| insert_value.pass.cpp | 44 test(int P, C& c1, int x)
47 std::size_t c1_osize = c1.size();
48 CI i = c1.insert(c1.begin() + P, x);
49 assert(i == c1.begin() + P);
50 assert(c1.size() == c1_osize + 1);
51 assert(distance(c1.begin(), c1.end()) == c1.size());
52 i = c1.begin()
69 C c1 = make<C>(N, start); local
77 C c1 = make<C>(N, start); local
85 C c1 = make<C>(N, start); local
[all...] |
| pop_back.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_back();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 0; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| pop_front.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_front();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 1; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| push_front.pass.cpp | 43 test(C& c1, int x)
46 std::size_t c1_osize = c1.size();
47 c1.push_front(x);
48 assert(c1.size() == c1_osize + 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1, -10)
[all...] |
| push_front_rvalue.pass.cpp | 46 test(C& c1, int x)
49 std::size_t c1_osize = c1.size();
50 c1.push_front(MoveOnly(x));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
64 C c1 = make<C>(N, start); local
65 test(c1, -10)
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 54 C c1 = make<C>(N, start); local
56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
57 assert(c1 == c2);
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
59 assert(c1 == c2);
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
61 assert(c1 == c2)
[all...] |
| copy_backward.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2)
[all...] |
| move.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
56 assert(c1 == c2);
57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
58 assert(c1 == c2);
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
60 assert(c1 == c2)
[all...] |
| move_backward.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2)
[all...] |
| swap.pass.cpp | 45 C c1 = make<C>(N, start); local
47 C c1_save = c1;
49 swap(c1, c2);
50 assert(c1 == c2_save);
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
70 swap(c1, c2);
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
72 assert(c1.get_allocator() == A(1));
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
82 swap(c1, c2)
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| remove.pass.cpp | 38 C c1(std::begin(t1), std::end(t1));
40 c1.remove(0);
41 assert(c1 == c2);
47 C c1(std::begin(t1), std::end(t1));
49 c1.remove(0);
50 assert(c1 == c2);
57 C c1(std::begin(t1), std::end(t1));
59 c1.remove(0);
60 assert(c1 == c2);
65 C c1; local
139 C c1; local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
| emplace.pass.cpp | 56 std::list<A> c1; local
58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
80 std::list<A, min_allocator<A>> c1; local
82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.modifiers/ |
| emplace.pass.cpp | 119 std::vector<A> c1; local
121 std::vector<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
152 std::vector<A, min_allocator<A>> c1; local
154 std::vector<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.swap/ |
| swap_noexcept.pass.cpp | 125 C c1, c2; local
126 static_assert(noexcept(swap(c1, c2)), "");
131 C c1, c2; local
132 static_assert(noexcept(swap(c1, c2)), "");
137 C c1, c2; local
138 static_assert(noexcept(swap(c1, c2)), "");
142 C c1, c2; local
143 static_assert(!noexcept(swap(c1, c2)), "");
148 C c1, c2; local
149 static_assert(!noexcept(swap(c1, c2)), "")
155 C c1, c2; local
160 C c1, c2; local
165 C c1, c2; local
170 C c1, c2; local
175 C c1, c2; local
180 C c1, c2; local
185 C c1, c2; local
190 C c1, c2; local
196 C c1, c2; local
[all...] |
