527 |
|
} |
528 |
|
} |
529 |
|
|
530 |
– |
private boolean xdelete(int i) { |
531 |
– |
int mask = elements.length - 1; |
532 |
– |
int front = (i - head) & mask; |
533 |
– |
int back = (tail - i) & mask; |
534 |
– |
|
535 |
– |
// Invariant: head <= i < tail mod circularity |
536 |
– |
if (front >= ((tail - head) & mask)) |
537 |
– |
throw new ConcurrentModificationException(); |
538 |
– |
|
539 |
– |
// Optimize for least element motion |
540 |
– |
if (front < back) { |
541 |
– |
if (head <= i) { |
542 |
– |
System.arraycopy(elements, head, elements, head + 1, front); |
543 |
– |
} else { // Wrap around |
544 |
– |
System.arraycopy(elements, 0, elements, 1, i); |
545 |
– |
elements[0] = elements[mask]; |
546 |
– |
System.arraycopy(elements, head, elements, head + 1, mask - head); |
547 |
– |
} |
548 |
– |
elements[head] = null; |
549 |
– |
head = (head + 1) & mask; |
550 |
– |
return false; |
551 |
– |
} else { |
552 |
– |
int t = tail; |
553 |
– |
tail = (tail - 1) & mask; |
554 |
– |
if (i < t) { // Copy the null tail as well |
555 |
– |
System.arraycopy(elements, i + 1, elements, i, back); |
556 |
– |
} else { // Wrap around |
557 |
– |
System.arraycopy(elements, i + 1, elements, i, mask - i); |
558 |
– |
elements[mask] = elements[0]; |
559 |
– |
System.arraycopy(elements, 1, elements, 0, t); |
560 |
– |
} |
561 |
– |
return true; |
562 |
– |
} |
563 |
– |
} |
564 |
– |
|
530 |
|
// *** Collection Methods *** |
531 |
|
|
532 |
|
/** |