Home
last modified time | relevance | path

Searched refs:iterator (Results 1 – 25 of 96) sorted by relevance

1234

/system/core/libunwindstack/
DElfInterfaceArm.h36 class iterator : public std::iterator<std::bidirectional_iterator_tag, uint32_t> {
38 iterator(ElfInterfaceArm* interface, size_t index) : interface_(interface), index_(index) { } in iterator() function
40 iterator& operator++() { index_++; return *this; }
41 iterator& operator++(int increment) { index_ += increment; return *this; }
42 iterator& operator--() { index_--; return *this; }
43 iterator& operator--(int decrement) { index_ -= decrement; return *this; }
45 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
46 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
64 iterator begin() { return iterator(this, 0); } in begin()
65 iterator end() { return iterator(this, total_entries_); } in end()
/system/core/libbacktrace/include/backtrace/
DBacktraceMap.h74 class iterator : public std::iterator<std::bidirectional_iterator_tag, backtrace_map_t*> {
76 iterator(BacktraceMap* map, size_t index) : map_(map), index_(index) {} in iterator() function
78 iterator& operator++() {
82 const iterator operator++(int increment) {
86 iterator& operator--() {
90 const iterator operator--(int decrement) {
95 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
96 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
114 iterator begin() { return iterator(this, 0); } in begin()
115 iterator end() { return iterator(this, maps_.size()); } in end()
DBacktrace.h172 typedef std::vector<backtrace_frame_data_t>::iterator iterator; typedef
173 iterator begin() { return frames_.begin(); } in begin()
174 iterator end() { return frames_.end(); } in end()
/system/keymaster/include/keymaster/
DList.h175 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef
193 inline iterator begin() { in begin()
194 return iterator(mpMiddle->getNext()); in begin()
199 inline iterator end() { in end()
200 return iterator(mpMiddle); in end()
211 iterator insert(iterator posn, const T& val) in insert()
218 return iterator(newNode); in insert()
222 void insert(iterator posn, const_iterator first, const_iterator last) { in insert()
228 iterator erase(iterator posn) { in erase()
234 return iterator(pNext); in erase()
[all …]
/system/core/libutils/include/utils/
DList.h177 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef
195 inline iterator begin() { in begin()
196 return iterator(mpMiddle->getNext()); in begin()
201 inline iterator end() { in end()
202 return iterator(mpMiddle); in end()
213 iterator insert(iterator posn, const T& val) in insert()
220 return iterator(newNode); in insert()
224 void insert(iterator posn, const_iterator first, const_iterator last) { in insert()
230 iterator erase(iterator posn) { in erase()
236 return iterator(pNext); in erase()
[all …]
/system/core/libunwindstack/include/unwindstack/
DDwarfSection.h45 class iterator : public std::iterator<std::bidirectional_iterator_tag, DwarfFde*> {
47 iterator(DwarfSection* section, size_t index) : index_(index) { in iterator() function
54 iterator& operator++() {
58 iterator& operator++(int increment) {
62 iterator& operator--() {
66 iterator& operator--(int decrement) {
71 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
72 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
84 iterator begin() { return iterator(this, 0); } in begin()
85 iterator end() { return iterator(this, static_cast<size_t>(-1)); } in end()
DMaps.h63 typedef std::vector<std::unique_ptr<MapInfo>>::iterator iterator; typedef
64 iterator begin() { return maps_.begin(); } in begin()
65 iterator end() { return maps_.end(); } in end()
/system/bt/gd/common/
Dlist_map.h50 using iterator = typename std::list<value_type>::iterator; variable
106 iterator find(const Key& key) { in find()
123 std::pair<iterator, bool> try_emplace(const_iterator pos, const Key& key, Args&&... args) { in try_emplace()
137 std::pair<iterator, bool> try_emplace_back(const Key& key, Args&&... args) { in try_emplace_back()
184 iterator erase(const_iterator iter) { in erase()
195 inline iterator begin() { in begin()
205 inline iterator end() { in end()
216 std::unordered_map<Key, iterator> key_map_;
Dlru_cache.h58 using iterator = typename ListMap<Key, T>::iterator; variable
116 iterator find(const Key& key) { in find()
162 std::tuple<iterator, bool, std::optional<node_type>> try_emplace(const Key& key, Args&&... args) { in try_emplace()
184 iterator erase(const_iterator iter) { in erase()
194 inline iterator begin() { in begin()
204 inline iterator end() { in end()
/system/core/logd/
DChattyLogBuffer.h45 typedef std::unordered_map<uid_t, LogBufferElementCollection::iterator> LogBufferIteratorMap;
48 typedef std::unordered_map<pid_t, LogBufferElementCollection::iterator> LogBufferPidIteratorMap;
61 LogBufferElementCollection::iterator Erase(LogBufferElementCollection::iterator it,
DSimpleLogBuffer.h55 std::list<LogBufferElement>::iterator GetOldest(log_id_t log_id) REQUIRES(lock_);
56 std::list<LogBufferElement>::iterator Erase(std::list<LogBufferElement>::iterator it)
82 std::optional<std::list<LogBufferElement>::iterator> oldest_[LOG_ID_MAX] GUARDED_BY(lock_);
DLogStatistics.h94 typedef typename std::unordered_map<TKey, TEntry>::iterator iterator; typedef
142 iterator Add(const TKey& key, const LogStatisticsElement& element) { in Add()
143 iterator it = map.find(key); in Add()
152 iterator Add(const TKey& key) { in Add()
153 iterator it = map.find(key); in Add()
163 iterator it = map.find(key); in Subtract()
170 iterator it = map.find(key); in Drop()
177 iterator it = map.find(key); in Erase()
183 iterator begin() { return map.begin(); } in begin()
185 iterator end() { return map.end(); } in end()
[all …]
DChattyLogBuffer.cpp177 LogBufferElementCollection::iterator ChattyLogBuffer::Erase(LogBufferElementCollection::iterator it, in Erase()
187 LogBufferIteratorMap::iterator found = mLastWorst[id].find(key); in Erase()
197 LogBufferPidIteratorMap::iterator found = mLastWorstPidOfSystem[id].find(element.pid()); in Erase()
204 LogBufferElementCollection::iterator bad = it; in Erase()
243 LogBufferElementMap::iterator it = map.find(key); in coalesce()
266 for (LogBufferElementMap::iterator it = map.begin(); it != map.end();) { in clear()
350 LogBufferElementCollection::iterator it; in Prune()
417 LogBufferIteratorMap::iterator found = mLastWorst[id].find(worst); in Prune()
426 LogBufferPidIteratorMap::iterator found = mLastWorstPidOfSystem[id].find(worstPid); in Prune()
437 LogBufferElementCollection::iterator lastt; in Prune()
/system/incremental_delivery/incfs/include/
DMountRegistry.h66 struct iterator final : public std::vector<Root>::const_iterator {
71 explicit iterator(base b) : base(b) {} in iterator() function
77 iterator begin() const { return iterator(roots.begin()); } in begin()
78 iterator end() const { return iterator(roots.end()); } in end()
/system/connectivity/wificond/
Dap_interface_impl.cpp95 const auto iterator = std::find_if(connected_clients_.begin(), connected_clients_.end(), in OnStationEvent() local
100 if (iterator == connected_clients_.end()) { in OnStationEvent()
118 const auto iterator = std::find_if(connected_clients_.begin(), connected_clients_.end(), in OnStationEvent() local
123 if (iterator != connected_clients_.end()) { in OnStationEvent()
124 connected_clients_.erase(iterator); in OnStationEvent()
/system/bt/gd/security/record/
Dsecurity_record_database.h30 using iterator = std::set<std::shared_ptr<SecurityRecord>>::iterator;
52 iterator Find(hci::AddressWithType address) { in Find()
/system/chre/util/include/chre/util/
Dpriority_queue.h152 typedef ElementType* iterator; typedef
158 typename PriorityQueue<ElementType, CompareFunction>::iterator begin();
165 typename PriorityQueue<ElementType, CompareFunction>::iterator end();
Dfixed_size_vector.h180 typedef ElementType* iterator; typedef
186 typename FixedSizeVector<ElementType, kCapacity>::iterator begin();
193 typename FixedSizeVector<ElementType, kCapacity>::iterator end();
Ddynamic_vector.h36 typedef ElementType* iterator; typedef
293 typename DynamicVector<ElementType>::iterator begin();
300 typename DynamicVector<ElementType>::iterator end();
/system/chre/util/tests/
Dfixed_size_vector_test.cc206 for (FixedSizeVector<int, 8>::iterator it = vector.begin(); in TEST()
211 FixedSizeVector<int, 8>::iterator it = vector.begin() + vector.size() - 1; in TEST()
244 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
245 FixedSizeVector<int, 8>::iterator it_e = vector.end(); in TEST()
261 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
262 FixedSizeVector<int, 8>::iterator it_e = vector.end(); in TEST()
278 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
295 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
316 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
Darray_queue_test.cc288 ArrayQueue<int, 4>::iterator it = q.begin(); in TEST()
301 for (ArrayQueue<int, 4>::iterator it = q.begin(); it != q.end(); ++it) { in TEST()
305 for (ArrayQueue<int, 4>::iterator it = q.begin(); it != q.end(); it++) { in TEST()
310 ArrayQueue<int, 4>::iterator it = q.begin(); in TEST()
328 ArrayQueue<int, 4>::iterator it2; in TEST()
332 ArrayQueue<int, 4>::iterator it3(it); in TEST()
353 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
354 ArrayQueue<int, 4>::iterator it_e = q.end(); in TEST()
369 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
384 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
[all …]
/system/libhidl/transport/include/hidl/
DConcurrentMap.h29 using iterator = typename std::map<K, V>::iterator; variable
83 iterator begin() { return mMap.begin(); } in begin()
84 iterator end() { return mMap.end(); } in end()
/system/core/fastboot/
Dusb_osx.cpp92 io_iterator_t iterator; in try_interfaces() local
106 kr = (*dev)->CreateInterfaceIterator(dev, &request, &iterator); in try_interfaces()
113 while ((usbInterface = IOIteratorNext(iterator))) { in try_interfaces()
396 io_iterator_t iterator; in init_usb() local
415 kIOMasterPortDefault, matchingDict, &iterator); in init_usb()
423 if (! IOIteratorIsValid(iterator)) { in init_usb()
428 IOIteratorReset(iterator); in init_usb()
432 io_service_t device = IOIteratorNext(iterator); in init_usb()
453 IOObjectRelease(iterator); in init_usb()
/system/netd/server/
DPppController.cpp44 TtyCollection::iterator it; in ~PppController()
63 TtyCollection::iterator it; in attachPppd()
132 TtyCollection::iterator it; in updateTtyList()
/system/bt/gd/packet/
Dfragmenting_inserter.cc25 … std::back_insert_iterator<std::vector<std::unique_ptr<RawBuilder>>> iterator) in FragmentingInserter() argument
27 iterator_(iterator) {} in FragmentingInserter()

1234