62 |
|
*/ |
63 |
|
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8; |
64 |
|
|
65 |
< |
// fields are non-private to simpify nested class access |
65 |
> |
// fields are non-private to simplify nested class access |
66 |
|
volatile Object[] array; |
67 |
|
final SequenceLock lock; |
68 |
|
volatile int count; |
795 |
|
// ReadMostlyVector-only methods |
796 |
|
|
797 |
|
/** |
798 |
< |
* Append the element if not present. |
798 |
> |
* Appends the element, if not present. |
799 |
|
* |
800 |
|
* @param e element to be added to this list, if absent |
801 |
|
* @return {@code true} if the element was added |
1166 |
|
|
1167 |
|
public E next() { |
1168 |
|
if (validNext || hasNext()) { |
1169 |
< |
validNext = false; |
1169 |
> |
validNext = validPrev = false; |
1170 |
|
lastRet = cursor++; |
1171 |
|
return next; |
1172 |
|
} |
1175 |
|
|
1176 |
|
public E previous() { |
1177 |
|
if (validPrev || hasPrevious()) { |
1178 |
< |
validPrev = false; |
1178 |
> |
validNext = validPrev = false; |
1179 |
|
lastRet = cursor--; |
1180 |
|
return prev; |
1181 |
|
} |
1557 |
|
|
1558 |
|
public E next() { |
1559 |
|
if (validNext || hasNext()) { |
1560 |
< |
validNext = false; |
1560 |
> |
validNext = validPrev = false; |
1561 |
|
lastRet = cursor++; |
1562 |
|
return next; |
1563 |
|
} |
1566 |
|
|
1567 |
|
public E previous() { |
1568 |
|
if (validPrev || hasPrevious()) { |
1569 |
< |
validPrev = false; |
1569 |
> |
validNext = validPrev = false; |
1570 |
|
lastRet = cursor--; |
1571 |
|
return prev; |
1572 |
|
} |
1633 |
|
|
1634 |
|
} |
1635 |
|
} |
1636 |
– |
|