Lines Matching refs:iterator
50 * <i>not</i> have to provide an iterator implementation; the iterator and
51 * list iterator are implemented by this class, on top of the "random access"
170 * <p>This implementation first gets a list iterator (with
194 * <p>This implementation first gets a list iterator that points to the end
240 * <p>This implementation gets an iterator over the specified collection
242 * iterator into this list at the appropriate position, one at a time,
270 * Returns an iterator over the elements in this list in proper sequence.
273 * iterator interface, relying on the backing list's {@code size()},
276 * <p>Note that the iterator returned by this method will throw an
285 * @return an iterator over the elements in this list in proper sequence
287 public Iterator<E> iterator() {
307 * {@code Iterator} interface returned by the {@code iterator()} method.
312 * <p>Note that the list iterator returned by this implementation will
344 * The modCount value that the iterator believes that the backing
345 * List should have. If this expectation is violated, the iterator
469 * over a list iterator on the backing list, which is created with the
470 * corresponding method on the backing list. The {@code iterator} method
505 * {@code false}. If either iterator runs out of elements before the
558 * <p>This implementation gets a list iterator positioned before
581 * <p>This field is used by the iterator and list iterator implementation
582 * returned by the {@code iterator} and {@code listIterator} methods.
583 * If the value of this field changes unexpectedly, the iterator (or list
584 * iterator) will throw a {@code ConcurrentModificationException} in
690 public Iterator<E> iterator() {