HomeSort by relevance Sort by last modified time
    Searched full:cbegin (Results 51 - 75 of 1093) sorted by null

1 23 4 5 6 7 8 91011>>

  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.modifiers/
insert_after_const.pass.cpp 32 i = c.insert_after(c.cbegin(), 1);
38 i = c.insert_after(next(c.cbegin()), 2);
45 i = c.insert_after(c.cbegin(), 3);
65 i = c.insert_after(c.cbegin(), 1);
71 i = c.insert_after(next(c.cbegin()), 2);
78 i = c.insert_after(c.cbegin(), 3);
insert_after_rv.pass.cpp 35 i = c.insert_after(c.cbegin(), 1);
41 i = c.insert_after(next(c.cbegin()), 2);
48 i = c.insert_after(c.cbegin(), 3);
67 i = c.insert_after(c.cbegin(), 1);
73 i = c.insert_after(next(c.cbegin()), 2);
80 i = c.insert_after(c.cbegin(), 3);
  /external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/
begin_end.pass.cpp 18 // const_iterator cbegin() const noexcept;
47 assert ( data == &*dyn.cbegin ());
54 assert (ds == std::distance ( dyn.cbegin(), dyn.cend()));
58 assert ( dyn.begin () == dyn.cbegin ());
59 assert ( &*dyn.begin () == &*dyn.cbegin ());
70 assert ( data == &*dyn.cbegin ());
77 assert (ds == std::distance ( dyn.cbegin(), dyn.cend()));
81 assert ( dyn.begin () == dyn.cbegin ());
82 assert ( &*dyn.begin () == &*dyn.cbegin ());
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/
begin_end.pass.cpp 18 // const_iterator cbegin() const noexcept;
47 assert ( data == &*dyn.cbegin ());
54 assert (ds == std::distance ( dyn.cbegin(), dyn.cend()));
58 assert ( dyn.begin () == dyn.cbegin ());
59 assert ( &*dyn.begin () == &*dyn.cbegin ());
70 assert ( data == &*dyn.cbegin ());
77 assert (ds == std::distance ( dyn.cbegin(), dyn.cend()));
81 assert ( dyn.begin () == dyn.cbegin ());
82 assert ( &*dyn.begin () == &*dyn.cbegin ());
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/glslang/SPIRV/
Logger.cpp 57 for (auto it = tbdFeatures.cbegin(); it != tbdFeatures.cend(); ++it)
59 for (auto it = missingFeatures.cbegin(); it != missingFeatures.cend(); ++it)
61 for (auto it = warnings.cbegin(); it != warnings.cend(); ++it)
63 for (auto it = errors.cbegin(); it != errors.cend(); ++it)
  /external/libcxx/test/std/containers/unord/unord.multimap/
local_iterators.fail.cpp 20 // const_local_iterator cbegin(size_type n) const;
176 I i = c.cbegin(b);
181 i = c.cbegin(b);
191 i = c.cbegin(b);
201 i = c.cbegin(b);
208 i = c.cbegin(b);
215 i = c.cbegin(b);
220 i = c.cbegin(b);
240 I i = c.cbegin(b);
245 i = c.cbegin(b)
    [all...]
local_iterators.pass.cpp 20 // const_local_iterator cbegin(size_type n) const;
175 I i = c.cbegin(b);
180 i = c.cbegin(b);
190 i = c.cbegin(b);
200 i = c.cbegin(b);
207 i = c.cbegin(b);
214 i = c.cbegin(b);
219 i = c.cbegin(b);
239 I i = c.cbegin(b);
244 i = c.cbegin(b)
    [all...]
  /external/libcxx/test/std/containers/unord/unord.multiset/
local_iterators.fail.cpp 20 // const_local_iterator cbegin(size_type n) const;
163 I i = c.cbegin(b);
168 i = c.cbegin(b);
176 i = c.cbegin(b);
184 i = c.cbegin(b);
190 i = c.cbegin(b);
196 i = c.cbegin(b);
201 i = c.cbegin(b);
221 I i = c.cbegin(b);
226 i = c.cbegin(b)
    [all...]
iterators.fail.cpp 20 // const_iterator cbegin() const {return __table_.begin();}
46 assert(std::distance(c.cbegin(), c.cend()) == c.size());
67 assert(std::distance(c.cbegin(), c.cend()) == c.size());
  /external/libcxx/test/std/containers/unord/unord.set/
local_iterators.fail.cpp 20 // const_local_iterator cbegin(size_type n) const;
161 I i = c.cbegin(b);
166 i = c.cbegin(b);
174 i = c.cbegin(b);
182 i = c.cbegin(b);
188 i = c.cbegin(b);
194 i = c.cbegin(b);
199 i = c.cbegin(b);
219 I i = c.cbegin(b);
224 i = c.cbegin(b)
    [all...]
local_iterators.pass.cpp 20 // const_local_iterator cbegin(size_type n) const;
134 I i = c.cbegin(b);
139 i = c.cbegin(b);
145 i = c.cbegin(b);
151 i = c.cbegin(b);
157 i = c.cbegin(b);
178 I i = c.cbegin(b);
183 i = c.cbegin(b);
189 i = c.cbegin(b);
195 i = c.cbegin(b)
    [all...]
