/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.capacity/ |
H A D | resize_size_value.pass.cpp | 46 test(C& c1, int size, int x) argument 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 64 C c1 = make<C>(N, start); local [all...] |
H A D | shrink_to_fit.pass.cpp | 44 test(C& c1) argument 46 C s = c1; 47 c1.shrink_to_fit(); 48 assert(c1 == s); 55 C c1 = make<C>(N, start); local 56 test(c1);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/ |
H A D | assign_size_value.pass.cpp | 45 test(C& c1, int size, int v) argument 48 c1.assign(size, v); 49 assert(c1.size() == size); 50 assert(distance(c1.begin(), c1.end()) == c1.size()); 51 for (CI i = c1.begin(); i != c1.end(); ++i) 59 C c1 = make<C>(N, start); local 60 test(c1, [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
H A D | emplace.pass.cpp | 47 test(int P, C& c1) argument 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 local 74 C c1 = make<C>(N, start); local 82 C c1 = make<C>(N, start); local [all...] |
H A D | emplace_back.pass.cpp | 46 test(C& c1) argument 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...] |
H A D | emplace_front.pass.cpp | 46 test(C& c1) argument 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...] |
H A D | insert_rvalue.pass.cpp | 47 test(int P, C& c1, int x) argument 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 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...] |
H A D | pop_back.pass.cpp | 43 test(C& c1) argument 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 local [all...] |
H A D | pop_front.pass.cpp | 43 test(C& c1) argument 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 local [all...] |
H A D | push_front.pass.cpp | 43 test(C& c1, int x) argument 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, [all...] |
H A D | push_front_rvalue.pass.cpp | 46 test(C& c1, int x) argument 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, [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.special/ |
H A D | 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 [all...] |
H A D | 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 [all...] |
H A D | 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 [all...] |
H A D | 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 [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
H A D | 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/ |
H A D | 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/ |
H A D | 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, c 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...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
H A D | swap_noexcept.pass.cpp | 124 C c1, c2; local 125 static_assert(noexcept(swap(c1, c2)), ""); 130 C c1, c2; local 131 static_assert(noexcept(swap(c1, c2)), ""); 136 C c1, c2; local 137 static_assert(noexcept(swap(c1, c2)), ""); 141 C c1, c2; local 142 static_assert(!noexcept(swap(c1, c2)), ""); 147 C c1, c2; local 148 static_assert(!noexcept(swap(c1, c 154 C c1, c2; local 159 C c1, c2; local 164 C c1, c2; local 169 C c1, c2; local 174 C c1, c2; local 179 C c1, c2; local 184 C c1, c2; local 189 C c1, c2; local 194 C c1, c2; local [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
H A D | swap_noexcept.pass.cpp | 123 C c1, c2; local 124 static_assert(noexcept(swap(c1, c2)), ""); 129 C c1, c2; local 130 static_assert(noexcept(swap(c1, c2)), ""); 135 C c1, c2; local 136 static_assert(noexcept(swap(c1, c2)), ""); 140 C c1, c2; local 141 static_assert(!noexcept(swap(c1, c2)), ""); 146 C c1, c2; local 147 static_assert(!noexcept(swap(c1, c 153 C c1, c2; local 158 C c1, c2; local 163 C c1, c2; local 168 C c1, c2; local 173 C c1, c2; local 178 C c1, c2; local 183 C c1, c2; local 188 C c1, c2; local 194 C c1, c2; local [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/unord.set.swap/ |
H A D | swap_noexcept.pass.cpp | 123 C c1, c2; local 124 static_assert(noexcept(swap(c1, c2)), ""); 129 C c1, c2; local 130 static_assert(noexcept(swap(c1, c2)), ""); 135 C c1, c2; local 136 static_assert(noexcept(swap(c1, c2)), ""); 140 C c1, c2; local 141 static_assert(!noexcept(swap(c1, c2)), ""); 146 C c1, c2; local 147 static_assert(!noexcept(swap(c1, c 153 C c1, c2; local 158 C c1, c2; local 163 C c1, c2; local 168 C c1, c2; local 173 C c1, c2; local 178 C c1, c2; local 183 C c1, c2; local 188 C c1, c2; local 194 C c1, c2; local [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/ |
H A D | lv_value.pass.cpp | 25 test(C c1, typename C::difference_type j, argument 29 std::insert_iterator<C> q(c1, c1.begin() + j); 33 assert(c1 == c2); 51 C c1; local 53 c1.push_back(i); 54 C c2 = c1; 56 test(c1, 0, 'a', 'b', 'c', c2); 57 c2 = c1; 59 test(c1, 69 C c1; local [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/ |
H A D | assign_iter_iter.pass.cpp | 46 test(C& c1, const C& c2) argument 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) argument 68 c1 77 C c1 = make<C>(N, start); local [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
H A D | erase_iter_iter.pass.cpp | 47 test(int P, C& c1, int size) argument 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 74 C c1 = make<C>(N, start); local [all...] |
H A D | insert_value.pass.cpp | 44 test(int P, C& c1, int x) argument 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 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...] |