Javadoc fixes.
git-svn-id: https://svn.apache.org/repos/asf/commons/proper/collections/trunk@1382171 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
161ea25722
commit
5409f76e35
|
@ -172,6 +172,7 @@ public class ArrayListIterator<E> extends ArrayIterator<E>
|
|||
* This iterator does not support modification of its backing collection, and so will
|
||||
* always throw an {@link UnsupportedOperationException} when this method is invoked.
|
||||
*
|
||||
* @param o the element to add
|
||||
* @throws UnsupportedOperationException always thrown.
|
||||
* @see java.util.ListIterator#set
|
||||
*/
|
||||
|
@ -192,6 +193,9 @@ public class ArrayListIterator<E> extends ArrayIterator<E>
|
|||
* not support <code>add()</code> or <code>remove()</code>, <code>set()</code> may be
|
||||
* called as often as desired.
|
||||
*
|
||||
* @param o the element to set
|
||||
* @throws IllegalStateException if {@link #next()} or {@link #previous()} has not been called
|
||||
* before {@link #set(Object)}
|
||||
* @see java.util.ListIterator#set
|
||||
*/
|
||||
public void set(Object o) {
|
||||
|
|
|
@ -39,6 +39,7 @@ public final class UnmodifiableIterator<E> implements Iterator<E>, Unmodifiable
|
|||
* <p>
|
||||
* If the iterator is already unmodifiable it is returned directly.
|
||||
*
|
||||
* @param <E> the element type
|
||||
* @param iterator the iterator to decorate
|
||||
* @return a new unmodifiable iterator
|
||||
* @throws IllegalArgumentException if the iterator is null
|
||||
|
|
|
@ -37,6 +37,7 @@ public final class UnmodifiableListIterator<E> implements ListIterator<E>, Unmod
|
|||
/**
|
||||
* Decorates the specified iterator such that it cannot be modified.
|
||||
*
|
||||
* @param <E> the element type
|
||||
* @param iterator the iterator to decorate
|
||||
* @return a new unmodifiable list iterator
|
||||
* @throws IllegalArgumentException if the iterator is null
|
||||
|
|
|
@ -36,6 +36,8 @@ public final class UnmodifiableMapIterator<K, V> implements MapIterator<K, V>, U
|
|||
/**
|
||||
* Decorates the specified iterator such that it cannot be modified.
|
||||
*
|
||||
* @param <K> the key type
|
||||
* @param <V> the value type
|
||||
* @param iterator the iterator to decorate
|
||||
* @return a new unmodifiable map iterator
|
||||
* @throws IllegalArgumentException if the iterator is null
|
||||
|
|
|
@ -37,6 +37,8 @@ public final class UnmodifiableOrderedMapIterator<K, V> implements OrderedMapIte
|
|||
/**
|
||||
* Decorates the specified iterator such that it cannot be modified.
|
||||
*
|
||||
* @param <K> the key type
|
||||
* @param <V> the value type
|
||||
* @param iterator the iterator to decorate
|
||||
* @return a new unmodifiable ordered map iterator
|
||||
* @throws IllegalArgumentException if the iterator is null
|
||||
|
|
|
@ -427,6 +427,7 @@ public abstract class AbstractLinkedList<E> implements List<E> {
|
|||
* Subclasses can override this to create a different class.
|
||||
*
|
||||
* @param value value of the new node
|
||||
* @return a new node containing the value
|
||||
*/
|
||||
protected Node<E> createNode(E value) {
|
||||
return new Node<E>(value);
|
||||
|
@ -509,6 +510,7 @@ public abstract class AbstractLinkedList<E> implements List<E> {
|
|||
* @param index the index, starting from 0
|
||||
* @param endMarkerAllowed whether or not the end marker can be returned if
|
||||
* startIndex is set to the list's size
|
||||
* @return the node at the given index
|
||||
* @throws IndexOutOfBoundsException if the index is less than 0; equal to
|
||||
* the size of the list and endMakerAllowed is false; or greater than the
|
||||
* size of the list
|
||||
|
@ -551,6 +553,7 @@ public abstract class AbstractLinkedList<E> implements List<E> {
|
|||
* Creates an iterator for the sublist.
|
||||
*
|
||||
* @param subList the sublist to get an iterator for
|
||||
* @return a new iterator on the given sublist
|
||||
*/
|
||||
protected Iterator<E> createSubListIterator(LinkedSubList<E> subList) {
|
||||
return createSubListListIterator(subList, 0);
|
||||
|
@ -561,6 +564,7 @@ public abstract class AbstractLinkedList<E> implements List<E> {
|
|||
*
|
||||
* @param subList the sublist to get an iterator for
|
||||
* @param fromIndex the index to start from, relative to the sublist
|
||||
* @return a new list iterator on the given sublist
|
||||
*/
|
||||
protected ListIterator<E> createSubListListIterator(LinkedSubList<E> subList, int fromIndex) {
|
||||
return new LinkedSubListIterator<E>(subList, fromIndex);
|
||||
|
@ -749,6 +753,7 @@ public abstract class AbstractLinkedList<E> implements List<E> {
|
|||
*
|
||||
* @param parent the parent list
|
||||
* @param fromIndex the index to start at
|
||||
* @throws IndexOutOfBoundsException if fromIndex is less than 0 or greater than the size of the list
|
||||
*/
|
||||
protected LinkedListIterator(AbstractLinkedList<E> parent, int fromIndex) throws IndexOutOfBoundsException {
|
||||
super();
|
||||
|
@ -774,9 +779,9 @@ public abstract class AbstractLinkedList<E> implements List<E> {
|
|||
/**
|
||||
* Gets the last node returned.
|
||||
*
|
||||
* @throws IllegalStateException If {@link #next()} or
|
||||
* {@link #previous()} haven't been called, or if the node has been removed
|
||||
* with {@link #remove()} or a new node added with {@link #add(Object)}.
|
||||
* @return the last node returned
|
||||
* @throws IllegalStateException If {@link #next()} or {@link #previous()} haven't been called,
|
||||
* or if the node has been removed with {@link #remove()} or a new node added with {@link #add(Object)}.
|
||||
*/
|
||||
protected Node<E> getLastNodeReturned() throws IllegalStateException {
|
||||
if (current == null) {
|
||||
|
|
Loading…
Reference in New Issue