/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/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/lldb/include/lldb/Core/ |
H A D | ThreadSafeSTLMap.h | 28 typedef typename collection::iterator iterator; typedef in class:lldb_private::ThreadSafeSTLMap 144 iterator
|
H A D | VMRange.h | 27 typedef collection::iterator iterator; typedef in class:lldb_private::VMRange
|
/external/lldb/include/lldb/Symbol/ |
H A D | Symtab.h | 100 typedef collection::iterator iterator; typedef in class:lldb_private::Symtab
|
/external/lldb/source/Plugins/DynamicLoader/Darwin-Kernel/ |
H A D | DynamicLoaderDarwinKernel.h | 255 typedef collection::iterator iterator; typedef in class:DynamicLoaderDarwinKernel::KextImageInfo
|
/external/lldb/source/Plugins/ObjectContainer/BSD-Archive/ |
H A D | ObjectContainerBSDArchive.h | 120 typedef collection::iterator iterator; typedef in struct:ObjectContainerBSDArchive::Object
|
/external/lldb/tools/debugserver/source/ |
H A D | DNBBreakpoint.h | 159 typedef collection::iterator iterator; typedef in class:DNBBreakpointList
|
/external/lldb/tools/debugserver/source/MacOSX/ |
H A D | MachException.h | 113 typedef collection::iterator iterator; typedef in struct:MachException::Message
|
/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; 97 iterator begin() const { return Data; } 98 iterator end() const { return Data + Length; } 196 typedef T *iterator; 198 typedef std::reverse_iterator<iterator> reverse_iterator; 231 iterator begin() const { return data(); } 232 iterator end() const { return data() + this->size(); }
|
H A D | MapVector.h | 38 typedef typename VectorType::iterator iterator; typedef in class:llvm::MapVector 45 iterator begin() { 53 iterator 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); 128 /// Returns an iterator t [all...] |
H A D | SparseSet.h | 171 typedef typename DenseT::iterator iterator; typedef in class:llvm::SparseSet 176 iterator begin() { return Dense.begin(); } 177 iterator end() { return Dense.end(); } 202 /// @returns An iterator to the element identified by key, or end(). 204 iterator findIndex(unsigned Idx) { 222 /// @returns An iterator to the element identified by key, or end(). 224 iterator find(const KeyT &Key) { 241 /// If Val is successfully inserted, return (I, true), where I is an iterator 245 /// (I, false), where I is an iterator pointin [all...] |
H A D | StringRef.h | 42 typedef const char *iterator; typedef in class:llvm::StringRef 96 iterator begin() const { return Data; } 98 iterator end() const { return Data + Length; }
|
H A D | TinyPtrVector.h | 126 typedef EltTy *iterator; typedef in class:llvm::TinyPtrVector 128 iterator begin() { 135 iterator end() { 214 iterator erase(iterator I) { 216 assert(I < end() && "Erasing at past-the-end iterator."); 230 iterator erase(iterator S, iterator E) { 244 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 | 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 | 89 /// iterator/begin/end - The interface to the top-level loops in the current 92 typedef LoopInfoBase<MachineBasicBlock, MachineLoop>::iterator iterator; typedef in class:llvm::MachineLoopInfo 93 inline iterator begin() const { return LI.begin(); } 94 inline iterator end() const { return LI.end(); } 132 inline MachineLoop *removeLoop(iterator I) { return LI.removeLoop(I); } 165 typedef MachineLoopInfo::iterator ChildIteratorType; 178 typedef MachineLoopInfo::iterator ChildIteratorType;
|
/external/llvm/include/llvm/MC/MCAnalysis/ |
H A D | MCFunction.h | 123 typedef BasicBlockListTy:: iterator iterator; typedef in class:llvm::MCFunction 125 iterator begin() { return Blocks.begin(); } 127 iterator end() { return Blocks.end(); }
|
/external/mockito/src/org/mockito/internal/util/collections/ |
H A D | HashCodeAndEqualsSafeSet.java | 36 public Iterator<Object> iterator() { method in class:HashCodeAndEqualsSafeSet 38 private Iterator<HashCodeAndEqualsMockWrapper> iterator = backingHashSet.iterator(); 41 return iterator.hasNext(); 45 return iterator.next().get(); 49 iterator.remove(); 99 Iterator<Object> iterator = iterator(); 101 if (iterator.hasNext()) { 102 array[i] = (T) iterator [all...] |
/external/nist-sip/java/gov/nist/core/ |
H A D | DuplicateNameValueList.java | 75 Iterator<NameValue> iterator = nameValueMap.values().iterator(); 76 if (iterator.hasNext()) { 78 Object obj = iterator.next(); 85 if (iterator.hasNext()) 134 Iterator<String> li = this.nameValueMap.keySet().iterator(); 191 Iterator<NameValue> it = this.nameValueMap.values().iterator(); 199 * Return an iterator for the name-value pairs of this list. 201 * @return the iterator. 203 public Iterator<NameValue> iterator() { method in class:DuplicateNameValueList [all...] |
/external/opencv/cvaux/src/ |
H A D | cvlines.cpp | 226 CvLineIterator iterator; local 227 assert( cvInitLineIterator( &mat, start, end, &iterator, 8 ) == dst_nums[k] ); 257 CvLineIterator iterator; local 274 if( cvInitLineIterator( &mat, start, end, &iterator, 8 ) != src_num ) 282 memcpy( iterator.ptr, src + curr_src, 3 ); 283 CV_NEXT_LINE_POINT( iterator );
|