Searched refs:modCount (Results 1 - 12 of 12) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DArrayList.java184 modCount++;
219 modCount++;
341 v.modCount = 0;
441 ensureCapacityInternal(size + 1); // Increments modCount!!
459 ensureCapacityInternal(size + 1); // Increments modCount!!
479 modCount++;
526 modCount++;
539 modCount++;
564 ensureCapacityInternal(size + numNew); // Increments modCount
591 ensureCapacityInternal(size + numNew); // Increments modCount
[all...]
H A DAbstractList.java283 * for the (protected) {@link #modCount} field.
320 * the (protected) {@link #modCount} field.
344 * The modCount value that the iterator believes that the backing
348 int expectedModCount = modCount;
378 expectedModCount = modCount;
385 if (modCount != expectedModCount)
427 expectedModCount = modCount;
441 expectedModCount = modCount;
455 * {@code modCount} value of the backing list. There are two variants
474 * <p>All methods first check to see if the actual {@code modCount} o
601 protected transient int modCount = 0; field in class:AbstractList
[all...]
H A DVector.java204 modCount++;
230 modCount++;
287 modCount++;
556 modCount++;
596 modCount++;
619 modCount++;
640 modCount++;
656 modCount++;
676 v.modCount = 0;
781 modCount
[all...]
H A DLinkedHashMap.java372 lm.modCount++;
388 * The modCount value that the iterator believes that the backing
392 int expectedModCount = modCount;
401 if (modCount != expectedModCount)
406 expectedModCount = modCount;
410 if (modCount != expectedModCount)
545 int mc = modCount;
546 // Android modified - breaks from the loop when modCount != mc
547 for (LinkedHashMapEntry<K,V> e = header.after; modCount == mc && e != header; e = e.after)
549 if (modCount !
[all...]
H A DPriorityQueue.java114 transient int modCount; // non-private to simplify nested class access field in class:PriorityQueue
336 modCount++;
521 * The modCount value that the iterator believes that the backing
525 private int expectedModCount = modCount;
534 if (expectedModCount != modCount)
548 if (expectedModCount != modCount)
566 expectedModCount = modCount;
579 modCount++;
590 modCount++;
614 modCount
[all...]
H A DIdentityHashMap.java181 private transient int modCount; field in class:IdentityHashMap
448 modCount++;
532 modCount++;
567 modCount++;
621 modCount++;
720 int expectedModCount = modCount; // to support fast-fail
739 if (modCount != expectedModCount)
753 if (modCount != expectedModCount)
756 expectedModCount = ++modCount;
787 expectedModCount = modCount;
[all...]
H A DHashMap.java190 transient int modCount; field in class:HashMap
435 modCount++;
452 modCount++;
607 modCount++;
641 modCount++;
662 modCount++;
721 result.modCount = 0;
837 expectedModCount = modCount;
850 if (modCount != expectedModCount)
868 if (modCount !
[all...]
H A DLinkedList.java134 modCount++;
149 modCount++;
165 modCount++;
183 modCount++;
202 modCount++;
231 modCount++;
440 modCount++;
462 modCount++;
875 private int expectedModCount = modCount;
956 while (modCount
[all...]
H A DWeakHashMap.java190 int modCount; field in class:WeakHashMap
444 modCount++;
582 modCount++;
612 modCount++;
637 modCount++;
747 private int expectedModCount = modCount;
788 if (modCount != expectedModCount)
803 if (modCount != expectedModCount)
807 expectedModCount = modCount;
993 int expectedModCount = modCount;
[all...]
H A DHashtable.java166 private transient int modCount = 0; field in class:Hashtable
405 modCount++;
457 modCount++;
489 modCount++;
523 modCount++;
547 t.modCount = 0;
713 modCount++;
856 final int expectedModCount = modCount;
864 if (expectedModCount != modCount) {
875 final int expectedModCount = modCount;
[all...]
H A DTreeMap.java134 private transient int modCount = 0; field in class:TreeMap
318 ++modCount;
567 modCount++;
609 modCount++;
642 modCount++;
664 clone.modCount = 0;
1024 int expectedModCount = modCount;
1028 if (expectedModCount != modCount) {
1037 int expectedModCount = modCount;
1042 if (expectedModCount != modCount) {
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DAbstractListTest.java129 // which does not update modCount
217 modCount++;
232 modCount += 10;
387 modCount += 2;
392 return modCount;
396 //test remove for failure by inconsistency of modCount and expectedModCount

Completed in 306 milliseconds