/libcore/json/src/main/java/org/json/ |
H A D | JSONArray.java | 72 for (Iterator it = copyFrom.iterator(); it.hasNext();) {
|
H A D | JSONObject.java | 89 * <li>show up in the {@link #keys} iterator 648 * Returns an iterator of the {@code String} names in this object. The 649 * returned iterator supports {@link Iterator#remove() remove}, which will 651 * modified after the iterator is returned, the iterator's behavior is 655 return nameValuePairs.keySet().iterator(); 661 * the corresponding mapping from this object and set iterator behaviour
|
/libcore/luni/src/main/java/java/security/ |
H A D | Signature.java | 293 for (Iterator<String> i = ce.iterator(); i.hasNext();) {
|
/libcore/luni/src/main/java/java/util/ |
H A D | HugeEnumSet.java | 241 public Iterator<E> iterator() { method in class:HugeEnumSet
|
H A D | HashMap.java | 42 * <p>The {@code Iterator} created by calling the {@code iterator} method 44 * changed while an iterator is used to iterate over the elements. Only the 45 * {@code remove} method that is provided by the iterator allows for removal of 687 * AbstractCollection. The iterator method of this subclass returns a 688 * "wrapper object" over the iterator of map's entrySet(). The {@code size} 893 public Iterator<K> iterator() { method in class:HashMap.KeySet 916 public Iterator<V> iterator() { method in class:HashMap.Values 934 public Iterator<Entry<K, V>> iterator() { method in class:HashMap.EntrySet
|
H A D | Locale.java | 1750 Iterator<Map.Entry<Character, String>> entryIterator = extensionsMap.entrySet().iterator(); 1912 Iterator<String> attributesIterator = attributes.iterator(); 1928 Iterator<Map.Entry<String, String>> keywordsIterator = keywords.entrySet().iterator();
|
H A D | ArrayDeque.java | 24 * removeLastOccurrence}, {@link #contains contains}, {@link #iterator 25 * iterator.remove()}, and the bulk operations, all of which run in linear 28 * <p>The iterators returned by this class's <tt>iterator</tt> method are 29 * <i>fail-fast</i>: If the deque is modified at any time after the iterator 30 * is created, in any way except through the iterator's own <tt>remove</tt> 31 * method, the iterator will generally throw a {@link 33 * modification, the iterator fails quickly and cleanly, rather than risking 37 * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed 45 * <p>This class and its iterator implement all of the 172 * iterator 571 public Iterator<E> iterator() { method in class:ArrayDeque [all...] |
H A D | LinkedList.java | 326 * returned from the collection's iterator. 970 Iterator<E> it = iterator();
|
/libcore/luni/src/main/java/libcore/net/url/ |
H A D | FtpURLConnection.java | 185 Iterator<Proxy> iter = proxyList.iterator();
|
/libcore/luni/src/test/java/libcore/javax/net/ssl/ |
H A D | SSLSessionContextTest.java | 175 Iterator<String> i = uniqueCipherSuites.iterator();
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | ArrayListTest.java | 386 Iterator i = setWithNulls.iterator(); 867 Iterator it = al.iterator(); 1057 Iterator<T> i = iterator();
|
H A D | RefSortedMap.java | 111 public Iterator<java.util.Map.Entry<K, V>> iterator() {
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | DelayQueueTest.java | 595 * iterator iterates through all elements 600 Iterator it = q.iterator(); 609 * iterator.remove removes current element 616 Iterator it = q.iterator(); 619 it = q.iterator();
|
H A D | LinkedBlockingDequeTest.java | 1493 * iterator iterates through all elements 1497 Iterator it = q.iterator(); 1504 * iterator.remove removes current element 1512 Iterator it = q.iterator(); 1516 it = q.iterator(); 1523 * iterator ordering is FIFO 1532 for (Iterator it = q.iterator(); it.hasNext();) { 1546 for (Iterator it = q.iterator(); it.hasNext();) { 1554 * Descending iterator iterates through all elements 1573 * Descending iterator orderin [all...] |
/libcore/dom/src/test/java/org/w3c/domts/ |
H A D | DOMTestCase.java | 379 Iterator iter = expected.iterator();
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedQueue.java | 42 * creation of the iterator. They do <em>not</em> throw {@link 45 * of the iterator will be returned exactly once. 55 * to be performed atomically. For example, an iterator operating 59 * <p>This class and its iterator implement all of the <em>optional</em> 230 * added in traversal order of the collection's iterator. 476 * collection's iterator. Attempts to {@code addAll} of a queue to 622 * Returns an iterator over the elements in this queue in proper sequence. 625 * <p>The returned iterator is a "weakly consistent" iterator that 628 * elements as they existed upon construction of the iterator, an 634 public Iterator<E> iterator() { method in class:ConcurrentLinkedQueue [all...] |
H A D | LinkedBlockingQueue.java | 40 * <p>This class and its iterator implement all of the 238 * added in traversal order of the collection's iterator. 734 * Returns an iterator over the elements in this queue in proper sequence. 737 * <p>The returned iterator is a "weakly consistent" iterator that 740 * elements as they existed upon construction of the iterator, and 744 * @return an iterator over the elements in this queue in proper sequence 746 public Iterator<E> iterator() { method in class:LinkedBlockingQueue 752 * Basic weakly-consistent iterator. At all times hold the next
|
H A D | ConcurrentHashMap.java | 58 * iterator/enumeration. They do <em>not</em> throw {@link 1031 * <p>The view's {@code iterator} is a "weakly consistent" iterator 1034 * construction of the iterator, and may (but is not guaranteed to) 1055 * <p>The view's {@code iterator} is a "weakly consistent" iterator 1058 * construction of the iterator, and may (but is not guaranteed to) 1077 * <p>The view's {@code iterator} is a "weakly consistent" iterator 1080 * construction of the iterator, an 2675 public abstract Iterator<E> iterator(); method in class:ConcurrentHashMap.CollectionView 2845 public Iterator<K> iterator() { method in class:ConcurrentHashMap.KeySetView 2933 public final Iterator<V> iterator() { method in class:ConcurrentHashMap.ValuesView 2979 public Iterator<Map.Entry<K,V>> iterator() { method in class:ConcurrentHashMap.EntrySetView [all...] |
H A D | ConcurrentSkipListMap.java | 28 * the creation of the iterator. They do <em>not</em> throw {@link 48 * iterator operating concurrently with a {@code putAll} operation 1448 map.entrySet().iterator(); 1518 * as the kind of iterator needed by buildFromSorted. (They 1709 * The set's iterator returns the keys in ascending order. 1718 * <p>The view's {@code iterator} is a "weakly consistent" iterator 1721 * construction of the iterator, and may (but is not guaranteed to) 1740 * The collection's iterator returns the values in ascending order 1750 * <p>The view's {@code iterator} i 2300 public Iterator<E> iterator() { method in class:ConcurrentSkipListMap.KeySet 2357 public Iterator<E> iterator() { method in class:ConcurrentSkipListMap.Values 2385 public Iterator<Map.Entry<K1,V1>> iterator() { method in class:ConcurrentSkipListMap.EntrySet [all...] |
H A D | LinkedBlockingDeque.java | 34 * contains}, {@link #iterator iterator.remove()}, and the bulk 37 * <p>This class and its iterator implement all of the 157 * collection's iterator. 280 // an iterator. 977 * Returns an iterator over the elements in this deque in proper sequence. 980 * <p>The returned iterator is a "weakly consistent" iterator that 983 * elements as they existed upon construction of the iterator, and 987 * @return an iterator ove 989 public Iterator<E> iterator() { method in class:LinkedBlockingDeque [all...] |
H A D | LinkedTransferQueue.java | 37 * to be performed atomically. For example, an iterator operating 41 * <p>This class and its iterator implement all of the 990 * added in traversal order of the collection's iterator. 1160 * Returns an iterator over the elements in this queue in proper sequence. 1163 * <p>The returned iterator is a "weakly consistent" iterator that 1166 * elements as they existed upon construction of the iterator, and 1170 * @return an iterator over the elements in this queue in proper sequence 1172 public Iterator<E> iterator() { method in class:LinkedTransferQueue
|
H A D | PriorityBlockingQueue.java | 28 * <p>This class and its iterator implement all of the 31 * #iterator()} is <em>not</em> guaranteed to traverse the elements of 825 * Returns an iterator over the elements in this queue. The 826 * iterator does not return the elements in any particular order. 828 * <p>The returned iterator is a "weakly consistent" iterator that 831 * elements as they existed upon construction of the iterator, and 835 * @return an iterator over the elements in this queue 837 public Iterator<E> iterator() { method in class:PriorityBlockingQueue 842 * Snapshot iterator tha [all...] |
/libcore/support/src/test/java/org/apache/harmony/security/tests/support/cert/ |
H A D | TestUtils.java | 288 return s.iterator();
|
/libcore/support/src/test/java/tests/http/ |
H A D | MockWebServer.java | 199 for (Iterator<Socket> s = openClientSockets.iterator(); s.hasNext();) {
|
/libcore/dex/src/main/java/com/android/dex/ |
H A D | Dex.java | 977 public Iterator<ClassDef> iterator() { method in class:Dex.ClassDefIterable 979 ? Collections.<ClassDef>emptySet().iterator()
|