| /external/guava/guava-tests/test/com/google/common/collect/ |
| FluentIterableTest.java | 40 import java.util.Iterator;
84 public Iterator<Integer> iterator() {
85 return asList(0, 1).iterator();
94 @Override public Iterator<Integer> iterator() {
153 // We left the last iterator pointing to "b". But a new iterator should
155 assertEquals("a", cycle.iterator().next());
160 Iterator<Integer> iterator = cycle.iterator() local
[all...] |
| ForwardingCollectionTest.java | 176 forward.iterator();
177 assertEquals("[iterator]", getCalls());
|
| ForwardingMultisetTest.java | 32 import java.util.Iterator;
123 @Override public Iterator<T> iterator() { method in class:ForwardingMultisetTest.StandardImplForwardingMultiset
246 @Override public Iterator<String> iterator() {
314 forward().iterator();
315 assertEquals("[iterator]", getCalls());
|
| SynchronizedDequeTest.java | 23 import java.util.Iterator;
74 public Iterator<E> iterator() { method in class:SynchronizedDequeTest.TestDeque
75 // We explicitly don't lock for iterator()
77 return delegate.iterator();
249 public Iterator<E> descendingIterator() {
271 create().iterator();
|
| TreeMultimapExplicitTest.java | 30 import java.util.Iterator;
145 Iterator<Map.Entry<String, Collection<Integer>>> iterator = local
146 multimap.asMap().entrySet().iterator();
147 Map.Entry<String, Collection<Integer>> entry = iterator.next();
150 entry = iterator.next();
153 entry = iterator.next();
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| CollationThaiTest.java | 249 CollationElementIterator iterator local
251 CollationTest.backAndForth(this, iterator);
|
| Counter.java | 16 import java.util.Iterator;
155 //Iterator<T> it = map.keySet().iterator();
167 public Iterator<T> iterator() { method in class:Counter
168 return map.keySet().iterator();
198 Iterator<T> i = map.keySet().iterator();
199 Iterator<T> j = o.map.keySet().iterator();
[all...] |
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| CollationThaiTest.java | 246 CollationElementIterator iterator local
248 CollationTest.backAndForth(this, iterator);
|
| Counter.java | 15 import java.util.Iterator;
152 //Iterator<T> it = map.keySet().iterator();
164 public Iterator<T> iterator() { method in class:Counter
165 return map.keySet().iterator();
195 Iterator<T> i = map.keySet().iterator();
196 Iterator<T> j = o.map.keySet().iterator();
[all...] |
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| CanonicalCharacterData.java | 31 CanonicalIterator iterator = new CanonicalIterator(char32); local
36 for (String equiv = iterator.next(); equiv != null; equiv = iterator.next()) {
|
| /external/javassist/src/main/javassist/ |
| CodeConverter.java | 502 CodeIterator iterator = codeAttr.iterator(); local
503 while (iterator.hasNext()) {
505 int pos = iterator.next();
507 pos = t.transform(clazz, pos, iterator, cp);
|
| CtBehavior.java | 697 CodeIterator iterator = ca.iterator(); local
716 int pos = iterator.insertEx(b.get());
717 iterator.insert(b.getExceptionTable(), pos);
768 CodeIterator iterator = ca.iterator(); local
790 int gapPos = iterator.append(b.get());
791 iterator.append(b.getExceptionTable(), gapPos);
796 int gapLen = iterator.getCodeLength() - gapPos - handlerLen;
797 int subr = iterator.getCodeLength() - gapLen
1010 CodeIterator iterator = ca.iterator(); local
1118 CodeIterator iterator = ca.iterator(); local
[all...] |
| /external/javassist/src/main/javassist/expr/ |
| NewExpr.java | 45 int c = iterator.byteAt(pos);
46 int index = iterator.u16bitAt(pos + 1);
105 int methodIndex = iterator.u16bitAt(currentPos + 1); // constructor
114 int index = iterator.u16bitAt(currentPos + 1);
134 int index = iterator.u16bitAt(currentPos + 1);
141 int op = iterator.byteAt(newPos + 3);
145 && iterator.byteAt(newPos + 4) == Opcode.SWAP)
167 int newIndex = iterator.u16bitAt(pos + 1);
174 iterator.writeByte(NOP, i);
178 int methodIndex = iterator.u16bitAt(pos + 1); // constructo
[all...] |
| /external/junit/src/main/java/org/junit/experimental/theories/internal/ |
| AllMembersSupplier.java | 7 import java.util.Iterator;
142 Iterator<?> iterator = iterable.iterator(); local
144 while (iterator.hasNext()) {
145 Object value = iterator.next();
|
| /external/libbrillo/brillo/glib/ |
| object.h | 347 typedef value_type* iterator; typedef in class:brillo::glib::ScopedPtrArray
362 iterator begin() {
363 return iterator(object_ ? object_->pdata : nullptr);
365 iterator end() {
431 // Container. The standard for an associative container would have an iterator
|
| /external/libchrome/base/containers/ |
| mru_cache.h | 58 typename PayloadList::iterator,
64 typedef typename PayloadList::iterator iterator; typedef in class:base::MRUCacheBase
82 // the same key, it is removed prior to insertion. An iterator indicating the
87 iterator Put(const KeyType& key, Payload&& payload) {
89 typename KeyIndex::iterator index_iter = index_.find(key);
108 iterator Get(const KeyType& key) {
109 typename KeyIndex::iterator index_iter = index_.find(key);
112 typename PayloadList::iterator iter = index_iter->second;
121 iterator Peek(const KeyType& key)
[all...] |
| small_map.h | 225 class iterator { class in class:base::SmallMap
227 typedef typename NormalMap::iterator::iterator_category iterator_category;
228 typedef typename NormalMap::iterator::value_type value_type;
229 typedef typename NormalMap::iterator::difference_type difference_type;
230 typedef typename NormalMap::iterator::pointer pointer;
231 typedef typename NormalMap::iterator::reference reference;
233 inline iterator(): array_iter_(NULL) {} function in class:base::SmallMap::iterator
235 inline iterator& operator++() {
243 inline iterator operator++(int /*unused*/) {
244 iterator result(*this)
295 inline explicit iterator(ManualConstructor<value_type>* init) function in class:base::SmallMap::iterator
297 inline explicit iterator(const typename NormalMap::iterator& init) function in class:base::SmallMap::iterator
[all...] |
| /external/libchrome/base/ |
| id_map.h | 71 typename HashTable::iterator i = data_.find(id);
89 typename HashTable::iterator i = data_.find(id);
101 for (typename HashTable::iterator i = data_.begin();
134 class Iterator {
136 Iterator(IDMap<V, K>* map) : map_(map), iter_(map_->data_.begin()) {
140 Iterator(const Iterator& iter)
146 const Iterator& operator=(const Iterator& iter) {
153 ~Iterator() {
204 typedef Iterator<T> iterator; typedef in class:final
[all...] |
| /external/libcxx/test/support/ |
| nasty_containers.hpp | 27 typedef typename nested_container::iterator iterator; typedef in class:nasty_vector
54 iterator begin() TEST_NOEXCEPT { return v_.begin(); }
56 iterator end() TEST_NOEXCEPT { return v_.end(); }
98 template <class... Args> iterator emplace(const_iterator pos, Args&&... args)
102 iterator insert(const_iterator pos, const value_type& x) { return v_.insert(pos, x); }
104 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); }
106 iterator insert(const_iterator pos, size_type n, const value_type& x) { return v_.insert(pos, n, x); }
108 iterator insert(const_iterator pos, InputIterator first, InputIterator last)
112 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return v_.insert(pos, il);
149 typedef typename nested_container::iterator iterator; typedef in class:nasty_list
[all...] |
| /external/libmicrohttpd/src/microspdy/ |
| applicationlayer.c | 71 struct SPDY_NameValue * iterator = stream->headers; local
91 while(iterator != NULL)
93 if(strcmp(":method",iterator->name) == 0)
95 if(1 != iterator->num_values)
97 method = iterator->value[0];
99 else if(strcmp(":path",iterator->name) == 0)
101 if(1 != iterator->num_values)
103 path = iterator->value[0];
105 else if(strcmp(":version",iterator->name) == 0)
107 if(1 != iterator->num_values
[all...] |
| /external/libmojo/base/android/java/src/org/chromium/base/ |
| ObserverList.java | 8 import java.util.Iterator;
17 * This container can be modified during iteration without invalidating the iterator.
23 * - The iterator implements NOTIFY_EXISTING_ONLY.
24 * - The range-based for loop is left to the clients to implement in terms of iterator().
34 * Extended iterator interface that provides rewind functionality.
36 public interface RewindableIterator<E> extends Iterator<E> {
38 * Rewind the iterator back to the beginning.
40 * If we need to iterate multiple times, we can avoid iterator object reallocation by using
68 // cannot use the underlying list's iterator to iterate over the list.
124 public Iterator<E> iterator() method in class:ObserverList
[all...] |
| /external/libphonenumber/demo/src/com/google/phonenumbers/ |
| PhoneNumberParserServlet.java | 73 FileItemIterator iterator = upload.getItemIterator(req); local
74 while (iterator.hasNext()) {
75 FileItemStream item = iterator.next();
|
| /external/llvm/include/llvm/ADT/ |
| DenseSet.h | 80 class Iterator {
81 typename MapTy::iterator I;
85 typedef typename MapTy::iterator::difference_type difference_type;
91 Iterator(const typename MapTy::iterator &i) : I(i) {}
96 Iterator& operator++() { ++I; return *this; }
97 Iterator operator++(int) { auto T = *this; ++I; return T; }
98 bool operator==(const Iterator& X) const { return I == X.I; }
99 bool operator!=(const Iterator& X) const { return I != X.I; }
124 typedef Iterator iterator typedef in class:llvm::DenseSet
[all...] |
| EquivalenceClasses.h | 43 /// for (EquivalenceClasses<int>::iterator I = EC.begin(), E = EC.end();
125 for (iterator I = RHS.begin(), E = RHS.end(); I != E; ++I)
139 /// iterator* - Provides a way to iterate over all values in the set.
140 typedef typename std::set<ECValue>::const_iterator iterator; typedef in class:llvm::EquivalenceClasses
141 iterator begin() const { return TheMapping.begin(); }
142 iterator end() const { return TheMapping.end(); }
149 member_iterator member_begin(iterator I) const {
157 /// findValue - Return an iterator to the specified value. If it does not
159 iterator findValue(const ElemTy &V) const {
185 for (iterator I = begin(), E = end(); I != E; ++I
[all...] |
| ImmutableList.h | 81 class iterator { class in class:llvm::ImmutableList
84 iterator() : L(nullptr) {} 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(X);
[all...] |
