| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| swap_member.pass.cpp | 45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
144 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
192 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
205 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
226 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
235 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| swap_non_member.pass.cpp | 45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
144 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
192 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
205 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
226 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
235 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
| assign_move.pass.cpp | 36 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
53 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
70 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
87 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
105 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
122 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
139 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
156 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
174 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n)
191 for (C::const_iterator i = c1.cbegin(); i != c1.cend(); ++i, ++n
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| assign_move.pass.cpp | 62 C::const_iterator i = c.cbegin();
79 assert(std::distance(c.cbegin(), c.cend()) == c.size());
124 assert(std::distance(c.cbegin(), c.cend()) == c.size());
169 assert(std::distance(c.cbegin(), c.cend()) == c.size());
206 C::const_iterator i = c.cbegin();
223 assert(std::distance(c.cbegin(), c.cend()) == c.size());
268 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init.pass.cpp | 56 assert(std::distance(c.cbegin(), c.cend()) == c.size());
87 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size.pass.cpp | 58 assert(std::distance(c.cbegin(), c.cend()) == c.size());
91 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size_hash.pass.cpp | 60 assert(std::distance(c.cbegin(), c.cend()) == c.size());
94 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size_hash_equal.pass.cpp | 61 assert(std::distance(c.cbegin(), c.cend()) == c.size());
96 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| insert_value.pass.cpp | 103 CI it = c.cbegin() + i;
104 CI jt = c.cbegin() + j;
108 it = c.cbegin();
|
| erase_iter_iter.pass.cpp | 48 I i = c1.erase(c1.cbegin() + P, c1.cbegin() + (P + size));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| copy.pass.cpp | 63 assert(std::distance(c.cbegin(), c.cend()) == c.size());
102 assert(std::distance(c.cbegin(), c.cend()) == c.size());
142 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_range.pass.cpp | 72 assert(std::distance(c.cbegin(), c.cend()) == c.size());
95 assert(std::distance(c.cbegin(), c.cend()) == c.size());
97 k = c.erase(c.cbegin(), c.cend());
149 assert(std::distance(c.cbegin(), c.cend()) == c.size());
172 assert(std::distance(c.cbegin(), c.cend()) == c.size());
174 k = c.erase(c.cbegin(), c.cend());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| emplace_hint.pass.cpp | 38 r = m.emplace_hint(m.cbegin());
57 r = m.emplace_hint(m.cbegin(), 2, 3.5);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| emplace_hint.pass.cpp | 38 r = m.emplace_hint(m.cbegin());
57 r = m.emplace_hint(m.cbegin(), 2, 3.5);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| insert_iter_value.pass.cpp | 48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 4);
81 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 4);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| iterators.pass.cpp | 16 // const_iterator cbegin() const;
49 C::const_iterator i = c.cbegin();
84 C::const_iterator i = c.cbegin();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
| assign_init.pass.cpp | 58 assert(std::distance(c.cbegin(), c.cend()) == c.size());
91 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init.pass.cpp | 58 assert(std::distance(c.cbegin(), c.cend()) == c.size());
90 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size.pass.cpp | 60 assert(std::distance(c.cbegin(), c.cend()) == c.size());
94 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size_hash.pass.cpp | 61 assert(std::distance(c.cbegin(), c.cend()) == c.size());
96 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| init_size_hash_equal.pass.cpp | 63 assert(std::distance(c.cbegin(), c.cend()) == c.size());
99 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| range.pass.cpp | 62 assert(std::distance(c.cbegin(), c.cend()) == c.size());
96 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| range_size.pass.cpp | 64 assert(std::distance(c.cbegin(), c.cend()) == c.size());
100 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| erase_range.pass.cpp | 56 k = c.erase(c.cbegin(), c.cend());
93 k = c.erase(c.cbegin(), c.cend());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| erase_range.pass.cpp | 54 k = c.erase(c.cbegin(), c.cend());
89 k = c.erase(c.cbegin(), c.cend());
|