iterators.fail.cpp 20 // const_iterator cbegin() const {return __table_.begin();}
44 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/
local_iterators.fail.cpp 20 // const_local_iterator cbegin(size_type n) const;
176 I i = c.cbegin(b);
181 i = c.cbegin(b);
191 i = c.cbegin(b);
201 i = c.cbegin(b);
208 i = c.cbegin(b);
215 i = c.cbegin(b);
220 i = c.cbegin(b);
240 I i = c.cbegin(b);
245 i = c.cbegin(b)
    [all...]
local_iterators.pass.cpp 20 // const_local_iterator cbegin(size_type n) const;
175 I i = c.cbegin(b);
180 i = c.cbegin(b);
190 i = c.cbegin(b);
200 i = c.cbegin(b);
207 i = c.cbegin(b);
214 i = c.cbegin(b);
219 i = c.cbegin(b);
239 I i = c.cbegin(b);
244 i = c.cbegin(b)
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/
local_iterators.fail.cpp 20 // const_local_iterator cbegin(size_type n) const;
163 I i = c.cbegin(b);
168 i = c.cbegin(b);
176 i = c.cbegin(b);
184 i = c.cbegin(b);
190 i = c.cbegin(b);
196 i = c.cbegin(b);
201 i = c.cbegin(b);
221 I i = c.cbegin(b);
226 i = c.cbegin(b)
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/
local_iterators.fail.cpp 20 // const_local_iterator cbegin(size_type n) const;
161 I i = c.cbegin(b);
166 i = c.cbegin(b);
174 i = c.cbegin(b);
182 i = c.cbegin(b);
188 i = c.cbegin(b);
194 i = c.cbegin(b);
199 i = c.cbegin(b);
219 I i = c.cbegin(b);
224 i = c.cbegin(b)
    [all...]
local_iterators.pass.cpp 20 // const_local_iterator cbegin(size_type n) const;
134 I i = c.cbegin(b);
139 i = c.cbegin(b);
145 i = c.cbegin(b);
151 i = c.cbegin(b);
157 i = c.cbegin(b);
178 I i = c.cbegin(b);
183 i = c.cbegin(b);
189 i = c.cbegin(b);
195 i = c.cbegin(b)
    [all...]
  /external/libcxx/test/std/containers/unord/unord.map/
local_iterators.pass.cpp 20 // const_local_iterator cbegin(size_type n) const;
143 I i = c.cbegin(b);
148 i = c.cbegin(b);
155 i = c.cbegin(b);
162 i = c.cbegin(b);
169 i = c.cbegin(b);
191 I i = c.cbegin(b);
196 i = c.cbegin(b);
203 i = c.cbegin(b);
210 i = c.cbegin(b)
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/
local_iterators.pass.cpp 20 // const_local_iterator cbegin(size_type n) const;
143 I i = c.cbegin(b);
148 i = c.cbegin(b);
155 i = c.cbegin(b);
162 i = c.cbegin(b);
169 i = c.cbegin(b);
191 I i = c.cbegin(b);
196 i = c.cbegin(b);
203 i = c.cbegin(b);
210 i = c.cbegin(b)
    [all...]
  /frameworks/native/libs/vr/libpdx/private/pdx/rpc/
payload.h 26 const_cursor_(buffer_.cbegin()) {}
43 const_cursor_ = buffer_.cbegin();
47 void Rewind() { const_cursor_ = buffer_.cbegin(); }
55 const_cursor_ = buffer_.cbegin() + offset;
62 const_cursor_ = buffer_.cbegin();
  /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/
erase_iter.pass.cpp 49 I i = m.erase(next(m.cbegin(), 3));
69 i = m.erase(next(m.cbegin(), 0));
87 i = m.erase(next(m.cbegin(), 5));
103 i = m.erase(next(m.cbegin(), 1));
117 i = m.erase(next(m.cbegin(), 2));
129 i = m.erase(next(m.cbegin(), 2));
139 i = m.erase(next(m.cbegin(), 0));
147 i = m.erase(next(m.cbegin(), 1));
153 i = m.erase(m.cbegin());
177 I i = m.erase(next(m.cbegin(), 3))
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.modifiers/
erase_iter.pass.cpp 49 I i = m.erase(next(m.cbegin(), 3));
69 i = m.erase(next(m.cbegin(), 0));
87 i = m.erase(next(m.cbegin(), 5));
103 i = m.erase(next(m.cbegin(), 1));
117 i = m.erase(next(m.cbegin(), 2));
129 i = m.erase(next(m.cbegin(), 2));
139 i = m.erase(next(m.cbegin(), 0));
147 i = m.erase(next(m.cbegin(), 1));
153 i = m.erase(m.cbegin());
177 I i = m.erase(next(m.cbegin(), 3))
    [all...]
  /art/libartbase/base/
dchecked_vector.h 103 using Base::cbegin;
151 DCHECK(cbegin() <= position && position <= cend());
155 DCHECK(cbegin() <= position && position <= cend());
160 DCHECK(cbegin() <= position && position <= cend());
164 DCHECK(cbegin() <= position && position <= cend());
168 DCHECK(cbegin() <= position && position <= cend());
174 DCHECK(cbegin() <= position && position < cend());
178 DCHECK(cbegin() <= first && first <= cend());
186 DCHECK(cbegin() <= position && position <= cend());
  /external/libcxx/test/std/containers/sequences/deque/
iterators.pass.cpp 34 j = c.cbegin();
44 j = c.cbegin();
74 // assert ( ii1 != c.cbegin());
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/
iterators.pass.cpp 34 j = c.cbegin();
44 j = c.cbegin();
74 // assert ( ii1 != c.cbegin());

Completed in 4565 milliseconds

1 23 4 5 6 7 8 91011>>