| /libcore/ojluni/src/main/java/java/util/ |
| D | ArrayList.java | 754 int expectedModCount = modCount; in writeObject() local
765 if (modCount != expectedModCount) { in writeObject()
851 int expectedModCount = modCount; field in ArrayList.Itr
859 if (modCount != expectedModCount) in next()
874 if (modCount != expectedModCount) in remove()
881 expectedModCount = modCount; in remove()
901 while (i != size && modCount == expectedModCount) { in forEachRemaining()
908 if (modCount != expectedModCount) in forEachRemaining()
936 if (modCount != expectedModCount) in previous()
951 if (modCount != expectedModCount) in set()
[all …]
|
| D | Vector.java | 1137 int expectedModCount = modCount; field in Itr
1164 expectedModCount = modCount; in remove()
1188 while (i != size && modCount == expectedModCount) { in forEachRemaining()
1199 if (modCount != expectedModCount) in checkForComodification()
1250 expectedModCount = modCount; in add()
1262 final int expectedModCount = modCount; in forEach() local
1266 for (int i=0; modCount == expectedModCount && i < elementCount; i++) { in forEach()
1269 if (modCount != expectedModCount) { in forEach()
1284 final int expectedModCount = modCount; in removeIf() local
1285 for (int i=0; modCount == expectedModCount && i < size; i++) { in removeIf()
[all …]
|
| D | AbstractList.java | 361 int expectedModCount = modCount; field in AbstractList.Itr
391 expectedModCount = modCount; in remove()
398 if (modCount != expectedModCount) in checkForComodification()
440 expectedModCount = modCount; in set()
454 expectedModCount = modCount; in add()
658 private int expectedModCount; // initialized when fence set field in AbstractList.RandomAccessSpliterator
668 this.expectedModCount = alist != null ? alist.modCount : 0; in RandomAccessSpliterator()
679 this.expectedModCount = parent.expectedModCount; in RandomAccessSpliterator()
687 expectedModCount = alist.modCount; in getFence()
707 checkAbstractListModCount(alist, expectedModCount); in tryAdvance()
[all …]
|
| D | PriorityQueue.java | 525 private int expectedModCount = modCount; field in PriorityQueue.Itr
534 if (expectedModCount != modCount) in next()
548 if (expectedModCount != modCount) in remove()
566 expectedModCount = modCount; in remove()
827 private int expectedModCount; // initialized when fence set field in PriorityQueue.PriorityQueueSpliterator
831 int expectedModCount) { in PriorityQueueSpliterator() argument
835 this.expectedModCount = expectedModCount; in PriorityQueueSpliterator()
841 expectedModCount = pq.modCount; in getFence()
851 expectedModCount); in trySplit()
866 mc = expectedModCount; in forEachRemaining()
[all …]
|
| D | TreeMap.java | 1004 int expectedModCount = modCount; in forEach() local
1008 if (expectedModCount != modCount) { in forEach()
1017 int expectedModCount = modCount; in replaceAll() local
1022 if (expectedModCount != modCount) { in replaceAll()
1195 int expectedModCount; field in TreeMap.PrivateEntryIterator
1198 expectedModCount = modCount; in PrivateEntryIterator()
1211 if (modCount != expectedModCount) in nextEntry()
1222 if (modCount != expectedModCount) in prevEntry()
1232 if (modCount != expectedModCount) in remove()
1238 expectedModCount = modCount; in remove()
[all …]
|
| D | LinkedList.java | 875 private int expectedModCount = modCount; field in LinkedList.ListItr
932 expectedModCount++; in remove()
950 expectedModCount++; in add()
955 while (modCount == expectedModCount && nextIndex < size) { in forEachRemaining()
965 if (modCount != expectedModCount) in checkForComodification()
1180 int expectedModCount; // initialized when est set field in LinkedList.LLSpliterator
1183 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { in LLSpliterator() argument
1186 this.expectedModCount = expectedModCount; in LLSpliterator()
1196 expectedModCount = lst.modCount; in getEst()
1238 if (list.modCount != expectedModCount) in forEachRemaining()
[all …]
|
| D | LinkedHashMap.java | 745 int expectedModCount; field in LinkedHashMap.LinkedHashIterator
749 expectedModCount = modCount; in LinkedHashIterator()
759 if (modCount != expectedModCount) in nextNode()
772 if (modCount != expectedModCount) in remove()
777 expectedModCount = modCount; in remove()
|
| D | Hashtable.java | 875 final int expectedModCount = modCount; in forEach() local
883 if (expectedModCount != modCount) { in forEach()
895 final int expectedModCount = modCount; in replaceAll() local
904 if (expectedModCount != modCount) { in replaceAll()
1351 protected int expectedModCount = modCount; field in Hashtable.Enumerator
1396 if (modCount != expectedModCount) in next()
1406 if (modCount != expectedModCount) in remove()
1418 expectedModCount++; in remove()
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | PriorityQueue.java | 224 private int expectedModCount; field in PriorityQueue.Itr
237 java.util.PriorityQueue<E> pq, int origin, int fence, int expectedModCount) { in PriorityQueueSpliterator() argument
265 private int expectedModCount; field in PriorityQueue.PriorityQueueSpliterator
|
| D | Vector.java | 313 int expectedModCount; field in Vector.Itr
360 int expectedModCount) { in VectorSpliterator() argument
390 private int expectedModCount; field in Vector.VectorSpliterator
|
| D | LinkedList.java | 305 LLSpliterator(java.util.LinkedList<E> list, int est, int expectedModCount) { in LLSpliterator() argument
343 int expectedModCount; field in LinkedList.LLSpliterator
403 private int expectedModCount; field in LinkedList.ListItr
|
| D | ArrayList.java | 243 java.util.ArrayList<E> list, int origin, int fence, int expectedModCount) { in ArrayListSpliterator() argument
271 private int expectedModCount; field in ArrayList.ArrayListSpliterator
309 int expectedModCount; field in ArrayList.Itr
|
| D | HashMap.java | 340 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in EntrySpliterator() argument
385 int expectedModCount; field in HashMap.HashIterator
396 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in HashMapSpliterator() argument
412 int expectedModCount; field in HashMap.HashMapSpliterator
475 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in KeySpliterator() argument
652 java.util.HashMap<K, V> m, int origin, int fence, int est, int expectedModCount) { in ValueSpliterator() argument
|
| D | LinkedHashMap.java | 227 int expectedModCount; field in LinkedHashMap.LinkedHashIterator
|