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

/system/chre/util/include/chre/util/
H A Dfixed_size_vector.h170 * Random-access iterator that points to some element in the container.
172 typedef ElementType* iterator; typedef in class:chre::FixedSizeVector
176 * @return A random-access iterator to the beginning.
178 typename FixedSizeVector<ElementType, kCapacity>::iterator begin();
183 * @return A random-access iterator to the end.
185 typename FixedSizeVector<ElementType, kCapacity>::iterator end();
H A Dpriority_queue.h150 * Random-access iterator that points to some element in the container.
152 typedef ElementType* iterator; typedef in class:chre::PriorityQueue
156 * @return A random-access iterator to the beginning.
158 typename PriorityQueue<ElementType, CompareFunction>::iterator begin();
163 * @return A random-access iterator to the end.
165 typename PriorityQueue<ElementType, CompareFunction>::iterator end();
H A Ddynamic_vector.h34 * Random-access iterator that points to some element in the container.
36 typedef ElementType* iterator; typedef in class:chre::DynamicVector
116 * has been resized. Otherwise, only the past-the-end iterator is invalidated.
127 * only the past-the-end iterator is invalidated.
336 * @return A random-access iterator to the beginning.
338 typename DynamicVector<ElementType>::iterator begin();
343 * @return A random-access iterator to the end.
345 typename DynamicVector<ElementType>::iterator end();
H A Darray_queue.h140 * A template class that implements a forward iterator for the array queue.
185 //! Pointer of the iterator.
196 * Forward iterator that points to some element in the container.
198 typedef ArrayQueueIterator<ElementType> iterator; typedef in class:chre::ArrayQueue
202 * @return A forward iterator to the beginning.
204 typename ArrayQueue<ElementType, kCapacity>::iterator begin();
209 * @return A forward iterator to the end.
211 typename ArrayQueue<ElementType, kCapacity>::iterator end();
/system/core/libunwindstack/
H A DElfInterfaceArm.h23 #include <iterator>
36 class iterator : public std::iterator<std::bidirectional_iterator_tag, uint32_t> { class in class:unwindstack::ElfInterfaceArm
38 iterator(ElfInterfaceArm* interface, size_t index) : interface_(interface), index_(index) { } function in class:unwindstack::ElfInterfaceArm::iterator
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
[all...]
/system/core/libunwindstack/include/unwindstack/
H A DMaps.h47 typedef std::vector<MapInfo>::iterator iterator; typedef in class:unwindstack::Maps
48 iterator begin() { return maps_.begin(); }
49 iterator end() { return maps_.end(); }
H A DDwarfSection.h22 #include <iterator>
41 class iterator : public std::iterator<std::bidirectional_iterator_tag, DwarfFde*> { class in class:unwindstack::DwarfSection
43 iterator(DwarfSection* section, size_t index) : section_(section), index_(index) {} function in class:unwindstack::DwarfSection::iterator
45 iterator& operator++() {
49 iterator& operator++(int increment) {
53 iterator& operator--() {
57 iterator& operator--(int decrement) {
62 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
63 bool operator!=(const iterator
[all...]
/system/security/keystore/
H A Dgrant_store.cpp51 auto iterator = std::find_if(uid_grant_list.begin(), uid_grant_list.end(), local
57 std::tie(iterator, success) = uid_grant_list.emplace(alias, owner_dir_name, owner_uid,
60 s << iterator->grant_no_;
/system/core/include/backtrace/
H A DBacktraceMap.h84 typedef std::deque<backtrace_map_t>::iterator iterator; typedef in class:BacktraceMap
85 iterator begin() { return maps_.begin(); }
86 iterator end() { return maps_.end(); }
H A DBacktrace.h141 typedef std::vector<backtrace_frame_data_t>::iterator iterator; typedef in class:Backtrace
142 iterator begin() { return frames_.begin(); }
143 iterator end() { return frames_.end(); }
/system/core/libbacktrace/include/backtrace/
H A DBacktraceMap.h84 typedef std::deque<backtrace_map_t>::iterator iterator; typedef in class:BacktraceMap
85 iterator begin() { return maps_.begin(); }
86 iterator end() { return maps_.end(); }
H A DBacktrace.h141 typedef std::vector<backtrace_frame_data_t>::iterator iterator; typedef in class:Backtrace
142 iterator begin() { return frames_.begin(); }
143 iterator end() { return frames_.end(); }
/system/core/fastboot/
H A Dusb_osx.cpp88 io_iterator_t iterator; local
104 // Get an iterator for the interfaces on the device
105 kr = (*dev)->CreateInterfaceIterator(dev, &request, &iterator);
108 ERR("Couldn't create a device interface iterator: (%08x)\n", kr);
112 while ((usbInterface = IOIteratorNext(iterator))) {
395 io_iterator_t iterator; local
414 kIOMasterPortDefault, matchingDict, &iterator);
417 ERR("Could not create iterator.");
422 if (! IOIteratorIsValid(iterator)) {
424 * Apple documentation advises resetting the iterator i
[all...]
/system/core/include/utils/
H A DSortedVector.h128 typedef TYPE* iterator; typedef in class:android::SortedVector
131 inline iterator begin() { return editArray(); }
132 inline iterator end() { return editArray() + size(); }
137 inline iterator erase(iterator pos) {
H A DList.h99 // this will handle conversions from iterator to const_iterator
123 * handle comparisons between iterator and const_iterator
175 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef in class:android::List
190 * _Node* we're returning is converted to an "iterator" by a
193 inline iterator begin() {
194 return iterator(mpMiddle->getNext());
199 inline iterator end() {
200 return iterator(mpMiddle);
210 /* insert before the current node; returns iterator at new node */
211 iterator inser
[all...]
H A DVector.h197 typedef TYPE* iterator; typedef in class:android::Vector
200 inline iterator begin() { return editArray(); }
201 inline iterator end() { return editArray() + size(); }
208 inline iterator erase(iterator pos) {
/system/core/libutils/include/utils/
H A DSortedVector.h128 typedef TYPE* iterator; typedef in class:android::SortedVector
131 inline iterator begin() { return editArray(); }
132 inline iterator end() { return editArray() + size(); }
137 inline iterator erase(iterator pos) {
H A DList.h99 // this will handle conversions from iterator to const_iterator
123 * handle comparisons between iterator and const_iterator
175 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef in class:android::List
190 * _Node* we're returning is converted to an "iterator" by a
193 inline iterator begin() {
194 return iterator(mpMiddle->getNext());
199 inline iterator end() {
200 return iterator(mpMiddle);
210 /* insert before the current node; returns iterator at new node */
211 iterator inser
[all...]
H A DVector.h197 typedef TYPE* iterator; typedef in class:android::Vector
200 inline iterator begin() { return editArray(); }
201 inline iterator end() { return editArray() + size(); }
208 inline iterator erase(iterator pos) {
/system/core/adb/client/
H A Dusb_osx.cpp108 static void AndroidInterfaceAdded(io_iterator_t iterator);
119 // Create an iterator for all I/O Registry objects that match the dictionary.
133 AndroidInterfaceAdded(io_iterator_t iterator) argument
151 while ((usbInterface = IOIteratorNext(iterator))) {
/system/core/include/sysutils/
H A DList.h100 // this will handle conversions from iterator to const_iterator
124 * handle comparisons between iterator and const_iterator
176 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef in class:android::sysutils::List
191 * _Node* we're returning is converted to an "iterator" by a
194 inline iterator begin() {
195 return iterator(mpMiddle->getNext());
200 inline iterator end() {
201 return iterator(mpMiddle);
211 /* insert before the current node; returns iterator at new node */
212 iterator inser
[all...]
/system/core/libsysutils/include/sysutils/
H A DList.h100 // this will handle conversions from iterator to const_iterator
124 * handle comparisons between iterator and const_iterator
176 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef in class:android::sysutils::List
191 * _Node* we're returning is converted to an "iterator" by a
194 inline iterator begin() {
195 return iterator(mpMiddle->getNext());
200 inline iterator end() {
201 return iterator(mpMiddle);
211 /* insert before the current node; returns iterator at new node */
212 iterator inser
[all...]
/system/keymaster/
H A DList.h99 // this will handle conversions from iterator to const_iterator
123 * handle comparisons between iterator and const_iterator
175 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef in class:android::List
190 * _Node* we're returning is converted to an "iterator" by a
193 inline iterator begin() {
194 return iterator(mpMiddle->getNext());
199 inline iterator end() {
200 return iterator(mpMiddle);
210 /* insert before the current node; returns iterator at new node */
211 iterator inser
[all...]
/system/core/logd/
H A DLogStatistics.h78 typedef typename std::unordered_map<TKey, TEntry>::iterator iterator; typedef in class:LogHashtable
120 inline iterator add(const TKey& key, const LogBufferElement* element) {
121 iterator it = map.find(key);
130 inline iterator add(TKey key) {
131 iterator it = map.find(key);
141 iterator it = map.find(std::move(key));
148 iterator it = map.find(key);
155 iterator it = map.find(key);
161 inline iterator begi
[all...]
/system/chre/external/flatbuffers/include/flatbuffers/
H A Dflatbuffers.h281 // An STL compatible iterator implementation for Vector below, effectively
285 : public std::iterator<std::random_access_iterator_tag, IT, uoffset_t> {
287 typedef std::iterator<std::random_access_iterator_tag, IT, uoffset_t> super_type;
376 iterator; typedef in class:flatbuffers::Vector
406 iterator begin() { return iterator(Data(), 0); }
409 iterator end() { return iterator(Data(), size()); }

Completed in 619 milliseconds