444 |
|
/** |
445 |
|
* Returns the number of elements in this deque. |
446 |
|
* |
447 |
< |
* @return the number of elements in this deque. |
447 |
> |
* @return the number of elements in this deque |
448 |
|
*/ |
449 |
|
public int size() { |
450 |
|
lock.lock(); |
647 |
|
* construction of the iterator, and may (but is not guaranteed to) |
648 |
|
* reflect any modifications subsequent to construction. |
649 |
|
* |
650 |
< |
* @return an iterator over the elements in this deque in proper sequence. |
650 |
> |
* @return an iterator over the elements in this deque in proper sequence |
651 |
|
*/ |
652 |
|
public Iterator<E> iterator() { |
653 |
|
return new Itr(); |
664 |
|
* an element exists in hasNext(), we must return item read |
665 |
|
* under lock (in advance()) even if it was in the process of |
666 |
|
* being removed when hasNext() was called. |
667 |
< |
**/ |
667 |
> |
*/ |
668 |
|
private E nextItem; |
669 |
|
|
670 |
|
/** |