/external/guava/guava-tests/test/com/google/common/base/ |
H A D | JoinerTest.java | 79 J.join(ITERABLE_NULL.iterator()); 84 J.join(ITERABLE_1_NULL_2.iterator()); 128 assertEquals("", joiner.join(set.iterator())); 152 joiner.appendTo(NASTY_APPENDABLE, set.iterator()); 181 assertEquals(expected, joiner.join(parts.iterator())); 188 joiner.appendTo(sb1FromIterator, parts.iterator()); 232 Lists.newArrayList(new IterableIterator().iterator()).toArray(new Integer[0]); 306 assertEquals("", j.join(ImmutableMultimap.of().entries().iterator())); 308 assertEquals(":", j.join(ImmutableMultimap.of("", "").entries().iterator())); 310 assertEquals("1:a;1:b", j.join(ImmutableMultimap.of("1", "a", "1", "b").entries().iterator())); 372 private final Iterator<Integer> iterator; field in class:JoinerTest.IterableIterator 376 @Override public Iterator<Integer> iterator() { method in class:JoinerTest.IterableIterator [all...] |
/external/webkit/Source/WebCore/page/ |
H A D | PageGroup.cpp | 94 pair<PageGroupMap::iterator, bool> result = pageGroups->add(groupName, 0); 111 PageGroupMap::iterator end = pageGroups->end(); 113 for (PageGroupMap::iterator it = pageGroups->begin(); it != end; ++it) { 127 PageGroupMap::iterator end = pageGroups->end(); 128 for (PageGroupMap::iterator it = pageGroups->begin(); it != end; ++it) { 139 PageGroupMap::iterator end = pageGroups->end(); 140 for (PageGroupMap::iterator it = pageGroups->begin(); it != end; ++it) { 151 PageGroupMap::iterator end = pageGroups->end(); 152 for (PageGroupMap::iterator it = pageGroups->begin(); it != end; ++it) { 172 PageGroupMap::iterator en [all...] |
/external/stlport/stlport/stl/ |
H A D | _list.h | 104 typedef _List_iterator<_Tp, _NonConstTraits> iterator; typedef in struct:_List_iterator 115 //copy constructor for iterator and constructor from iterator for const_iterator 116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} 275 typedef _STLP_PRIV _List_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; typedef in class:list 367 iterator begin() { return iterator(this->_M_node._M_data._M_next); } 370 iterator end() { return iterator(&this->_M_node._M_data); } 420 iterator inser [all...] |
H A D | _set.h | 41 //Specific iterator traits creation 60 //Specific iterator traits creation 73 typedef typename _Rep_type::iterator iterator; typedef in class:set 151 iterator begin() { return _M_t.begin(); } 152 iterator end() { return _M_t.end(); } 168 pair<iterator,bool> insert(const value_type& __x) 170 iterator insert(iterator __pos, const value_type& __x) 182 void erase(iterator __po 244 typedef typename _Rep_type::iterator iterator; typedef in class:multiset [all...] |
/external/regex-re2/util/ |
H A D | sparse_array.h | 23 // The array iterator visits entries in the order they were first 25 // using an iterator: the iterator will visit indices added to the array 106 // IndexValue pairs: exposed in SparseArray::iterator. 110 typedef typename vector<IndexValue>::iterator iterator; typedef in class:re2::SparseArray 121 iterator begin() { 124 iterator end() { 161 inline iterator set(int i, Value v); 163 pair<iterator, boo [all...] |
/external/stlport/test/unit/ |
H A D | alg_test.cpp | 127 //Forward iterator 130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2); 137 //Bidirectionnal iterator 140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3); 147 //Random access iterator 150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4); 160 //Forward iterator 163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>()); 170 //Bidirectionnal iterator 173 list<int>::iterator li [all...] |
H A D | mvctor_test.cpp | 239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end()); 247 deque<vector<int> >::iterator it = vect_deque.end() - 5; 258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); 267 deque<vector<int> >::iterator it = vect_deque.end() - 5; 278 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); 287 deque<vector<int> >::iterator it = vect_deque.end() - 5; 298 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); 307 deque<vector<int> >::iterator it = vect_deque.end() - 5; 318 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); 331 deque<vector<int> >::iterator vdi [all...] |
/external/clang/test/Index/ |
H A D | annotate-nested-name-specifier.cpp | 5 typedef T* iterator; typedef in struct:outer::inner::vector 17 using outer_alias::inner::vector<X>::iterator; 40 using typename outer::inner::vector<type>::iterator; 100 typedef typename outer_alias::inner::vector<type>::iterator iter_type; 101 typedef typename outer_alias::inner::vector<int>::iterator int_ptr_type; 161 // CHECK: Keyword: "using" [17:3 - 17:8] UsingDeclaration=iterator[5:18] 163 // CHECK: Punctuation: "::" [17:20 - 17:22] UsingDeclaration=iterator[5:18] 165 // CHECK: Punctuation: "::" [17:27 - 17:29] UsingDeclaration=iterator[5:18] 167 // CHECK: Punctuation: "<" [17:35 - 17:36] UsingDeclaration=iterator[5:18] 169 // CHECK: Punctuation: ">" [17:37 - 17:38] UsingDeclaration=iterator[ [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ForwardingSortedSet.java | 128 * A sensible definition of {@link #remove} in terms of the {@code iterator()} 139 Iterator<Object> iterator = self.tailSet(object).iterator(); 140 if (iterator.hasNext()) { 141 Object ceiling = iterator.next(); 143 iterator.remove();
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
H A D | FramePrinter.java | 94 CodeIterator iterator = code.iterator(); 95 while (iterator.hasNext()) { 98 pos = iterator.next(); 103 stream.println(pos + ": " + InstructionPrinter.instructionString(iterator, pos, pool));
|
/external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/Format/ |
H A D | PackedSwitchMethodItem.java | 53 Iterator<PackedSwitchDataPseudoInstruction.PackedSwitchTarget> iterator = instruction.iterateKeysAndTargets(); 56 while (iterator.hasNext()) { 57 PackedSwitchDataPseudoInstruction.PackedSwitchTarget target = iterator.next(); 67 while (iterator.hasNext()) { 68 PackedSwitchDataPseudoInstruction.PackedSwitchTarget target = iterator.next();
|
H A D | SparseSwitchMethodItem.java | 53 Iterator<SparseSwitchDataPseudoInstruction.SparseSwitchTarget> iterator = instruction.iterateKeysAndTargets(); 55 while (iterator.hasNext()) { 56 SparseSwitchDataPseudoInstruction.SparseSwitchTarget target = iterator.next(); 68 while (iterator.hasNext()) { 69 SparseSwitchDataPseudoInstruction.SparseSwitchTarget target = iterator.next();
|
/external/stlport/stlport/stl/pointers/ |
H A D | _set.h | 32 //Specific iterator traits creation 81 //Specific iterator traits creation 96 typedef typename _Rep_type::iterator base_iterator; 104 typedef typename _Priv_Rep_type::iterator iterator; typedef in class:set 117 static iterator _S_to_value_ite(const_base_iterator __ite) 118 { return iterator(__ite._Owner(), __ite._M_iterator._M_node); } 122 static iterator _S_to_value_ite(const_base_iterator __ite) 123 { return iterator(__ite._M_node); } 211 iterator begi 351 typedef typename _Priv_Rep_type::iterator iterator; typedef in class:multiset [all...] |
/external/webkit/Source/WebKit/chromium/src/ |
H A D | WebAccessibilityCacheImpl.cpp | 113 ObjectMap::iterator it = m_objectMap.find(id); 123 ObjectMap::iterator it = m_objectMap.find(id); 130 IdMap::iterator it2 = m_idMap.find(it->second->accessibilityObject()); 151 IdMap::iterator it = m_idMap.find(o.get()); 170 IdMap::iterator it = m_idMap.find(o.get());
|
/external/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 75 typedef FunctionMapTy::iterator iterator; typedef in class:clang::CallGraph 77 iterator begin() { return FunctionMap.begin(); } 78 iterator end() { return FunctionMap.end(); } 92 typedef llvm::SetVector<CallGraphNode *>::iterator nodes_iterator; 148 typedef llvm::SmallVector<CallRecord, 5>::iterator iterator; typedef in class:clang::CallGraphNode 152 inline iterator begin() { return CalledFunctions.begin(); } 153 inline iterator end() { return CalledFunctions.end(); } 183 typedef mapped_iterator<NodeType::iterator, CGNDerefFu [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ImmutableList.h | 82 class iterator { class in class:llvm::ImmutableList 85 iterator() : L(0) {} function in class:llvm::ImmutableList::iterator 86 iterator(ImmutableList l) : L(l.getInternalPointer()) {} function in class:llvm::ImmutableList::iterator 88 iterator& operator++() { L = L->getTail(); return *this; } 89 bool operator==(const iterator& I) const { return L == I.L; } 90 bool operator!=(const iterator& I) const { return L != I.L; } 95 /// begin - Returns an iterator referring to the head of the list, or 96 /// an iterator denoting the end of the list if the list is empty. 97 iterator begin() const { return iterator( [all...] |
H A D | ImmutableSet.h | 51 typedef ImutAVLTreeInOrderIterator<ImutInfo> iterator; typedef in class:llvm::ImutAVLTree 108 /// begin - Returns an iterator that iterates over the nodes of the tree 109 /// in an inorder traversal. The returned iterator thus refers to the 111 iterator begin() const { return iterator(this); } 113 /// end - Returns an iterator for the tree that denotes the end of an 115 iterator end() const { return iterator(); } 142 iterator LItr = begin(), LEnd = end(); 143 iterator RIt 1056 class iterator { class in class:llvm::ImmutableSet 1058 iterator(TreeTy* t) : itr(t) {} function in class:llvm::ImmutableSet::iterator 1061 iterator() {} function in class:llvm::ImmutableSet::iterator 1182 class iterator { class in class:llvm::ImmutableSetRef 1184 iterator(TreeTy* t) : itr(t) {} function in class:llvm::ImmutableSetRef::iterator 1187 iterator() {} function in class:llvm::ImmutableSetRef::iterator [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | CallGraph.h | 84 typedef FunctionMapTy::iterator iterator; typedef in class:llvm::CallGraph 91 inline iterator begin() { return FunctionMap.begin(); } 92 inline iterator end() { return FunctionMap.end(); } 207 typedef std::vector<CallRecord>::iterator iterator; typedef in class:llvm::CallGraphNode 213 inline iterator begin() { return CalledFunctions.begin(); } 214 inline iterator end() { return CalledFunctions.end(); } 269 void removeCallEdge(iterator I) { 317 typedef mapped_iterator<NodeType::iterator, CGNDerefFu [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | LiveIntervalAnalysis.h | 33 #include <iterator> 104 typedef Reg2IntervalMap::iterator iterator; typedef in class:llvm::LiveIntervals 108 iterator begin() { return r2iMap_.begin(); } 109 iterator end() { return r2iMap_.end(); } 113 Reg2IntervalMap::iterator I = r2iMap_.find(reg); 162 Reg2IntervalMap::iterator I = r2iMap_.find(reg); 190 DenseMap<unsigned, LiveInterval*>::iterator I = r2iMap_.find(Reg); 348 MachineBasicBlock::iterator MI, 361 MachineBasicBlock::iterator M [all...] |
H A D | MachineFunction.h | 281 typedef BasicBlockListType::iterator iterator; 284 typedef std::reverse_iterator<iterator> reverse_iterator; 293 iterator begin() { return BasicBlocks.begin(); } 295 iterator end () { return BasicBlocks.end(); } 312 void insert(iterator MBBI, MachineBasicBlock *MBB) { 315 void splice(iterator InsertPt, iterator MBBI) { 318 void splice(iterator InsertPt, iterator MBB [all...] |
/external/webkit/Source/WebCore/rendering/ |
H A D | CounterNode.cpp | 122 for (RenderCounter* iterator = m_rootRenderer;iterator; iterator = iterator->m_nextForSameCounter) { 123 if (iterator == value) { 150 for (RenderCounter* iterator = m_rootRenderer;iterator; iterator = iterator->m_nextForSameCounter) { 151 if (iterator [all...] |
/external/webkit/Source/JavaScriptCore/runtime/ |
H A D | ArgList.h | 42 typedef VectorType::iterator iterator; typedef in class:JSC::MarkedArgumentBuffer 138 iterator begin() { return m_buffer; } 139 iterator end() { return m_buffer + m_size; } 182 typedef JSValue* iterator; typedef in class:JSC::ArgList 231 iterator begin() { return m_args; } 232 iterator end() { return m_args + m_argCount; }
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ListsTest.java | 74 public Iterator<Integer> iterator() { method in class:ListsTest.SomeIterable 75 return SOME_COLLECTION.iterator(); 366 ArrayList<Integer> list = Lists.newArrayList(SOME_COLLECTION.iterator()); 432 return Lists.asList("foo", new String[] {"bar", "baz"}).iterator(); 459 return Lists.asList("foo", new String[0]).iterator(); 472 return Lists.asList("foo", "bar", new String[] {"baz"}).iterator(); 492 return Lists.asList("foo", "bar", new String[0]).iterator(); 655 ListIterator<String> iterator = list.listIterator(1); 656 assertEquals(1, iterator.nextIndex()); 657 assertEquals("2", iterator [all...] |
H A D | AbstractMultimapTest.java | 244 public Iterator<Integer> iterator() { 245 return Lists.newArrayList(1, 3).iterator(); 255 public Iterator<Integer> iterator() { 551 multimap.entries().iterator(); 614 Iterator<Entry<String, Collection<Integer>>> iterator = 615 entries.iterator(); 617 assertTrue(iterator.hasNext()); 618 Entry<String, Collection<Integer>> entry = iterator.next(); 629 assertFalse(iterator.hasNext()); 670 assertEquals("foo", entries.iterator() [all...] |
/external/opencv/cxcore/src/ |
H A D | cxcopy.cpp | 306 CvSparseMatIterator iterator; local 325 for( node = cvInitSparseMatIterator( src1, &iterator ); 326 node != 0; node = cvGetNextSparseNode( &iterator )) 340 CvNArrayIterator iterator; local 342 CV_CALL( cvInitNArrayIterator( 2, arrs, maskarr, stubs, &iterator )); 343 pix_size = CV_ELEM_SIZE(iterator.hdr[0]->type); 347 iterator.size.width *= pix_size; 348 if( iterator.size.width <= CV_MAX_INLINE_MAT_OP_SIZE*(int)sizeof(double)) 352 memcpy( iterator.ptr[1], iterator 511 CvNArrayIterator iterator; local 687 CvNArrayIterator iterator; local [all...] |