| /art/libartbase/base/ |
| D | transform_iterator_test.cc | 88 MakeTransformIterator(input.rend(), add1), in TEST()
109 ASSERT_EQ(input[i].value + 1, MakeTransformIterator(input.rend(), add1)[index_from_rend]); in TEST()
124 ASSERT_EQ(MakeTransformIterator(input.rend(), add1) - i, in TEST()
125 MakeTransformIterator(input.rend() - i, add1)); in TEST()
191 MakeTransformIterator(input.rend(), sub1), in TEST()
293 MakeTransformIterator(input.rend(), ref), in TEST()
314 ASSERT_EQ(input[i].value, MakeTransformIterator(input.rend(), ref)[index_from_rend]); in TEST()
329 ASSERT_EQ(MakeTransformIterator(input.rend(), ref) - i, in TEST()
330 MakeTransformIterator(input.rend() - i, ref)); in TEST()
366 MakeTransformIterator(input.rend(), ref), in TEST()
[all …]
|
| D | transform_array_ref_test.cc | 62 std::copy(taref.rbegin(), taref.rend(), std::back_inserter(output)); in TEST()
98 std::copy(taref.rbegin(), taref.rend(), std::back_inserter(output)); in TEST()
137 std::copy(taref.rbegin(), taref.rend(), std::back_inserter(output)); in TEST()
181 std::copy(ctaref.rbegin(), ctaref.rend(), std::back_inserter(output)); in TEST()
|
| D | array_slice.h | 68 reverse_iterator rend() { return reverse_iterator(begin()); } in rend() function
69 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } in rend() function
|
| D | array_ref.h | 128 reverse_iterator rend() { return reverse_iterator(begin()); } in rend() function
129 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } in rend() function
|
| D | transform_array_ref.h | 101 reverse_iterator rend() { return reverse_iterator(begin()); } in rend() function
102 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } in rend() function
|
| D | dchecked_vector.h | 102 using Base::rend;
|
| /art/compiler/optimizing/ |
| D | linear_order.cc | 44 for (auto end = worklist->rend(); insert_pos != end; ++insert_pos) { in AddToListForLinearization()
|
| /art/tools/dexanalyze/ |
| D | dexanalyze_bytecode.cc | 43 std::sort(most_used.rbegin(), most_used.rend()); in SortByOrder()
83 std::sort(sorted.rbegin(), sorted.rend());
180 std::sort(pairs.rbegin(), pairs.rend()); in Dump()
|
| D | dexanalyze_strings.cc | 321 return std::string(chars.rbegin(), chars.rend()); in GetString()
|
| D | dexanalyze_experiments.cc | 465 std::sort(uses.rbegin(), uses.rend()); in ProcessDexFile()
|
| /art/runtime/ |
| D | trace.cc | 244 for (auto rit = stack_trace->rbegin(); rit != stack_trace->rend(); ++rit) { in CompareAndUpdateStackTrace()
254 while (old_rit != old_stack_trace->rend() && rit != stack_trace->rend() && *old_rit == *rit) { in CompareAndUpdateStackTrace()
264 for (; rit != stack_trace->rend(); ++rit) { in CompareAndUpdateStackTrace()
|
| D | instrumentation.cc | 412 end = thread->GetInstrumentationStack()->rend(); isi != end; ++isi) { in InstrumentationInstallStack()
413 while (ssi != visitor.shadow_stack_.rend() && (*ssi).frame_id_ < (*isi).frame_id_) { in InstrumentationInstallStack()
|
| /art/runtime/gc/ |
| D | allocation_record.cc | 59 for (auto it = entries_.rbegin(), end = entries_.rend(); it != end; ++it) { in VisitRoots()
|
| D | allocation_record.h | 293 return entries_.rend(); in REnd()
|
| /art/runtime/gc/allocator/ |
| D | rosalloc.cc | 180 … if (it != free_page_runs_.rend() && (last_free_page_run = *it)->End(this) == base_ + footprint_) { in AllocPages()
234 DCHECK(it != free_page_runs_.rend()); in AllocPages()
1353 if (it != free_page_runs_.rend() && (last_free_page_run = *it)->End(this) == base_ + footprint_) { in Trim()
|
| /art/imgdiag/ |
| D | imgdiag.cc | 167 std::sort(value_key_vector.rbegin(), value_key_vector.rend());
|