| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binary_heap_/ |
| binary_heap_.hpp | 133 typedef const_iterator iterator; typedef in class:__gnu_pbds::detail::binary_heap
187 inline iterator
193 inline iterator
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/list_update_map_/ |
| lu_map_.hpp | 42 #include <iterator>
127 #include <ext/pb_ds/detail/unordered_iterator/iterator.hpp>
172 typedef iterator_ iterator; typedef in class:__gnu_pbds::detail::PB_DS_LU_NAME
176 typedef const_iterator_ iterator; typedef in class:__gnu_pbds::detail::PB_DS_LU_NAME
245 inline iterator
251 inline iterator
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| base.h | 301 * If features the usual random-access iterator functionality.
365 typedef _PseudoSequenceIterator<_Tp, uint64_t> iterator; typedef in class:__gnu_parallel::_PseudoSequence
374 /** @brief Begin iterator. */
375 iterator
377 { return iterator(_M_val, 0); }
379 /** @brief End iterator. */
380 iterator
382 { return iterator(_M_val, _M_count); }
391 * @param __a First iterator.
392 * @param __b Second iterator
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/ |
| map.h | 56 typedef typename _Base::iterator iterator; typedef in class:__profile::map
62 typedef std::reverse_iterator<iterator> reverse_iterator;
139 iterator
147 iterator
246 std::pair<iterator, bool>
251 return std::pair<iterator, bool>(iterator(__res.first),
256 iterator
268 std::pair<iterator, bool
[all...] |
| multimap.h | 56 typedef typename _Base::iterator iterator; typedef in class:__profile::multimap
132 iterator
134 { return iterator(_Base::begin()); }
140 iterator
142 { return iterator(_Base::end()); }
190 iterator
193 return iterator(_Base::emplace(std::forward<_Args>(__args)...));
197 iterator
200 return iterator(_Base::emplace_hint(__pos
[all...] |
| multiset.h | 56 typedef typename _Base::iterator iterator; typedef in class:__profile::multiset
132 iterator
134 { return iterator(_Base::begin()); }
140 iterator
142 { return iterator(_Base::end()); }
190 iterator
192 { return iterator(_Base::emplace(std::forward<_Args>(__args)...)); }
195 iterator
198 return iterator(_Base::emplace_hint(__pos
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/support/ |
| nasty_containers.hpp | 27 typedef typename nested_container::iterator iterator; typedef in class:nasty_vector
54 iterator begin() TEST_NOEXCEPT { return v_.begin(); }
56 iterator end() TEST_NOEXCEPT { return v_.end(); }
98 template <class... Args> iterator emplace(const_iterator pos, Args&&... args)
102 iterator insert(const_iterator pos, const value_type& x) { return v_.insert(pos, x); }
104 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); }
106 iterator insert(const_iterator pos, size_type n, const value_type& x) { return v_.insert(pos, n, x); }
108 iterator insert(const_iterator pos, InputIterator first, InputIterator last)
112 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return v_.insert(pos, il);
149 typedef typename nested_container::iterator iterator; typedef in class:nasty_list
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/libshaderc_util/include/libshaderc_util/ |
| string_piece.h | 32 typedef const char* iterator; typedef in class:shaderc_util::string_piece
194 iterator begin = begin_;
203 iterator end = end_;
236 // Returns an iterator to the first element.
237 iterator begin() const { return begin_; }
239 // Returns an iterator to one past the last element.
240 iterator end() const { return end_; }
319 string_piece::iterator begin_ = nullptr;
320 string_piece::iterator end_ = nullptr;
|
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/ |
| reflection.h | 67 typedef typename internal::RefTypeTraits<T>::iterator IteratorType;
81 typedef IteratorType iterator; typedef in class:google::protobuf::RepeatedFieldRef
83 iterator begin() const {
84 return iterator(data_, accessor_, true);
86 iterator end() const {
87 return iterator(data_, accessor_, false);
145 typedef typename Container::const_iterator Iterator;
146 for (Iterator it = container.begin(); it != container.end(); ++it) {
175 typedef typename internal::RefTypeTraits<T>::iterator IteratorType;
203 typedef IteratorType iterator; typedef in class:google::protobuf::RepeatedFieldRef
526 typedef RepeatedFieldRefIterator<T> iterator; typedef in struct:google::protobuf::internal::RefTypeTraits
541 typedef RepeatedFieldRefIterator<T> iterator; typedef in struct:google::protobuf::internal::RefTypeTraits
557 typedef RepeatedFieldRefIterator<T> iterator; typedef in struct:google::protobuf::internal::RefTypeTraits
585 typedef RepeatedFieldRefIterator<T> iterator; typedef in struct:google::protobuf::internal::RefTypeTraits
[all...] |
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/stubs/ |
| stringpiece.h | 356 typedef const char* iterator; typedef in class:google::protobuf::StringPiece
358 typedef std::reverse_iterator<iterator> reverse_iterator;
359 iterator begin() const { return ptr_; }
360 iterator end() const { return ptr_ + length_; }
|
| /system/core/fastboot/ |
| usb_osx.cpp | 88 io_iterator_t iterator; local
101 // Get an iterator for the interfaces on the device
102 kr = (*dev)->CreateInterfaceIterator(dev, &request, &iterator);
105 ERR("Couldn't create a device interface iterator: (%08x)\n", kr);
109 while ((usbInterface = IOIteratorNext(iterator))) {
391 io_iterator_t iterator; local
410 kIOMasterPortDefault, matchingDict, &iterator);
413 ERR("Could not create iterator.");
418 if (! IOIteratorIsValid(iterator)) {
420 * Apple documentation advises resetting the iterator i
[all...] |
| /system/core/libbacktrace/include/backtrace/ |
| Backtrace.h | 193 typedef std::vector<backtrace_frame_data_t>::iterator iterator; typedef in class:Backtrace
194 iterator begin() { return frames_.begin(); }
195 iterator end() { return frames_.end(); }
|
| BacktraceMap.h | 33 #include <iterator>
71 class iterator : public std::iterator<std::bidirectional_iterator_tag, backtrace_map_t*> { class in class:BacktraceMap
73 iterator(BacktraceMap* map, size_t index) : map_(map), index_(index) {} function in class:BacktraceMap::iterator
75 iterator& operator++() {
79 iterator& operator++(int increment) {
83 iterator& operator--() {
87 iterator& operator--(int decrement) {
92 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
93 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_;
[all...] |
| /system/core/libsysutils/include/sysutils/ |
| List.h | 69 * Iterator for walking through the list.
100 // this will handle conversions from iterator to const_iterator
115 * Iterator comparison.
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);
[all...] |
| /system/core/libutils/include/utils/ |
| List.h | 70 * Iterator for walking through the list.
101 // this will handle conversions from iterator to const_iterator
116 * Iterator comparison.
125 * handle comparisons between iterator and const_iterator
177 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef in class:android::List
192 * _Node* we're returning is converted to an "iterator" by a
195 inline iterator begin() {
196 return iterator(mpMiddle->getNext());
201 inline iterator end() {
202 return iterator(mpMiddle);
[all...] |
| SortedVector.h | 130 typedef TYPE* iterator; typedef in class:android::SortedVector
133 inline iterator begin() { return editArray(); }
134 inline iterator end() { return editArray() + size(); }
139 inline iterator erase(iterator pos) {
|
| Vector.h | 199 typedef TYPE* iterator; typedef in class:android::Vector
202 inline iterator begin() { return editArray(); }
203 inline iterator end() { return editArray() + size(); }
210 inline iterator erase(iterator pos) {
|
| /system/keymaster/include/keymaster/ |
| List.h | 68 * Iterator for walking through the list.
99 // this will handle conversions from iterator to const_iterator
114 * Iterator comparison.
123 * handle comparisons between iterator and const_iterator
175 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef in class:keymaster::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);
[all...] |
| /toolchain/binutils/binutils-2.27/gold/ |
| token.h | 313 typedef Task_token** iterator; typedef in class:gold::Task_locker
315 iterator
319 iterator
|
| /tools/metalava/src/main/java/com/android/tools/metalava/apilevels/ |
| ApiClass.java | 25 import java.util.Iterator;
116 for (Iterator<ApiElement> iterator = mInterfaces.iterator(); iterator.hasNext(); ) {
117 ApiElement interfaceElement = iterator.next();
123 iterator.remove();
162 for (Iterator<Map.Entry<String, ApiElement>> it = mMethods.entrySet().iterator(); it.hasNext(); ) {
|
| /tools/tradefederation/core/src/com/android/tradefed/util/ |
| ConditionPriorityBlockingQueue.java | 21 import java.util.Iterator;
34 * Iteration is also thread-safe, but not consistent. A copy of the queue is made at iterator
36 * iteration, a {@link ConcurrentModificationException} will not be thrown, but the iterator
320 public Iterator<T> iterator() { method in class:ConditionPriorityBlockingQueue
321 return getCopy().iterator();
|
| /external/guava/guava-gwt/src-super/com/google/common/cache/super/com/google/common/cache/ |
| LocalCache.java | 33 import java.util.Iterator;
540 class EntryIterator implements Iterator<Entry<K, V>> {
541 Iterator<Entry<K, Timestamped<V>>> iterator; field in class:LocalCache.EntryIterator
546 this.iterator = LocalCache.this.cachingHashMap.entrySet().iterator();
567 while (iterator.hasNext()) {
568 Entry<K, Timestamped<V>> next = iterator.next();
590 final class KeyIterator implements Iterator<K> {
591 private EntryIterator iterator; field in class:LocalCache.KeyIterator
617 private EntryIterator iterator; field in class:LocalCache.ValueIterator
755 public Iterator<K> iterator() { method in class:LocalCache.KeySet
780 public Iterator<V> iterator() { method in class:LocalCache.Values
800 public Iterator<Entry<K, V>> iterator() { method in class:LocalCache.EntrySet
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| MapConstraintsTest.java | 34 import java.util.Iterator;
255 Iterator<Collection<Integer>> iterator = local
256 constrained.asMap().values().iterator();
257 iterator.next();
258 iterator.next().add(12);
269 = multimap.asMap().entrySet().iterator().next();
282 = multimap.asMap().entrySet().iterator().next();
295 = multimap.asMap().entrySet().iterator().next();
308 = multimap.asMap().entrySet().iterator().next()
639 @Override public Iterator<Entry<K, V>> iterator() { method
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MapConstraintsTest.java | 36 import java.util.Iterator;
257 Iterator<Collection<Integer>> iterator = local
258 constrained.asMap().values().iterator();
259 iterator.next();
260 iterator.next().add(12);
271 = multimap.asMap().entrySet().iterator().next();
284 = multimap.asMap().entrySet().iterator().next();
297 = multimap.asMap().entrySet().iterator().next();
310 = multimap.asMap().entrySet().iterator().next()
641 @Override public Iterator<Entry<K, V>> iterator() { method
[all...] |
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowApplication.java | 27 import java.util.Iterator;
380 Iterator<Wrapper> iterator = registeredReceivers.iterator(); local
381 while (iterator.hasNext()) {
382 Wrapper wrapper = iterator.next();
384 iterator.remove();
416 Iterator<String> actions = registeredReceiver.intentFilter.actionsIterator();
|
