/libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/ |
H A D | TestData.java | 48 default Iterator<T> iterator() { method in interface:TestData 49 return Spliterators.iterator(spliterator()); 295 public PrimitiveIterator.OfInt iterator() { method in class:TestData.AbstractTestData.IntTestData 296 return Spliterators.iterator(spliterator()); 320 public PrimitiveIterator.OfLong iterator() { method in class:TestData.AbstractTestData.LongTestData 321 return Spliterators.iterator(spliterator()); 345 public PrimitiveIterator.OfDouble iterator() { method in class:TestData.AbstractTestData.DoubleTestData 346 return Spliterators.iterator(spliterator());
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | OldCollectionsTest.java | 377 public Iterator iterator() { method in class:OldCollectionsTest.Mock_Collection 433 public Iterator iterator() { method in class:OldCollectionsTest.Mock_WrongCollection
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | ProcessEnvironment.java | 328 public Iterator<Map.Entry<String,String>> iterator() { method in class:ProcessEnvironment.StringEntrySet 330 Iterator<Map.Entry<Variable,Value>> i = s.iterator(); 370 public Iterator<String> iterator() { method in class:ProcessEnvironment.StringValues 372 Iterator<Value> i = c.iterator(); 397 public Iterator<String> iterator() { method in class:ProcessEnvironment.StringKeySet 399 Iterator<Variable> i = s.iterator();
|
/libcore/ojluni/src/main/java/java/text/ |
H A D | MessageFormat.java | 1350 * <code>iterator</code> to the StringBuffer <code>result</code>. 1352 private void append(StringBuffer result, CharacterIterator iterator) { argument 1353 if (iterator.first() != CharacterIterator.DONE) { 1356 result.append(iterator.first()); 1357 while ((aChar = iterator.next()) != CharacterIterator.DONE) {
|
H A D | AttributedString.java | 98 AttributedCharacterIterator iterator = iterators[counter]; 99 int start = iterator.getBeginIndex(); 100 int end = iterator.getEndIndex(); 104 iterator.setIndex(index); 106 Map<Attribute,Object> attrs = iterator.getAttributes(); 112 index = iterator.getRunLimit(); 164 Iterator<? extends Map.Entry<? extends Attribute, ?>> iterator = attributes.entrySet().iterator(); 165 while (iterator.hasNext()) { 166 Map.Entry<? extends Attribute, ?> entry = iterator 689 appendContents(StringBuffer buf, CharacterIterator iterator) argument [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | ArrayDeque.java | 59 * {@link #iterator iterator.remove()}, 62 * <p>The iterators returned by this class's {@link #iterator() iterator} 64 * the iterator is created, in any way except through the iterator's own 65 * {@code remove} method, the iterator will generally throw a {@link 67 * modification, the iterator fails quickly and cleanly, rather than risking 71 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed 79 * <p>This class and its iterator implemen 587 public Iterator<E> iterator() { method in class:ArrayDeque [all...] |
H A D | 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 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...] |
H A D | PriorityQueue.java | 54 * <p>This class and its iterator implement all of the 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 521 * The modCount value that the iterator believes that the backing 522 * Queue should have. If this expectation is violated, the iterator 608 * position before i. This fact is used by iterator [all...] |
H A D | ArrayList.java | 42 * <tt>iterator</tt>, and <tt>listIterator</tt> operations run in constant 75 * The iterators returned by this class's {@link #iterator() iterator} and 77 * if the list is structurally modified at any time after the iterator is 78 * created, in any way except through the iterator's own 80 * {@link ListIterator#add(Object) add} methods, the iterator will throw a 82 * concurrent modification, the iterator fails quickly and cleanly, rather 86 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed 185 * iterator. 602 * specified collection's iterator 833 public Iterator<E> iterator() { method in class:ArrayList 1110 public Iterator<E> iterator() { method in class:ArrayList.SubList [all...] |
H A D | Hashtable.java | 87 * <p>The iterators returned by the <tt>iterator</tt> method of the collections 90 * after the iterator is created, in any way except through the iterator's own 91 * <tt>remove</tt> method, the iterator will throw a {@link 93 * modification, the iterator fails quickly and cleanly, rather than risking 98 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed 581 Iterator<Map.Entry<K,V>> it = entrySet().iterator(); 631 * the iterator's own <tt>remove</tt> operation), the results of 648 public Iterator<K> iterator() { method in class:Hashtable.KeySet 670 * the iterator' 688 public Iterator<Map.Entry<K,V>> iterator() { method in class:Hashtable.EntrySet 770 public Iterator<V> iterator() { method in class:Hashtable.ValueCollection 1344 boolean iterator; field in class:Hashtable.Enumerator 1353 Enumerator(int type, boolean iterator) argument [all...] |
H A D | IdentityHashMap.java | 99 * <p>The iterators returned by the <tt>iterator</tt> method of the 102 * at any time after the iterator is created, in any way except 103 * through the iterator's own <tt>remove</tt> method, the iterator 105 * face of concurrent modification, the iterator fails quickly and 109 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed 760 // traversed by this iterator. We cannot allow future 975 public Iterator<K> iterator() { method in class:IdentityHashMap.KeySet 997 for (Iterator<K> i = iterator(); i.hasNext(); ) { 1081 public Iterator<V> iterator() { method in class:IdentityHashMap.Values 1185 public Iterator<Map.Entry<K,V>> iterator() { method in class:IdentityHashMap.EntrySet [all...] |
H A D | Vector.java | 49 * The iterators returned by this class's {@link #iterator() iterator} and 51 * if the vector is structurally modified at any time after the iterator is 52 * created, in any way except through the iterator's own 54 * {@link ListIterator#add(Object) add} methods, the iterator will throw a 56 * concurrent modification, the iterator fails quickly and cleanly, rather 61 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed 163 * iterator. 942 * iterator. 1081 * Returns a list iterator ove 1117 public synchronized Iterator<E> iterator() { method in class:Vector [all...] |
H A D | WeakHashMap.java | 105 * <p>The iterators returned by the <tt>iterator</tt> method of the collections 108 * iterator is created, in any way except through the iterator's own 109 * <tt>remove</tt> method, the iterator will throw a {@link 111 * modification, the iterator fails quickly and cleanly, rather than risking 114 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed 858 * the iterator's own <tt>remove</tt> operation), the results of 876 public Iterator<K> iterator() { method in class:WeakHashMap.KeySet 911 * (except through the iterator's own <tt>remove</tt> operation), 929 public Iterator<V> iterator() { method in class:WeakHashMap.Values 970 public Iterator<Map.Entry<K,V>> iterator() { method in class:WeakHashMap.EntrySet [all...] |
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedQueue.java | 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> 246 * added in traversal order of the collection's iterator. 502 * collection's iterator. Attempts to {@code addAll} of a queue to 676 * Returns an iterator over the elements in this queue in proper sequence. 679 * <p>The returned iterator is 682 * @return an iterator over the elements in this queue in proper sequence 684 public Iterator<E> iterator() { method in class:ConcurrentLinkedQueue [all...] |
H A D | CopyOnWriteArrayList.java | 68 * concurrent threads. The "snapshot" style iterator method uses a 69 * reference to the state of the array at the point that the iterator 71 * iterator, so interference is impossible and the iterator is 73 * The iterator will not reflect additions, removals, or changes to 74 * the list since the iterator was created. Element-changing 131 * iterator. 721 * specified collection's iterator. 765 * collection's iterator. 797 * specified collection's iterator 1010 public Iterator<E> iterator() { method in class:CopyOnWriteArrayList 1282 public Iterator<E> iterator() { method in class:CopyOnWriteArrayList.COWSubList [all...] |
H A D | LinkedBlockingQueue.java | 72 * <p>This class and its iterator implement all of the 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 758 * Basic weakly-consistent iterator. At all times hold the next
|
H A D | PriorityBlockingQueue.java | 67 * <p>This class and its iterator implement all of the 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 859 * Snapshot iterator that works off copy of underlying q array.
|
H A D | ArrayBlockingQueue.java | 77 * <p>This class and its iterator implement all of the 125 * iterator state. 181 * Utility for remove(Object) and iterator.remove. 251 * added in traversal order of the collection's iterator. 709 * Returns an iterator over the elements in this queue in proper sequence. 712 * <p>The returned iterator is 715 * @return an iterator over the elements in this queue in proper sequence 717 public Iterator<E> iterator() { method in class:ArrayBlockingQueue 730 * this, when a queue has one or more iterators, it keeps iterator 739 * These suffice to eliminate iterator inconsistencie 780 Node(Itr iterator, Node next) argument [all...] |
H A D | ConcurrentLinkedDeque.java | 74 * to be performed atomically. For example, an iterator operating 78 * <p>This class and its iterator implement all of the <em>optional</em> 165 * may remain reachable indefinitely from an iterator. 183 * iterator, but unlike unlinked nodes, are never reachable from 202 * indefinitely (for example by an iterator). We must ensure that 811 * collection's iterator. 1145 * collection's iterator. Attempts to {@code addAll} of a deque to 1330 * Returns an iterator over the elements in this deque in proper sequence. 1333 * <p>The returned iterator is 1336 * @return an iterator ove 1338 public Iterator<E> iterator() { method in class:ConcurrentLinkedDeque [all...] |
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | DoublePipeline.java | 172 public final PrimitiveIterator.OfDouble iterator() { method in class:DoublePipeline 173 return Spliterators.iterator(spliterator());
|
H A D | IntPipeline.java | 176 public final PrimitiveIterator.OfInt iterator() { method in class:IntPipeline 177 return Spliterators.iterator(spliterator());
|
H A D | IntStream.java | 680 PrimitiveIterator.OfInt iterator(); method in interface:IntStream 743 final PrimitiveIterator.OfInt iterator = new PrimitiveIterator.OfInt() { 759 iterator,
|
H A D | LongPipeline.java | 173 public final PrimitiveIterator.OfLong iterator() { method in class:LongPipeline 174 return Spliterators.iterator(spliterator());
|
H A D | LongStream.java | 672 PrimitiveIterator.OfLong iterator(); method in interface:LongStream 735 final PrimitiveIterator.OfLong iterator = new PrimitiveIterator.OfLong() { 751 iterator,
|
H A D | ReferencePipeline.java | 139 public final Iterator<P_OUT> iterator() { method in class:ReferencePipeline 140 return Spliterators.iterator(spliterator());
|