HomeSort by relevance Sort by last modified time
    Searched refs:modCount (Results 1 - 25 of 224) sorted by null

1 2 3 4 5 6 7 8 9

  /libcore/ojluni/src/main/java/java/util/
ArrayList.java 208 modCount++;
245 modCount++;
367 v.modCount = 0;
467 ensureCapacityInternal(size + 1); // Increments modCount!!
485 ensureCapacityInternal(size + 1); // Increments modCount!!
505 modCount++;
552 modCount++;
565 modCount++;
590 ensureCapacityInternal(size + numNew); // Increments modCount
617 ensureCapacityInternal(size + numNew); // Increments modCount
    [all...]
AbstractList.java 283 * 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
    [all...]
Vector.java 204 modCount++;
230 modCount++;
287 modCount++;
556 modCount++;
596 modCount++;
619 modCount++;
640 modCount++;
656 modCount++;
676 v.modCount = 0;
781 modCount++
    [all...]
LinkedHashMap.java 350 ++modCount;
590 int mc = modCount;
591 // Android-changed: Detect changes to modCount early.
592 for (LinkedHashMapEntry<K,V> e = head; (e != null && modCount == mc); e = e.after)
594 if (modCount != mc)
640 int mc = modCount;
641 // Android-changed: Detect changes to modCount early.
642 for (LinkedHashMapEntry<K,V> e = head; (e != null && modCount == mc); e = e.after)
644 if (modCount != mc)
704 int mc = modCount;
    [all...]
PriorityQueue.java 114 transient int modCount; // non-private to simplify nested class access
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...]
IdentityHashMap.java 184 transient int modCount;
443 modCount++;
527 modCount++;
561 modCount++;
615 modCount++;
714 int expectedModCount = modCount; // to support fast-fail
733 if (modCount != expectedModCount)
747 if (modCount != expectedModCount)
750 expectedModCount = ++modCount;
781 expectedModCount = modCount;
    [all...]
LinkedList.java 134 modCount++;
149 modCount++;
165 modCount++;
183 modCount++;
202 modCount++;
231 modCount++;
440 modCount++;
462 modCount++;
875 private int expectedModCount = modCount;
955 while (modCount == expectedModCount && nextIndex < size)
    [all...]
WeakHashMap.java 191 int modCount;
462 modCount++;
600 modCount++;
630 modCount++;
655 modCount++;
764 private int expectedModCount = modCount;
805 if (modCount != expectedModCount)
820 if (modCount != expectedModCount)
824 expectedModCount = modCount;
    [all...]
Hashtable.java 166 private transient int modCount = 0;
405 modCount++;
422 modCount++;
499 modCount++;
533 modCount++;
557 t.modCount = 0;
724 modCount++;
875 final int expectedModCount = modCount;
883 if (expectedModCount != modCount)
    [all...]
HashMap.java 415 transient int modCount;
660 ++modCount;
    [all...]
TreeMap.java 134 private transient int modCount = 0;
318 ++modCount;
543 modCount++;
585 modCount++;
618 modCount++;
640 clone.modCount = 0;
    [all...]
  /external/protobuf/java/core/src/main/java/com/google/protobuf/
LazyStringArrayList.java 151 modCount++;
157 modCount++;
163 modCount++;
183 modCount++;
191 modCount++;
199 modCount++;
207 modCount++;
215 modCount++;
222 modCount++;
229 modCount++
    [all...]
ProtobufArrayList.java 77 modCount++;
89 modCount++;
97 modCount++;
BooleanArrayList.java 192 modCount++;
226 modCount++;
237 modCount++;
251 modCount++;
DoubleArrayList.java 193 modCount++;
227 modCount++;
238 modCount++;
252 modCount++;
FloatArrayList.java 191 modCount++;
225 modCount++;
236 modCount++;
250 modCount++;
IntArrayList.java 191 modCount++;
225 modCount++;
236 modCount++;
250 modCount++;
LongArrayList.java 191 modCount++;
225 modCount++;
236 modCount++;
250 modCount++;
RepeatedFieldBuilder.java 635 modCount++;
670 modCount++;
705 modCount++;
  /external/guava/guava/src/com/google/common/collect/
HashBiMap.java 104 private transient int modCount;
116 this.modCount = 0;
156 modCount++;
169 modCount++;
298 this.modCount++;
323 modCount++;
335 int expectedModCount = modCount;
338 if (modCount != expectedModCount) {
377 expectedModCount = modCount;
467 expectedModCount = modCount;
    [all...]
LinkedListMultimap.java 166 private transient int modCount;
224 modCount++;
232 modCount++;
283 modCount++;
321 int expectedModCount = modCount;
341 if (modCount != expectedModCount) {
371 expectedModCount = modCount;
414 int expectedModCount = modCount;
417 if (modCount != expectedModCount) {
443 expectedModCount = modCount;
    [all...]
LinkedHashMultimap.java 312 private int modCount = 0;
360 int expectedModCount = modCount;
363 if (modCount != expectedModCount) {
391 expectedModCount = modCount;
433 modCount++;
471 modCount++;
488 modCount++;
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
LinkedListMultimap.java 162 private transient int modCount;
220 modCount++;
228 modCount++;
279 modCount++;
317 int expectedModCount = modCount;
337 if (modCount != expectedModCount) {
367 expectedModCount = modCount;
410 int expectedModCount = modCount;
413 if (modCount != expectedModCount) {
439 expectedModCount = modCount;
    [all...]
LinkedHashMultimap.java 308 private int modCount = 0;
356 int expectedModCount = modCount;
359 if (modCount != expectedModCount) {
387 expectedModCount = modCount;
429 modCount++;
467 modCount++;
484 modCount++;
  /art/runtime/jdwp/
jdwp_event.h 97 int modCount; /* #of entries in mods[] */

Completed in 581 milliseconds

1 2 3 4 5 6 7 8 9