OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:modCount
(Results
1 - 25
of
91
) sorted by null
1
2
3
4
/libcore/luni/src/main/java/java/util/
AbstractList.java
35
protected transient int
modCount
;
45
expectedModCount =
modCount
;
53
if (expectedModCount ==
modCount
) {
70
if (expectedModCount !=
modCount
) {
80
expectedModCount =
modCount
;
98
if (expectedModCount ==
modCount
) {
106
if (
modCount
!= expectedModCount) {
107
expectedModCount =
modCount
;
123
if (expectedModCount ==
modCount
) {
141
if (expectedModCount ==
modCount
) {
[
all
...]
ArrayList.java
126
modCount
++;
161
modCount
++;
204
modCount
++;
246
modCount
++;
268
modCount
++;
302
modCount
++;
409
modCount
++;
422
modCount
++;
432
modCount
++;
463
modCount
++
[
all
...]
LinkedList.java
69
expectedModCount = list.
modCount
;
90
if (expectedModCount == list.
modCount
) {
100
list.
modCount
++;
115
if (expectedModCount == list.
modCount
) {
132
if (expectedModCount == list.
modCount
) {
149
if (expectedModCount == list.
modCount
) {
162
list.
modCount
++;
172
if (expectedModCount == list.
modCount
) {
199
expectedModCount = list.
modCount
;
209
if (expectedModCount == list.
modCount
) {
[
all
...]
Stack.java
78
modCount
++;
UnsafeArrayList.java
43
++
modCount
;
Vector.java
156
modCount
++;
196
modCount
++;
225
modCount
++;
588
modCount
++;
703
modCount
++;
754
modCount
++;
803
modCount
++;
838
modCount
++;
929
modCount
++;
[
all
...]
LinkedHashMap.java
280
modCount
++;
338
int expectedModCount =
modCount
;
345
if (
modCount
!= expectedModCount)
355
if (
modCount
!= expectedModCount)
361
expectedModCount =
modCount
;
WeakHashMap.java
48
volatile int
modCount
;
126
expectedModCount =
modCount
;
154
if (expectedModCount ==
modCount
) {
169
if (expectedModCount ==
modCount
) {
260
modCount
++;
563
modCount
++;
605
modCount
++;
685
modCount
++;
HashMap.java
106
transient int
modCount
;
398
modCount
++;
412
modCount
++;
434
* ensure that capacity is sufficient, and does not increment
modCount
.
627
modCount
++;
642
modCount
++;
663
modCount
++;
768
int expectedModCount =
modCount
;
786
if (
modCount
!= expectedModCount)
804
if (
modCount
!= expectedModCount
[
all
...]
IdentityHashMap.java
76
transient int
modCount
= 0;
147
expectedModCount = hm.
modCount
;
163
if (expectedModCount != associatedMap.
modCount
) {
324
modCount
++;
473
modCount
++;
580
modCount
++;
Hashtable.java
85
private transient int
modCount
;
377
modCount
++;
392
* ensure that capacity is sufficient, and does not increment
modCount
.
564
modCount
++;
582
modCount
++;
710
int expectedModCount =
modCount
;
726
if (
modCount
!= expectedModCount)
758
if (
modCount
!= expectedModCount)
762
expectedModCount =
modCount
;
827
modCount
++
[
all
...]
TreeMap.java
79
int
modCount
= 0;
192
modCount
++;
259
modCount
++;
323
modCount
++;
341
modCount
++;
422
modCount
++;
868
protected int expectedModCount =
modCount
;
882
if (
modCount
!= expectedModCount) {
894
if (
modCount
!= expectedModCount) {
907
expectedModCount =
modCount
;
[
all
...]
/external/protobuf/java/src/main/java/com/google/protobuf/
LazyStringArrayList.java
122
modCount
++;
141
modCount
++;
148
modCount
++;
155
modCount
++;
162
modCount
++;
169
modCount
++;
175
modCount
++;
181
modCount
++;
290
modCount
++;
297
modCount
++
[
all
...]
RepeatedFieldBuilder.java
627
modCount
++;
660
modCount
++;
693
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
++;
MinMaxPriorityQueue.java
225
private int
modCount
;
273
modCount
++;
383
modCount
++;
750
private int expectedModCount =
modCount
;
825
if (
modCount
!= expectedModCount) {
/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[] */
jdwp_event.cc
197
for (int i = 0; i < pEvent->
modCount
; i++) {
280
for (int i = 0; i < pEvent->
modCount
; i++) {
390
for (int i = 0; i < pEvent->
modCount
; i++) {
410
for (int i = 0; i < pEvent->
modCount
; ++i) {
453
for (int i = pEvent->
modCount
; i > 0; i--, pMod++) {
[
all
...]
/external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/translit/
UnicodeMapTest.java
259
int
modCount
= count & 0xFF;
260
if (
modCount
== 0 && isVerbose()) {
265
if (
modCount
== 1 && isVerbose()) {
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
AbstractListTest.java
129
// 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
/external/guava/guava/src/com/google/common/cache/
LocalCache.java
[
all
...]
Completed in 1213 milliseconds
1
2
3
4