| /art/libartbase/base/ |
| D | dchecked_vector.h | 104 using Base::cend;
151 DCHECK(cbegin() <= position && position <= cend()); in insert()
155 DCHECK(cbegin() <= position && position <= cend()); in insert()
160 DCHECK(cbegin() <= position && position <= cend()); in insert()
164 DCHECK(cbegin() <= position && position <= cend()); in insert()
168 DCHECK(cbegin() <= position && position <= cend()); in insert()
174 DCHECK(cbegin() <= position && position < cend()); in erase()
178 DCHECK(cbegin() <= first && first <= cend()); in erase()
179 DCHECK(first <= last && last <= cend()); in erase()
186 DCHECK(cbegin() <= position && position <= cend()); in emplace()
|
| D | transform_array_ref.h | 96 const_iterator end() const { return MakeIterator(base().cend()); } in end()
97 const_iterator cend() const { return MakeIterator(base().cend()); } in cend() function
100 const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); } in crbegin()
|
| D | transform_iterator_test.cc | 82 MakeTransformIterator(input.cend(), add1), in TEST()
107 ASSERT_EQ(input[i].value + 1, MakeTransformIterator(input.cend(), add1)[index_from_end]); in TEST()
122 ASSERT_EQ(MakeTransformIterator(input.cend(), add1) - i, in TEST()
123 MakeTransformIterator(input.cend() - i, add1)); in TEST()
185 MakeTransformIterator(input.cend(), sub1), in TEST()
235 MakeTransformIterator(input.cend(), mul3), in TEST()
287 MakeTransformIterator(input.cend(), ref), in TEST()
312 ASSERT_EQ(input[i].value, MakeTransformIterator(input.cend(), ref)[index_from_end]); in TEST()
327 ASSERT_EQ(MakeTransformIterator(input.cend(), ref) - i, in TEST()
328 MakeTransformIterator(input.cend() - i, ref)); in TEST()
[all …]
|
| D | transform_array_ref_test.cc | 58 std::copy(taref.cbegin(), taref.cend(), std::back_inserter(output)); in TEST()
133 std::copy(taref.cbegin(), taref.cend(), std::back_inserter(output)); in TEST()
181 std::copy(ctaref.cbegin(), ctaref.cend(), std::back_inserter(output)); in TEST()
185 std::copy(std::cbegin(ctaref), std::cend(ctaref), std::back_inserter(output)); in TEST()
|
| D | array_slice.h | 73 const_iterator cend() const { return const_iterator(&AtUnchecked(size_), element_size_); } in cend() function
76 const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); } in crbegin()
|
| D | iteration_range.h | 40 iterator cend() const { return last_; } in cend() function
|
| D | array_ref.h | 124 const_iterator cend() const { return array_ + size_; } in cend() function
127 const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); } in crbegin()
|
| D | intrusive_forward_list_test.cc | 147 ASSERT_TRUE(ifl.end() == ifl.cend()); in IteratorOperators()
148 ASSERT_FALSE(ifl.end() != ifl.cend()); in IteratorOperators()
|
| D | intrusive_forward_list.h | 172 const_iterator cend() const { return const_iterator(nullptr); } in cend() function
|
| /art/runtime/gc/accounting/ |
| D | card_table_test.cc | 117 for (uint8_t* cend = HeapLimit() - delta; cend < HeapLimit(); cend += CardTable::kCardSize) { in TEST_F() local
120 uint8_t* end = cend - end_offset; in TEST_F()
|
| /art/runtime/mirror/ |
| D | object_array.h | 119 inline ConstObjPtrArrayIter<T> cend() const REQUIRES_SHARED(Locks::mutator_lock_);
121 return IterationRange(cbegin(), cend()); in ConstIterate()
131 static inline ConstHandleArrayIter<T> cend(const Handle<ObjectArray<T>>& h_this)
135 return IterationRange(cbegin(h_this), cend(h_this)); in ConstIterate()
|
| D | object_array-inl.h | 339 inline ConstObjPtrArrayIter<T> ObjectArray<T>::cend() const { in cend() function
347 inline ConstHandleArrayIter<T> ObjectArray<T>::cend(const Handle<ObjectArray<T>>& h_this) { in cend() function
|
| D | var_handle_test.cc | 178 for (; it != method_descriptor.cend() && !returnValueSeen; ++it) { in MethodTypeOf()
181 descriptors.push_back(std::string(++it, method_descriptor.cend())); in MethodTypeOf()
|
| D | var_handle.cc | 1673 auto last = std::cend(kAccessorToAccessMode); in GetAccessModeByMethodName()
|
| /art/runtime/jit/ |
| D | jit_code_cache.h | 158 ArrayRef<const Entry>::const_iterator cend() const { in cend() function
159 return map_.cend(); in cend()
|
| /art/openjdkjvmti/ |
| D | transform.cc | 349 definitions.cend(), in RetransformClasses()
|
| D | ti_redefine.cc | 245 return ObsoleteMapIter(this, id_map_.cend()); in end()
965 std::find_if(old_methods.cbegin(), old_methods.cend(), [&](const auto& current_old_method) { in CheckMethods()
973 if (old_iter == old_methods.cend()) { in CheckMethods()
997 !std::all_of(seen_old_methods.cbegin(), seen_old_methods.cend(), [](auto x) { return x; })) { in CheckMethods()
1000 std::find_if(seen_old_methods.cbegin(), seen_old_methods.cend(), [](auto x) { return !x; }); in CheckMethods()
1029 std::find_if(old_fields.cbegin(), old_fields.cend(), [&](const auto& old_iter) { in CheckFields()
1036 if (old_iter == old_fields.cend()) { in CheckFields()
1057 if (!std::all_of(seen_old_fields.cbegin(), seen_old_fields.cend(), [](auto x) { return x; })) { in CheckFields()
1059 std::find_if(seen_old_fields.cbegin(), seen_old_fields.cend(), [](auto x) { return !x; }); in CheckFields()
2976 old_classes_vec.cend(), in UpdateClassStructurally()
|
| /art/test/ti-agent/ |
| D | suspend_event_helper.cc | 277 if (std::find(data->interesting_classes.cbegin(), data->interesting_classes.cend(), name_str) != in cbClassLoadOrPrepare()
278 data->interesting_classes.cend()) { in cbClassLoadOrPrepare()
|
| /art/runtime/jni/ |
| D | jni_id_manager.cc | 333 vec.cend(), in EncodeGenericId()
|
| /art/runtime/ |
| D | instrumentation.cc | 830 t->GetInstrumentationStack()->cend(), in UpdateStubs()
|