| /libcore/ojluni/src/main/java/java/util/ |
| D | Vector.java | 217 modCount++; in trimToSize()
243 modCount++; in ensureCapacity()
279 modCount++; in setSize()
559 modCount++; in removeElementAt()
592 modCount++; in insertElementAt()
616 modCount++; in addElement()
636 modCount++; in removeElement()
655 modCount++; in removeAllElements()
670 v.modCount = 0; in clone()
795 modCount++; in add()
[all …]
|
| D | ArrayList.java | 207 modCount++; in trimToSize()
226 modCount++; in ensureCapacity()
353 v.modCount = 0; in clone()
502 modCount++; in add()
518 modCount++; in add()
614 final int expectedModCount = modCount; in equals()
640 final int otherModCount = other.modCount; in equalsArrayList()
661 if (modCount != expectedModCount) { in checkForComodification()
670 int expectedModCount = modCount; in hashCode()
727 modCount++; in fastRemove()
[all …]
|
| D | AbstractList.java | 363 int expectedModCount = modCount;
393 expectedModCount = modCount; in remove()
400 if (modCount != expectedModCount) in checkForComodification()
442 expectedModCount = modCount; in set()
456 expectedModCount = modCount; in add()
630 protected transient int modCount = 0; field in AbstractList
670 this.expectedModCount = alist != null ? alist.modCount : 0; in RandomAccessSpliterator()
689 expectedModCount = alist.modCount; in getFence()
744 if (alist != null && alist.modCount != expectedModCount) { in checkAbstractListModCount()
765 this.modCount = root.modCount; in SubList()
[all …]
|
| D | PriorityQueue.java | 128 transient int modCount; // non-private to simplify nested class access field in PriorityQueue
333 modCount++; in offer()
527 private int expectedModCount = modCount;
537 if (expectedModCount != modCount)
551 if (expectedModCount != modCount)
569 expectedModCount = modCount;
582 modCount++;
594 modCount++;
624 modCount++;
855 expectedModCount = modCount; in getFence()
[all …]
|
| D | LinkedHashMap.java | 377 ++modCount; in afterNodeAccess()
398 ++modCount; in afterNodeAccess()
753 int mc = modCount; in forEach()
756 for (LinkedHashMap.Entry<K,V> e = tail; e != null && modCount == mc; e = e.before) in forEach()
760 for (LinkedHashMap.Entry<K,V> e = head; (e != null && modCount == mc); e = e.after) in forEach()
763 if (modCount != mc) in forEach()
859 int mc = modCount; in forEach()
862 for (LinkedHashMap.Entry<K,V> e = tail; e != null && modCount == mc; e = e.before) in forEach()
866 for (LinkedHashMap.Entry<K,V> e = head; (e != null && modCount == mc); e = e.after) in forEach()
869 if (modCount != mc) in forEach()
[all …]
|
| D | Hashtable.java | 172 private transient int modCount = 0; field in Hashtable
422 modCount++; in rehash()
454 modCount++; in addEntry()
520 modCount++; in remove()
551 modCount++; in clear()
572 t.modCount = 0; in clone()
749 modCount++; in remove()
891 final int expectedModCount = modCount; in forEach()
899 if (expectedModCount != modCount) { in forEach()
911 final int expectedModCount = modCount; in replaceAll()
[all …]
|
| D | IdentityHashMap.java | 189 transient int modCount; field in IdentityHashMap
448 modCount++; in put()
532 modCount++; in remove()
566 modCount++; in removeMapping()
620 modCount++; in clear()
717 int expectedModCount = modCount; // to support fast-fail
736 if (modCount != expectedModCount) in nextIndex()
750 if (modCount != expectedModCount) in remove()
753 expectedModCount = ++modCount; in remove()
784 expectedModCount = modCount; in remove()
[all …]
|
| D | WeakHashMap.java | 190 int modCount; field in WeakHashMap
468 modCount++; in put()
605 modCount++; in remove()
634 modCount++; in removeMapping()
659 modCount++; in clear()
767 private int expectedModCount = modCount;
808 if (modCount != expectedModCount) in nextEntry()
823 if (modCount != expectedModCount) in remove()
827 expectedModCount = modCount; in remove()
1019 int expectedModCount = modCount; in forEach()
[all …]
|
| D | Scanner.java | 376 int modCount; field in Scanner
1225 modCount++; in useDelimiter()
1245 modCount++; in useDelimiter()
1280 modCount++; in useLocale()
1376 modCount++; in useRadix()
1460 modCount++; in hasNext()
1486 modCount++; in next()
1564 modCount++; in hasNext()
1596 modCount++; in next()
1628 modCount++; in hasNextLine()
[all …]
|
| D | HashMap.java | 409 transient int modCount; field in HashMap
666 ++modCount; in putVal()
850 ++modCount; in removeNode()
865 modCount++; in clear()
1012 int mc = modCount; in forEach()
1014 for (int i = 0; (i < tab.length && modCount == mc); ++i) { in forEach()
1018 if (modCount != mc) in forEach()
1070 int mc = modCount; in forEach()
1072 for (int i = 0; (i < tab.length && modCount == mc); ++i) { in forEach()
1076 if (modCount != mc) in forEach()
[all …]
|
| D | LinkedList.java | 145 modCount++; in linkFirst()
160 modCount++; in linkLast()
176 modCount++; in linkBefore()
194 modCount++; in unlinkFirst()
213 modCount++; in unlinkLast()
242 modCount++; in unlink()
451 modCount++; in addAll()
473 modCount++; in clear()
886 private int expectedModCount = modCount;
966 while (modCount == expectedModCount && nextIndex < size) { in forEachRemaining()
[all …]
|
| D | TreeMap.java | 147 private transient int modCount = 0; field in TreeMap
353 ++modCount; in putAll()
783 int mc = modCount; in callMappingFunctionWithCheck()
785 if (mc != modCount) { in callMappingFunctionWithCheck()
792 int mc = modCount; in callRemappingFunctionWithCheck()
794 if (mc != modCount) { in callRemappingFunctionWithCheck()
808 modCount++; in addEntry()
815 modCount++; in addEntryToEmptyMap()
886 int mc = modCount; in mergeValue()
888 if (mc != modCount) { in mergeValue()
[all …]
|
| /libcore/ojluni/src/main/java/java/util/regex/ |
| D | Matcher.java | 180 int modCount; field in Matcher
351 modCount++; in usePattern()
367 modCount++; in reset()
660 modCount++; in matches()
683 modCount++; in find()
714 modCount++; in find()
736 modCount++; in lookingAt()
868 modCount++; in appendReplacement()
1050 modCount++; in appendReplacement()
1316 int ec = modCount; in replaceAll()
[all …]
|
| /libcore/ojluni/src/test/java/util/Vector/ |
| D | ArrayManagement.java | 56 public int modCount() { return modCount; } in modCount() method in ArrayManagement.PublicVector
62 int oldModCount = modCount(); in ensureCapacity()
68 assertEquals(modCount(), oldModCount + 1); in ensureCapacity()
86 int modCount = list.modCount(); in addOneElement() local
94 assertEquals(list.modCount(), modCount + 1); in addOneElement() local
|
| /libcore/ojluni/src/test/java/util/ArrayList/ |
| D | ArrayManagement.java | 69 static int modCount(ArrayList<?> list) { in modCount() method in ArrayManagement
87 int oldModCount = modCount(list); in ensureCapacity()
90 assertEquals(modCount(list), in ensureCapacity()
103 int modCount = modCount(list); in addOneElement() local
111 assertEquals(modCount(list), modCount + 1); in addOneElement() local
|
| /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
|
| /libcore/api/ |
| D | current.txt | 13066 field protected transient int modCount;
|