| /libcore/ojluni/src/main/java/java/util/ |
| LinkedHashMap.java | 73 * key-value mappings are provided by the specified map's entry set iterator.
121 * <p>The iterators returned by the <tt>iterator</tt> method of the collections
124 * the iterator is created, in any way except through the iterator's own
125 * <tt>remove</tt> method, the iterator will throw a {@link
127 * modification, the iterator fails quickly and cleanly, rather than risking
130 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
199 * LinkedHashMap.Entry<K, V> entry = map.entrySet().iterator.next()
550 * the iterator's own <tt>remove</tt> operation), the results of
553 * <tt>Iterator.remove</tt>, <tt>Set.remove</tt>
575 public final Iterator<K> iterator() { method in class:LinkedHashMap.LinkedKeySet
629 public final Iterator<V> iterator() { method in class:LinkedHashMap.LinkedValues
676 public final Iterator<Map.Entry<K,V>> iterator() { method in class:LinkedHashMap.LinkedEntrySet
[all...] |
| PriorityQueue.java | 54 * <p>This class and its iterator implement all of the
56 * Iterator} interfaces. The Iterator provided in method {@link
57 * #iterator()} is <em>not</em> guaranteed to traverse the elements of
385 * Needed by iterator.remove.
478 * Returns an iterator over the elements in this queue. The iterator
481 * @return an iterator over the elements in this queue
483 public Iterator<E> iterator() { method in class:PriorityQueue
[all...] |
| Spliterators.java | 398 // Iterator-based spliterators
402 * {@link java.util.Collection#iterator()} as the source of elements, and
407 * the <em>fail-fast</em> properties of the collection's iterator, and
415 * @return A spliterator from an iterator
425 * Creates a {@code Spliterator} using a given {@code Iterator}
430 * the <em>fail-fast</em> properties of the iterator, and implements
434 * The behaviour of splitting and traversal is undefined if the iterator is
439 * @param iterator The iterator for the source
445 * @return A spliterator from an iterator
666 public static<T> Iterator<T> iterator(Spliterator<? extends T> spliterator) { method in class:Spliterators
711 public static PrimitiveIterator.OfInt iterator(Spliterator.OfInt spliterator) { method in class:Spliterators
756 public static PrimitiveIterator.OfLong iterator(Spliterator.OfLong spliterator) { method in class:Spliterators
801 public static PrimitiveIterator.OfDouble iterator(Spliterator.OfDouble spliterator) { method in class:Spliterators
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 41 import java.util.Iterator;
75 * creation of the iterator. They do <em>not</em> throw {@link
78 * of the iterator will be returned exactly once.
88 * to be performed atomically. For example, an iterator operating
92 * <p>This class and its iterator implement all of the <em>optional</em>
93 * methods of the {@link Queue} and {@link Iterator} interfaces.
135 * indefinitely due to creation of an Iterator or simply a
140 * - allow a rogue Iterator to cause unbounded memory retention
246 * added in traversal order of the collection's iterator.
502 * collection's iterator. Attempts to {@code addAll} of a queue t
684 public Iterator<E> iterator() { method in class:ConcurrentLinkedQueue
[all...] |
| LinkedBlockingQueue.java | 40 import java.util.Iterator;
72 * <p>This class and its iterator implement all of the
74 * Iterator} interfaces.
108 * - allow a rogue Iterator to cause unbounded memory retention
270 * added in traversal order of the collection's iterator.
744 * Returns an iterator over the elements in this queue in proper sequence.
747 * <p>The returned iterator is
750 * @return an iterator over the elements in this queue in proper sequence
752 public Iterator<E> iterator() { method in class:LinkedBlockingQueue
[all...] |
| PriorityBlockingQueue.java | 42 import java.util.Iterator;
67 * <p>This class and its iterator implement all of the
69 * Iterator} interfaces. The Iterator provided in method {@link
70 * #iterator()} is <em>not</em> guaranteed to traverse the elements of
846 * Returns an iterator over the elements in this queue. The
847 * iterator does not return the elements in any particular order.
849 * <p>The returned iterator is
852 * @return an iterator over the elements in this queue
854 public Iterator<E> iterator() method in class:PriorityBlockingQueue
[all...] |
| /packages/apps/Contacts/tests/src/com/android/contacts/test/mocks/ |
| MockContentProvider.java | 33 import java.util.Iterator;
523 for (Iterator<Query> iterator = mExpectedQueries.iterator(); iterator.hasNext();) {
524 Query query = iterator.next();
528 iterator.remove();
559 for (Iterator<Insert> iterator = mExpectedInserts.iterator(); iterator.hasNext(); )
[all...] |
| /packages/apps/Messaging/src/com/android/messaging/ui/ |
| MultiAttachmentLayout.java | 42 import java.util.Iterator;
231 final Iterator<MessagePartData> iterator = attachments.iterator(); local
232 while (iterator.hasNext() && i < count) {
233 final MessagePartData attachment = iterator.next();
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Basic/ |
| IdentifierTable.h | 399 /// \brief An iterator that walks over all of the known identifiers
402 /// Since this iterator uses an abstract interface via virtual
404 /// more standard C++ STL iterator interface. In this OO-style
407 /// operation. Subclasses of this iterator type will provide the
420 /// advances the iterator for the following string.
439 /// \brief Retrieve an iterator into the set of all identifiers
447 /// \returns A new iterator into the set of known identifiers. The
448 /// caller is responsible for deleting this iterator.
546 typedef HashTableTy::const_iterator iterator; typedef in class:clang::IdentifierTable
549 iterator begin() const { return HashTable.begin();
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Sema/ |
| CodeCompleteConsumer.h | 464 typedef const Chunk *iterator; typedef in class:clang::CodeCompletionString
465 iterator begin() const { return reinterpret_cast<const Chunk *>(this + 1); }
466 iterator end() const { return begin() + NumChunks; }
[all...] |
| Lookup.h | 127 typedef UnresolvedSetImpl::iterator iterator; typedef in class:clang::LookupResult
319 iterator begin() const { return iterator(Decls.begin()); }
320 iterator end() const { return iterator(Decls.end()); }
602 LookupResult::iterator I;
636 /// Erase the last element returned from this iterator.
696 for (iterator I = begin(), E = end(); I != E; ++I)
789 typedef llvm::mapped_iterator<decltype(Decls)::iterator, select_second
790 iterator; typedef in class:clang::ADLResult
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporter.h | 67 typedef VisitorList::iterator visitor_iterator;
376 typedef llvm::ilist<BugReport>::iterator iterator; typedef in class:clang::ento::BugReportEquivClass
379 iterator begin() { return Reports.begin(); }
380 iterator end() { return Reports.end(); }
451 /// \brief Iterator over the set of BugTypes tracked by the BugReporter.
452 typedef BugTypesTy::iterator iterator; typedef in class:clang::ento::BugReporter
453 iterator begin() { return BugTypes.begin(); }
454 iterator end() { return BugTypes.end();
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CoreEngine.h | 232 for (iterator I = Frontier.begin(), E = Frontier.end(); I != E; ++I) {
287 typedef ExplodedNodeSet::iterator iterator; typedef in class:clang::ento::NodeBuilder
289 inline iterator begin() {
294 inline iterator end() {
303 for (ExplodedNodeSet::iterator I = S.begin(), E = S.end(); I != E; ++I )
369 for (ExplodedNodeSet::iterator I = SrcSet.begin(),
460 class iterator { class in class:clang::ento::IndirectGotoNodeBuilder
464 iterator(CFGBlock::const_succ_iterator i) : I(i) {} function in class:clang::ento::IndirectGotoNodeBuilder::iterator
467 iterator &operator++() { ++I; return *this;
506 class iterator { class in class:clang::ento::SwitchNodeBuilder
510 iterator(CFGBlock::const_succ_reverse_iterator i) : I(i) {} function in class:clang::ento::SwitchNodeBuilder::iterator
[all...] |
| ExplodedGraph.h | 336 typedef NodeVector::iterator roots_iterator;
338 typedef NodeVector::iterator eop_iterator;
340 typedef AllNodesTy::iterator node_iterator;
422 typedef ImplTy::iterator iterator; typedef in class:clang::ento::ExplodedNodeSet
438 inline iterator begin() { return Impl.begin(); }
439 inline iterator end() { return Impl.end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseMap.h | 27 #include <iterator>
65 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT> iterator; typedef in class:llvm::DenseMapBase
68 inline iterator begin() {
70 return empty() ? end() : iterator(getBuckets(), getBucketsEnd(), *this);
72 inline iterator end() {
73 return iterator(getBucketsEnd(), getBucketsEnd(), *this, true);
130 iterator find(const_arg_type_t<KeyT> Val) {
133 return iterator(TheBucket, getBucketsEnd(), *this, true);
149 iterator find_as(const LookupKeyT &Val) {
152 return iterator(TheBucket, getBucketsEnd(), *this, true)
[all...] |
| SmallVector.h | 28 #include <iterator>
102 typedef T *iterator; typedef in class:llvm::SmallVectorTemplateCommon
106 typedef std::reverse_iterator<iterator> reverse_iterator;
113 // forward iterator creation methods.
115 iterator begin() { return (iterator)this->BeginX; }
119 iterator end() { return (iterator)this->EndX; }
124 iterator capacity_ptr() { return (iterator)this->CapacityX;
325 typedef typename SuperClass::iterator iterator; typedef in class:llvm::SmallVectorImpl
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 44 #include "llvm/ADT/iterator.h"
53 #include <iterator>
189 /// An iterator used for the edges to both entry nodes and child nodes.
190 class iterator class in class:llvm::LazyCallGraph::Edge::EdgeSequence
191 : public iterator_adaptor_base<iterator, VectorImplT::iterator,
196 VectorImplT::iterator E;
198 // Build the iterator for a specific position in the edge list.
199 iterator(VectorImplT::iterator BaseI, VectorImplT::iterator E function in class:llvm::LazyCallGraph::Edge::EdgeSequence::iterator
206 iterator() {} function in class:llvm::LazyCallGraph::Edge::EdgeSequence::iterator
464 typedef pointee_iterator<SmallVectorImpl<Node *>::const_iterator> iterator; typedef in class:llvm::LazyCallGraph::Edge::SCC
594 typedef pointee_iterator<SmallVectorImpl<SCC *>::const_iterator> iterator; typedef in class:llvm::LazyCallGraph::Edge::RefSCC
[all...] |
| LoopInfo.h | 129 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopBase
132 iterator begin() const { return SubLoops.begin(); }
133 iterator end() const { return SubLoops.end(); }
287 LoopT *removeChildLoop(iterator I) {
288 assert(I != SubLoops.end() && "Cannot remove end iterator!");
562 /// iterator/begin/end - The interface to the top-level loops in the current
565 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopInfoBase
568 iterator begin() const { return TopLevelLoops.begin(); }
569 iterator end() const { return TopLevelLoops.end(); }
616 LoopT *removeLoop(iterator I)
[all...] |
| RegionInfo.h | 544 /// These iterators iterator over all subregions of this Region.
546 typedef typename RegionSet::iterator iterator; typedef in class:llvm::RegionBase
549 iterator begin() { return children.begin(); }
550 iterator end() { return children.end(); }
559 /// Region. The iterator also iterates over BasicBlocks that are elements of
560 /// a subregion of this Region. It is therefore called a flat iterator.
573 // Construct the begin iterator.
582 // Construct the end iterator.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| Function.h | 54 typedef BasicBlockListType::iterator iterator; typedef in class:llvm::Function
538 // BasicBlock iterator forwarding functions
540 iterator begin() { return BasicBlocks.begin(); }
542 iterator end () { return BasicBlocks.end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/MC/ |
| MCAssembler.h | 14 #include "llvm/ADT/iterator.h"
67 typedef pointee_iterator<SectionListType::iterator> iterator; typedef in class:llvm::MCAssembler
71 typedef pointee_iterator<SymbolDataListType::iterator> symbol_iterator;
78 typedef std::vector<IndirectSymbolData>::iterator indirect_symbol_iterator;
82 typedef std::vector<DataRegionData>::iterator data_region_iterator;
303 iterator begin() { return Sections.begin(); }
306 iterator end() { return Sections.end(); }
|
| MCRegisterInfo.h | 35 typedef const MCPhysReg* iterator; typedef in class:llvm::MCRegisterClass
38 const iterator RegsBegin;
54 iterator begin() const { return RegsBegin; }
55 iterator end() const { return RegsBegin + RegsSize; }
189 /// DiffListIterator - Base iterator class that can traverse the
198 /// Create an invalid iterator. Call init() to point to something useful.
201 /// init - Point the iterator to InitVal, decoding subsequent values from
202 /// DiffList. The iterator will initially point to InitVal, sub-classes are
220 /// isValid - returns true if this iterator is not yet at the end.
223 /// Dereference the iterator to get the value at the current position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 36 #include <iterator>
111 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::iterator iterator; typedef in class:llvm::DomTreeNodeBase
115 iterator begin() { return Children.begin(); }
116 iterator end() { return Children.end(); }
158 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
651 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
|
| OnDiskHashTable.h | 320 class iterator { class in class:llvm::OnDiskChainedHashTable
327 iterator() : Key(), Data(nullptr), Len(0), InfoObj(nullptr) {} function in class:llvm::OnDiskChainedHashTable::iterator
328 iterator(const internal_key_type K, const unsigned char *D, offset_type L, function in class:llvm::OnDiskChainedHashTable::iterator
337 bool operator==(const iterator &X) const { return X.Data == Data; }
338 bool operator!=(const iterator &X) const { return X.Data != Data; }
342 iterator find(const external_key_type &EKey, Info *InfoPtr = nullptr) {
349 iterator find_hashed(const internal_key_type &IKey, hash_value_type KeyHash,
362 return iterator(); // Empty bucket.
396 return iterator(X, Items + L.first, L.second, InfoPtr);
399 return iterator();
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Basic/ |
| IdentifierTable.h | 412 /// \brief An iterator that walks over all of the known identifiers
415 /// Since this iterator uses an abstract interface via virtual
417 /// more standard C++ STL iterator interface. In this OO-style
420 /// operation. Subclasses of this iterator type will provide the
433 /// advances the iterator for the following string.
452 /// \brief Retrieve an iterator into the set of all identifiers
460 /// \returns A new iterator into the set of known identifiers. The
461 /// caller is responsible for deleting this iterator.
559 typedef HashTableTy::const_iterator iterator; typedef in class:clang::IdentifierTable
562 iterator begin() const { return HashTable.begin();
[all...] |
