T
- Component typepublic interface Iterator<T> extends Iterator<T>, Traversable<T>
javaslang.collection.Iterator
is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements.
It is recommended to create instances using AbstractIterator
in favor of Iterator
.
Note: Iterators encapsulate mutable state. They are not meant to be used concurrently by different threads. Do not reuse Iterators, e.g. after passing to List.ofAll(Iterable).
There are two abstract methods: hasNext
for checking if there is a next element available,
and next
which removes the next element from the iterator and returns it. They can be called
an arbitrary amount of times. If hasNext
returns false, a call of next
will throw
a NoSuchElementException
.
Caution: Other methods than hasNext
and next
can be called only once (exclusively).
More specifically, after calling a method it cannot be guaranteed that the next call will succeed.
An Iterator that can be only used once because it is a traversal pointer into a collection, and not a collection
itself.
Modifier and Type | Field and Description |
---|---|
static Iterator<Object> |
EMPTY
The empty Iterator.
|
Modifier and Type | Method and Description |
---|---|
static <T> Iterator<T> |
concat(Iterable<? extends Iterable<? extends T>> iterables)
Creates an Iterator which traverses along the concatenation of the given iterables.
|
static <T> Iterator<T> |
concat(Iterable<? extends T>... iterables)
Creates an Iterator which traverses along the concatenation of the given iterables.
|
default Iterator<T> |
concat(Iterator<? extends T> that) |
static <T> Iterator<T> |
continually(Supplier<? extends T> supplier)
Generates an infinite iterator using a value Supplier.
|
static <T> Iterator<T> |
continually(T t)
Creates an infinite iterator returning the given element.
|
default Iterator<T> |
distinct()
Returns a new version of this which contains no duplicates.
|
default Iterator<T> |
distinctBy(Comparator<? super T> comparator)
Returns a new version of this which contains no duplicates.
|
default <U> Iterator<T> |
distinctBy(Function<? super T,? extends U> keyExtractor)
Returns a new version of this which contains no duplicates.
|
default Iterator<T> |
drop(long n)
Removes up to n elements from this iterator.
|
default Iterator<T> |
dropRight(long n)
Drops the last n elements of this or all elements, if this length < n.
|
default Iterator<T> |
dropUntil(Predicate<? super T> predicate)
Drops elements until the predicate holds for the current element.
|
default Iterator<T> |
dropWhile(Predicate<? super T> predicate)
Drops elements while the predicate holds for the current element.
|
static <T> Iterator<T> |
empty()
Returns the empty Iterator.
|
static <T> Iterator<T> |
fill(int n,
Supplier<? extends T> s)
Returns an Iterator on a sequence of
n values supplied by a given Supplier s . |
default Iterator<T> |
filter(Predicate<? super T> predicate)
Returns an Iterator that contains elements that satisfy the given
predicate . |
default Option<T> |
findLast(Predicate<? super T> predicate)
Returns the last element of this which satisfies the given predicate.
|
default <U> Iterator<U> |
flatMap(Function<? super T,? extends Iterable<? extends U>> mapper)
FlatMaps the elements of this Iterator to Iterables, which are iterated in the order of occurrence.
|
default <U> U |
foldRight(U zero,
BiFunction<? super T,? super U,? extends U> f)
Accumulates the elements of this Traversable by successively calling the given function
f from the right,
starting with a value zero of type B. |
static Iterator<Integer> |
from(int value)
Returns an infinite iterator of int values starting from
value . |
static Iterator<Integer> |
from(int value,
int step)
Returns an infinite iterator of int values starting from
value and spaced by step . |
static Iterator<Long> |
from(long value)
Returns an infinite iterator of long values starting from
value . |
static Iterator<Long> |
from(long value,
long step)
Returns an infinite iterator of long values starting from
value and spaced by step . |
default T |
get()
Gets the underlying value or throws if no value is present.
|
default <C> Map<C,Iterator<T>> |
groupBy(Function<? super T,? extends C> classifier)
Groups this elements by classifying the elements.
|
default Iterator<Seq<T>> |
grouped(long size)
Groups this
Traversable into fixed size blocks. |
default boolean |
hasDefiniteSize()
Checks if this Traversable is known to have a finite size.
|
default T |
head()
Returns the first element of a non-empty Traversable.
|
default Option<T> |
headOption()
Returns the first element of a non-empty Traversable as
Option . |
default Iterator<T> |
init()
Dual of Traversable.tail(), returning all elements except the last.
|
default Option<Iterator<T>> |
initOption()
Dual of Traversable.tailOption(), returning all elements except the last as
Option . |
default Iterator<T> |
intersperse(T element)
Inserts an element between all elements of this Iterator.
|
default boolean |
isEmpty()
Checks if this Traversable is empty.
|
default boolean |
isTraversableAgain()
Checks if this Traversable can be repeatedly traversed.
|
static <T> Iterator<T> |
iterate(T seed,
Function<? super T,? extends T> f)
Generates an infinite iterator using a function to calculate the next value
based on the previous.
|
default Iterator<T> |
iterator()
An iterator by means of head() and tail().
|
default int |
length()
Computes the number of elements of this Traversable.
|
default <U> Iterator<U> |
map(Function<? super T,? extends U> mapper)
Maps the elements of this Iterator lazily using the given
mapper . |
static <T> Iterator<T> |
narrow(Iterator<? extends T> iterator)
Narrows a widened
Iterator<? extends T> to Iterator<T>
by performing a type safe-cast. |
static <T> Iterator<T> |
of(T... elements)
Creates an Iterator which traverses the given elements.
|
static <T> Iterator<T> |
of(T element)
Creates an Iterator which traverses one element.
|
static Iterator<Boolean> |
ofAll(boolean[] array)
Creates an Iterator based on the elements of a boolean array.
|
static Iterator<Byte> |
ofAll(byte[] array)
Creates an Iterator based on the elements of a byte array.
|
static Iterator<Character> |
ofAll(char[] array)
Creates an Iterator based on the elements of a char array.
|
static Iterator<Double> |
ofAll(double[] array)
Creates ann Iterator based on the elements of a double array.
|
static Iterator<Float> |
ofAll(float[] array)
Creates an Iterator based on the elements of a float array.
|
static Iterator<Integer> |
ofAll(int[] array)
Creates an Iterator based on the elements of an int array.
|
static <T> Iterator<T> |
ofAll(Iterable<? extends T> iterable)
Creates an Iterator based on the given Iterable.
|
static <T> Iterator<T> |
ofAll(Iterator<? extends T> iterator)
Creates an Iterator based on the given Iterator by
delegating calls of
hasNext() and next() to it. |
static Iterator<Long> |
ofAll(long[] array)
Creates an Iterator based on the elements of a long array.
|
static Iterator<Short> |
ofAll(short[] array)
Creates an Iterator based on the elements of a short array.
|
default Tuple2<Iterator<T>,Iterator<T>> |
partition(Predicate<? super T> predicate)
Creates a partition of this
Traversable by splitting this elements in two in distinct tarversables
according to a predicate. |
default Iterator<T> |
peek(Consumer<? super T> action)
Performs the given
action on the first element if this is an eager implementation. |
static Iterator<Character> |
range(char from,
char toExclusive)
Creates an Iterator of characters starting from
from , extending to toExclusive - 1 . |
static Iterator<Integer> |
range(int from,
int toExclusive)
Creates an Iterator of int numbers starting from
from , extending to toExclusive - 1 . |
static Iterator<Long> |
range(long from,
long toExclusive)
Creates an Iterator of long numbers starting from
from , extending to toExclusive - 1 . |
static Iterator<Character> |
rangeBy(char from,
char toExclusive,
int step)
Creates an Iterator of characters starting from
from , extending to toExclusive - 1 ,
with step . |
static Iterator<Double> |
rangeBy(double from,
double toExclusive,
double step) |
static Iterator<Integer> |
rangeBy(int from,
int toExclusive,
int step)
Creates an Iterator of int numbers starting from
from , extending to toExclusive - 1 ,
with step . |
static Iterator<Long> |
rangeBy(long from,
long toExclusive,
long step)
Creates an Iterator of long numbers starting from
from , extending to toExclusive - 1 ,
with step . |
static Iterator<Character> |
rangeClosed(char from,
char toInclusive)
Creates an Iterator of characters starting from
from , extending to toInclusive . |
static Iterator<Integer> |
rangeClosed(int from,
int toInclusive)
Creates an Iterator of int numbers starting from
from , extending to toInclusive . |
static Iterator<Long> |
rangeClosed(long from,
long toInclusive)
Creates an Iterator of long numbers starting from
from , extending to toInclusive . |
static Iterator<Character> |
rangeClosedBy(char from,
char toInclusive,
int step)
Creates an Iterator of characters starting from
from , extending to toInclusive ,
with step . |
static Iterator<Double> |
rangeClosedBy(double from,
double toInclusive,
double step) |
static Iterator<Integer> |
rangeClosedBy(int from,
int toInclusive,
int step)
Creates an Iterator of int numbers starting from
from , extending to toInclusive ,
with step . |
static Iterator<Long> |
rangeClosedBy(long from,
long toInclusive,
long step)
Creates an Iterator of long numbers starting from
from , extending to toInclusive ,
with step . |
default T |
reduceLeft(BiFunction<? super T,? super T,? extends T> op)
Accumulates the elements of this Traversable by successively calling the given operation
op from the left. |
default T |
reduceRight(BiFunction<? super T,? super T,? extends T> op)
Accumulates the elements of this Traversable by successively calling the given operation
op from the right. |
default Iterator<T> |
replace(T currentElement,
T newElement)
Replaces the first occurrence (if exists) of the given currentElement with newElement.
|
default Iterator<T> |
replaceAll(T currentElement,
T newElement)
Replaces all occurrences of the given currentElement with newElement.
|
default Iterator<T> |
retainAll(Iterable<? extends T> elements)
Keeps all occurrences of the given elements from this.
|
default Traversable<T> |
scan(T zero,
BiFunction<? super T,? super T,? extends T> operation)
Computes a prefix scan of the elements of the collection.
|
default <U> Iterator<U> |
scanLeft(U zero,
BiFunction<? super U,? super T,? extends U> operation)
Produces a collection containing cumulative results of applying the
operator going left to right.
|
default <U> Iterator<U> |
scanRight(U zero,
BiFunction<? super T,? super U,? extends U> operation)
Produces a collection containing cumulative results of applying the
operator going right to left.
|
default Iterator<Seq<T>> |
sliding(long size)
Slides a window of a specific
size and step size 1 over this Traversable by calling
Traversable.sliding(long, long) . |
default Iterator<Seq<T>> |
sliding(long size,
long step)
Slides a window of a specific
size and step size over this Traversable . |
default Tuple2<Iterator<T>,Iterator<T>> |
span(Predicate<? super T> predicate)
Returns a tuple where the first element is the longest prefix of elements that satisfy the given
predicate and the second element is the remainder. |
default Spliterator<T> |
spliterator() |
default String |
stringPrefix()
Returns the name of this Value type, which is used by toString().
|
static <T> Iterator<T> |
tabulate(int n,
Function<? super Integer,? extends T> f)
Returns an Iterator on a sequence of
n values of a given Function f
over a range of integer values from 0 to n - 1 . |
default Iterator<T> |
tail()
Drops the first element of a non-empty Traversable.
|
default Option<Iterator<T>> |
tailOption()
Drops the first element of a non-empty Traversable and returns an
Option . |
default Iterator<T> |
take(long n)
Take the first n elements from this iterator.
|
default Iterator<T> |
takeRight(long n)
Takes the last n elements of this or all elements, if this length < n.
|
default Iterator<T> |
takeUntil(Predicate<? super T> predicate)
Takes elements until the predicate holds for the current element.
|
default Iterator<T> |
takeWhile(Predicate<? super T> predicate)
Takes elements while the predicate holds for the current element.
|
default <U> U |
transform(Function<? super Iterator<T>,? extends U> f)
Transforms this
Iterator . |
default <T1,T2> Tuple2<Iterator<T1>,Iterator<T2>> |
unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)
Unzips this elements by mapping this elements to pairs which are subsequently split into two distinct
sets.
|
default <T1,T2,T3> Tuple3<Iterator<T1>,Iterator<T2>,Iterator<T3>> |
unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
Unzips this elements by mapping this elements to triples which are subsequently split into three distinct
sets.
|
default <U> Iterator<Tuple2<T,U>> |
zip(Iterable<? extends U> that)
Returns a traversable formed from this traversable and another Iterable collection by combining
corresponding elements in pairs.
|
default <U> Iterator<Tuple2<T,U>> |
zipAll(Iterable<? extends U> that,
T thisElem,
U thatElem)
Returns a traversable formed from this traversable and another Iterable by combining corresponding elements in
pairs.
|
default Iterator<Tuple2<T,Long>> |
zipWithIndex()
Zips this traversable with its indices.
|
forEachRemaining, hasNext, next, remove
average, containsAll, count, existsUnique, find, foldLeft, hash, isSingleValued, last, lastOption, max, maxBy, maxBy, min, minBy, minBy, mkString, mkString, mkString, narrow, nonEmpty, product, reduceLeftOption, reduceRightOption, size, sum
fold, reduce, reduceOption
contains, corresponds, eq, equals, exists, forAll, forEach, getOption, getOrElse, getOrElse, getOrElseThrow, getOrElseTry, hashCode, narrow, out, out, stderr, stdout, toArray, toCharSeq, toJavaArray, toJavaArray, toJavaCollection, toJavaList, toJavaList, toJavaMap, toJavaMap, toJavaOptional, toJavaSet, toJavaSet, toJavaStream, toLeft, toLeft, toList, toMap, toOption, toQueue, toRight, toRight, toSet, toStack, toStream, toString, toTree, toTry, toTry, toVector
@SafeVarargs static <T> Iterator<T> concat(Iterable<? extends T>... iterables)
T
- Component type.iterables
- The iterablesjavaslang.collection.Iterator
static <T> Iterator<T> concat(Iterable<? extends Iterable<? extends T>> iterables)
T
- Component type.iterables
- The iterable of iterablesjavaslang.collection.Iterator
static <T> Iterator<T> empty()
T
- Component typestatic <T> Iterator<T> narrow(Iterator<? extends T> iterator)
Iterator<? extends T>
to Iterator<T>
by performing a type safe-cast. This is eligible because immutable/read-only
collections are covariant.T
- Component type of the Iterator
.iterator
- An Iterator
.iterator
instance as narrowed type Iterator<T>
.static <T> Iterator<T> of(T element)
T
- Component type.element
- An element@SafeVarargs static <T> Iterator<T> of(T... elements)
T
- Component typeelements
- Zero or more elementsstatic <T> Iterator<T> ofAll(Iterable<? extends T> iterable)
Iterator.of(iterable.iterator()
.T
- Component type.iterable
- A Iterable
javaslang.collection.Iterator
static <T> Iterator<T> ofAll(Iterator<? extends T> iterator)
hasNext()
and next()
to it.T
- Component type.iterator
- A Iterator
javaslang.collection.Iterator
static Iterator<Boolean> ofAll(boolean[] array)
array
- a boolean arraystatic Iterator<Byte> ofAll(byte[] array)
array
- a byte arraystatic Iterator<Character> ofAll(char[] array)
array
- a char arraystatic Iterator<Double> ofAll(double[] array)
array
- a double arraystatic Iterator<Float> ofAll(float[] array)
array
- a float arraystatic Iterator<Integer> ofAll(int[] array)
array
- an int arraystatic Iterator<Long> ofAll(long[] array)
array
- a long arraystatic Iterator<Short> ofAll(short[] array)
array
- a short arraystatic <T> Iterator<T> tabulate(int n, Function<? super Integer,? extends T> f)
n
values of a given Function f
over a range of integer values from 0 to n - 1
.T
- Component type of the Iteratorn
- The number of elementsf
- The Function computing element valuesf(0),f(1), ..., f(n - 1)
NullPointerException
- if f
is nullstatic <T> Iterator<T> fill(int n, Supplier<? extends T> s)
n
values supplied by a given Supplier s
.T
- Component type of the Iteratorn
- The number of elementss
- The Supplier computing element valuesn
elements, where each element contains the result supplied by s
.NullPointerException
- if s
is nullstatic Iterator<Character> range(char from, char toExclusive)
from
, extending to toExclusive - 1
.
Examples:
Iterator.range('a', 'c') // = ('a', 'b')
Iterator.range('c', 'a') // = ()
from
- the first charactertoExclusive
- the successor of the last characterfrom >= toExclusive
static Iterator<Character> rangeBy(char from, char toExclusive, int step)
from
, extending to toExclusive - 1
,
with step
.
Examples:
Iterator.rangeBy('a', 'c', 1) // = ('a', 'b')
Iterator.rangeBy('a', 'd', 2) // = ('a', 'c')
Iterator.rangeBy('d', 'a', -2) // = ('d', 'b')
Iterator.rangeBy('d', 'a', 2) // = ()
from
- the first charactertoExclusive
- the successor of the last character if step > 0, the predecessor of the last character if step < 0step
- the step(from == toExclusive) || (step * (from - toExclusive) > 0)
.IllegalArgumentException
- if step
is zerostatic Iterator<Integer> range(int from, int toExclusive)
from
, extending to toExclusive - 1
.
Examples:
Iterator.range(0, 0) // = ()
Iterator.range(2, 0) // = ()
Iterator.range(-2, 2) // = (-2, -1, 0, 1)
from
- the first numbertoExclusive
- the last number + 1from >= toExclusive
static Iterator<Integer> rangeBy(int from, int toExclusive, int step)
from
, extending to toExclusive - 1
,
with step
.
Examples:
Iterator.rangeBy(1, 3, 1) // = (1, 2)
Iterator.rangeBy(1, 4, 2) // = (1, 3)
Iterator.rangeBy(4, 1, -2) // = (4, 2)
Iterator.rangeBy(4, 1, 2) // = ()
from
- the first numbertoExclusive
- the last number + 1 if step > 0, the last number - 1 if step < 0step
- the step(from == toExclusive) || (step * (from - toExclusive) > 0)
.IllegalArgumentException
- if step
is zerostatic Iterator<Long> range(long from, long toExclusive)
from
, extending to toExclusive - 1
.
Examples:
Iterator.range(0L, 0L) // = ()
Iterator.range(2L, 0L) // = ()
Iterator.range(-2L, 2L) // = (-2L, -1L, 0L, 1L)
from
- the first numbertoExclusive
- the last number + 1from >= toExclusive
static Iterator<Long> rangeBy(long from, long toExclusive, long step)
from
, extending to toExclusive - 1
,
with step
.
Examples:
Iterator.rangeBy(1L, 3L, 1L) // = (1L, 2L)
Iterator.rangeBy(1L, 4L, 2L) // = (1L, 3L)
Iterator.rangeBy(4L, 1L, -2L) // = (4L, 2L)
Iterator.rangeBy(4L, 1L, 2L) // = ()
from
- the first numbertoExclusive
- the last number + 1 if step > 0, the last number - 1 if step < 0step
- the step(from == toExclusive) || (step * (from - toExclusive) > 0)
.IllegalArgumentException
- if step
is zerostatic Iterator<Character> rangeClosed(char from, char toInclusive)
from
, extending to toInclusive
.
Examples:
Iterator.rangeClosed('a', 'c') // = ('a', 'b', 'c')
Iterator.rangeClosed('c', 'a') // = ()
from
- the first charactertoInclusive
- the last characterfrom > toInclusive
static Iterator<Character> rangeClosedBy(char from, char toInclusive, int step)
from
, extending to toInclusive
,
with step
.
Examples:
Iterator.rangeClosedBy('a', 'c', 1) // = ('a', 'b', 'c')
Iterator.rangeClosedBy('a', 'd', 2) // = ('a', 'c')
Iterator.rangeClosedBy('d', 'a', -2) // = ('d', 'b')
Iterator.rangeClosedBy('d', 'a', 2) // = ()
from
- the first charactertoInclusive
- the last characterstep
- the stepstep * (from - toInclusive) > 0
.IllegalArgumentException
- if step
is zerostatic Iterator<Integer> rangeClosed(int from, int toInclusive)
from
, extending to toInclusive
.
Examples:
Iterator.rangeClosed(0, 0) // = (0)
Iterator.rangeClosed(2, 0) // = ()
Iterator.rangeClosed(-2, 2) // = (-2, -1, 0, 1, 2)
from
- the first numbertoInclusive
- the last numberfrom > toInclusive
static Iterator<Integer> rangeClosedBy(int from, int toInclusive, int step)
from
, extending to toInclusive
,
with step
.
Examples:
Iterator.rangeClosedBy(1, 3, 1) // = (1, 2, 3)
Iterator.rangeClosedBy(1, 4, 2) // = (1, 3)
Iterator.rangeClosedBy(4, 1, -2) // = (4, 2)
Iterator.rangeClosedBy(4, 1, 2) // = ()
from
- the first numbertoInclusive
- the last numberstep
- the stepstep * (from - toInclusive) > 0
.IllegalArgumentException
- if step
is zerostatic Iterator<Long> rangeClosed(long from, long toInclusive)
from
, extending to toInclusive
.
Examples:
Iterator.rangeClosed(0L, 0L) // = (0L)
Iterator.rangeClosed(2L, 0L) // = ()
Iterator.rangeClosed(-2L, 2L) // = (-2L, -1L, 0L, 1L, 2L)
from
- the first numbertoInclusive
- the last numberfrom > toInclusive
static Iterator<Long> rangeClosedBy(long from, long toInclusive, long step)
from
, extending to toInclusive
,
with step
.
Examples:
Iterator.rangeClosedBy(1L, 3L, 1L) // = (1L, 2L, 3L)
Iterator.rangeClosedBy(1L, 4L, 2L) // = (1L, 3L)
Iterator.rangeClosedBy(4L, 1L, -2L) // = (4L, 2L)
Iterator.rangeClosedBy(4L, 1L, 2L) // = ()
from
- the first numbertoInclusive
- the last numberstep
- the stepstep * (from - toInclusive) > 0
.IllegalArgumentException
- if step
is zerostatic Iterator<Integer> from(int value)
value
.
The Iterator
extends to Integer.MIN_VALUE
when passing Integer.MAX_VALUE
.
value
- a start int valueIterator
of int values starting from from
static Iterator<Integer> from(int value, int step)
value
and spaced by step
.
The Iterator
extends to Integer.MIN_VALUE
when passing Integer.MAX_VALUE
.
value
- a start int valuestep
- the step by which to advance on each iterationIterator
of int values starting from from
static Iterator<Long> from(long value)
value
.
The Iterator
extends to Long.MIN_VALUE
when passing Long.MAX_VALUE
.
value
- a start long valueIterator
of long values starting from from
static Iterator<Long> from(long value, long step)
value
and spaced by step
.
The Iterator
extends to Long.MIN_VALUE
when passing Long.MAX_VALUE
.
value
- a start long valuestep
- the step by which to advance on each iterationIterator
of long values starting from from
static <T> Iterator<T> continually(Supplier<? extends T> supplier)
T
- value typesupplier
- A Supplier of iterator valuesIterator
static <T> Iterator<T> iterate(T seed, Function<? super T,? extends T> f)
T
- value typeseed
- The first value in the iteratorf
- A function to calculate the next value based on the previousIterator
static <T> Iterator<T> continually(T t)
T
- Element typet
- An elementt
's.default Iterator<T> intersperse(T element)
element
- An element.default <U> U transform(Function<? super Iterator<T>,? extends U> f)
Iterator
.U
- Type of transformation resultf
- A transformationU
NullPointerException
- if f
is nulldefault <U> Iterator<Tuple2<T,U>> zip(Iterable<? extends U> that)
Traversable
The length of the returned traversable is the minimum of the lengths of this traversable and that
iterable.
zip
in interface Traversable<T>
U
- The type of the second half of the returned pairs.that
- The Iterable providing the second half of each result pair.that
iterable.default <U> Iterator<Tuple2<T,U>> zipAll(Iterable<? extends U> that, T thisElem, U thatElem)
Traversable
The length of the returned traversable is the maximum of the lengths of this traversable and that
iterable.
Special case: if this traversable is shorter than that elements, and that elements contains duplicates, the resulting traversable may be shorter than the maximum of the lengths of this and that because a traversable contains an element at most once.
If this Traversable is shorter than that, thisElem values are used to fill the result. If that is shorter than this Traversable, thatElem values are used to fill the result.
zipAll
in interface Traversable<T>
U
- The type of the second half of the returned pairs.that
- The Iterable providing the second half of each result pair.thisElem
- The element to be used to fill up the result if this traversable is shorter than that.thatElem
- The element to be used to fill up the result if that is shorter than this traversable.default Iterator<Tuple2<T,Long>> zipWithIndex()
Traversable
zipWithIndex
in interface Traversable<T>
default <T1,T2> Tuple2<Iterator<T1>,Iterator<T2>> unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)
Traversable
unzip
in interface Traversable<T>
T1
- 1st element type of a pair returned by unzipperT2
- 2nd element type of a pair returned by unzipperunzipper
- a function which converts elements of this to pairsdefault <T1,T2,T3> Tuple3<Iterator<T1>,Iterator<T2>,Iterator<T3>> unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
Traversable
unzip3
in interface Traversable<T>
T1
- 1st element type of a triplet returned by unzipperT2
- 2nd element type of a triplet returned by unzipperT3
- 3rd element type of a triplet returned by unzipperunzipper
- a function which converts elements of this to pairsdefault Iterator<T> distinct()
Traversable
equals
.distinct
in interface Traversable<T>
Traversable
containing this elements without duplicatesdefault Iterator<T> distinctBy(Comparator<? super T> comparator)
Traversable
comparator
.distinctBy
in interface Traversable<T>
comparator
- A comparatorTraversable
containing this elements without duplicatesdefault <U> Iterator<T> distinctBy(Function<? super T,? extends U> keyExtractor)
Traversable
equals
.
The elements of the result are determined in the order of their occurrence - first match wins.
distinctBy
in interface Traversable<T>
U
- key typekeyExtractor
- A key extractorTraversable
containing this elements without duplicatesdefault Iterator<T> drop(long n)
drop
in interface Traversable<T>
n
- A numbern <= 0
or this is empty, otherwise a new iterator without the first n elements.default Iterator<T> dropRight(long n)
Traversable
dropRight
in interface Traversable<T>
n
- The number of elements to drop.default Iterator<T> dropUntil(Predicate<? super T> predicate)
Traversable
Note: This is essentially the same as dropWhile(predicate.negate())
. It is intended to be used with
method references, which cannot be negated directly.
dropUntil
in interface Traversable<T>
predicate
- A condition tested subsequently for this elements.default Iterator<T> dropWhile(Predicate<? super T> predicate)
Traversable
dropWhile
in interface Traversable<T>
predicate
- A condition tested subsequently for this elements starting with the first.default Iterator<T> filter(Predicate<? super T> predicate)
predicate
.filter
in interface Traversable<T>
predicate
- A predicatedefault Option<T> findLast(Predicate<? super T> predicate)
Traversable
Same as reverse().find(predicate)
.
findLast
in interface Traversable<T>
predicate
- A predicate.List.of(null).find(e -> e == null)
).default <U> Iterator<U> flatMap(Function<? super T,? extends Iterable<? extends U>> mapper)
flatMap
in interface Traversable<T>
U
- Component typemapper
- A mapperdefault <U> U foldRight(U zero, BiFunction<? super T,? super U,? extends U> f)
Traversable
f
from the right,
starting with a value zero
of type B.
Example: List.of("a", "b", "c").foldRight("", (x, xs) -> x + xs) = "abc"
default T get()
Value
default <C> Map<C,Iterator<T>> groupBy(Function<? super T,? extends C> classifier)
Traversable
groupBy
in interface Traversable<T>
C
- classified class typeclassifier
- A function which classifies elements into classesdefault Iterator<Seq<T>> grouped(long size)
Traversable
Traversable
into fixed size blocks.
Let length be the length of this Iterable. Then grouped is defined as follows:
this.isEmpty()
, the resulting Iterator
is empty.size <= length
, the resulting Iterator
will contain length / size
blocks of size
size
and maybe a non-empty block of size length % size
, if there are remaining elements.size > length
, the resulting Iterator
will contain one block of size length
.
[].grouped(1) = []
[].grouped(0) throws
[].grouped(-1) throws
[1,2,3,4].grouped(2) = [[1,2],[3,4]]
[1,2,3,4,5].grouped(2) = [[1,2],[3,4],[5]]
[1,2,3,4].grouped(5) = [[1,2,3,4]]
Please note that grouped(int)
is a special case of Traversable.sliding(long, long), i.e.
grouped(size)
is the same as sliding(size, size)
.grouped
in interface Traversable<T>
size
- a positive block sizedefault boolean hasDefiniteSize()
Traversable
This method should be implemented by classes only, i.e. not by interfaces.
hasDefiniteSize
in interface Traversable<T>
default T head()
Traversable
head
in interface Traversable<T>
default Option<T> headOption()
Traversable
Option
.headOption
in interface Traversable<T>
Some(element)
or None
if this is empty.default Iterator<T> init()
Traversable
init
in interface Traversable<T>
default Option<Iterator<T>> initOption()
Traversable
Option
.initOption
in interface Traversable<T>
Some(traversable)
or None
if this is empty.default boolean isEmpty()
Traversable
default boolean isTraversableAgain()
Traversable
This method should be implemented by classes only, i.e. not by interfaces.
isTraversableAgain
in interface Traversable<T>
default Iterator<T> iterator()
Traversable
default int length()
Traversable
Same as Traversable.size()
.
length
in interface Traversable<T>
default <U> Iterator<U> map(Function<? super T,? extends U> mapper)
mapper
.default Tuple2<Iterator<T>,Iterator<T>> partition(Predicate<? super T> predicate)
Traversable
Traversable
by splitting this elements in two in distinct tarversables
according to a predicate.partition
in interface Traversable<T>
predicate
- A predicate which classifies an element if it is in the first or the second traversable.Traversable
contains all elements that satisfy the given predicate
, the second Traversable
contains all elements that don't. The original order of elements is preserved.default Iterator<T> peek(Consumer<? super T> action)
Value
action
on the first element if this is an eager implementation.
Performs the given action
on all elements (the first immediately, successive deferred),
if this is a lazy implementation.default T reduceLeft(BiFunction<? super T,? super T,? extends T> op)
Traversable
op
from the left.reduceLeft
in interface Foldable<T>
reduceLeft
in interface Traversable<T>
op
- A BiFunction of type Tdefault T reduceRight(BiFunction<? super T,? super T,? extends T> op)
Traversable
op
from the right.reduceRight
in interface Foldable<T>
reduceRight
in interface Traversable<T>
op
- An operation of type Tdefault Iterator<T> replace(T currentElement, T newElement)
Traversable
replace
in interface Traversable<T>
currentElement
- An element to be substituted.newElement
- A replacement for currentElement.default Iterator<T> replaceAll(T currentElement, T newElement)
Traversable
replaceAll
in interface Traversable<T>
currentElement
- An element to be substituted.newElement
- A replacement for currentElement.default Iterator<T> retainAll(Iterable<? extends T> elements)
Traversable
retainAll
in interface Traversable<T>
elements
- Elements to be kept.default Traversable<T> scan(T zero, BiFunction<? super T,? super T,? extends T> operation)
Traversable
scan
in interface Traversable<T>
zero
- neutral element for the operator opoperation
- the associative operator for the scandefault <U> Iterator<U> scanLeft(U zero, BiFunction<? super U,? super T,? extends U> operation)
Traversable
scanLeft
in interface Traversable<T>
U
- the type of the elements in the resulting collectionzero
- the initial valueoperation
- the binary operator applied to the intermediate result and the elementdefault <U> Iterator<U> scanRight(U zero, BiFunction<? super T,? super U,? extends U> operation)
Traversable
scanRight
in interface Traversable<T>
U
- the type of the elements in the resulting collectionzero
- the initial valueoperation
- the binary operator applied to the intermediate result and the elementdefault Iterator<Seq<T>> sliding(long size)
Traversable
size
and step size 1 over this Traversable
by calling
Traversable.sliding(long, long)
.sliding
in interface Traversable<T>
size
- a positive window sizedefault Iterator<Seq<T>> sliding(long size, long step)
Traversable
size
and step
size over this Traversable
.
Examples:
[].sliding(1,1) = []
[1,2,3,4,5].sliding(2,3) = [[1,2],[4,5]]
[1,2,3,4,5].sliding(2,4) = [[1,2],[5]]
[1,2,3,4,5].sliding(2,5) = [[1,2]]
[1,2,3,4].sliding(5,3) = [[1,2,3,4],[4]]
sliding
in interface Traversable<T>
size
- a positive window sizestep
- a positive step sizedefault Tuple2<Iterator<T>,Iterator<T>> span(Predicate<? super T> predicate)
Traversable
predicate
and the second element is the remainder.span
in interface Traversable<T>
predicate
- A predicate.default Spliterator<T> spliterator()
spliterator
in interface Iterable<T>
default String stringPrefix()
Value
stringPrefix
in interface Value<T>
default Iterator<T> tail()
Traversable
tail
in interface Traversable<T>
default Option<Iterator<T>> tailOption()
Traversable
Option
.tailOption
in interface Traversable<T>
Some(traversable)
or None
if this is empty.default Iterator<T> take(long n)
take
in interface Traversable<T>
n
- A numbern <= 0
or this is empty, otherwise a new iterator without the first n elements.default Iterator<T> takeRight(long n)
Traversable
The result is equivalent to sublist(max(0, min(length(), length() - n)), n)
, i.e. takeRight will not
throw if n < 0
or n > length()
.
In the case of n < 0
the empty instance is returned, in the case of n > length()
this is returned.
takeRight
in interface Traversable<T>
n
- The number of elements to take.default Iterator<T> takeUntil(Predicate<? super T> predicate)
Traversable
Note: This is essentially the same as takeWhile(predicate.negate())
. It is intended to be used with
method references, which cannot be negated directly.
takeUntil
in interface Traversable<T>
predicate
- A condition tested subsequently for this elements.default Iterator<T> takeWhile(Predicate<? super T> predicate)
Traversable
takeWhile
in interface Traversable<T>
predicate
- A condition tested subsequently for the contained elements.Copyright © 2016. All Rights Reserved.