476 |
|
final int capacity = elements.length; |
477 |
|
int i, to, end, todo; |
478 |
|
todo = (to = ((end = (i = tail()) - size) >= -1) ? end : -1) - end; |
479 |
< |
for (;; i = capacity - 1, to = capacity - 1 - todo, todo = 0) { |
479 |
> |
for (;; i = capacity - 1, to = i - todo, todo = 0) { |
480 |
|
for (; i > to; i--) |
481 |
|
if (o.equals(elements[i])) { |
482 |
|
delete(i); |
893 |
|
final int capacity = elements.length; |
894 |
|
int end, to, todo; |
895 |
|
todo = (to = ((end = i - remaining) >= -1) ? end : -1) - end; |
896 |
< |
for (;; i = capacity - 1, to = capacity - 1 - todo, todo = 0) { |
896 |
> |
for (;; i = capacity - 1, to = i - todo, todo = 0) { |
897 |
|
for (; i > to; i--) |
898 |
|
action.accept(nonNullElementAt(elements, i)); |
899 |
|
if (todo == 0) break; |