/external/guava/guava-gwt/src-super/com/google/common/base/super/com/google/common/base/ |
H A D | Splitter.java | 139 @Override public SplittingIterator iterator( 167 @Override public SplittingIterator iterator( 208 @Override public SplittingIterator iterator( 250 * The limit defines the maximum number of items returned by the iterator. 316 @Override public Iterator<String> iterator() { 323 return strategy.iterator(this, sequence); 405 Iterator<String> iterator(Splitter splitter, CharSequence toSplit); method in interface:Splitter.Strategy
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | AbstractMapBasedMultiset.java | 90 backingMap.entrySet().iterator(); 153 @Override public Iterator<E> iterator() { method in class:AbstractMapBasedMultiset 169 this.entryIterator = backingMap.entrySet().iterator(); 337 @Override public Iterator<E> iterator() { method in class:AbstractMapBasedMultiset.MapBasedElementSet 339 = map.entrySet().iterator(); 370 return Iterators.removeAll(iterator(), elementsToRemove); 374 return Iterators.retainAll(iterator(), elementsToRetain); 381 Iterator<E> i = iterator();
|
H A D | EmptyContiguousSet.java | 77 @Override public UnmodifiableIterator<C> iterator() { method in class:EmptyContiguousSet
|
H A D | ImmutableCollection.java | 43 public abstract UnmodifiableIterator<E> iterator(); method in class:ImmutableCollection 128 return ImmutableList.of(iterator().next());
|
H A D | LinkedHashMultimap.java | 216 @Override public Iterator<V> iterator() { method in class:LinkedHashMultimap.SetDecorator 217 final Iterator<V> delegateIterator = delegate.iterator(); 243 * by entries().iterator().remove() 264 Iterator<V> iterator = delegate.iterator(); 265 while (iterator.hasNext()) { 266 V value = iterator.next(); 268 iterator.remove(); 280 * <p>Generates an iterator across map entries that follows the ordering in 283 * @return a key-value iterator wit [all...] |
H A D | RegularContiguousSet.java | 66 @Override public UnmodifiableIterator<C> iterator() { method in class:RegularContiguousSet
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | UnmodifiableCollectionTests.java | 61 public static void assertIteratorIsUnmodifiable(Iterator<?> iterator) { argument 62 while (iterator.hasNext()) { 63 iterator.next(); 65 iterator.remove(); 66 fail("Remove on unmodifiable iterator succeeded"); 142 assertIteratorIsUnmodifiable(collection.iterator()); 297 multimap.asMap().entrySet().iterator().next().getValue(); 324 K key = multimap.keySet().iterator().next(); 388 K presentKey = multimap.keySet().iterator().next(); 397 multimap.asMap().values().iterator() [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | PeekingIteratorTest.java | 46 * Version of {@link IteratorTester} that compares an iterator over 47 * a given collection of elements (used as the reference iterator) 48 * against a {@code PeekingIterator} that *wraps* such an iterator 49 * (used as the target iterator). 53 * same elements as the reference's iterator {@code #remove()}. 67 Iterator<T> iterator = targetList.iterator(); 68 return Iterators.peekingIterator(iterator); 84 Iterator<T> iterator = Collections.unmodifiableList(list).iterator(); 193 Iterator<E> iterator; field in class:PeekingIteratorTest.ThrowsAtEndIterator 242 assertNextThrows(Iterator<?> iterator) argument [all...] |
/external/javassist/src/main/javassist/convert/ |
H A D | TransformBefore.java | 51 protected int match(int c, int pos, CodeIterator iterator, argument 66 return match2(pos, iterator); 69 protected int match2(int pos, CodeIterator iterator) throws BadBytecode { argument 70 iterator.move(pos); 71 iterator.insert(saveCode); 72 iterator.insert(loadCode); 73 int p = iterator.insertGap(3); 74 iterator.writeByte(INVOKESTATIC, p); 75 iterator.write16bit(newIndex, p + 1); 76 iterator [all...] |
/external/javassist/src/main/javassist/expr/ |
H A D | ExprEditor.java | 85 CodeIterator iterator = codeAttr.iterator(); 89 while (iterator.hasNext()) 90 if (loopBody(iterator, clazz, minfo, context)) 96 Handler h = new Handler(et, i, iterator, clazz, minfo); 126 CodeIterator iterator, int endPos) 130 while (iterator.hasNext() && iterator.lookAhead() < endPos) { 131 int size = iterator.getCodeLength(); 132 if (loopBody(iterator, claz 125 doit(CtClass clazz, MethodInfo minfo, LoopContext context, CodeIterator iterator, int endPos) argument 175 loopBody(CodeIterator iterator, CtClass clazz, MethodInfo minfo, LoopContext context) argument [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/light/ |
H A D | LightList.java | 264 * Returns an iterator that can be used to iterate over this LightList. 266 * @return an iterator that can be used to iterate over this LightList. 268 public Iterator<Light> iterator() { method in class:LightList
|
/external/jmonkeyengine/engine/src/core/com/jme3/util/ |
H A D | IntMap.java | 200 public Iterator<Entry<T>> iterator() { method in class:IntMap
|
/external/jsilver/src/com/google/clearsilver/jsilver/data/ |
H A D | UnmodifiableData.java | 67 UnmodifiableIterator(Iterator<? extends Data> iterator) { argument 68 super(iterator); 81 return new UnmodifiableIterator(getDelegate().getChildren().iterator());
|
/external/llvm/include/llvm/ADT/ |
H A D | ArrayRef.h | 33 typedef const T *iterator; typedef in class:llvm::ArrayRef 37 typedef std::reverse_iterator<iterator> reverse_iterator; 90 iterator begin() const { return Data; } 91 iterator end() const { return Data + Length; } 179 typedef T *iterator; 212 iterator begin() const { return data(); } 213 iterator end() const { return data() + this->size(); }
|
H A D | MapVector.h | 40 typedef typename VectorType::iterator iterator; typedef in class:llvm::MapVector 47 iterator begin() { 55 iterator end() { 79 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 93 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { 95 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 110 iterator find(const KeyT &Key) { 124 typename MapType::iterator Pos = Map.find(Vector.back().first);
|
H A D | SparseSet.h | 166 typedef typename DenseT::iterator iterator; typedef in class:llvm::SparseSet 171 iterator begin() { return Dense.begin(); } 172 iterator end() { return Dense.end(); } 197 /// @returns An iterator to the element identified by key, or end(). 199 iterator findIndex(unsigned Idx) { 220 /// @returns An iterator to the element identified by key, or end(). 222 iterator find(const KeyT &Key) { 238 /// If Val is successfully inserted, return (I, true), where I is an iterator 242 /// (I, false), where I is an iterator pointin [all...] |
H A D | StringRef.h | 43 typedef const char *iterator; typedef in class:llvm::StringRef 97 iterator begin() const { return Data; } 99 iterator end() const { return Data + Length; }
|
H A D | TinyPtrVector.h | 130 typedef EltTy *iterator; typedef in class:llvm::TinyPtrVector 132 iterator begin() { 139 iterator end() { 218 iterator erase(iterator I) { 220 assert(I < end() && "Erasing at past-the-end iterator."); 234 iterator erase(iterator S, iterator E) { 248 iterator inser [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontier.h | 57 typedef DomSetMapType::iterator iterator; typedef in class:llvm::DominanceFrontierBase 59 iterator begin() { return Frontiers.begin(); } 61 iterator end() { return Frontiers.end(); } 63 iterator find(BasicBlock *B) { return Frontiers.find(B); } 66 iterator addBasicBlock(BasicBlock *BB, const DomSetType &frontier) { 74 for (iterator I = begin(), E = end(); I != E; ++I) 79 void addToFrontier(iterator I, BasicBlock *Node) { 84 void removeFromFrontier(iterator I, BasicBlock *Node) { 123 for (DomSetMapType::iterator [all...] |
H A D | IVUsers.h | 160 typedef ilist<IVStrideUse>::iterator iterator; typedef in class:llvm::IVUsers 162 iterator begin() { return IVUses.begin(); } 163 iterator end() { return IVUses.end(); }
|
H A D | Trace.h | 86 typedef BasicBlockListType::iterator iterator; typedef in class:llvm::Trace 89 typedef std::reverse_iterator<iterator> reverse_iterator; 91 iterator begin() { return BasicBlocks.begin(); } 93 iterator end () { return BasicBlocks.end(); } 104 iterator erase(iterator q) { return BasicBlocks.erase (q); } 105 iterator erase(iterator q1, iterator q [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | GCStrategy.h | 58 typedef list_type::iterator iterator; typedef in class:llvm::GCStrategy 134 iterator begin() { return Functions.begin(); } 135 iterator end() { return Functions.end(); }
|
H A D | MachineLoopInfo.h | 88 /// iterator/begin/end - The interface to the top-level loops in the current 91 typedef LoopInfoBase<MachineBasicBlock, MachineLoop>::iterator iterator; typedef in class:llvm::MachineLoopInfo 92 inline iterator begin() const { return LI.begin(); } 93 inline iterator end() const { return LI.end(); } 131 inline MachineLoop *removeLoop(iterator I) { return LI.removeLoop(I); } 164 typedef MachineLoopInfo::iterator ChildIteratorType; 177 typedef MachineLoopInfo::iterator ChildIteratorType;
|
/external/llvm/include/llvm/IR/ |
H A D | Metadata.h | 50 typedef StringRef::iterator iterator; typedef in class:llvm::MDString 53 iterator begin() const { return getName().begin(); } 56 iterator end() const { return getName().end(); }
|
/external/llvm/include/llvm/MC/ |
H A D | MCFunction.h | 107 typedef BasicBlockListTy:: iterator iterator; typedef in class:llvm::MCFunction 109 iterator begin() { return Blocks.begin(); } 111 iterator end() { return Blocks.end(); }
|