663 |
|
long seq = lock.awaitAvailability(); |
664 |
|
Object[] items = array; |
665 |
|
int n = count; |
666 |
< |
if (n <= items.length) { |
666 |
> |
if (n <= items.length) { |
667 |
|
for (int i = 0; i < n; ++i) { |
668 |
|
Object e = items[i]; |
669 |
|
if (lock.getSequence() != seq) { |
697 |
|
long seq = lock.awaitAvailability(); |
698 |
|
Object[] items = array; |
699 |
|
int n = count; |
700 |
< |
if (n <= items.length) { |
700 |
> |
if (n <= items.length) { |
701 |
|
for (int i = n - 1; i >= 0; --i) { |
702 |
|
Object e = items[i]; |
703 |
|
if (lock.getSequence() != seq) { |
805 |
|
* Append the element if not present. |
806 |
|
* |
807 |
|
* @param e element to be added to this list, if absent |
808 |
< |
* @return <tt>true</tt> if the element was added |
808 |
> |
* @return {@code true} if the element was added |
809 |
|
*/ |
810 |
|
public boolean addIfAbsent(E e) { |
811 |
|
boolean added; |
860 |
|
* Returns an iterator operating over a snapshot copy of the |
861 |
|
* elements of this collection created upon construction of the |
862 |
|
* iterator. The iterator does <em>NOT</em> support the |
863 |
< |
* <tt>remove</tt> method. |
863 |
> |
* {@code remove} method. |
864 |
|
* |
865 |
|
* @return an iterator over the elements in this list in proper sequence |
866 |
|
*/ |