| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| CopyOnWriteArraySet.java | 40 import java.util.Iterator;
164 * are returned by its iterator, this method must return the
196 * are returned by its iterator, this method must return the elements
379 * Returns an iterator over the elements contained in this set
382 * <p>The returned iterator provides a snapshot of the state of the set
383 * when the iterator was constructed. No synchronization is needed while
384 * traversing the iterator. The iterator does <em>NOT</em> support the
387 * @return an iterator over the elements in this set
389 public Iterator<E> iterator() method in class:CopyOnWriteArraySet
[all...] |
| /packages/apps/Dialer/java/com/android/voicemail/impl/scheduling/ |
| TaskQueue.java | 28 import java.util.Iterator;
146 public Iterator<Task> iterator() { method in class:TaskQueue
147 return queue.iterator();
|
| /packages/apps/DocumentsUI/src/com/android/documentsui/clipping/ |
| ClipStorageReader.java | 67 public Iterator iterator() { method in class:ClipStorageReader
68 return new Iterator(mScanner);
92 private static final class Iterator implements java.util.Iterator {
95 private Iterator(Scanner scanner) {
|
| /packages/apps/DocumentsUI/src/com/android/documentsui/selection/ |
| Selection.java | 28 import java.util.Iterator;
83 * Returns an {@link Iterator} that iterators over the selection, *excluding*
89 public Iterator<String> iterator() { method in class:Selection
90 return mSelection.iterator();
|
| /packages/apps/Settings/tests/uitests/src/com/android/settings/ui/ |
| AboutPhoneSettingsTests.java | 44 import java.util.Iterator;
109 for (Iterator<String> iterator = itemsLeftToFind.iterator(); iterator.hasNext(); ) {
110 String itemText = iterator.next();
113 iterator.remove();
|
| /platform_testing/libraries/metrics-helper/src/android/support/test/metricshelper/ |
| MetricsAsserts.java | 26 import java.util.Iterator;
156 public Iterator<LogMaker> iterator() { method in class:MetricsAsserts.ReaderQueue
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/AST/ |
| UnresolvedSet.h | 21 #include "llvm/ADT/iterator.h"
25 /// The iterator over UnresolvedSets. Serves as both the const and
26 /// non-const iterator.
72 // We don't currently support assignment through this iterator, so we might
74 typedef UnresolvedSetIterator iterator; typedef in class:clang::UnresolvedSetImpl
77 iterator begin() { return iterator(decls().begin()); }
78 iterator end() { return iterator(decls().end()); }
95 for (DeclsTy::iterator I = decls().begin(), E = decls().end(); I != E; ++I
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/ |
| CallGraph.h | 70 typedef FunctionMapTy::iterator iterator; typedef in class:clang::CallGraph
72 iterator begin() { return FunctionMap.begin(); }
73 iterator end() { return FunctionMap.end(); }
87 typedef llvm::SetVector<CallGraphNode *>::iterator nodes_iterator;
148 typedef SmallVectorImpl<CallRecord>::iterator iterator; typedef in class:clang::CallGraphNode
152 inline iterator begin() { return CalledFunctions.begin(); }
153 inline iterator end() { return CalledFunctions.end(); }
177 typedef NodeType::iterator ChildIteratorType
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Basic/ |
| FileSystemStatCache.h | 119 iterator; typedef in class:clang::MemorizeStatCalls
121 iterator begin() const { return StatCalls.begin(); }
122 iterator end() const { return StatCalls.end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Driver/ |
| Job.h | 16 #include "llvm/ADT/iterator.h"
170 typedef llvm::pointee_iterator<list_type::iterator> iterator; typedef in class:clang::driver::JobList
190 iterator begin() { return Jobs.begin(); }
192 iterator end() { return Jobs.end(); }
|
| Multilib.h | 98 typedef multilib_list::iterator iterator; typedef in class:clang::driver::MultilibSet
142 iterator begin() { return Multilibs.begin(); }
145 iterator end() { return Multilibs.end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Rewrite/Core/ |
| RewriteRope.h | 23 #include <iterator>
89 public std::iterator<std::forward_iterator_tag, const char, ptrdiff_t> {
98 // begin iterator.
100 // end iterator
145 typedef RopePieceBTreeIterator iterator; typedef in class:clang::RopePieceBTree
146 iterator begin() const { return iterator(Root); }
147 iterator end() const { return iterator(); }
180 typedef RopePieceBTree::iterator iterator typedef in class:clang::RewriteRope
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Sema/ |
| IdentifierResolver.h | 45 inline DeclsTy::iterator decls_begin() { return Decls.begin(); }
46 inline DeclsTy::iterator decls_end() { return Decls.end(); }
55 void InsertDecl(DeclsTy::iterator Pos, NamedDecl *D) {
65 /// iterator - Iterate over the decls of a specified declaration name.
68 class iterator { class in class:clang::IdentifierResolver
78 /// 2) A IdDeclInfo::DeclsTy::iterator that traverses only the decls of the
81 typedef IdDeclInfo::DeclsTy::iterator BaseIter;
84 iterator(NamedDecl *D) { function in class:clang::IdentifierResolver::iterator
88 /// A IdDeclInfo::DeclsTy::iterator that walks or not the parent declaration
90 iterator(BaseIter I) function in class:clang::IdentifierResolver::iterator
105 iterator() : Ptr(0) {} function in class:clang::IdentifierResolver::iterator
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| MapVector.h | 40 typedef typename VectorType::iterator iterator; typedef in class:llvm::MapVector
53 iterator begin() { return Vector.begin(); }
55 iterator end() { return Vector.end(); }
84 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
101 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
103 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
113 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
116 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
131 iterator find(const KeyT &Key)
[all...] |
| 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 pointing to the existing element
[all...] |
| StringRef.h | 49 typedef const char *iterator; typedef in class:llvm::StringRef
103 iterator begin() const { return Data; }
105 iterator end() const { return Data + Length; }
|
| TinyPtrVector.h | 19 #include <iterator>
170 typedef EltTy *iterator; typedef in class:llvm::TinyPtrVector
172 typedef std::reverse_iterator<iterator> reverse_iterator;
175 iterator begin() {
182 iterator end() {
272 iterator erase(iterator I) {
273 assert(I >= begin() && "Iterator to erase is out of bounds.");
274 assert(I < end() && "Erasing at past-the-end iterator.");
288 iterator erase(iterator S, iterator E)
[all...] |
| ilist_iterator.h | 1 //===- llvm/ADT/ilist_iterator.h - Intrusive List Iterator -------*- C++ -*-==//
16 #include <iterator>
54 /// Iterator for intrusive lists based on ilist_node.
88 // This is templated so that we can allow constructing a const iterator from
89 // a nonconst iterator...
96 // This is templated so that we can allow assigning to a const iterator from
97 // a nonconst iterator...
108 /// boundaries. The resulting iterator will dereference (and have a handle)
117 /// Get a reverse iterator to the same node.
119 /// Gives a reverse iterator that will dereference (and have a handle) to th
187 typedef ilist_iterator<OptionsT, false, IsConst> iterator; typedef in struct:llvm::simplify_type
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 72 typedef typename DomSetMapType::iterator iterator; typedef in class:llvm::DominanceFrontierBase
74 iterator begin() { return Frontiers.begin(); }
76 iterator end() { return Frontiers.end(); }
78 iterator find(BlockT *B) { return Frontiers.find(B); }
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier) {
89 void addToFrontier(iterator I, BlockT *Node);
91 void removeFromFrontier(iterator I, BlockT *Node);
142 typedef DominanceFrontierBase<BasicBlock>::iterator iterator; typedef in class:llvm::DominanceFrontier
[all...] |
| IVUsers.h | 143 typedef ilist<IVStrideUse>::iterator iterator; typedef in class:llvm::IVUsers
145 iterator begin() { return IVUses.begin(); }
146 iterator end() { return IVUses.end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDie.h | 14 #include "llvm/ADT/iterator.h"
24 #include <iterator>
262 /// Get an iterator range to all attributes in the current DIE only.
264 /// \returns an iterator range for the attributes of the current DIE.
267 class iterator;
269 iterator begin() const;
270 iterator end() const;
271 iterator_range<iterator> children() const;
287 /// error will be set if the Err member variable is non-NULL and the iterator
310 class DWARFDie::iterator : public iterator_facade_base<iterator class in class:llvm::DWARFDie
321 explicit iterator(DWARFDie D) : Die(D) { function in class:llvm::DWARFDie::iterator
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 33 // External storage for depth first iterator that reuses the info lookup map
41 typedef typename BaseSet::iterator iterator; typedef in struct:llvm::df_iterator_dom_storage
42 std::pair<iterator, bool> insert(NodeRef N) {
|
| Registry.h | 51 class iterator;
63 friend class iterator;
84 class iterator { class in class:llvm::Registry
88 explicit iterator(const node *N) : Cur(N) {} function in class:llvm::Registry::iterator
90 bool operator==(const iterator &That) const { return Cur == That.Cur; }
91 bool operator!=(const iterator &That) const { return Cur != That.Cur; }
92 iterator &operator++() { Cur = Cur->Next; return *this; }
99 static iterator begin();
100 static iterator end() { return iterator(nullptr);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/AST/ |
| UnresolvedSet.h | 21 #include "llvm/ADT/iterator.h"
25 /// The iterator over UnresolvedSets. Serves as both the const and
26 /// non-const iterator.
72 // We don't currently support assignment through this iterator, so we might
74 typedef UnresolvedSetIterator iterator; typedef in class:clang::UnresolvedSetImpl
77 iterator begin() { return iterator(decls().begin()); }
78 iterator end() { return iterator(decls().end()); }
95 for (DeclsTy::iterator I = decls().begin(), E = decls().end(); I != E; ++I
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Analysis/ |
| CallGraph.h | 70 typedef FunctionMapTy::iterator iterator; typedef in class:clang::CallGraph
72 iterator begin() { return FunctionMap.begin(); }
73 iterator end() { return FunctionMap.end(); }
87 typedef llvm::SetVector<CallGraphNode *>::iterator nodes_iterator;
148 typedef SmallVectorImpl<CallRecord>::iterator iterator; typedef in class:clang::CallGraphNode
152 inline iterator begin() { return CalledFunctions.begin(); }
153 inline iterator end() { return CalledFunctions.end(); }
177 typedef NodeType::iterator ChildIteratorType
[all...] |
