| /libcore/ojluni/src/main/java/java/util/ |
| H A D | AbstractList.java | 348 int expectedModCount = modCount; field in class:AbstractList.Itr
378 expectedModCount = modCount;
385 if (modCount != expectedModCount)
427 expectedModCount = modCount;
441 expectedModCount = modCount;
|
| H A D | LinkedHashMap.java | 742 int expectedModCount; field in class:LinkedHashMap.LinkedHashIterator
746 expectedModCount = modCount;
756 if (modCount != expectedModCount)
769 if (modCount != expectedModCount)
774 expectedModCount = modCount;
|
| H A D | PriorityQueue.java | 525 private int expectedModCount = modCount; field in class:PriorityQueue.Itr
534 if (expectedModCount != modCount)
548 if (expectedModCount != modCount)
566 expectedModCount = modCount;
827 private int expectedModCount; // initialized when fence set field in class:PriorityQueue.PriorityQueueSpliterator
831 int expectedModCount) {
835 this.expectedModCount = expectedModCount;
841 expectedModCount = pq.modCount;
851 expectedModCount);
830 PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence, int expectedModCount) argument
[all...] |
| H A D | ArrayList.java | 754 int expectedModCount = modCount;
765 if (modCount != expectedModCount) {
851 int expectedModCount = modCount; field in class:ArrayList.Itr
859 if (modCount != expectedModCount)
874 if (modCount != expectedModCount)
881 expectedModCount = modCount;
901 while (i != size && modCount == expectedModCount) {
908 if (modCount != expectedModCount)
936 if (modCount != expectedModCount)
951 if (modCount != expectedModCount)
1328 private int expectedModCount; // initialized when fence set field in class:ArrayList.ArrayListSpliterator
1331 ArrayListSpliterator(ArrayList<E> list, int origin, int fence, int expectedModCount) argument
[all...] |
| H A D | Hashtable.java | 875 final int expectedModCount = modCount;
883 if (expectedModCount != modCount) {
895 final int expectedModCount = modCount;
904 if (expectedModCount != modCount) {
1351 protected int expectedModCount = modCount; field in class:Hashtable.Enumerator
1396 if (modCount != expectedModCount)
1406 if (modCount != expectedModCount)
1418 expectedModCount++;
|
| H A D | IdentityHashMap.java | 714 int expectedModCount = modCount; // to support fast-fail field in class:IdentityHashMap.IdentityHashMapIterator
733 if (modCount != expectedModCount)
747 if (modCount != expectedModCount)
750 expectedModCount = ++modCount;
781 expectedModCount = modCount;
1019 int expectedModCount = modCount;
1036 if (ti < size || expectedModCount != modCount) {
1107 int expectedModCount = modCount;
1123 if (ti < size || expectedModCount != modCount) {
1229 int expectedModCount
1388 int expectedModCount; // initialized when fence set field in class:IdentityHashMap.IdentityHashMapSpliterator
1390 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, int expectedModCount) argument
1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, int expectedModCount) argument
1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1534 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | LinkedList.java | 875 private int expectedModCount = modCount; field in class:LinkedList.ListItr
932 expectedModCount++;
950 expectedModCount++;
955 while (modCount == expectedModCount && nextIndex < size) {
965 if (modCount != expectedModCount)
1180 int expectedModCount; // initialized when est set field in class:LinkedList.LLSpliterator
1183 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { argument
1186 this.expectedModCount = expectedModCount;
1196 expectedModCount
[all...] |
| H A D | Vector.java | 1137 int expectedModCount = modCount; field in class:Vector.Itr
1160 expectedModCount = modCount;
1181 while (i != size && modCount == expectedModCount) {
1192 if (modCount != expectedModCount)
1243 expectedModCount = modCount;
1254 final int expectedModCount = modCount;
1258 for (int i=0; modCount == expectedModCount && i < elementCount; i++) {
1261 if (modCount != expectedModCount) {
1276 final int expectedModCount = modCount;
1277 for (int i=0; modCount == expectedModCount
1360 private int expectedModCount; // initialized when fence set field in class:Vector.VectorSpliterator
1363 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, int expectedModCount) argument
[all...] |
| H A D | WeakHashMap.java | 764 private int expectedModCount = modCount; field in class:WeakHashMap.HashIterator
805 if (modCount != expectedModCount)
820 if (modCount != expectedModCount)
824 expectedModCount = modCount;
1018 int expectedModCount = modCount;
1029 if (expectedModCount != modCount) {
1040 int expectedModCount = modCount;
1051 if (expectedModCount != modCount) {
1068 int expectedModCount; // for comodification checks field in class:WeakHashMap.WeakHashMapSpliterator
1072 int expectedModCount) {
1070 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1100 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1180 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1257 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | HashMap.java | 1420 int expectedModCount; // for fast-fail field in class:HashMap.HashIterator
1424 expectedModCount = modCount;
1440 if (modCount != expectedModCount)
1454 if (modCount != expectedModCount)
1459 expectedModCount = modCount;
1487 int expectedModCount; // for comodification checks field in class:HashMap.HashMapSpliterator
1491 int expectedModCount) {
1496 this.expectedModCount = expectedModCount;
1504 expectedModCount
1489 HashMapSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1592 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1663 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | TreeMap.java | 1030 int expectedModCount = modCount;
1034 if (expectedModCount != modCount) {
1043 int expectedModCount = modCount;
1048 if (expectedModCount != modCount) {
1221 int expectedModCount; field in class:TreeMap.PrivateEntryIterator
1224 expectedModCount = modCount;
1237 if (modCount != expectedModCount)
1248 if (modCount != expectedModCount)
1258 if (modCount != expectedModCount)
1264 expectedModCount
1716 int expectedModCount; field in class:TreeMap.NavigableSubMap.SubMapIterator
2733 int expectedModCount; // for CME checks field in class:TreeMap.TreeMapSpliterator
2735 TreeMapSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2768 KeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2846 DescendingKeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2919 ValueSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2991 EntrySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
[all...] |