/libcore/luni/src/main/java/java/util/ |
Iterator.java | 21 * An iterator over a sequence of objects, such as a collection. 23 * <p>If a collection has been changed since the iterator was created, 29 * <p>Implementing {@link Iterable} and returning an {@code Iterator} allows your 33 * the type of object returned by the iterator. 35 public interface Iterator<E> { 43 * Returns the next object and advances the iterator.
|
/external/icu/icu4c/source/common/ |
bytestrieiterator.cpp | 23 BytesTrie::Iterator::Iterator(const void *trieBytes, int32_t maxStringLength, 35 // Unlike BytesTrie itself, its Iterator performs memory allocations anyway 45 BytesTrie::Iterator::Iterator(const BytesTrie &trie, int32_t maxStringLength, 76 BytesTrie::Iterator::~Iterator() { 81 BytesTrie::Iterator & 82 BytesTrie::Iterator::reset() { 97 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty(); [all...] |
ucharstrieiterator.cpp | 22 UCharsTrie::Iterator::Iterator(const UChar *trieUChars, int32_t maxStringLength, 35 // Unlike UCharsTrie itself, its Iterator performs memory allocations anyway 44 UCharsTrie::Iterator::Iterator(const UCharsTrie &trie, int32_t maxStringLength, 75 UCharsTrie::Iterator::~Iterator() { 79 UCharsTrie::Iterator & 80 UCharsTrie::Iterator::reset() { 96 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty(); [all...] |
/external/sfntly/cpp/src/sfntly/port/ |
java_iterator.h | 22 // Interface of Java iterator. 23 // This is a forward read-only iterator that represents java.util.Iterator<E> 28 class Iterator : public virtual RefCount { 30 virtual ~Iterator() {} 34 Iterator() {} 35 NO_COPY_AND_ASSIGN(Iterator); 40 class PODIterator : public Iterator<ReturnType, ContainerBase>, 67 class RefIterator : public Iterator<ReturnType, ContainerBase>,
|
/frameworks/av/include/drm/ |
DrmInfo.h | 52 * Iterator for key 76 * Iterator 78 class Iterator { 82 Iterator(const DrmInfo* drmInfo) 86 Iterator(const Iterator& iterator); 87 Iterator& operator=(const Iterator& iterator); [all...] |
DrmMetadata.h | 33 * Iterator for key 55 * Iterator for constraints 57 class Iterator { 60 Iterator(DrmMetadata* drmMetadata) : mDrmMetadata(drmMetadata), mIndex(0) {} 63 Iterator(const Iterator& iterator); 64 Iterator& operator=(const Iterator& iterator); [all...] |
DrmConstraints.h | 68 * Iterator for key 91 * Iterator for constraints 93 class Iterator { 96 Iterator(DrmConstraints* drmConstraints) 100 Iterator(const Iterator& iterator); 101 Iterator& operator=(const Iterator& iterator); [all...] |
DrmInfoRequest.h | 66 * Iterator for key 90 * Iterator 92 class Iterator { 96 Iterator(const DrmInfoRequest* drmInfoRequest) 100 Iterator(const Iterator& iterator); 101 Iterator& operator=(const Iterator& iterator); [all...] |
/external/v8/src/compiler/ |
generic-algorithm-inl.h | 23 typedef typename N::Inputs::iterator Iterator; 25 static Iterator begin(Node* node) { return node->inputs().begin(); } 26 static Iterator end(Node* node) { return node->inputs().end(); } 28 static Node* to(Iterator iterator) { return *iterator; } 29 static Node* from(Iterator iterator) { return iterator.edge().from(); [all...] |
generic-algorithm.h | 44 typedef typename Traits::Iterator Iterator; 45 typedef std::pair<Iterator, Iterator> NodeState; 61 Iterator begin(visit ? Traits::begin(current) : Traits::end(current)); 62 Iterator end(Traits::end(current));
|
/frameworks/av/drm/common/ |
DrmConstraints.cpp | 88 DrmConstraints::Iterator DrmConstraints::iterator() { function in class:DrmConstraints 89 return Iterator(this); 92 DrmConstraints::Iterator::Iterator(const DrmConstraints::Iterator& iterator) : 93 mDrmConstraints(iterator.mDrmConstraints), 94 mIndex(iterator.mIndex) { 97 DrmConstraints::Iterator& DrmConstraints::Iterator::operator= [all...] |
DrmInfoRequest.cpp | 57 DrmInfoRequest::Iterator DrmInfoRequest::iterator() const { function in class:DrmInfoRequest 58 return Iterator(this); 85 // Iterator implementation 86 DrmInfoRequest::Iterator::Iterator(const DrmInfoRequest::Iterator& iterator) : 87 mDrmInfoRequest(iterator.mDrmInfoRequest), mIndex(iterator.mIndex) [all...] |
DrmMetadata.cpp | 92 DrmMetadata::Iterator DrmMetadata::iterator() { function in class:DrmMetadata 93 return Iterator(this); 96 DrmMetadata::Iterator::Iterator(const DrmMetadata::Iterator& iterator) : 97 mDrmMetadata(iterator.mDrmMetadata), 98 mIndex(iterator.mIndex) { 99 ALOGV("DrmMetadata::Iterator::Iterator") [all...] |
DrmInfo.cpp | 64 DrmInfo::Iterator DrmInfo::iterator() const { function in class:DrmInfo 65 return Iterator(this); 90 // Iterator implementation 91 DrmInfo::Iterator::Iterator(const DrmInfo::Iterator& iterator) 92 : mDrmInfo(iterator.mDrmInfo), mIndex(iterator.mIndex) [all...] |
/external/clang/include/clang/AST/ |
AttrIterator.h | 18 #include <iterator> 49 typedef typename Container::const_iterator Iterator; 51 /// Current - The current, underlying iterator. 52 /// In order to ensure we don't dereference an invalid iterator unless 55 /// operation is acting on what should be a past-the-end iterator, 57 /// past-the-end iterator when we move to a past-the-end position. 58 mutable Iterator Current; 65 void AdvanceToNext(Iterator I) const { 78 explicit specific_attr_iterator(Iterator i) : Current(i) { }
|
/external/clang/test/SemaCXX/ |
warn-range-loop-analysis.cpp | 5 struct Iterator { 7 Iterator operator++(); 8 bool operator!=(const Iterator); 13 typedef Iterator<T> I;
|
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_list.h | 29 friend class Iterator; 134 typedef IteratorBase<IntrusiveList<Item>, Item> Iterator;
|
/external/google-breakpad/src/common/ |
simple_string_dictionary.h | 76 // An Iterator can be used to iterate over all the active entries in a 78 class Iterator { 80 explicit Iterator(const NonAllocatingMap& map) 101 DISALLOW_COPY_AND_ASSIGN(Iterator);
|
/frameworks/av/media/libstagefright/include/ |
ID3.h | 48 struct Iterator { 49 Iterator(const ID3 &parent, const char *id); 50 ~Iterator(); 71 Iterator(const Iterator &); 72 Iterator &operator=(const Iterator &);
|
/external/v8/src/ |
data-flow.h | 20 // Iterator for the elements of this BitVector. 21 class Iterator BASE_EMBEDDED { 23 explicit Iterator(BitVector* target) 31 ~Iterator() { } 195 class Iterator BASE_EMBEDDED { 197 Iterator(const GrowableBitVector* target, Zone* zone) 205 BitVector::Iterator it_; 223 for (Iterator it(&other, zone); !it.Done(); it.Advance()) {
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
MultidimensionalCounter.java | 70 public class Iterator implements java.util.Iterator<Integer> { 81 * Create an iterator 82 * @see #iterator() 84 Iterator() { 139 * of the iterator. 190 * Create an iterator over this counter. 192 * @return the iterator. 194 public Iterator iterator() { method in class:MultidimensionalCounter [all...] |
/external/llvm/include/llvm/ADT/ |
MapVector.h | 39 typedef typename VectorType::iterator iterator; typedef in class:llvm::MapVector 46 iterator begin() { return Vector.begin(); } 48 iterator end() { return Vector.end(); } 77 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 91 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { 93 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 108 iterator find(const KeyT &Key) { 122 typename MapType::iterator Pos = Map.find(Vector.back().first); 127 /// \brief Remove the element given by Iterator [all...] |
/external/skia/src/gpu/ |
GrVertices.h | 132 class Iterator {
|
/ndk/sources/host-tools/gdb-pretty-printers/stlport/gppfs-0.2/stlport/ |
printers.py | 152 class Iterator: 207 return self.Iterator (start['_M_node'], start['_M_cur'], 217 class Iterator: 247 return self.Iterator (node_type, self.val['_M_node']['_M_data']) 267 class Iterator: 299 return self.Iterator (RbtreeIterator (self.val), node_type) 313 class Iterator: 337 return self.Iterator (RbtreeIterator (self.val), node_type) 351 class Iterator: 376 return self.Iterator (node_type, self.val['_M_head']['_M_data'] [all...] |
/prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/stlport/stlport/ |
printers.py | 151 class Iterator: 206 return self.Iterator (start['_M_node'], start['_M_cur'], 216 class Iterator: 246 return self.Iterator (node_type, self.val['_M_node']['_M_data']) 266 class Iterator: 298 return self.Iterator (RbtreeIterator (self.val), node_type) 312 class Iterator: 336 return self.Iterator (RbtreeIterator (self.val), node_type) 350 class Iterator: 375 return self.Iterator (node_type, self.val['_M_head']['_M_data'] [all...] |