746 |
|
final boolean modified; |
747 |
|
int r; |
748 |
|
// Optimize for initial run of survivors |
749 |
< |
for (r = 0; r < size; r++) |
750 |
< |
if (c.contains(es[r]) != complement) |
751 |
< |
break; |
749 |
> |
for (r = 0; r < size && c.contains(es[r]) == complement; r++) |
750 |
> |
; |
751 |
|
if (modified = (r < size)) { |
752 |
|
int w = r++; |
753 |
|
try { |
1502 |
|
final boolean modified; |
1503 |
|
int r; |
1504 |
|
// Optimize for initial run of survivors |
1505 |
< |
for (r = 0; r < size; r++) |
1506 |
< |
if (filter.test((E) es[r])) |
1508 |
< |
break; |
1505 |
> |
for (r = 0; r < size && !filter.test((E) es[r]); r++) |
1506 |
> |
; |
1507 |
|
if (modified = (r < size)) { |
1508 |
|
expectedModCount++; |
1509 |
|
modCount++; |