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
35
) sorted by null
1
2
/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
122
modCount
++;
157
modCount
++;
200
modCount
++;
242
modCount
++;
264
modCount
++;
298
modCount
++;
405
modCount
++;
418
modCount
++;
428
modCount
++;
459
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
284
modCount
++;
342
int expectedModCount =
modCount
;
349
if (
modCount
!= expectedModCount)
359
if (
modCount
!= expectedModCount)
365
expectedModCount =
modCount
;
WeakHashMap.java
48
volatile int
modCount
;
126
expectedModCount =
modCount
;
154
if (expectedModCount ==
modCount
) {
169
if (expectedModCount ==
modCount
) {
259
modCount
++;
582
modCount
++;
624
modCount
++;
704
modCount
++;
HashMap.java
106
transient int
modCount
;
403
modCount
++;
417
modCount
++;
439
* ensure that capacity is sufficient, and does not increment
modCount
.
632
modCount
++;
647
modCount
++;
668
modCount
++;
773
int expectedModCount =
modCount
;
791
if (
modCount
!= expectedModCount)
809
if (
modCount
!= expectedModCount
[
all
...]
IdentityHashMap.java
76
transient int
modCount
= 0;
147
expectedModCount = hm.
modCount
;
163
if (expectedModCount != associatedMap.
modCount
) {
325
modCount
++;
474
modCount
++;
581
modCount
++;
Hashtable.java
85
private transient int
modCount
;
380
modCount
++;
395
* ensure that capacity is sufficient, and does not increment
modCount
.
565
modCount
++;
583
modCount
++;
711
int expectedModCount =
modCount
;
727
if (
modCount
!= expectedModCount)
759
if (
modCount
!= expectedModCount)
763
expectedModCount =
modCount
;
828
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
...]
/libcore/luni/src/main/java/org/apache/harmony/luni/util/
TwoKeyHashMap.java
45
private int
modCount
;
116
modCount
++;
147
modCount
++;
172
modCount
++;
403
startModCount =
modCount
;
425
if (
modCount
!= startModCount) {
443
if (
modCount
!= startModCount) {
459
modCount
++;
492
modCount
++;
512
modCount
++
[
all
...]
/dalvik/vm/jdwp/
JdwpEvent.h
92
int
modCount
; /* #of entries in mods[] */
JdwpEvent.cpp
166
ALOGI(" kind=%s susp=%s
modCount
=%d",
169
pEvent->
modCount
);
171
for (int i = 0; i < pEvent->
modCount
; i++) {
199
for (int i = 0; i < pEvent->
modCount
; i++) {
258
for (int i = 0; i < pEvent->
modCount
; i++) {
357
for (int i = 0; i < pEvent->
modCount
; i++) {
394
for (int i = 0; i < pEvent->
modCount
; i++) {
465
for (int i = pEvent->
modCount
; i > 0; i--, pMod++) {
[
all
...]
JdwpHandler.cpp
[
all
...]
/libcore/luni/src/main/java/java/util/concurrent/
ConcurrentHashMap.java
266
transient int
modCount
;
436
++
modCount
;
532
++
modCount
;
554
++
modCount
;
691
mcsum += mc[i] = segments[i].
modCount
;
699
mc[i] != segments[i].
modCount
)
726
mcsum += mc[i] = segments[i].
modCount
;
731
if (mc[i] != segments[i].
modCount
) {
800
// See explanation of
modCount
use above
811
mcsum += mc[i] = segments[i].
modCount
;
[
all
...]
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
AbstractListTest.java
129
// which does not update
modCount
217
modCount
++;
232
modCount
+= 10;
323
modCount
+=2;
328
return
modCount
;
332
//test remove for failure by inconsistency of
modCount
and expectedModCount
/external/guava/guava/src/com/google/common/collect/
MinMaxPriorityQueue.java
224
private int
modCount
;
272
modCount
++;
382
modCount
++;
749
private int expectedModCount =
modCount
;
826
if (
modCount
!= expectedModCount) {
MapMakerInternalMap.java
[
all
...]
/external/guava/guava/src/com/google/common/cache/
LocalCache.java
[
all
...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.core.databinding.property_1.3.0.I20100601-0800.jar
/prebuilt/common/netbeans-visual/
org-openide-util.jar
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
FlexAntTasks.jar
/prebuilts/tools/common/guava-tools/
guava-10.0.1.jar
Completed in 1549 milliseconds
1
2