private static final class Collections2.OrderedPermutationIterator<E> extends AbstractIterator<java.util.List<E>>
Modifier and Type | Field and Description |
---|---|
(package private) java.util.Comparator<? super E> |
comparator |
(package private) java.util.List<E> |
nextPermutation |
Constructor and Description |
---|
OrderedPermutationIterator(java.util.List<E> list,
java.util.Comparator<? super E> comparator) |
Modifier and Type | Method and Description |
---|---|
(package private) void |
calculateNextPermutation() |
protected java.util.List<E> |
computeNext()
Returns the next element.
|
(package private) int |
findNextJ() |
(package private) int |
findNextL(int j) |
endOfData, hasNext, next, peek
remove
java.util.List<E> nextPermutation
final java.util.Comparator<? super E> comparator
protected java.util.List<E> computeNext()
AbstractIterator
AbstractIterator.endOfData()
when there are no elements left in the iteration. Failure to
do so could result in an infinite loop.
The initial invocation of AbstractIterator.hasNext()
or AbstractIterator.next()
calls
this method, as does the first invocation of hasNext
or next
following each successful call to next
. Once the
implementation either invokes endOfData
or throws an exception,
computeNext
is guaranteed to never be called again.
If this method throws an exception, it will propagate outward to the
hasNext
or next
invocation that invoked this method. Any
further attempts to use the iterator will result in an IllegalStateException
.
The implementation of this method may not invoke the hasNext
,
next
, or AbstractIterator.peek()
methods on this instance; if it does, an
IllegalStateException
will result.
computeNext
in class AbstractIterator<java.util.List<E>>
endOfData
was called
during execution, the return value will be ignored.void calculateNextPermutation()
int findNextJ()
int findNextL(int j)