Iterator interface.
You may also consider using
IteratorUtils,
which is a single class that uses static methods to construct instances
of the classes in this package.
| Modifier and Type | Class and Description |
|---|---|
| pack-priv abstract class | |
| public abstract class | AbstractEmptyMapIterator<
the type of keys K, the type of mapped values V>Provides an implementation of an empty map iterator. |
| public abstract class | AbstractIteratorDecorator<E>
Provides basic behaviour for decorating an iterator with extra functionality. |
| public class | AbstractListIteratorDecorator<E>
Provides basic behaviour for decorating a list iterator with extra functionality. |
| public class | AbstractMapIteratorDecorator<
the type of keys K, the type of mapped values V>Provides basic behaviour for decorating a map iterator with extra functionality. |
| public class | AbstractOrderedMapIteratorDecorator<
the type of keys K, the type of mapped values V>Provides basic behaviour for decorating an ordered map iterator with extra functionality. |
| public abstract class | AbstractUntypedIteratorDecorator<I, O>
Provides basic behaviour for decorating an iterator with extra functionality without committing the generic type of the Iterator implementation. |
| public class | ArrayIterator<
the type of elements returned by this iterator E>Implements an |
| public class | |
| public class | |
| public class | CollatingIterator<E>
Provides an ordered iteration over the elements contained in a collection of ordered Iterators. |
| public class | |
| public class | |
| public class | EmptyMapIterator<
the type of keys K, the type of mapped values V>Provides an implementation of an empty map iterator. |
| public class | |
| public class | EmptyOrderedMapIterator<
the type of keys K, the type of mapped values V>Provides an implementation of an empty ordered map iterator. |
| public class | EntrySetMapIterator<
the type of keys K, the type of mapped values V>Implements a |
| public class | |
| public class | |
| public class | |
| public class | |
| public class | |
| public class | |
| public abstract class | LazyIteratorChain<E>
An LazyIteratorChain is an Iterator that wraps a number of Iterators in a lazy manner. |
| public class | |
| public class | |
| public class | LoopingListIterator<E>
A ListIterator that restarts when it reaches the end or when it reaches the beginning. |
| public class | |
| public class | ObjectArrayIterator<
the type of elements returned by this iterator E>An |
| public class | |
| public class | |
| public class | |
| public class | PermutationIterator<
the type of the objects being permuted E>This iterator creates permutations of an input collection, using the Steinhaus-Johnson-Trotter algorithm (also called plain changes). |
| public class | |
| public class | ReverseListIterator<E>
Iterates backwards through a List, starting with the last element and continuing to the first. |
| public class | |
| public class | SingletonListIterator<E>
|
| public class | |
| public class | |
| public class | |
| public class | |
| public class | |
| public class | UnmodifiableMapIterator<
the type of keys K, the type of mapped values V>Decorates a map iterator such that it cannot be modified. |
| public class | UnmodifiableOrderedMapIterator<
the type of keys K, the type of mapped values V>Decorates an ordered map iterator such that it cannot be modified. |
| public class | ZippingIterator<E>
Provides an interleaved iteration over the elements contained in a collection of Iterators. |