| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| find_const.pass.cpp | 45 assert(i == c.cend());
68 assert(i == c.cend());
|
| local_iterators.pass.cpp | 21 // const_local_iterator cend (size_type n) const;
144 I j = c.cend(b);
149 j = c.cend(b);
156 j = c.cend(b);
163 j = c.cend(b);
170 j = c.cend(b);
192 I j = c.cend(b);
197 j = c.cend(b);
204 j = c.cend(b);
211 j = c.cend(b)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| find_const.pass.cpp | 45 assert(i == c.cend());
68 assert(i == c.cend());
|
| iterators.fail.cpp | 21 // const_iterator cend() const {return __table_.end();}
45 assert(std::distance(c.cbegin(), c.cend()) == c.size());
67 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| local_iterators.fail.cpp | 21 // const_local_iterator cend (size_type n) const;
175 I j = c.cend(b);
180 j = c.cend(b);
190 j = c.cend(b);
200 j = c.cend(b);
207 j = c.cend(b);
214 j = c.cend(b);
219 j = c.cend(b);
239 I j = c.cend(b);
244 j = c.cend(b)
[all...] |
| local_iterators.pass.cpp | 21 // const_local_iterator cend (size_type n) const;
176 I j = c.cend(b);
181 j = c.cend(b);
191 j = c.cend(b);
201 j = c.cend(b);
208 j = c.cend(b);
215 j = c.cend(b);
220 j = c.cend(b);
240 I j = c.cend(b);
245 j = c.cend(b)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| find_const.pass.cpp | 43 assert(i == c.cend());
65 assert(i == c.cend());
|
| find_non_const.pass.cpp | 43 assert(i == c.cend());
65 assert(i == c.cend());
|
| iterators.fail.cpp | 21 // const_iterator cend() const {return __table_.end();}
44 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| find_const.pass.cpp | 43 assert(i == c.cend());
64 assert(i == c.cend());
|
| find_non_const.pass.cpp | 43 assert(i == c.cend());
64 assert(i == c.cend());
|
| iterators.fail.cpp | 21 // const_iterator cend() const {return __table_.end();}
44 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| local_iterators.pass.cpp | 21 // const_local_iterator cend (size_type n) const;
135 I j = c.cend(b);
140 j = c.cend(b);
146 j = c.cend(b);
152 j = c.cend(b);
158 j = c.cend(b);
179 I j = c.cend(b);
184 j = c.cend(b);
190 j = c.cend(b);
196 j = c.cend(b)
[all...] |
| /external/libcxx/test/containers/unord/unord.multimap/ |
| local_iterators.fail.cpp | 21 // const_local_iterator cend (size_type n) const;
175 I j = c.cend(b);
180 j = c.cend(b);
190 j = c.cend(b);
200 j = c.cend(b);
207 j = c.cend(b);
214 j = c.cend(b);
219 j = c.cend(b);
239 I j = c.cend(b);
244 j = c.cend(b)
[all...] |
| local_iterators.pass.cpp | 21 // const_local_iterator cend (size_type n) const;
176 I j = c.cend(b);
181 j = c.cend(b);
191 j = c.cend(b);
201 j = c.cend(b);
208 j = c.cend(b);
215 j = c.cend(b);
220 j = c.cend(b);
240 I j = c.cend(b);
245 j = c.cend(b)
[all...] |
| iterators.pass.cpp | 21 // const_iterator cend() const {return __table_.end();}
47 assert(std::distance(c.cbegin(), c.cend()) == c.size());
69 assert(std::distance(c.cbegin(), c.cend()) == c.size());
90 assert(std::distance(c.cbegin(), c.cend()) == c.size());
113 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /external/libcxx/test/containers/unord/unord.map/ |
| local_iterators.pass.cpp | 21 // const_local_iterator cend (size_type n) const;
144 I j = c.cend(b);
149 j = c.cend(b);
156 j = c.cend(b);
163 j = c.cend(b);
170 j = c.cend(b);
192 I j = c.cend(b);
197 j = c.cend(b);
204 j = c.cend(b);
211 j = c.cend(b)
[all...] |
| iterators.pass.cpp | 21 // const_iterator cend() const {return __table_.end();}
47 assert(std::distance(c.cbegin(), c.cend()) == c.size());
66 assert(std::distance(c.cbegin(), c.cend()) == c.size());
87 assert(std::distance(c.cbegin(), c.cend()) == c.size());
107 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /external/libcxx/test/containers/unord/unord.set/ |
| local_iterators.pass.cpp | 21 // const_local_iterator cend (size_type n) const;
135 I j = c.cend(b);
140 j = c.cend(b);
146 j = c.cend(b);
152 j = c.cend(b);
158 j = c.cend(b);
179 I j = c.cend(b);
184 j = c.cend(b);
190 j = c.cend(b);
196 j = c.cend(b)
[all...] |
| iterators.pass.cpp | 21 // const_iterator cend() const {return __table_.end();}
46 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
86 assert(std::distance(c.cbegin(), c.cend()) == c.size());
106 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /art/runtime/gc/accounting/ |
| card_table_test.cc | 112 for (byte* cend = HeapLimit() - delta; cend < HeapLimit(); cend += kCardSize) {
115 byte* end = cend - end_offset;
|
| /external/libcxx/test/containers/sequences/dynarray/dynarray.overview/ |
| begin_end.pass.cpp | 18 // const_iterator cend() const noexcept;
51 assert ( dyn.size () == std::distance ( dyn.cbegin(), dyn.cend()));
59 assert ( dyn.end () == dyn.cend ());
73 assert ( dyn.size () == std::distance ( dyn.cbegin(), dyn.cend()));
81 assert ( dyn.end () == dyn.cend ());
|
| /external/libcxx/test/containers/sequences/vector/vector.cons/ |
| construct_size_value_alloc.pass.cpp | 27 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
|
| /external/libcxx/test/containers/sequences/vector.bool/ |
| construct_size_value_alloc.pass.cpp | 29 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
|
| /external/libcxx/test/containers/unord/unord.multiset/ |
| iterators.pass.cpp | 21 // const_iterator cend() const;
46 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
86 assert(std::distance(c.cbegin(), c.cend()) == c.size());
106 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
