| /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 | 93 const_iterator end() const { return MakeIterator(base().cend()); } in end()
94 const_iterator cend() const { return MakeIterator(base().cend()); } in cend() function
97 const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); } in crbegin()
|
| D | transform_iterator_test.cc | 78 MakeTransformIterator(input.cend(), add1), in TEST()
103 ASSERT_EQ(input[i].value + 1, MakeTransformIterator(input.cend(), add1)[index_from_end]); in TEST()
118 ASSERT_EQ(MakeTransformIterator(input.cend(), add1) - i, in TEST()
119 MakeTransformIterator(input.cend() - i, add1)); in TEST()
177 MakeTransformIterator(input.cend(), sub1), in TEST()
225 MakeTransformIterator(input.cend(), mul3), in TEST()
273 MakeTransformIterator(input.cend(), ref), in TEST()
298 ASSERT_EQ(input[i].value, MakeTransformIterator(input.cend(), ref)[index_from_end]); in TEST()
313 ASSERT_EQ(MakeTransformIterator(input.cend(), ref) - i, in TEST()
314 MakeTransformIterator(input.cend() - i, ref)); in TEST()
[all …]
|
| D | transform_array_ref_test.cc | 57 std::copy(taref.cbegin(), taref.cend(), std::back_inserter(output)); in TEST()
131 std::copy(taref.cbegin(), taref.cend(), std::back_inserter(output)); in TEST()
178 std::copy(ctaref.cbegin(), ctaref.cend(), std::back_inserter(output)); in TEST()
182 std::copy(std::cbegin(ctaref), std::cend(ctaref), std::back_inserter(output)); in TEST()
|
| D | array_slice.h | 78 const_iterator cend() const { return const_iterator(&AtUnchecked(size_), element_size_); } in cend() function
81 const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); } in crbegin()
|
| D | array_ref.h | 121 const_iterator cend() const { return array_ + size_; } in cend() function
124 const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); } in crbegin()
|
| D | iteration_range.h | 41 iterator cend() const { return last_; } in cend() function
|
| 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 | 171 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 | 121 inline ConstObjPtrArrayIter<T> cend() const REQUIRES_SHARED(Locks::mutator_lock_);
123 return IterationRange(cbegin(), cend()); in ConstIterate()
133 static inline ConstHandleArrayIter<T> cend(const Handle<ObjectArray<T>>& h_this)
137 return IterationRange(cbegin(h_this), cend(h_this)); in ConstIterate()
|
| D | object_array-inl.h | 352 inline ConstObjPtrArrayIter<T> ObjectArray<T>::cend() const { in cend() function
360 inline ConstHandleArrayIter<T> ObjectArray<T>::cend(const Handle<ObjectArray<T>>& h_this) { in cend() function
|
| D | var_handle_test.cc | 182 for (; it != method_descriptor.cend() && !returnValueSeen; ++it) { in MethodTypeOf()
185 descriptors.push_back(std::string(++it, method_descriptor.cend())); in MethodTypeOf()
|
| /art/compiler/optimizing/ |
| D | execution_subgraph.cc | 118 DCHECK(std::find(current_path.cbegin(), current_path.cend(), cur_block->GetBlockId()) == in Prune()
121 std::for_each(current_path.cbegin(), current_path.cend(), [&](auto id) { in Prune()
307 if (std::any_of(preds.cbegin(), preds.cend(), is_external)) { in RecalculateExcludedCohort()
310 if (std::any_of(succs.cbegin(), succs.cend(), is_external)) { in RecalculateExcludedCohort()
|
| D | execution_subgraph_test.cc | 625 exclusions.cend(), in TEST_F()
628 }) != exclusions.cend()); in TEST_F()
630 exclusions.cend(), in TEST_F()
633 }) != exclusions.cend()); in TEST_F()
738 exclusions.cend(), in TEST_F()
741 }) != exclusions.cend()); in TEST_F()
744 exclusions.cbegin(), exclusions.cend(), [&](const ExecutionSubgraph::ExcludedCohort& it) { in TEST_F()
748 }) != exclusions.cend()); in TEST_F()
|
| D | load_store_analysis.cc | 140 inst->GetUses().cend(), in InstructionEligibleForLSERemoval()
|
| D | load_store_analysis.h | 290 auto res = std::find(heap_locations_.cbegin(), heap_locations_.cend(), hl); in GetHeapLocationIndex()
|
| D | load_store_elimination.cc | 631 cohorts.cend(), in IsPartialNoEscape()
3130 subgraph_->GetExcludedCohorts().cend(), in IsPostEscape()
3137 subgraph_->GetExcludedCohorts().cend(), in InEscapeCohort()
3143 subgraph_->GetExcludedCohorts().cend(), in BeforeAllEscapes()
3662 ni->GetAllEnvironments().cend(), in ReorderMaterializationsForEnvDominance()
3666 env->GetEnvInputs().cend(), in ReorderMaterializationsForEnvDominance()
|
| /art/openjdkjvmti/ |
| D | transform.cc | 171 definitions.cend(), in RetransformClasses()
|
| D | ti_redefine.cc | 245 return ObsoleteMapIter(this, id_map_.cend()); in end()
972 std::find_if(old_methods.cbegin(), old_methods.cend(), [&](const auto& current_old_method) { in CheckMethods()
980 if (old_iter == old_methods.cend()) { in CheckMethods()
1004 !std::all_of(seen_old_methods.cbegin(), seen_old_methods.cend(), [](auto x) { return x; })) { in CheckMethods()
1007 std::find_if(seen_old_methods.cbegin(), seen_old_methods.cend(), [](auto x) { return !x; }); in CheckMethods()
1036 std::find_if(old_fields.cbegin(), old_fields.cend(), [&](const auto& old_iter) { in CheckFields()
1043 if (old_iter == old_fields.cend()) { in CheckFields()
1064 if (!std::all_of(seen_old_fields.cbegin(), seen_old_fields.cend(), [](auto x) { return x; })) { in CheckFields()
1066 std::find_if(seen_old_fields.cbegin(), seen_old_fields.cend(), [](auto x) { return !x; }); in CheckFields()
2960 old_classes_vec.cend(), in UpdateClassStructurally()
[all …]
|
| /art/runtime/jit/ |
| D | jit_code_cache.h | 160 ArrayRef<const Entry>::const_iterator cend() const { in cend() function
161 return map_.cend(); in cend()
|
| /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/profman/ |
| D | profile_assistant_test.cc | 1626 lines.cend(), in TEST_F()
1628 lines.cend()); in TEST_F()
1630 lines.cend(), in TEST_F()
1631 "HLTestInlineSubtype;->inlineMonomorphic(LSuper;)I") != lines.cend()); in TEST_F()
|
| /art/libartbase/base/metrics/ |
| D | metrics.h | 497 return std::all_of(buckets.cbegin(), buckets.cend(), [](value_t i) { return i == 0; }); in IsNull()
|
| /art/runtime/jni/ |
| D | jni_id_manager.cc | 361 vec.cend(), in EncodeGenericId()
|