865 |
int rowsize; |
int rowsize; |
866 |
|
|
867 |
// Fill each row that is completely full of nodes. |
// Fill each row that is completely full of nodes. |
868 |
for (rowsize = 2; rowsize + rowsize < count; rowsize <<= 1) |
for (rowsize = 2; rowsize + rowsize <= count; rowsize <<= 1) |
869 |
{ |
{ |
870 |
Node parent = row; |
Node parent = row; |
871 |
Node last = null; |
Node last = null; |
1468 |
*/ |
*/ |
1469 |
public void remove() |
public void remove() |
1470 |
{ |
{ |
|
if (knownMod != modCount) |
|
|
throw new ConcurrentModificationException(); |
|
1471 |
if (last == null) |
if (last == null) |
1472 |
throw new IllegalStateException(); |
throw new IllegalStateException(); |
1473 |
|
if (knownMod != modCount) |
1474 |
|
throw new ConcurrentModificationException(); |
1475 |
|
|
1476 |
removeNode(last); |
removeNode(last); |
1477 |
last = null; |
last = null; |