Searched defs:iterator (Results 1 - 6 of 6) sorted by relevance
/art/runtime/base/ |
H A D | bit_vector_test.cc | 58 BitVector::IndexIterator iterator = bv.Indexes().begin(); local 59 EXPECT_TRUE(iterator != bv.Indexes().end()); 60 EXPECT_EQ(0u, *iterator); 61 ++iterator; 62 EXPECT_TRUE(iterator != bv.Indexes().end()); 63 EXPECT_EQ(kBits - 1u, *iterator); 64 ++iterator; 65 EXPECT_TRUE(iterator == bv.Indexes().end());
|
H A D | iteration_range.h | 20 #include <iterator> 29 typedef Iter iterator; typedef in class:art::IterationRange 35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } 37 iterator begin() const { return first_; } 38 iterator end() const { return last_; } 39 iterator cbegin() const { return first_; } 40 iterator cend() const { return last_; } 43 const iterator first_; 44 const iterator last [all...] |
H A D | stringpiece.h | 43 typedef const char* iterator; typedef in class:art::StringPiece 45 typedef std::reverse_iterator<iterator> reverse_iterator; 133 iterator begin() const { return ptr_; } 134 iterator end() const { return ptr_ + length_; }
|
/art/compiler/dex/ |
H A D | pass_driver_me.h | 188 DataflowIterator* iterator) { 189 // Paranoid: Check the iterator before walking the BasicBlocks. 190 DCHECK(iterator != nullptr); 192 for (BasicBlock* bb = iterator->Next(change); bb != nullptr; bb = iterator->Next(change)) { 203 Iterator iterator(c_unit->mir_graph.get()); 204 DoWalkBasicBlocks(data, pass, &iterator); 187 DoWalkBasicBlocks(PassMEDataHolder* data, const PassME* pass, DataflowIterator* iterator) argument
|
/art/compiler/utils/ |
H A D | array_ref.h | 51 typedef T* iterator; typedef in class:art::ArrayRef 53 typedef std::reverse_iterator<iterator> reverse_iterator; 112 iterator begin() { return array_; } 115 iterator end() { return array_ + size_; }
|
/art/runtime/ |
H A D | safe_map.h | 40 typedef typename ::std::map<K, V, Comparator, Allocator>::iterator iterator; typedef in class:art::SafeMap 61 iterator begin() { return map_.begin(); } 63 iterator end() { return map_.end(); } 71 iterator erase(iterator it) { return map_.erase(it); } 74 iterator find(const K& k) { return map_.find(k); } 77 iterator lower_bound(const K& k) { return map_.lower_bound(k); } 90 iterator Put(const K& k, const V& v) { 91 std::pair<iterator, boo [all...] |
Completed in 91 milliseconds