Searched refs:expectedModCount (Results 1 – 11 of 11) sorted by relevance
726 int expectedModCount = modCount; in writeObject() local737 if (modCount != expectedModCount) { in writeObject()822 int expectedModCount = modCount; field in ArrayList.Itr830 if (modCount != expectedModCount) in next()845 if (modCount != expectedModCount) in remove()852 expectedModCount = modCount; in remove()872 while (i != size && modCount == expectedModCount) { in forEachRemaining()879 if (modCount != expectedModCount) in forEachRemaining()907 if (modCount != expectedModCount) in previous()922 if (modCount != expectedModCount) in set()[all …]
1134 int expectedModCount = modCount; field in Itr1157 expectedModCount = modCount; in remove()1178 while (i != size && modCount == expectedModCount) { in forEachRemaining()1189 if (modCount != expectedModCount) in checkForComodification()1240 expectedModCount = modCount; in add()1250 final int expectedModCount = modCount; in forEach() local1254 for (int i=0; modCount == expectedModCount && i < elementCount; i++) { in forEach()1257 if (modCount != expectedModCount) { in forEach()1286 private int expectedModCount; // initialized when fence set field in VectorSpliterator1290 int expectedModCount) { in VectorSpliterator() argument[all …]
720 int expectedModCount = modCount; // to support fast-fail field in IdentityHashMap.IdentityHashMapIterator739 if (modCount != expectedModCount) in nextIndex()753 if (modCount != expectedModCount) in remove()756 expectedModCount = ++modCount; in remove()787 expectedModCount = modCount; in remove()1024 int expectedModCount = modCount; in toArray() local1041 if (ti < size || expectedModCount != modCount) { in toArray()1111 int expectedModCount = modCount; in toArray() local1127 if (ti < size || expectedModCount != modCount) { in toArray()1233 int expectedModCount = modCount; in toArray() local[all …]
747 private int expectedModCount = modCount; field in WeakHashMap.HashIterator788 if (modCount != expectedModCount) in nextEntry()803 if (modCount != expectedModCount) in remove()807 expectedModCount = modCount; in remove()993 int expectedModCount = modCount; in forEach() local1004 if (expectedModCount != modCount) { in forEach()1015 int expectedModCount = modCount; in replaceAll() local1026 if (expectedModCount != modCount) { in replaceAll()1044 int expectedModCount; // for comodification checks field in WeakHashMap.WeakHashMapSpliterator1048 int expectedModCount) { in WeakHashMapSpliterator() argument[all …]
525 private int expectedModCount = modCount; field in PriorityQueue.Itr534 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.PriorityQueueSpliterator831 int expectedModCount) { in PriorityQueueSpliterator() argument835 this.expectedModCount = expectedModCount; in PriorityQueueSpliterator()841 expectedModCount = pq.modCount; in getFence()851 expectedModCount); in trySplit()866 mc = expectedModCount; in forEachRemaining()[all …]
832 int expectedModCount; // For fast-fail field in HashMap.HashIterator837 expectedModCount = modCount; in HashIterator()850 if (modCount != expectedModCount) in nextEntry()868 if (modCount != expectedModCount) in remove()873 expectedModCount = modCount; in remove()904 int expectedModCount; // for comodification checks field in HashMap.HashMapSpliterator908 int expectedModCount) { in HashMapSpliterator() argument913 this.expectedModCount = expectedModCount; in HashMapSpliterator()921 expectedModCount = m.modCount; in getFence()938 int expectedModCount) { in KeySpliterator() argument[all …]
1024 int expectedModCount = modCount; in forEach() local1028 if (expectedModCount != modCount) { in forEach()1037 int expectedModCount = modCount; in replaceAll() local1042 if (expectedModCount != modCount) { in replaceAll()1215 int expectedModCount; field in TreeMap.PrivateEntryIterator1218 expectedModCount = modCount; in PrivateEntryIterator()1231 if (modCount != expectedModCount) in nextEntry()1242 if (modCount != expectedModCount) in prevEntry()1252 if (modCount != expectedModCount) in remove()1258 expectedModCount = modCount; in remove()[all …]
875 private int expectedModCount = modCount; field in LinkedList.ListItr932 expectedModCount++; in remove()950 expectedModCount++; in add()956 while (modCount == expectedModCount && nextIndex < size) { in forEachRemaining()966 if (modCount != expectedModCount) in checkForComodification()1181 int expectedModCount; // initialized when est set field in LinkedList.LLSpliterator1184 LLSpliterator(LinkedList<E> list, int est, int expectedModCount) { in LLSpliterator() argument1187 this.expectedModCount = expectedModCount; in LLSpliterator()1197 expectedModCount = lst.modCount; in getEst()1239 if (list.modCount != expectedModCount) in forEachRemaining()[all …]
348 int expectedModCount = modCount; field in AbstractList.Itr378 expectedModCount = modCount; in remove()385 if (modCount != expectedModCount) in checkForComodification()427 expectedModCount = modCount; in set()441 expectedModCount = modCount; in add()
392 int expectedModCount = modCount; field in LinkedHashMap.LinkedHashIterator401 if (modCount != expectedModCount) in remove()406 expectedModCount = modCount; in remove()410 if (modCount != expectedModCount) in nextEntry()
856 final int expectedModCount = modCount; in forEach() local864 if (expectedModCount != modCount) { in forEach()875 final int expectedModCount = modCount; in replaceAll() local884 if (expectedModCount != modCount) { in replaceAll()1142 protected int expectedModCount = modCount; field in Hashtable.Enumerator1186 if (modCount != expectedModCount) in next()1196 if (modCount != expectedModCount) in remove()1207 expectedModCount++; in remove()