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

1234

/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 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...]
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(); }
/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/include/utils/
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/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/core/libutils/include/utils/
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/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/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/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/logd/
H A DLogBuffer.h86 LogBufferElementCollection::iterator mLast[LOG_ID_MAX];
89 typedef std::unordered_map<uid_t, LogBufferElementCollection::iterator>
93 typedef std::unordered_map<pid_t, LogBufferElementCollection::iterator>
191 LogBufferElementCollection::iterator erase(
192 LogBufferElementCollection::iterator it, bool coalesce = false);
/system/chre/util/tests/
H A Darray_queue_test.cc200 ArrayQueue<int, 4>::iterator it = q.begin();
212 for (ArrayQueue<int, 4>::iterator it = q.begin(); it != q.end(); ++it) {
217 ArrayQueue<int, 4>::iterator it = q.begin();
240 ArrayQueue<int, 4>::iterator it_b = q.begin();
241 ArrayQueue<int, 4>::iterator it_e = q.end();
256 ArrayQueue<int, 4>::iterator it_b = q.begin();
271 ArrayQueue<int, 4>::iterator it_b = q.begin();
283 ArrayQueue<int, 4>::iterator it_b = q.begin();
284 ArrayQueue<int, 4>::iterator it_e = q.end();
H A Dfixed_size_vector_test.cc184 for (FixedSizeVector<int, 8>::iterator it = vector.begin();
189 FixedSizeVector<int, 8>::iterator it = vector.begin() + vector.size() - 1;
222 FixedSizeVector<int, 8>::iterator it_b = vector.begin();
223 FixedSizeVector<int, 8>::iterator it_e = vector.end();
239 FixedSizeVector<int, 8>::iterator it_b = vector.begin();
240 FixedSizeVector<int, 8>::iterator it_e = vector.end();
256 FixedSizeVector<int, 8>::iterator it_b = vector.begin();
273 FixedSizeVector<int, 8>::iterator it_b = vector.begin();
294 FixedSizeVector<int, 8>::iterator it_b = vector.begin();
/system/netd/server/
H A DPppController.cpp43 TtyCollection::iterator it;
62 TtyCollection::iterator it;
131 TtyCollection::iterator it;
/system/bt/vendor_libs/test_vendor_lib/include/
H A Dl2cap_sdu.h20 #include <iterator>
76 // Get a vector iterator that points to the first byte of the
85 // Get a vector iterator that points to the last bytes of the
/system/update_engine/payload_generator/
H A Dgraph_utils.cc53 Vertex::EdgeMap::iterator edge_it = src->out_edges.find(dst);
56 pair<Vertex::EdgeMap::iterator, bool> result =
81 for (Vertex::EdgeMap::iterator it = edge_map->begin();
98 for (Graph::iterator it = graph->begin(), e = graph->end(); it != e; ++it) {
H A Dtarjan.cc40 for (Graph::iterator it = graph->begin(); it != graph->end(); ++it)
55 for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin();
/system/update_engine/update_manager/
H A Devaluation_context-inl.h34 ValueCacheMap::iterator it = value_cache_.find(var);
/system/security/keystore/include/keystore/
H A Dutils.h6 #include <iterator>
14 * This iterator abstracts from a collection of the form
17 * nulled entries. If shared_ptr(nullptr) is passed in, the iterator behaves
18 * like the end iterator yielding an empty collection. Nulled
19 * entries are skipped so that the iterator is always dereferencable unless
21 * The default constructor always yields an iterator equal to end.
22 * The same iterator invalidation rules apply as they do for the iterators
80 typename CollectionType::iterator cur_;

Completed in 1723 milliseconds

1234