Home | History | Annotate | Download | only in util

Lines Matching defs:expectedModCount

754         int expectedModCount = modCount;
765 if (modCount != expectedModCount) {
851 int expectedModCount = modCount;
859 if (modCount != expectedModCount)
874 if (modCount != expectedModCount)
881 expectedModCount = modCount;
901 while (i != size && modCount == expectedModCount) {
908 if (modCount != expectedModCount)
936 if (modCount != expectedModCount)
951 if (modCount != expectedModCount)
962 if (modCount != expectedModCount)
970 expectedModCount = modCount;
1124 int expectedModCount = ArrayList.this.modCount;
1132 if (expectedModCount != ArrayList.this.modCount)
1150 if (expectedModCount != ArrayList.this.modCount)
1174 while (i != size && modCount == expectedModCount) {
1179 if (expectedModCount != ArrayList.this.modCount)
1194 if (expectedModCount != ArrayList.this.modCount)
1201 expectedModCount = ArrayList.this.modCount;
1210 if (expectedModCount != ArrayList.this.modCount)
1221 if (expectedModCount != ArrayList.this.modCount)
1229 expectedModCount = ArrayList.this.modCount;
1257 final int expectedModCount = modCount;
1261 for (int i=0; modCount == expectedModCount && i < size; i++) {
1267 if (modCount != expectedModCount) {
1303 * initialize fence and expectedModCount until the latest
1328 private int expectedModCount; // initialized when fence set
1332 int expectedModCount) {
1336 this.expectedModCount = expectedModCount;
1346 expectedModCount = lst.modCount;
1357 expectedModCount);
1368 if (list.modCount != expectedModCount)
1386 mc = expectedModCount;
1416 final int expectedModCount = modCount;
1418 for (int i=0; modCount == expectedModCount && i < size; i++) {
1426 if (modCount != expectedModCount) {
1442 if (modCount != expectedModCount) {
1455 final int expectedModCount = modCount;
1457 for (int i=0; modCount == expectedModCount && i < size; i++) {
1460 if (modCount != expectedModCount) {
1469 final int expectedModCount = modCount;
1471 if (modCount != expectedModCount) {