| /external/flatbuffers/include/flatbuffers/ |
| flatbuffers.h | 86 // An STL compatible iterator implementation for Vector below, effectively
185 iterator; typedef in class:flatbuffers::Vector
227 iterator begin() { return iterator(Data(), 0); }
230 iterator end() { return iterator(Data(), size()); }
[all...] |
| /external/google-breakpad/src/testing/gtest/include/gtest/internal/ |
| gtest-internal.h | 1042 typedef Element* iterator; typedef in class:testing::internal::NativeArray
[all...] |
| /external/googletest/googletest/include/gtest/internal/ |
| gtest-internal.h | 1064 typedef Element* iterator; typedef in class:testing::internal::NativeArray
[all...] |
| gtest-param-util.h | 39 #include <iterator>
97 // Used only for the purposes of iterator comparison
100 // Advances iterator to point to the next element
102 // for not calling Advance() on an iterator equal to
105 // Clones the iterator object. Used for implementing copy semantics
108 // Dereferences the current iterator and provides (read-only) access
110 // Current() on an iterator equal to BaseGenerator()->End().
113 // Determines whether the given iterator and other point to the same
121 // and implements the const forward iterator concept.
185 typedef ParamIterator<T> iterator; typedef in class:testing::internal::ParamGenerator
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractMapBasedMultimap.java | 33 import java.util.Iterator;
228 Iterator<? extends V> iterator = values.iterator(); local
229 if (!iterator.hasNext()) {
241 while (iterator.hasNext()) {
242 if (collection.add(iterator.next())) {
448 @Override public Iterator<V> iterator() { method in class:AbstractMapBasedMultimap.WrappedCollection
453 /** Collection iterator for {@code WrappedCollection}. *
924 @Override public Iterator<K> iterator() { method in class:AbstractMapBasedMultimap.KeySet
965 Iterators.clear(iterator()); method
[all...] |
| MinMaxPriorityQueue.java | 36 import java.util.Iterator;
378 * used by iterator.remove so as to visit elements during a traversal once and
434 // Returned from removeAt() to iterator.remove()
515 // placed in removeIndex position. We must return that to the iterator so
748 private class QueueIterator implements Iterator<E> {
778 "iterator moved past last element in queue.");
845 * Returns an iterator over the elements contained in this collection,
848 * <p>The iterator is <i>fail-fast</i>: If the MinMaxPriorityQueue is modified
849 * at any time after the iterator is created, in any way except through the
850 * iterator's own remove method, the iterator will generally throw
866 @Override public Iterator<E> iterator() { method in class:MinMaxPriorityQueue
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| AbstractMapBasedMultimap.java | 32 import java.util.Iterator;
225 Iterator<? extends V> iterator = values.iterator(); local
226 if (!iterator.hasNext()) {
238 while (iterator.hasNext()) {
239 if (collection.add(iterator.next())) {
445 @Override public Iterator<V> iterator() { method in class:AbstractMapBasedMultimap.WrappedCollection
450 /** Collection iterator for {@code WrappedCollection}. *
846 @Override public Iterator<K> iterator() { method in class:AbstractMapBasedMultimap.KeySet
887 Iterators.clear(iterator()); method
[all...] |
| /external/guice/core/src/com/google/inject/spi/ |
| InjectionPoint.java | 45 import java.util.Iterator;
109 Iterator<Annotation[]> annotationsIterator = Arrays.asList(paramterAnnotations).iterator();
600 for (Iterator<InjectableMethod> iterator = methods.iterator();
601 iterator.hasNext();) {
602 InjectableMethod possiblyOverridden = iterator.next();
614 iterator.remove();
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| Trie2.java | 18 import java.util.Iterator;
296 Iterator<Trie2.Range> otherIter = OtherTrie.iterator();
336 * The iterator will return one item for each contiguous range of codepoints having the same value.
374 * Create an iterator over the value ranges in this Trie2.
378 * @return an Iterator
381 public Iterator<Range> iterator() { method in class:Trie2
382 return iterator(defaultValueMapper);
393 * Create an iterator over the value ranges from this Trie2
402 public Iterator<Range> iterator(ValueMapper mapper) { method in class:Trie2
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| AlphabeticIndex.java | 15 import java.util.Iterator;
107 * <li>AlphabeticIndex.getBucketLabels() or the bucket iterator on either class
218 public Iterator<Bucket<V>> iterator() { method in class:AlphabeticIndex.ImmutableIndex
219 return buckets.iterator();
475 for (Iterator<String> it = indexCharacters.iterator(); it.hasNext();) {
724 * Return an iterator over the buckets.
726 * @return iterator over buckets.
729 public Iterator<Bucket<V>> iterator() method in class:AlphabeticIndex
941 public Iterator<Record<V>> iterator() { method in class:AlphabeticIndex.Bucket
1152 public Iterator<Bucket<V>> iterator() { method in class:AlphabeticIndex.BucketList
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| AlphabeticIndex.java | 14 import java.util.Iterator;
106 * <li>AlphabeticIndex.getBucketLabels() or the bucket iterator on either class
223 public Iterator<Bucket<V>> iterator() { method in class:AlphabeticIndex.ImmutableIndex
224 return buckets.iterator();
494 for (Iterator<String> it = indexCharacters.iterator(); it.hasNext();) {
751 * Return an iterator over the buckets.
753 * @return iterator over buckets.
757 public Iterator<Bucket<V>> iterator() method in class:AlphabeticIndex
986 public Iterator<Record<V>> iterator() { method in class:AlphabeticIndex.Bucket
1198 public Iterator<Bucket<V>> iterator() { method in class:AlphabeticIndex.BucketList
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| Trie2.java | 17 import java.util.Iterator;
294 Iterator<Trie2.Range> otherIter = OtherTrie.iterator();
334 * The iterator will return one item for each contiguous range of codepoints having the same value.
372 * Create an iterator over the value ranges in this Trie2.
376 * @return an Iterator
379 public Iterator<Range> iterator() { method in class:Trie2
380 return iterator(defaultValueMapper);
391 * Create an iterator over the value ranges from this Trie2
400 public Iterator<Range> iterator(ValueMapper mapper) { method in class:Trie2
[all...] |
| /external/javassist/src/main/javassist/ |
| CtField.java | 85 java.util.ListIterator iterator local
90 while (iterator.hasNext()) {
91 AttributeInfo ainfo = (AttributeInfo)iterator.next();
[all...] |
| /external/jsoncpp/include/json/ |
| value.h | 124 typedef ValueIterator iterator; typedef in class:Json::Value
432 iterator begin();
433 iterator end();
728 static void increment(IteratorState& iterator);
729 static void incrementBucket(IteratorState& iterator);
730 static void decrement(IteratorState& iterator);
731 static const char* key(const IteratorState& iterator);
732 static const char* key(const IteratorState& iterator, bool& isStatic);
733 static Value& value(const IteratorState& iterator);
797 static void increment(IteratorState& iterator);
[all...] |
| /external/libvpx/libvpx/third_party/googletest/src/include/gtest/internal/ |
| gtest-internal.h | 1038 typedef Element* iterator; typedef in class:testing::internal::NativeArray
[all...] |
| gtest-param-util.h | 39 #include <iterator>
97 // Used only for the purposes of iterator comparison
100 // Advances iterator to point to the next element
102 // for not calling Advance() on an iterator equal to
105 // Clones the iterator object. Used for implementing copy semantics
108 // Dereferences the current iterator and provides (read-only) access
110 // Current() on an iterator equal to BaseGenerator()->End().
113 // Determines whether the given iterator and other point to the same
121 // and implements the const forward iterator concept.
185 typedef ParamIterator<T> iterator; typedef in class:testing::internal::ParamGenerator
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DenseMap.h | 29 #include <iterator>
61 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT> iterator; typedef in class:llvm::DenseMapBase
64 inline iterator begin() {
66 return empty() ? end() : iterator(getBuckets(), getBucketsEnd(), *this);
68 inline iterator end() {
69 return iterator(getBucketsEnd(), getBucketsEnd(), *this, true);
126 iterator find(const KeyT &Val) {
129 return iterator(TheBucket, getBucketsEnd(), *this, true);
145 iterator find_as(const LookupKeyT &Val) {
148 return iterator(TheBucket, getBucketsEnd(), *this, true)
[all...] |
| ImmutableSet.h | 50 typedef ImutAVLTreeInOrderIterator<ImutInfo> iterator; typedef in class:llvm::ImutAVLTree
107 /// begin - Returns an iterator that iterates over the nodes of the tree
108 /// in an inorder traversal. The returned iterator thus refers to the
110 iterator begin() const { return iterator(this); }
112 /// end - Returns an iterator for the tree that denotes the end of an
114 iterator end() const { return iterator(); }
141 iterator LItr = begin(), LEnd = end();
142 iterator RItr = RHS.begin(), REnd = RHS.end()
1082 typedef ImutAVLValueIterator<ImmutableSet> iterator; typedef in class:llvm::ImmutableSet
1192 typedef ImutAVLValueIterator<ImmutableSetRef> iterator; typedef in class:llvm::ImmutableSetRef
[all...] |
| ilist.h | 45 #include <iterator>
189 // Iterator for intrusive list.
193 : public std::iterator<std::bidirectional_iterator_tag, NodeTy, ptrdiff_t> {
196 typedef std::iterator<std::bidirectional_iterator_tag, NodeTy, ptrdiff_t>
212 // This is templated so that we can allow constructing a const iterator from
213 // a nonconst iterator...
218 // This is templated so that we can allow assigning to a const iterator from
219 // a nonconst iterator...
296 /// pointer is null. When in this form, any query for an iterator (e.g.
298 /// 2. The list may be empty, but contain a sentinel for the end iterator. Thi
341 typedef ilist_iterator<NodeTy> iterator; typedef in class:llvm::iplist
668 typedef typename iplist<NodeTy>::iterator iterator; typedef in struct:llvm::ilist
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 100 typedef std::vector<BranchProbability>::iterator probability_iterator;
162 typedef Instructions::iterator instr_iterator;
168 typedef MachineInstrBundleIterator<MachineInstr> iterator; typedef in class:llvm::MachineBasicBlock
171 typedef std::reverse_iterator<iterator> reverse_iterator;
203 iterator begin() { return instr_begin(); }
205 iterator end () { return instr_end(); }
217 inline iterator_range<iterator> terminators() {
225 typedef std::vector<MachineBasicBlock *>::iterator pred_iterator;
227 typedef std::vector<MachineBasicBlock *>::iterator succ_iterator;
392 /// Set successor probability of a given iterator
[all...] |
| ScheduleDAG.h | 261 typedef SmallVectorImpl<SDep>::iterator pred_iterator;
262 typedef SmallVectorImpl<SDep>::iterator succ_iterator;
637 class SUnitIterator : public std::iterator<std::forward_iterator_tag,
694 typedef std::vector<SUnit>::iterator nodes_iterator;
755 typedef std::vector<int>::iterator iterator; typedef in class:llvm::SUnit::ScheduleDAGTopologicalSort
757 iterator begin() { return Index2Node.begin(); }
759 iterator end() { return Index2Node.end(); }
|
| /external/llvm/include/llvm/IR/ |
| Module.h | 87 /// The Global Variable iterator.
88 typedef GlobalListType::iterator global_iterator;
89 /// The Global Variable constant iterator.
93 typedef FunctionListType::iterator iterator; typedef in class:llvm::Module
94 /// The Function constant iterator
97 /// The Function reverse iterator.
99 /// The Function constant reverse iterator.
103 typedef AliasListType::iterator alias_iterator;
104 /// The Global Alias constant iterator
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCDwarf.h | 168 typedef MCDwarfLineEntryCollection::iterator iterator; typedef in class:llvm::MCLineSection
|
| /external/llvm/include/llvm/Support/ |
| TargetRegistry.h | 543 class iterator class in struct:llvm::TargetRegistry
544 : public std::iterator<std::forward_iterator_tag, Target, ptrdiff_t> {
546 explicit iterator(Target *T) : Current(T) {} function in class:llvm::TargetRegistry::iterator
550 iterator() : Current(nullptr) {} function in class:llvm::TargetRegistry::iterator
552 bool operator==(const iterator &x) const { return Current == x.Current; }
553 bool operator!=(const iterator &x) const { return !operator==(x); }
555 // Iterator traversal: forward iteration only
556 iterator &operator++() { // Preincrement
557 assert(Current && "Cannot increment end iterator!");
561 iterator operator++(int) { // Postincremen
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineBlockPlacement.cpp | 175 /// \brief Iterator over blocks within the chain.
176 typedef SmallVectorImpl<MachineBasicBlock *>::iterator iterator; typedef in class:__anon27267::BlockChain
179 iterator begin() { return Blocks.begin(); }
182 iterator end() { return Blocks.end(); }
310 MachineFunction::iterator &PrevUnplacedBlockIt,
[all...] |
