Searched defs:iterator (Results 251 - 275 of 621) sorted by relevance

<<11121314151617181920>>

/external/javassist/src/main/javassist/expr/
H A DExpr.java46 CodeIterator iterator; field in class:Expr
59 iterator = i;
172 Iterator it = list.iterator();
286 runEditor(recursive, iterator);
295 iterator.writeByte(NOP, pos + i);
298 pos = iterator.insertGapAt(pos, gap, false).position;
300 iterator.write(code, pos);
301 iterator.insert(bytecode.getExceptionTable(), pos);
/external/jmonkeyengine/engine/src/core/com/jme3/cinematic/
H A DMotionPath.java109 for (Iterator<Vector3f> it = spline.getControlPoints().iterator(); it.hasNext();) {
227 * returns an iterator on the waypoints collection
230 public Iterator<Vector3f> iterator() { method in class:MotionPath
231 return spline.getControlPoints().iterator();
309 for (Iterator<MotionPathListener> it = listeners.iterator(); it.hasNext();) {
/external/jmonkeyengine/engine/src/core/com/jme3/util/
H A DSafeArrayList.java63 * modification method. add() and set() are not supported on the iterator.
65 * is not reflected in the iterator instance as it is still refering to its
76 // example, the default iterator() method will not work for
159 public Iterator<E> iterator() { method in class:SafeArrayList
234 Iterator i1 = iterator();
235 Iterator i2 = other.iterator();
386 // different than the one this iterator is a snapshot of.
390 // way, none of those changes are reflected in this iterator.
/external/jsilver/src/com/google/clearsilver/jsilver/data/
H A DDelegatedData.java147 * Wrapping implementation of iterator that makes sure any Data object returned by the underlying
148 * iterator is wrapped with the right DelegatedData type.
151 private final Iterator<? extends Data> iterator; field in class:DelegatedData.DelegatedIterator
153 DelegatedIterator(Iterator<? extends Data> iterator) { argument
154 this.iterator = iterator;
158 return iterator.hasNext();
162 return newInstance(iterator.next());
166 iterator.remove();
177 return new DelegatedIterator(getDelegate().getChildren().iterator());
[all...]
/external/llvm/include/llvm/ADT/
H A DDenseSet.h65 typename MapTy::iterator I;
68 typedef typename MapTy::iterator::difference_type difference_type;
74 Iterator(const typename MapTy::iterator &i) : I(i) {}
104 typedef Iterator iterator; typedef in class:llvm::DenseSet
107 iterator begin() { return Iterator(TheMap.begin()); }
108 iterator end() { return Iterator(TheMap.end()); }
113 iterator find(const ValueT &V) { return Iterator(TheMap.find(V)); }
117 std::pair<iterator, bool> insert(const ValueT &V) {
H A DEquivalenceClasses.h42 /// for (EquivalenceClasses<int>::iterator I = EC.begin(), E = EC.end();
124 for (iterator I = RHS.begin(), E = RHS.end(); I != E; ++I)
138 /// iterator* - Provides a way to iterate over all values in the set.
139 typedef typename std::set<ECValue>::const_iterator iterator; typedef in class:llvm::EquivalenceClasses
140 iterator begin() const { return TheMapping.begin(); }
141 iterator end() const { return TheMapping.end(); }
148 member_iterator member_begin(iterator I) const {
156 /// findValue - Return an iterator to the specified value. If it does not
158 iterator findValue(const ElemTy &V) const {
184 for (iterator
[all...]
H A DImmutableList.h81 class iterator { class in class:llvm::ImmutableList
84 iterator() : L(0) {} function in class:llvm::ImmutableList::iterator
85 iterator(ImmutableList l) : L(l.getInternalPointer()) {} function in class:llvm::ImmutableList::iterator
87 iterator& operator++() { L = L->getTail(); return *this; }
88 bool operator==(const iterator& I) const { return L == I.L; }
89 bool operator!=(const iterator& I) const { return L != I.L; }
94 /// begin - Returns an iterator referring to the head of the list, or
95 /// an iterator denoting the end of the list if the list is empty.
96 iterator begin() const { return iterator(
[all...]
H A DScopedHashTable.h180 typename DenseMap<K, ValTy*, KInfo>::iterator I = TopLevelMap.find(Key);
191 typedef ScopedHashTableIterator<K, V, KInfo> iterator; typedef in class:llvm::ScopedHashTable
193 iterator end() { return iterator(0); }
195 iterator begin(const K &Key) {
196 typename DenseMap<K, ValTy*, KInfo>::iterator I =
199 return iterator(I->second);
/external/llvm/include/llvm/Analysis/
H A DCallGraph.h84 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...]
H A DRegionInfo.h478 /// These iterators iterator over all subregions of this Region.
480 typedef RegionSet::iterator iterator; typedef in class:llvm::Region
483 iterator begin() { return children.begin(); }
484 iterator end() { return children.end(); }
493 /// Region. The iterator also iterates over BasicBlocks that are elements of
494 /// a subregion of this Region. It is therefore called a flat iterator.
509 // Construct the begin iterator.
518 // Construct the end iterator.
/external/llvm/include/llvm/CodeGen/
H A DGCMetadata.h85 typedef std::vector<GCPoint>::iterator iterator; typedef in class:llvm::GCFunctionInfo
86 typedef std::vector<GCRoot>::iterator roots_iterator;
144 iterator begin() { return SafePoints.begin(); }
145 iterator end() { return SafePoints.end(); }
156 live_iterator live_begin(const iterator &p) { return roots_begin(); }
157 live_iterator live_end (const iterator &p) { return roots_end(); }
158 size_t live_size(const iterator &p) const { return roots_size(); }
176 typedef list_type::const_iterator iterator; typedef in class:llvm::GCModuleInfo
190 iterator begi
[all...]
H A DLiveRangeEdit.h130 typedef SmallVectorImpl<LiveInterval*>::const_iterator iterator; typedef in class:llvm::LiveRangeEdit
131 iterator begin() const { return NewRegs.begin()+FirstNew; }
132 iterator end() const { return NewRegs.end(); }
179 MachineBasicBlock::iterator MI,
/external/llvm/include/llvm/IR/
H A DBasicBlock.h99 typedef InstListType::iterator iterator; typedef in class:llvm::BasicBlock
149 /// \brief Returns an iterator to the first instruction in this block that is
153 iterator getFirstInsertionPt();
191 /// Instruction iterator methods
193 inline iterator begin() { return InstList.begin(); }
195 inline iterator end () { return InstList.end(); }
251 /// Note that all instructions BEFORE the specified iterator stay as part of
255 /// This function invalidates the specified iterator.
264 BasicBlock *splitBasicBlock(iterator
[all...]
/external/llvm/include/llvm/Support/
H A DRegistry.h65 class iterator;
85 friend class iterator;
105 class iterator { class in class:llvm::Registry
109 explicit iterator(const node *N) : Cur(N) {} function in class:llvm::Registry::iterator
111 bool operator==(const iterator &That) const { return Cur == That.Cur; }
112 bool operator!=(const iterator &That) const { return Cur != That.Cur; }
113 iterator &operator++() { Cur = Cur->Next; return *this; }
118 static iterator begin() { return iterator(Head); }
119 static iterator en
[all...]
/external/llvm/lib/IR/
H A DAttributeImpl.h166 typedef const Attribute *iterator; typedef in class:llvm::AttributeSetNode
167 iterator begin() const { return reinterpret_cast<iterator>(this + 1); }
168 iterator end() const { return begin() + NumAttrs; }
244 typedef AttributeSetNode::iterator iterator; typedef in class:llvm::AttributeSetImpl
245 iterator begin(unsigned Slot) const { return getSlotNode(Slot)->begin(); }
246 iterator end(unsigned Slot) const { return getSlotNode(Slot)->end(); }
/external/mesa3d/src/glsl/
H A Dlist.h227 class iterator { class
244 class exec_list_iterator : public iterator {
278 for (iter_type iter = (container) . iterator(); iter.has_next(); iter.next())
442 exec_list_iterator iterator() function in struct:exec_list
447 exec_list_iterator iterator() const function in struct:exec_list
/external/nist-sip/java/gov/nist/core/
H A DGenericObjectList.java181 * Traverse the list given a list iterator
183 protected GenericObject next(ListIterator iterator) { argument
185 return (GenericObject) iterator.next();
192 * This is the default list iterator.This will not handle nested list
205 * Fetch the next object from the list based on the default list iterator
351 ListIterator iterator = this.listIterator();
352 if (iterator.hasNext()) {
354 Object obj = iterator.next();
361 if (iterator.hasNext())
H A DNameValueList.java95 Iterator<NameValue> iterator = hmap.values().iterator();
96 if (iterator.hasNext()) {
98 Object obj = iterator.next();
105 if (iterator.hasNext())
155 Iterator<String> li = this.hmap.keySet().iterator();
218 Iterator<NameValue> it = this.hmap.values().iterator();
240 * Return an iterator for the name-value pairs of this list.
242 * @return the iterator.
244 public Iterator<NameValue> iterator() { method in class:NameValueList
[all...]
/external/opencv/cxcore/src/
H A Dcxlogic.cpp223 CvNArrayIterator iterator; local
229 CV_CALL( cvInitNArrayIterator( 2, arrs, 0, stubs, &iterator ));
231 type = CV_MAT_TYPE(iterator.hdr[0]->type);
233 iterator.size.width *= CV_ELEM_SIZE(type);
240 IPPI_CALL( fn_2d( iterator.ptr[0], CV_STUB_STEP,
241 iterator.ptr[1], CV_STUB_STEP,
242 iterator.size, buf, elem_size1 ));
244 while( cvNextNArraySlice( &iterator ));
389 CvNArrayIterator iterator; local
395 CV_CALL( cvInitNArrayIterator( 3, arrs, 0, stubs, &iterator ));
651 CvNArrayIterator iterator; local
[all...]
H A Dcxrand.cpp462 CvNArrayIterator iterator_state, *iterator = 0; local
476 iterator = &iterator_state;
477 CV_CALL( cvInitNArrayIterator( 1, &arr, 0, &stub_nd, iterator ));
478 type = CV_MAT_TYPE(iterator->hdr[0]->type);
479 size = iterator->size;
592 IPPI_CALL( func( iterator->ptr[0], CV_STUB_STEP, size, rng, param ));
594 while( cvNextNArraySlice( iterator ));
/external/protobuf/java/src/main/java/com/google/protobuf/
H A DFieldSet.java133 * Get an iterator to the field map. This iterator should not be leaked
136 public Iterator<Map.Entry<FieldDescriptorType, Object>> iterator() { method in class:FieldSet
137 return fields.entrySet().iterator();
/external/regex-re2/re2/
H A Dstringpiece.h124 typedef const char* iterator; typedef in class:re2::StringPiece
126 typedef std::reverse_iterator<iterator> reverse_iterator;
127 iterator begin() const { return ptr_; }
128 iterator end() const { return ptr_ + length_; }
/external/regex-re2/util/
H A Dsparse_array.h23 // 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/smack/src/org/xbill/DNS/
H A DZone.java41 zentries = data.entrySet().iterator();
172 for (Iterator it = records.iterator(); it.hasNext(); ) {
507 iterator() { method in class:Zone
513 * construct an AXFR response. This is identical to {@link #iterator} except
540 Iterator zentries = data.entrySet().iterator();
/external/stlport/stlport/stl/
H A D_iterator_base.h59 struct iterator { struct
67 struct iterator<output_iterator_tag, void, void, void, void> { struct
81 //Old HP iterator queries do not give information about the iterator
106 * iterators we have to map std iterator categories to stlport ones. This
114 # include_next <iterator>
116 # include _STLP_NATIVE_HEADER(iterator)
249 inline _Category _STLP_CALL iterator_category(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return _Category(); }
251 inline _Tp* _STLP_CALL value_type(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return __STATIC_CAST(_Tp*, 0); }
253 inline _Distance* _STLP_CALL distance_type(const iterator<_Categor
[all...]

Completed in 487 milliseconds

<<11121314151617181920>>