| /external/llvm/include/llvm/ADT/ |
| ImmutableMap.h | 205 class iterator : public ImutAVLValueIterator<ImmutableMap> { class in class:llvm::ImmutableMap
206 iterator() = default;
207 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} function in class:llvm::ImmutableMap::iterator
215 iterator begin() const { return iterator(Root); }
216 iterator end() const { return iterator(); }
364 class iterator : public ImutAVLValueIterator<ImmutableMapRef> { class in class:llvm::ImmutableMapRef
365 iterator() = default
366 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} function in class:llvm::ImmutableMapRef::iterator
[all...] |
| ScopedHashTable.h | 180 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);
|
| SparseMultiSet.h | 123 /// erasure, iterator preservation, and dense size.
218 class iterator_base : public std::iterator<std::bidirectional_iterator_tag,
228 /// Whether our iterator has fallen outside our dense vector.
237 /// Whether our iterator is properly keyed, i.e. the SparseIdx is valid
247 typedef std::iterator<std::bidirectional_iterator_tag, ValueT> super;
255 "Dereferencing iterator of invalid key or index");
279 assert(isKeyed() && "Decrementing an invalid iterator");
292 assert(!isEnd() && isKeyed() && "Incrementing an invalid/end iterator");
307 typedef iterator_base<SparseMultiSet *> iterator; typedef in class:llvm::SparseMultiSet
311 typedef std::pair<iterator, iterator> RangePair
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CallGraph.h | 116 typedef FunctionMapTy::iterator iterator; typedef in class:llvm::CallGraph
122 inline iterator begin() { return FunctionMap.begin(); }
123 inline iterator end() { return FunctionMap.end(); }
187 typedef std::vector<CallRecord>::iterator iterator; typedef in class:llvm::CallGraphNode
193 inline iterator begin() { return CalledFunctions.begin(); }
194 inline iterator end() { return CalledFunctions.end(); }
244 void removeCallEdge(iterator I) {
342 typedef CallGraph::iterator iterator typedef in class:CallGraphWrapperPass
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| GCMetadata.h | 76 typedef std::vector<GCPoint>::iterator iterator; typedef in class:llvm::GCFunctionInfo
77 typedef std::vector<GCRoot>::iterator roots_iterator;
135 iterator begin() { return SafePoints.begin(); }
136 iterator end() { return SafePoints.end(); }
147 live_iterator live_begin(const iterator &p) { return roots_begin(); }
148 live_iterator live_end(const iterator &p) { return roots_end(); }
149 size_t live_size(const iterator &p) const { return roots_size(); }
171 FuncInfoVec::iterator funcinfo_begin() { return Functions.begin(); }
172 FuncInfoVec::iterator funcinfo_end() { return Functions.end();
184 typedef SmallVector<std::unique_ptr<GCStrategy>,1>::const_iterator iterator; typedef in class:llvm::GCModuleInfo
[all...] |
| LiveRangeEdit.h | 145 /// Iterator for accessing the new registers added by this edit.
146 typedef SmallVectorImpl<unsigned>::const_iterator iterator; typedef in class:llvm::LiveRangeEdit
147 iterator begin() const { return NewRegs.begin()+FirstNew; }
148 iterator end() const { return NewRegs.end(); }
212 MachineBasicBlock::iterator MI,
|
| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFUnit.h | 66 typedef typename UnitVector::iterator iterator; typedef in class:llvm::final
67 typedef llvm::iterator_range<typename UnitVector::iterator> iterator_range;
|
| /external/llvm/include/llvm/IR/ |
| Attributes.h | 372 typedef ArrayRef<Attribute>::iterator iterator; typedef
374 iterator begin(unsigned Slot) const;
375 iterator end(unsigned Slot) const;
566 typedef std::map<std::string, std::string>::iterator td_iterator;
|
| LegacyPassManagers.h | 146 typedef std::vector<PMDataManager *>::const_reverse_iterator iterator; typedef in class:llvm::PMStack
147 iterator begin() const { return S.rbegin(); }
148 iterator end() const { return S.rend(); }
401 for (PMStack::iterator I = PMS.begin(), E = PMS.end();
|
| /external/llvm/include/llvm/MC/ |
| MCInst.h | 170 typedef SmallVectorImpl<MCOperand>::iterator iterator; typedef in class:llvm::MCInst
173 void erase(iterator I) { Operands.erase(I); }
175 iterator begin() { return Operands.begin(); }
177 iterator end() { return Operands.end(); }
179 iterator insert(iterator I, const MCOperand &Op) {
|
| MCSection.h | 62 typedef FragmentListType::iterator iterator; typedef in class:llvm::MCSection
164 MCSection::iterator begin();
169 MCSection::iterator end();
184 MCSection::iterator getSubsectionInsertionPoint(unsigned Subsection);
|
| /external/llvm/include/llvm/Option/ |
| ArgList.h | 40 /// bother to factor this into two separate iterator implementations.
44 // iterator combinator which takes multiple iterators which can be
97 typedef arglist_type::iterator iterator; typedef in class:llvm::opt::ArgList
142 iterator begin() { return Args.begin(); }
143 iterator end() { return Args.end(); }
|
| /external/llvm/lib/IR/ |
| AttributeImpl.h | 199 typedef const Attribute *iterator; typedef in class:llvm::final
200 iterator begin() const { return getTrailingObjects<Attribute>(); }
201 iterator end() const { return begin() + NumAttrs; }
313 typedef AttributeSetNode::iterator iterator; typedef in class:llvm::final
314 iterator begin(unsigned Slot) const { return getSlotNode(Slot)->begin(); }
315 iterator end(unsigned Slot) const { return getSlotNode(Slot)->end(); }
|
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 257 typedef SmallVectorImpl<ArgumentGraphNode *>::iterator iterator; typedef in class:__anon27973::ArgumentGraph
259 iterator begin() { return SyntheticRoot.Uses.begin(); }
260 iterator end() { return SyntheticRoot.Uses.end(); }
335 typedef SmallVectorImpl<ArgumentGraphNode *>::iterator ChildIteratorType;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SROA.cpp | 103 BasicBlock::iterator InsertPt) const {
209 typedef SmallVectorImpl<Slice>::iterator iterator; typedef in class:llvm::sroa::AllocaSlices
210 typedef iterator_range<iterator> range;
211 iterator begin() { return Slices.begin(); }
212 iterator end() { return Slices.end(); }
221 void erase(iterator Start, iterator Stop) { Slices.erase(Start, Stop); }
236 // Forward declare the iterator and range accessor for walking the
322 typedef AllocaSlices::iterator iterator typedef in class:llvm::sroa::Partition
[all...] |
| /external/mesa3d/src/gallium/state_trackers/clover/util/ |
| range.hpp | 74 typedef I iterator; typedef in class:clover::detail::basic_range
76 typedef typename std::iterator_traits<iterator>::value_type value_type;
77 typedef typename std::iterator_traits<iterator>::reference
81 typedef typename std::iterator_traits<iterator>::difference_type
95 iterator
100 iterator
115 std::reverse_iterator<iterator>
120 std::reverse_iterator<iterator>
180 /// Range that contains all elements delimited by an iterator pair
254 typename super::iterator
[all...] |
| /external/mockito/src/main/java/org/mockito/internal/util/concurrent/ |
| WeakConcurrentMap.java | 10 import java.util.Iterator;
152 public Iterator<Map.Entry<K, V>> iterator() { method in class:WeakConcurrentMap
153 return new EntryIterator(target.entrySet().iterator());
277 public Iterator<Map.Entry<K, V>> iterator() { method in class:WeakConcurrentMap.WithInlinedExpunction
279 return super.iterator();
289 private class EntryIterator implements Iterator<Map.Entry<K, V>> {
291 private final Iterator<Map.Entry<WeakKey<K>, V>> iterator; field in class:WeakConcurrentMap.EntryIterator
[all...] |
| /external/nist-sip/java/gov/nist/core/ |
| DuplicateNameValueList.java | 28 import java.util.Iterator;
75 Iterator<NameValue> iterator = nameValueMap.values().iterator(); local
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()
203 public Iterator<NameValue> iterator() { method in class:DuplicateNameValueList
[all...] |
| NameValueList.java | 36 import java.util.Iterator;
95 Iterator<NameValue> iterator = hmap.values().iterator(); local
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()
244 public Iterator<NameValue> iterator() { method in class:NameValueList
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/ |
| EventScanner.java | 502 ListIterator iterator = eventsToDeliver.listIterator(); local
503 while (iterator.hasNext()) {
504 eventWrapper = (EventWrapper) iterator.next();
|
| /external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/internal/ |
| DiskLruCacheTest.java | 25 import java.util.Iterator;
934 @Test public void iterator() throws Exception { method in class:DiskLruCacheTest
938 Iterator<DiskLruCache.Snapshot> iterator = cache.snapshots(); local
940 assertTrue(iterator.hasNext());
941 DiskLruCache.Snapshot a = iterator.next();
947 assertTrue(iterator.hasNext());
948 DiskLruCache.Snapshot b = iterator.next();
954 assertTrue(iterator.hasNext());
955 DiskLruCache.Snapshot c = iterator.next()
972 Iterator<DiskLruCache.Snapshot> iterator = cache.snapshots(); local
990 Iterator<DiskLruCache.Snapshot> iterator = cache.snapshots(); local
1008 Iterator<DiskLruCache.Snapshot> iterator = cache.snapshots(); local
1021 Iterator<DiskLruCache.Snapshot> iterator = cache.snapshots(); local
1032 Iterator<DiskLruCache.Snapshot> iterator = cache.snapshots(); local
1042 Iterator<DiskLruCache.Snapshot> iterator = cache.snapshots(); local
1057 Iterator<DiskLruCache.Snapshot> iterator = cache.snapshots(); local
[all...] |
| /external/opencv/cv/src/ |
| cvsamplers.cpp | 60 CvLineIterator iterator; local
71 CV_CALL( count = cvInitLineIterator( mat, pt1, pt2, &iterator, connectivity ));
76 CV_MEMCPY_AUTO( buffer, iterator.ptr, pix_size );
78 CV_NEXT_LINE_POINT( iterator );
[all...] |
| /external/opencv/cxcore/src/ |
| cxlogic.cpp | 223 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...] |
| cxnorm.cpp | 1152 CvNArrayIterator iterator; local
[all...] |
| cxrand.cpp | 462 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 ));
|
