Home
last modified time | relevance | path

Searched refs:cend (Results 1 – 6 of 6) sorted by relevance

/art/runtime/base/
Ddchecked_vector.h106 using Base::cend;
153 DCHECK(cbegin() <= position && position <= cend()); in insert()
157 DCHECK(cbegin() <= position && position <= cend()); in insert()
162 DCHECK(cbegin() <= position && position <= cend()); in insert()
166 DCHECK(cbegin() <= position && position <= cend()); in insert()
170 DCHECK(cbegin() <= position && position <= cend()); in insert()
176 DCHECK(cbegin() <= position && position < cend()); in erase()
180 DCHECK(cbegin() <= first && first <= cend()); in erase()
181 DCHECK(first <= last && last <= cend()); in erase()
188 DCHECK(cbegin() <= position && position <= cend()); in emplace()
Diteration_range.h40 iterator cend() const { return last_; } in cend() function
/art/runtime/gc/accounting/
Dcard_table_test.cc116 for (uint8_t* cend = HeapLimit() - delta; cend < HeapLimit(); cend += CardTable::kCardSize) { in TEST_F() local
119 uint8_t* end = cend - end_offset; in TEST_F()
/art/compiler/utils/
Darray_ref.h121 const_iterator cend() const { return array_ + size_; } in cend() function
124 const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); } in crbegin()
Dintrusive_forward_list_test.cc62 ASSERT_TRUE(ifl.end() == ifl.cend()); in TEST()
63 ASSERT_FALSE(ifl.end() != ifl.cend()); in TEST()
Dintrusive_forward_list.h161 const_iterator cend() const { return const_iterator(nullptr); } in cend() function