Searched refs:iterator (Results 1 - 25 of 36) sorted by relevance

12

/art/runtime/base/
H A Diteration_range.h20 #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 Ddchecked_vector.h50 using typename Base::iterator;
152 iterator insert(const_iterator position, const value_type& value) {
156 iterator insert(const_iterator position, size_type n, const value_type& value) {
161 iterator insert(const_iterator position, InputIterator first, InputIterator last) {
165 iterator insert(const_iterator position, value_type&& value) {
169 iterator insert(const_iterator position, std::initializer_list<value_type> il) {
175 iterator erase(const_iterator position) {
179 iterator erase(const_iterator first, const_iterator last) {
187 iterator emplace(const_iterator position, Args&&... args) {
H A Dbit_vector_test.cc58 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 Dhash_set.h21 #include <iterator>
63 class BaseIterator : std::iterator<std::forward_iterator_tag, Elem> {
125 using iterator = BaseIterator<T, HashSet>;
272 iterator begin() {
273 iterator ret(this, 0);
290 iterator end() {
291 return iterator(this, NumBuckets());
309 // Make an empty slot where the iterator is pointing.
312 // iterator. It must be before the empty slot, in that case we can move it to the empty slot
316 iterator Eras
[all...]
H A Dstringpiece.h43 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_; }
H A Dbit_vector.h21 #include <iterator>
39 * @brief Convenient iterator across the indexes of the BitVector's set bits.
41 * @details IndexIterator is a Forward iterator (C++11: 24.2.5) from the lowest
50 std::iterator<std::forward_iterator_tag, uint32_t, ptrdiff_t, void, uint32_t> {
180 // be unused bits - setting those to one will confuse the iterator.
H A Dstl_util.h40 // For hash_[multi]set, it is important that this deletes behind the iterator
41 // because the hash_set may call the hash function on the iterator when it is
78 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
H A Dbit_utils.h20 #include <iterator>
299 : public std::iterator<std::forward_iterator_tag, uint32_t, ptrdiff_t, void, void> {
H A Dvariant_map.h405 typename StorageMap::iterator GetKeyValueIterator(const TKey<TValue>& key) {
/art/test/548-checker-inlining-and-dce/src/
H A DMain.java22 it.iterator();
29 it.iterator();
78 public java.util.Iterator iterator() { return null; }
/art/runtime/
H A Dsafe_map.h41 typedef typename ::std::map<K, V, Comparator, Allocator>::iterator iterator; typedef in class:art::SafeMap
62 iterator begin() { return map_.begin(); }
64 iterator end() { return map_.end(); }
72 iterator erase(iterator it) { return map_.erase(it); }
75 iterator find(const K& k) { return map_.find(k); }
78 iterator lower_bound(const K& k) { return map_.lower_bound(k); }
91 iterator Put(const K& k, const V& v) {
92 std::pair<iterator, boo
[all...]
H A Dstride_iterator.h20 #include <iterator>
27 class StrideIterator : public std::iterator<std::forward_iterator_tag, T> {
H A Dprofiler.cc500 Map::iterator i = table[index]->find(method);
559 MethodContextMap::iterator i = method_context_table->find(method);
601 PreviousProfile::iterator pi = previous_.find(method_name);
641 PreviousProfile::iterator pi = previous_.find(method_name);
648 PreviousContextMap::iterator ci = new_context_map.find(context_i.first);
859 ProfileSet::iterator end = countSet.end();
861 for (ProfileSet::iterator it = countSet.begin(); it != end ; it++) {
882 ProfileMap::iterator i = profile_map_.find(method_name);
891 ProfileMap::iterator end = profile_map_.end();
892 for (ProfileMap::iterator i
[all...]
/art/test/478-checker-clinit-check-pruning/src/
H A DMain.java331 it.iterator();
363 it.iterator();
392 it.iterator();
426 it.iterator();
464 it.iterator();
498 it.iterator();
514 it.iterator();
537 Iterable it = new Iterable() { public java.util.Iterator iterator() { return null; } };
/art/compiler/optimizing/
H A Dblock_builder.cc68 CatchHandlerIterator iterator(handlers_ptr);
69 for (; iterator.HasNext(); iterator.Next()) {
70 MaybeCreateBlockAt(iterator.GetHandlerAddress());
72 handlers_ptr = iterator.EndDataPointer();
194 auto iterator = try_block_info.find(block->GetBlockId()); local
195 return (iterator == try_block_info.end()) ? nullptr : iterator->second;
279 CatchHandlerIterator iterator(handlers_ptr);
280 for (; iterator
[all...]
H A Dgvn.cc226 // the given 'iterator'.
227 Node* CloneBucket(size_t index, Node* iterator = nullptr) {
234 if (node == iterator) {
H A Dnodes.h1384 HUserRecord(const HUserRecord<T>& old_record, typename HUseList<T>::iterator before_use_node)
1386 HUserRecord(HInstruction* instruction, typename HUseList<T>::iterator before_use_node)
1392 typename HUseList<T>::iterator GetBeforeUseNode() const { return before_use_node_; }
1393 typename HUseList<T>::iterator GetUseNode() const { return ++GetBeforeUseNode(); }
1400 typename HUseList<T>::iterator before_use_node_;
1870 HUseList<HInstruction*>::iterator before_use_node = input_use.GetBeforeUseNode();
2084 void FixUpUserRecordsAfterUseInsertion(HUseList<HInstruction*>::iterator fixup_end) {
2094 void FixUpUserRecordsAfterUseRemoval(HUseList<HInstruction*>::iterator before_use_node) {
2095 auto next = ++HUseList<HInstruction*>::iterator(before_use_node);
2104 void FixUpUserRecordsAfterEnvUseInsertion(HUseList<HEnvironment*>::iterator env_fixup_en
[all...]
/art/compiler/utils/
H A Dintrusive_forward_list.h22 #include <iterator>
52 class IntrusiveForwardListIterator : public std::iterator<std::forward_iterator_tag, T> {
59 // Conversion from iterator to const_iterator.
132 typedef IntrusiveForwardListIterator< T, hook_traits> iterator; typedef in class:art::IntrusiveForwardList
153 iterator before_begin() { return iterator(&first_); }
155 iterator begin() { return iterator(first_.next_hook); }
157 iterator end() { return iterator(nullpt
[all...]
H A Darray_ref.h51 typedef T* iterator; typedef in class:art::ArrayRef
53 typedef std::reverse_iterator<iterator> reverse_iterator;
116 iterator begin() { return array_; }
119 iterator end() { return array_ + size_; }
/art/cmdline/
H A Dtoken_range.h46 // Copying-from-iterator constructor
106 using iterator = TokenList::const_iterator;
109 using const_iterator = iterator;
144 iterator begin() const {
149 iterator end() const {
248 iterator it_end;
289 for (iterator it = begin(); it != end(); ++it) {
407 TokenList::iterator new_end =
420 const iterator begin_;
421 const iterator end
[all...]
/art/test/545-tracing-and-jit/src/
H A DMain.java180 set.iterator();
197 set.iterator();
214 set.iterator();
/art/tools/ahat/src/
H A DAhatSnapshot.java121 mRootSite.add(stackId, 0, path.iterator(), inst);
203 site = mRootSite.getChild(path.iterator());
263 site = mRootSite.getChild(path.iterator());
H A DSort.java101 Iterator<Comparator<T>> iter = mComparators.iterator();
/art/runtime/gc/
H A Dallocation_record.h267 EntryList::iterator Begin()
273 EntryList::iterator End()
/art/runtime/verifier/
H A Dmethod_verifier.cc1032 CatchHandlerIterator iterator(handlers_ptr);
1033 for (; iterator.HasNext(); iterator.Next()) {
1034 uint32_t dex_pc= iterator.GetHandlerAddress();
1048 if (iterator.GetHandlerTypeIndex() != DexFile::kDexNoIndex16) {
1050 iterator.GetHandlerTypeIndex(),
1058 handlers_ptr = iterator.EndDataPointer();
1688 DexFileParameterIterator iterator(*dex_file_, proto_id);
1690 for (; iterator.HasNext(); iterator
[all...]

Completed in 89 milliseconds

12