HomeSort by relevance Sort by last modified time
    Searched refs:cend (Results 26 - 50 of 387) sorted by null

12 3 4 5 6 7 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/
construct_size.pass.cpp 28 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
construct_size_value.pass.cpp 27 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
construct_size_value_alloc.pass.cpp 29 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
  /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());
57 assert(k == c.cend());
93 k = c.erase(c.cbegin(), c.cend());
94 assert(k == c.cend());
  /ndk/sources/cxx-stl/llvm-libc++/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());
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/
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());
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...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.results/re.results.acc/
cbegin_cend.pass.cpp 15 // const_iterator cend() const;
28 std::match_results<const char*>::const_iterator e = m.cend();
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
insert_iter_rvalue.pass.cpp 29 l1.insert(l1.cend(), MoveOnly(1));
50 l1.insert(l1.cend(), MoveOnly(1));
  /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...]
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());
  /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.multimap/unord.multimap.modifiers/
erase_key.pass.cpp 69 assert(std::distance(c.cbegin(), c.cend()) == c.size());
92 assert(std::distance(c.cbegin(), c.cend()) == c.size());
115 assert(std::distance(c.cbegin(), c.cend()) == c.size());
133 assert(std::distance(c.cbegin(), c.cend()) == c.size());
151 assert(std::distance(c.cbegin(), c.cend()) == c.size());
161 assert(std::distance(c.cbegin(), c.cend()) == c.size());
171 assert(std::distance(c.cbegin(), c.cend()) == c.size());
178 assert(std::distance(c.cbegin(), c.cend()) == c.size());
185 assert(std::distance(c.cbegin(), c.cend()) == c.size());
232 assert(std::distance(c.cbegin(), c.cend()) == c.size())
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/
construct_size.pass.cpp 29 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)
construct_size_value_alloc.pass.cpp 27 for (typename C::const_iterator i = c.cbegin(), e = c.cend(); i != e; ++i)

Completed in 530 milliseconds

12 3 4 5 6 7 8 91011>>