/art/libartbase/base/ |
D | intrusive_forward_list.h | 144 typedef IntrusiveForwardListIterator<const T, hook_traits> const_iterator; typedef 165 const_iterator before_begin() const { return const_iterator(&first_); } in before_begin() 167 const_iterator begin() const { return const_iterator(first_.next_hook); } in begin() 169 const_iterator end() const { return const_iterator(nullptr); } in end() 170 const_iterator cbefore_begin() const { return const_iterator(&first_); } in cbefore_begin() 171 const_iterator cbegin() const { return const_iterator(first_.next_hook); } in cbegin() 172 const_iterator cend() const { return const_iterator(nullptr); } in cend() 195 iterator insert_after(const_iterator position, value_type& value) { in insert_after() 202 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { in insert_after() 208 iterator erase_after(const_iterator position) { in erase_after() [all …]
|
D | bit_table.h | 156 class const_iterator : public std::iterator<std::random_access_iterator_tag, 163 const_iterator() {} in const_iterator() function 164 const_iterator(const BitTable* table, uint32_t row) : table_(table), row_(row) {} in const_iterator() function 165 const_iterator operator+(difference_type n) { return const_iterator(table_, row_ + n); } 166 const_iterator operator-(difference_type n) { return const_iterator(table_, row_ - n); } 167 difference_type operator-(const const_iterator& other) { return row_ - other.row_; } 170 const_iterator operator++() { return const_iterator(table_, ++row_); } 171 const_iterator operator--() { return const_iterator(table_, --row_); } 172 const_iterator operator++(int) { return const_iterator(table_, row_++); } 173 const_iterator operator--(int) { return const_iterator(table_, row_--); } [all …]
|
D | array_slice.h | 39 using const_iterator = StrideIterator<const T>; variable 41 using const_reverse_iterator = std::reverse_iterator<const_iterator>; 69 const_iterator begin() const { return const_iterator(&AtUnchecked(0), element_size_); } in begin() 70 const_iterator cbegin() const { return const_iterator(&AtUnchecked(0), element_size_); } in cbegin() 72 const_iterator end() const { return const_iterator(&AtUnchecked(size_), element_size_); } in end() 73 const_iterator cend() const { return const_iterator(&AtUnchecked(size_), element_size_); } in cend()
|
D | safe_map.h | 41 typedef typename ::std::map<K, V, Comparator, Allocator>::const_iterator const_iterator; typedef 63 const_iterator begin() const { return map_.begin(); } in begin() 65 const_iterator end() const { return map_.end(); } in end() 76 template<typename Kv> const_iterator find(const Kv& k) const { return map_.find(k); } in find() 79 template<typename Kv> const_iterator lower_bound(const Kv& k) const { in lower_bound() 84 template<typename Kv> const_iterator upper_bound(const Kv& k) const { in upper_bound() 92 const_iterator it = map_.find(k); in Get() 110 iterator PutBefore(const_iterator pos, const K& k, const V& v) { in PutBefore() 113 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore() 116 iterator PutBefore(const_iterator pos, const K& k, V&& v) { in PutBefore() [all …]
|
D | dchecked_vector.h | 51 using typename Base::const_iterator; 150 iterator insert(const_iterator position, const value_type& value) { in insert() 154 iterator insert(const_iterator position, size_type n, const value_type& value) { in insert() 159 iterator insert(const_iterator position, InputIterator first, InputIterator last) { in insert() 163 iterator insert(const_iterator position, value_type&& value) { in insert() 167 iterator insert(const_iterator position, std::initializer_list<value_type> il) { in insert() 173 iterator erase(const_iterator position) { in erase() 177 iterator erase(const_iterator first, const_iterator last) { in erase() 185 iterator emplace(const_iterator position, Args&&... args) { in emplace()
|
D | array_ref.h | 49 using const_iterator = const T*; variable 51 using const_reverse_iterator = std::reverse_iterator<const_iterator>; 120 const_iterator begin() const { return array_; } in begin() 121 const_iterator cbegin() const { return array_; } in cbegin() 123 const_iterator end() const { return array_ + size_; } in end() 124 const_iterator cend() const { return array_ + size_; } in cend()
|
D | transform_array_ref.h | 38 TransformIterator<typename ArrayRef<BaseType>::const_iterator, Function>; 53 using const_iterator = typename std::conditional< variable 93 const_iterator begin() const { return MakeIterator(base().cbegin()); } in begin() 94 const_iterator cbegin() const { return MakeIterator(base().cbegin()); } in cbegin() 96 const_iterator end() const { MakeIterator(base().cend()); } in end() 97 const_iterator cend() const { return MakeIterator(base().cend()); } in cend()
|
D | hash_set.h | 180 using const_iterator = HashSetIterator<const T, const HashSet>; variable 335 const_iterator begin() const { in begin() 336 const_iterator ret(this, 0); in begin() 349 const_iterator end() const { in end() 350 return const_iterator(this, NumBuckets()); in end() 428 const_iterator find(const K& key) const { in find() 438 const_iterator FindWithHash(const K& key, size_t hash) const { in FindWithHash() 439 return const_iterator(this, FindIndex(key, hash)); in FindWithHash() 445 std::pair<iterator, bool> insert(const_iterator hint ATTRIBUTE_UNUSED, const T& element) { in insert() 448 std::pair<iterator, bool> insert(const_iterator hint ATTRIBUTE_UNUSED, T&& element) { in insert()
|
D | transform_array_ref_test.cc | 46 using ConstTarefIter = decltype(taref)::const_iterator; in TEST() 87 static_assert(std::is_same<void, decltype(taref)::const_iterator>::value, "const_iterator"); in TEST()
|
D | variant_map.h | 424 typename StorageMap::const_iterator GetKeyValueIterator(const TKey<TValue>& key) const { in GetKeyValueIterator()
|
D | hash_set_test.cc | 363 HashSet<std::string>::const_iterator cit = it; in TEST_F()
|
D | intrusive_forward_list_test.cc | 130 typename ListType::const_iterator cbegin = ifl.cbegin(); in IteratorToConstIterator() 131 typename ListType::const_iterator converted_begin = begin; in IteratorToConstIterator()
|
/art/cmdline/ |
D | token_range.h | 59 TokenList::const_iterator it_begin, 60 TokenList::const_iterator it_end) 85 TokenList::const_iterator it_begin, in TokenRange() 86 TokenList::const_iterator it_end) in TokenRange() 108 using iterator = TokenList::const_iterator; 111 using const_iterator = iterator; member
|
/art/compiler/utils/ |
D | swap_space.h | 73 FreeBySizeEntry(size_t sz, FreeByStartSet::const_iterator entry) in FreeBySizeEntry() 79 mutable FreeByStartSet::const_iterator free_by_start_entry; 94 void RemoveChunk(FreeBySizeSet::const_iterator free_by_size_pos) REQUIRES(lock_);
|
D | swap_space.cc | 49 void SwapSpace::RemoveChunk(FreeBySizeSet::const_iterator free_by_size_pos) { in RemoveChunk()
|
/art/runtime/ |
D | oat.cc | 38 SafeMap<std::string, std::string>::const_iterator it = variable_data->begin(); in ComputeOatHeaderSize() 39 SafeMap<std::string, std::string>::const_iterator end = variable_data->end(); in ComputeOatHeaderSize() 420 SafeMap<std::string, std::string>::const_iterator it = key_value_store->begin(); in Flatten() 421 SafeMap<std::string, std::string>::const_iterator end = key_value_store->end(); in Flatten()
|
D | stack_map.h | 62 using const_iterator = const DexRegisterLocation*; variable 82 const_iterator begin() const { return data(); } in begin() 83 const_iterator end() const { return data() + count_; } in end()
|
D | native_stack_dump.cc | 358 for (Backtrace::const_iterator it = backtrace->begin(); in DumpNativeStack()
|
D | elf_file.cc | 888 typename SymbolTable::const_iterator it = (*symbol_table)->find(symbol_name); in FindSymbolByName()
|
/art/dex2oat/linker/ |
D | multi_oat_relative_patcher.h | 40 using const_iterator = SafeMap<MethodReference, uint32_t>::const_iterator;
|
/art/test/137-cfi/ |
D | cfi.cc | 104 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) { in CheckStack() 117 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) { in CheckStack()
|
/art/compiler/optimizing/ |
D | register_allocation_resolver.cc | 314 UsePositionList::const_iterator use_it = current->GetUses().begin(); in ConnectSiblings() 315 const UsePositionList::const_iterator use_end = current->GetUses().end(); in ConnectSiblings() 316 EnvUsePositionList::const_iterator env_use_it = current->GetEnvironmentUses().begin(); in ConnectSiblings() 317 const EnvUsePositionList::const_iterator env_use_end = current->GetEnvironmentUses().end(); in ConnectSiblings()
|
/art/runtime/jit/ |
D | jit_code_cache.h | 151 ArrayRef<const Entry>::const_iterator cbegin() const { in cbegin() 157 ArrayRef<const Entry>::const_iterator cend() const { in cend()
|
/art/dexlayout/ |
D | dex_visualize.cc | 93 ColorMapType::const_iterator iter = kColorMap.find(section); in GetColor()
|
/art/tools/signal_dumper/ |
D | signal_dumper.cc | 525 for (Backtrace::const_iterator it = backtrace->begin(); in DumpThread()
|