| /libcore/ojluni/src/main/java/java/util/ |
| D | ArrayList.java | 208 modCount++; in trimToSize()
245 modCount++; in ensureExplicitCapacity()
367 v.modCount = 0; in clone()
505 modCount++; in remove()
552 modCount++; in fastRemove()
565 modCount++; in clear()
651 modCount++; in removeRange()
735 modCount += size - w; in batchRemove()
754 int expectedModCount = modCount; in writeObject()
765 if (modCount != expectedModCount) { in writeObject()
[all …]
|
| D | Vector.java | 204 modCount++; in trimToSize()
230 modCount++; in ensureCapacity()
287 modCount++; in setSize()
556 modCount++; in removeElementAt()
596 modCount++; in insertElementAt()
619 modCount++; in addElement()
640 modCount++; in removeElement()
656 modCount++; in removeAllElements()
676 v.modCount = 0; in clone()
781 modCount++; in add()
[all …]
|
| D | LinkedHashMap.java | 350 ++modCount; in afterNodeAccess()
590 int mc = modCount; in forEach()
592 for (LinkedHashMapEntry<K,V> e = head; (e != null && modCount == mc); e = e.after) in forEach()
594 if (modCount != mc) in forEach()
640 int mc = modCount; in forEach()
642 for (LinkedHashMapEntry<K,V> e = head; (e != null && modCount == mc); e = e.after) in forEach()
644 if (modCount != mc) in forEach()
704 int mc = modCount; in forEach()
706 for (LinkedHashMapEntry<K,V> e = head; (e != null && mc == modCount); e = e.after) in forEach()
708 if (modCount != mc) in forEach()
[all …]
|
| D | AbstractList.java | 361 int expectedModCount = modCount;
391 expectedModCount = modCount; in remove()
398 if (modCount != expectedModCount) in checkForComodification()
440 expectedModCount = modCount; in set()
454 expectedModCount = modCount; in add()
628 protected transient int modCount = 0; field in AbstractList
668 this.expectedModCount = alist != null ? alist.modCount : 0; in RandomAccessSpliterator()
687 expectedModCount = alist.modCount; in getFence()
742 if (alist != null && alist.modCount != expectedModCount) { in checkAbstractListModCount()
763 this.modCount = root.modCount; in SubList()
[all …]
|
| D | PriorityQueue.java | 114 transient int modCount; // non-private to simplify nested class access field in PriorityQueue
336 modCount++; in offer()
525 private int expectedModCount = modCount;
534 if (expectedModCount != modCount) in next()
548 if (expectedModCount != modCount) in remove()
566 expectedModCount = modCount; in remove()
579 modCount++; in clear()
590 modCount++; in poll()
614 modCount++; in removeAt()
841 expectedModCount = pq.modCount; in getFence()
[all …]
|
| D | IdentityHashMap.java | 184 transient int modCount; field in IdentityHashMap
443 modCount++; in put()
527 modCount++; in remove()
561 modCount++; in removeMapping()
615 modCount++; in clear()
714 int expectedModCount = modCount; // to support fast-fail
733 if (modCount != expectedModCount) in nextIndex()
747 if (modCount != expectedModCount) in remove()
750 expectedModCount = ++modCount; in remove()
781 expectedModCount = modCount; in remove()
[all …]
|
| D | WeakHashMap.java | 191 int modCount; field in WeakHashMap
462 modCount++; in put()
600 modCount++; in remove()
630 modCount++; in removeMapping()
655 modCount++; in clear()
764 private int expectedModCount = modCount;
805 if (modCount != expectedModCount) in nextEntry()
820 if (modCount != expectedModCount) in remove()
824 expectedModCount = modCount; in remove()
1018 int expectedModCount = modCount; in forEach()
[all …]
|
| D | LinkedList.java | 134 modCount++; in linkFirst()
149 modCount++; in linkLast()
165 modCount++; in linkBefore()
183 modCount++; in unlinkFirst()
202 modCount++; in unlinkLast()
231 modCount++; in unlink()
440 modCount++; in addAll()
462 modCount++; in clear()
875 private int expectedModCount = modCount;
955 while (modCount == expectedModCount && nextIndex < size) { in forEachRemaining()
[all …]
|
| D | Hashtable.java | 166 private transient int modCount = 0; field in Hashtable
405 modCount++; in rehash()
422 modCount++; in addEntry()
499 modCount++; in remove()
533 modCount++; in clear()
557 t.modCount = 0; in clone()
724 modCount++; in remove()
875 final int expectedModCount = modCount; in forEach()
883 if (expectedModCount != modCount) { in forEach()
895 final int expectedModCount = modCount; in replaceAll()
[all …]
|
| D | HashMap.java | 415 transient int modCount; field in HashMap
660 ++modCount; in putVal()
844 ++modCount; in removeNode()
859 modCount++; in clear()
929 int mc = modCount; in forEach()
931 for (int i = 0; (i < tab.length && modCount == mc); ++i) { in forEach()
935 if (modCount != mc) in forEach()
978 int mc = modCount; in forEach()
980 for (int i = 0; (i < tab.length && modCount == mc); ++i) { in forEach()
984 if (modCount != mc) in forEach()
[all …]
|
| D | TreeMap.java | 134 private transient int modCount = 0; field in TreeMap
318 ++modCount; in putAll()
543 modCount++; in put()
585 modCount++; in put()
618 modCount++; in clear()
640 clone.modCount = 0; in clone()
1004 int expectedModCount = modCount; in forEach()
1008 if (expectedModCount != modCount) { in forEach()
1017 int expectedModCount = modCount; in replaceAll()
1022 if (expectedModCount != modCount) { in replaceAll()
[all …]
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| D | AbstractListTest.java | 217 modCount++; in remove()
232 modCount += 10; in add()
387 modCount += 2; in remove()
392 return modCount; in getModCount()
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| D | AbstractListTest.java | 190 modCount++; in add()
194 modCount++; in remove()
|
| /libcore/ojluni/annotations/sdk/nullability/java/util/ |
| D | AbstractList.annotated.java | 67 protected transient int modCount = 0; // 0x0 field in AbstractList
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | PriorityQueue.java | 193 transient int modCount; field in PriorityQueue
|
| D | HashMap.java | 278 transient int modCount; field in HashMap
|