Searched defs:iterator (Results 1 - 5 of 5) sorted by relevance

/art/runtime/base/
H A Dbit_vector_test.cc57 BitVector::IndexIterator iterator = bv.Indexes().begin(); local
58 EXPECT_TRUE(iterator != bv.Indexes().end());
59 EXPECT_EQ(0, *iterator);
60 ++iterator;
61 EXPECT_TRUE(iterator != bv.Indexes().end());
62 EXPECT_EQ(static_cast<int>(kBits - 1), *iterator);
63 ++iterator;
64 EXPECT_TRUE(iterator == bv.Indexes().end());
H A Dstringpiece.h133 typedef const char* iterator; typedef in class:art::StringPiece
135 typedef std::reverse_iterator<iterator> reverse_iterator;
136 iterator begin() const { return ptr_; }
137 iterator end() const { return ptr_ + length_; }
/art/compiler/dex/
H A Dpass_driver_me.h160 DataflowIterator* iterator) {
161 // Paranoid: Check the iterator before walking the BasicBlocks.
162 DCHECK(iterator != nullptr);
164 for (BasicBlock* bb = iterator->Next(change); bb != nullptr; bb = iterator->Next(change)) {
175 Iterator iterator(c_unit->mir_graph.get());
176 DoWalkBasicBlocks(data, pass, &iterator);
159 DoWalkBasicBlocks(PassMEDataHolder* data, const PassME* pass, DataflowIterator* iterator) argument
/art/compiler/utils/
H A Darray_ref.h51 typedef T* iterator; typedef in class:art::ArrayRef
53 typedef std::reverse_iterator<iterator> reverse_iterator;
113 iterator begin() { return array_; }
116 iterator end() { return array_ + size_; }
/art/runtime/
H A Dsafe_map.h40 typedef typename ::std::map<K, V, Comparator, Allocator>::iterator iterator; typedef in class:art::SafeMap
60 iterator begin() { return map_.begin(); }
62 iterator end() { return map_.end(); }
70 iterator erase(iterator it) { return map_.erase(it); }
73 iterator find(const K& k) { return map_.find(k); }
76 iterator lower_bound(const K& k) { return map_.lower_bound(k); }
89 iterator Put(const K& k, const V& v) {
90 std::pair<iterator, boo
[all...]

Completed in 374 milliseconds