| /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 | 392 int expectedModCount = modCount; field in class:LinkedHashMap.LinkedHashIterator
401 if (modCount != expectedModCount)
406 expectedModCount = modCount;
410 if (modCount != expectedModCount)
|
| 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 | 726 int expectedModCount = modCount;
737 if (modCount != expectedModCount) {
822 int expectedModCount = modCount; field in class:ArrayList.Itr
830 if (modCount != expectedModCount)
845 if (modCount != expectedModCount)
852 expectedModCount = modCount;
872 while (i != size && modCount == expectedModCount) {
879 if (modCount != expectedModCount)
907 if (modCount != expectedModCount)
922 if (modCount != expectedModCount)
1299 private int expectedModCount; // initialized when fence set field in class:ArrayList.ArrayListSpliterator
1302 ArrayListSpliterator(ArrayList<E> list, int origin, int fence, int expectedModCount) argument
[all...] |
| H A D | Hashtable.java | 856 final int expectedModCount = modCount;
864 if (expectedModCount != modCount) {
875 final int expectedModCount = modCount;
884 if (expectedModCount != modCount) {
1142 protected int expectedModCount = modCount; field in class:Hashtable.Enumerator
1186 if (modCount != expectedModCount)
1196 if (modCount != expectedModCount)
1207 expectedModCount++;
|
| H A D | IdentityHashMap.java | 720 int expectedModCount = modCount; // to support fast-fail field in class:IdentityHashMap.IdentityHashMapIterator
739 if (modCount != expectedModCount)
753 if (modCount != expectedModCount)
756 expectedModCount = ++modCount;
787 expectedModCount = modCount;
1024 int expectedModCount = modCount;
1041 if (ti < size || expectedModCount != modCount) {
1111 int expectedModCount = modCount;
1127 if (ti < size || expectedModCount != modCount) {
1233 int expectedModCount
1391 int expectedModCount; // initialized when fence set field in class:IdentityHashMap.IdentityHashMapSpliterator
1393 IdentityHashMapSpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, int expectedModCount) argument
1421 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est, int expectedModCount) argument
1478 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1537 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++;
956 while (modCount == expectedModCount && nextIndex < size) {
966 if (modCount != expectedModCount)
1181 int expectedModCount; // initialized when est set field in class:LinkedList.LLSpliterator
1184 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { argument
1187 this.expectedModCount = expectedModCount;
1197 expectedModCount
[all...] |
| H A D | Vector.java | 1134 int expectedModCount = modCount; field in class:Vector.Itr
1157 expectedModCount = modCount;
1178 while (i != size && modCount == expectedModCount) {
1189 if (modCount != expectedModCount)
1240 expectedModCount = modCount;
1251 final int expectedModCount = modCount;
1255 for (int i=0; modCount == expectedModCount && i < elementCount; i++) {
1258 if (modCount != expectedModCount) {
1287 private int expectedModCount; // initialized when fence set field in class:Vector.VectorSpliterator
1291 int expectedModCount) {
1290 VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, int expectedModCount) argument
[all...] |
| H A D | WeakHashMap.java | 747 private int expectedModCount = modCount; field in class:WeakHashMap.HashIterator
788 if (modCount != expectedModCount)
803 if (modCount != expectedModCount)
807 expectedModCount = modCount;
993 int expectedModCount = modCount;
1004 if (expectedModCount != modCount) {
1015 int expectedModCount = modCount;
1026 if (expectedModCount != modCount) {
1044 int expectedModCount; // for comodification checks field in class:WeakHashMap.WeakHashMapSpliterator
1048 int expectedModCount) {
1046 WeakHashMapSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1076 KeySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1156 ValueSpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1233 EntrySpliterator(WeakHashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | HashMap.java | 832 int expectedModCount; // For fast-fail field in class:HashMap.HashIterator
837 expectedModCount = modCount;
850 if (modCount != expectedModCount)
868 if (modCount != expectedModCount)
873 expectedModCount = modCount;
904 int expectedModCount; // for comodification checks field in class:HashMap.HashMapSpliterator
908 int expectedModCount) {
913 this.expectedModCount = expectedModCount;
921 expectedModCount
906 HashMapSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
937 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1010 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
1082 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est, int expectedModCount) argument
[all...] |
| H A D | TreeMap.java | 1024 int expectedModCount = modCount;
1028 if (expectedModCount != modCount) {
1037 int expectedModCount = modCount;
1042 if (expectedModCount != modCount) {
1215 int expectedModCount; field in class:TreeMap.PrivateEntryIterator
1218 expectedModCount = modCount;
1231 if (modCount != expectedModCount)
1242 if (modCount != expectedModCount)
1252 if (modCount != expectedModCount)
1258 expectedModCount
1710 int expectedModCount; field in class:TreeMap.NavigableSubMap.SubMapIterator
2723 int expectedModCount; // for CME checks field in class:TreeMap.TreeMapSpliterator
2725 TreeMapSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2758 KeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2836 DescendingKeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2909 ValueSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
2981 EntrySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument
[all...] |