Interface Iterator<T>
- Type Parameters:
T- Component type
- All Superinterfaces:
Foldable<T>, Iterable<T>, Iterator<T>, Traversable<T>, Value<T>
- All Known Implementing Classes:
AbstractIterator, BitSetModule.BitSetIterator, HashArrayMappedTrieModule.LeafNodeIterator, IteratorModule.CachedIterator, IteratorModule.ConcatIterator, IteratorModule.DistinctIterator, IteratorModule.EmptyIterator, IteratorModule.GroupedIterator, StreamModule.FlatMapIterator, StreamModule.StreamIterator
io.vavr.collection.Iterator is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements.
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.
-
Method Summary
Modifier and TypeMethodDescriptiondefault <R> Iterator<R> collect(PartialFunction<? super T, ? extends R> partialFunction) Collects all elements that are in the domain of the givenpartialFunctionby mapping the elements to typeR.static <T> Iterator<T> Creates an Iterator which traverses along the concatenation of the given iterables.static <T> Iterator<T> Creates an Iterator which traverses along the concatenation of the given iterables.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.distinct()Returns a new version of this which contains no duplicates.distinctBy(Comparator<? super T> comparator) Returns a new version of this which contains no duplicates.distinctBy(Function<? super T, ? extends U> keyExtractor) Returns a new version of this which contains no duplicates.drop(int n) Removes up to n elements from this iterator.dropRight(int n) Drops the last n elements of this or all elements, if this length < n.Drops elements until the predicate holds for the current element.Drops elements while the predicate holds for the current element.static <T> Iterator<T> empty()Returns the empty Iterator.static <T> Iterator<T> Returns an Iterator on a sequence ofnvalues supplied by a given Suppliers.static <T> Iterator<T> fill(int n, T element) Returns a Iterator containingntimes the givenelementReturns an Iterator that contains elements that satisfy the givenpredicate.Returns the last element of this which satisfies the given predicate.default <U> Iterator<U> FlatMaps the elements of this Iterator to Iterables, which are iterated in the order of occurrence.default <U> UfoldRight(U zero, BiFunction<? super T, ? super U, ? extends U> f) Folds this elements from the right, starting withzeroand successively callingcombine.from(int value) Returns an infinite iterator of int values starting fromvalue.from(int value, int step) Returns an infinite iterator of int values starting fromvalueand spaced bystep.from(long value) Returns an infinite iterator of long values starting fromvalue.from(long value, long step) Returns an infinite iterator of long values starting fromvalueand spaced bystep.default Tget()Gets the first value in iteration order if thisTraversableis not empty, otherwise throws.Groups this elements by classifying the elements.grouped(int size) Groups thisTraversableinto fixed size blocks.default booleanChecks if this Traversable is known to have a finite size.default Thead()Returns the first element of a non-empty Traversable.init()Dual of Traversable.tail(), returning all elements except the last.Dual of Traversable.tailOption(), returning all elements except the last asOption.intersperse(T element) Inserts an element between all elements of this Iterator.default booleanisAsync()AnIteratoris computed synchronously.default booleanisEmpty()Checks if this Traversable is empty.default booleanisLazy()AnIteratoris computed lazily.default booleanChecks if the elements of this Traversable appear in encounter order.default booleanChecks if this Traversable can be repeatedly traversed.static <T> Iterator<T> Creates an iterator that repeatedly invokes the supplier while it's aSomeand end on the firstNonestatic <T> Iterator<T> Generates an infinite iterator using a function to calculate the next value based on the previous.iterator()An iterator by means of head() and tail().default Tlast()Dual of Traversable.head(), returning the last element.default intlength()Computes the number of elements of this Traversable.default <U> Iterator<U> Maps the elements of this Iterator lazily using the givenmapper.static <T> Iterator<T> Narrows a widenedIterator<? extends T>toIterator<T>by performing a type-safe cast.static <T> Iterator<T> of(T element) Creates an Iterator which traverses one element.static <T> Iterator<T> of(T... elements) Creates an Iterator which traverses the given elements.ofAll(boolean... elements) Creates an Iterator from boolean values.ofAll(byte... elements) Creates an Iterator from byte values.ofAll(char... elements) Creates an Iterator from char values.ofAll(double... elements) Creates ann Iterator from double values.ofAll(float... elements) Creates an Iterator from float values.ofAll(int... elements) Creates an Iterator from int values.ofAll(long... elements) Creates an Iterator from long values.ofAll(short... elements) Creates an Iterator from short values.static <T> Iterator<T> Creates an Iterator based on the given Iterable.static <T> Iterator<T> Creates an Iterator based on the given Iterator by delegating calls ofhasNext()andnext()to it.Returns thisTraversableif it is nonempty, otherwise return the alternative.Returns thisTraversableif it is nonempty, otherwise return the result of evaluating supplier.Creates a partition of thisTraversableby splitting this elements in two in distinct traversables according to a predicate.Performs the givenactionon the first element if this is an eager implementation.range(char from, char toExclusive) Creates an Iterator of characters starting fromfrom, extending totoExclusive - 1.range(int from, int toExclusive) Creates an Iterator of int numbers starting fromfrom, extending totoExclusive - 1.range(long from, long toExclusive) Creates an Iterator of long numbers starting fromfrom, extending totoExclusive - 1.rangeBy(char from, char toExclusive, int step) Creates an Iterator of characters starting fromfrom, extending totoExclusive - 1, withstep.rangeBy(double from, double toExclusive, double step) rangeBy(int from, int toExclusive, int step) Creates an Iterator of int numbers starting fromfrom, extending totoExclusive - 1, withstep.rangeBy(long from, long toExclusive, long step) Creates an Iterator of long numbers starting fromfrom, extending totoExclusive - 1, withstep.static Iterator<BigDecimal> rangeBy(BigDecimal from, BigDecimal toExclusive, BigDecimal step) rangeClosed(char from, char toInclusive) Creates an Iterator of characters starting fromfrom, extending totoInclusive.rangeClosed(int from, int toInclusive) Creates an Iterator of int numbers starting fromfrom, extending totoInclusive.rangeClosed(long from, long toInclusive) Creates an Iterator of long numbers starting fromfrom, extending totoInclusive.rangeClosedBy(char from, char toInclusive, int step) Creates an Iterator of characters starting fromfrom, extending totoInclusive, withstep.rangeClosedBy(double from, double toInclusive, double step) rangeClosedBy(int from, int toInclusive, int step) Creates an Iterator of int numbers starting fromfrom, extending totoInclusive, withstep.rangeClosedBy(long from, long toInclusive, long step) Creates an Iterator of long numbers starting fromfrom, extending totoInclusive, withstep.default TreduceLeft(BiFunction<? super T, ? super T, ? extends T> op) Accumulates the elements of this Traversable by successively calling the given operationopfrom the left.default TreduceRight(BiFunction<? super T, ? super T, ? extends T> op) Accumulates the elements of this Traversable by successively calling the given operationopfrom the right.Returns a new traversable consisting of all elements which do not satisfy the given predicate.Replaces the first occurrence (if exists) of the given currentElement with newElement.replaceAll(T currentElement, T newElement) Replaces all occurrences of the given currentElement with newElement.Keeps all occurrences of the given elements from this.default Traversable<T> 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.Slides a non-overlapping window of a variable size over thisTraversable.sliding(int size) Slides a window of a specificsizeand step size 1 over thisTraversableby callingTraversable.sliding(int, int).sliding(int size, int step) Slides a window of a specificsizeandstepsize over thisTraversable.Returns a tuple where the first element is the longest prefix of elements that satisfy the givenpredicateand the second element is the remainder.default StringReturns the name of this Value type, which is used by toString().static <T> Iterator<T> Returns an Iterator on a sequence ofnvalues of a given Functionfover a range of integer values from 0 ton - 1.tail()Drops the first element of a non-empty Traversable.Drops the first element of a non-empty Traversable and returns anOption.take(int n) Take the first n elements from this iterator.takeRight(int n) Takes the last n elements of this or all elements, if this length < n.Takes elements until the predicate holds for the current element.Takes elements while the predicate holds for the current element.default <U> UTransforms thisIterator.static <T> Iterator<T> Creates an iterator from a seed value and a function.static <T,U> Iterator <U> unfoldLeft(T seed, Function<? super T, Option<Tuple2<? extends T, ? extends U>>> f) Creates an iterator from a seed value and a function.static <T,U> Iterator <U> unfoldRight(T seed, Function<? super T, Option<Tuple2<? extends U, ? extends T>>> f) Creates an iterator from a seed value and a function.Unzips this elements by mapping this elements to pairs which are subsequently split into two distinct sets.Unzips this elements by mapping this elements to triples which are subsequently split into three distinct sets.Returns a traversable formed from this traversable and another Iterable collection by combining corresponding elements in pairs.Returns a traversable formed from this traversable and another Iterable by combining corresponding elements in pairs.default <U,R> Iterator <R> zipWith(Iterable<? extends U> that, BiFunction<? super T, ? super U, ? extends R> mapper) Returns a traversable formed from this traversable and another Iterable collection by mapping elements.Zips this traversable with its indices.default <U> Iterator<U> zipWithIndex(BiFunction<? super T, ? super Integer, ? extends U> mapper) Zips this traversable with its indices by applying mapper provided.Methods inherited from interface Foldable
fold, reduce, reduceOptionMethods inherited from interface Iterator
forEachRemaining, hasNext, next, removeMethods inherited from interface Traversable
arrangeBy, average, containsAll, count, equals, existsUnique, find, foldLeft, forEachWithIndex, hashCode, headOption, isDistinct, isOrdered, isSingleValued, lastOption, max, maxBy, maxBy, min, minBy, minBy, mkCharSeq, mkCharSeq, mkCharSeq, mkString, mkString, mkString, nonEmpty, product, reduceLeftOption, reduceRightOption, single, singleOption, size, spliterator, sumMethods inherited from interface Value
collect, collect, contains, corresponds, eq, exists, forAll, forEach, getOrElse, getOrElse, getOrElseThrow, getOrElseTry, getOrNull, out, out, stderr, stdout, toArray, toCharSeq, toCompletableFuture, toEither, toEither, toInvalid, toInvalid, toJavaArray, toJavaArray, toJavaArray, toJavaCollection, toJavaList, toJavaList, toJavaMap, toJavaMap, toJavaMap, toJavaOptional, toJavaParallelStream, toJavaSet, toJavaSet, toJavaStream, toLeft, toLeft, toLinkedMap, toLinkedMap, toLinkedSet, toList, toMap, toMap, toOption, toPriorityQueue, toPriorityQueue, toQueue, toRight, toRight, toSet, toSortedMap, toSortedMap, toSortedMap, toSortedMap, toSortedSet, toSortedSet, toStream, toString, toTree, toTree, toTry, toTry, toValid, toValid, toValidation, toValidation, toVector
-
Method Details
-
concat
Creates an Iterator which traverses along the concatenation of the given iterables.- Type Parameters:
T- Component type.- Parameters:
iterables- The iterables- Returns:
- A new
io.vavr.collection.Iterator
-
concat
-
empty
Returns the empty Iterator.- Type Parameters:
T- Component type- Returns:
- The empty Iterator
-
narrow
Narrows a widenedIterator<? extends T>toIterator<T>by performing a type-safe cast. This is eligible because immutable/read-only collections are covariant.- Type Parameters:
T- Component type of theIterator.- Parameters:
iterator- AnIterator.- Returns:
- the given
iteratorinstance as narrowed typeIterator<T>.
-
of
Creates an Iterator which traverses one element.- Type Parameters:
T- Component type.- Parameters:
element- An element- Returns:
- A new Iterator
-
of
Creates an Iterator which traverses the given elements.- Type Parameters:
T- Component type- Parameters:
elements- Zero or more elements- Returns:
- A new Iterator
-
ofAll
-
ofAll
-
ofAll
Creates an Iterator from boolean values.- Parameters:
elements- boolean values- Returns:
- A new Iterator of Boolean values
- Throws:
NullPointerException- if elements is null
-
ofAll
Creates an Iterator from byte values.- Parameters:
elements- byte values- Returns:
- A new Iterator of Byte values
- Throws:
NullPointerException- if elements is null
-
ofAll
Creates an Iterator from char values.- Parameters:
elements- char values- Returns:
- A new Iterator of Character values
- Throws:
NullPointerException- if elements is null
-
ofAll
Creates ann Iterator from double values.- Parameters:
elements- double values- Returns:
- A new Iterator of Double values
- Throws:
NullPointerException- if elements is null
-
ofAll
Creates an Iterator from float values.- Parameters:
elements- float values- Returns:
- A new Iterator of Float values
- Throws:
NullPointerException- if elements is null
-
ofAll
Creates an Iterator from int values.- Parameters:
elements- int values- Returns:
- A new Iterator of Integer values
- Throws:
NullPointerException- if elements is null
-
ofAll
Creates an Iterator from long values.- Parameters:
elements- long values- Returns:
- A new Iterator of Long values
- Throws:
NullPointerException- if elements is null
-
ofAll
Creates an Iterator from short values.- Parameters:
elements- short values- Returns:
- A new Iterator of Short values
- Throws:
NullPointerException- if elements is null
-
tabulate
Returns an Iterator on a sequence ofnvalues of a given Functionfover a range of integer values from 0 ton - 1.- Type Parameters:
T- Component type of the Iterator- Parameters:
n- The number of elementsf- The Function computing element values- Returns:
- An Iterator on a sequence of elements
f(0),f(1), ..., f(n - 1) - Throws:
NullPointerException- iffis null
-
fill
Returns an Iterator on a sequence ofnvalues supplied by a given Suppliers.- Type Parameters:
T- Component type of the Iterator- Parameters:
n- The number of elementss- The Supplier computing element values- Returns:
- An iterator on a sequence of
nelements, where each element contains the result supplied bys. - Throws:
NullPointerException- ifsis null
-
fill
Returns a Iterator containingntimes the givenelement- Type Parameters:
T- Component type of the Iterator- Parameters:
n- The number of elementselement- The element- Returns:
- An iterator of
nsequence elements, where each element is the givenelement.
-
range
Creates an Iterator of characters starting fromfrom, extending totoExclusive - 1.Examples:
Iterator.range('a', 'c') // = ('a', 'b') Iterator.range('c', 'a') // = ()- Parameters:
from- the first charactertoExclusive- the successor of the last character- Returns:
- a range of characters as specified or the empty range if
from >= toExclusive
-
rangeBy
Creates an Iterator of characters starting fromfrom, extending totoExclusive - 1, withstep.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) // = ()- Parameters:
from- the first charactertoExclusive- the successor of the last character if step > 0, the predecessor of the last character if step < 0step- the step- Returns:
- a range of characters as specified or the empty range if
signum(step) == signum(from - toExclusive). - Throws:
IllegalArgumentException- ifstepis zero
-
rangeBy
@GwtIncompatible("BigDecimalHelper is GwtIncompatible") static Iterator<Double> rangeBy(double from, double toExclusive, double step) -
rangeBy
-
range
Creates an Iterator of int numbers starting fromfrom, extending totoExclusive - 1.Examples:
Iterator.range(0, 0) // = () Iterator.range(2, 0) // = () Iterator.range(-2, 2) // = (-2, -1, 0, 1)- Parameters:
from- the first numbertoExclusive- the last number + 1- Returns:
- a range of int values as specified or the empty range if
from >= toExclusive
-
rangeBy
Creates an Iterator of int numbers starting fromfrom, extending totoExclusive - 1, withstep.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) // = ()- Parameters:
from- the first numbertoExclusive- the last number + 1 if step > 0, the last number - 1 if step < 0step- the step- Returns:
- a range of long values as specified or the empty range if
(from == toExclusive) || (step * (from - toExclusive) > 0). - Throws:
IllegalArgumentException- ifstepis zero
-
range
Creates an Iterator of long numbers starting fromfrom, extending totoExclusive - 1.Examples:
Iterator.range(0L, 0L) // = () Iterator.range(2L, 0L) // = () Iterator.range(-2L, 2L) // = (-2L, -1L, 0L, 1L)- Parameters:
from- the first numbertoExclusive- the last number + 1- Returns:
- a range of long values as specified or the empty range if
from >= toExclusive
-
rangeBy
Creates an Iterator of long numbers starting fromfrom, extending totoExclusive - 1, withstep.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) // = ()- Parameters:
from- the first numbertoExclusive- the last number + 1 if step > 0, the last number - 1 if step < 0step- the step- Returns:
- a range of long values as specified or the empty range if
(from == toExclusive) || (step * (from - toExclusive) > 0). - Throws:
IllegalArgumentException- ifstepis zero
-
rangeClosed
Creates an Iterator of characters starting fromfrom, extending totoInclusive.Examples:
Iterator.rangeClosed('a', 'c') // = ('a', 'b', 'c') Iterator.rangeClosed('c', 'a') // = ()- Parameters:
from- the first charactertoInclusive- the last character- Returns:
- a range of characters as specified or the empty range if
from > toInclusive
-
rangeClosedBy
Creates an Iterator of characters starting fromfrom, extending totoInclusive, withstep.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) // = ()- Parameters:
from- the first charactertoInclusive- the last characterstep- the step- Returns:
- a range of characters as specified or the empty range if
signum(step) == signum(from - toInclusive). - Throws:
IllegalArgumentException- ifstepis zero
-
rangeClosedBy
@GwtIncompatible static Iterator<Double> rangeClosedBy(double from, double toInclusive, double step) -
rangeClosed
Creates an Iterator of int numbers starting fromfrom, extending totoInclusive.Examples:
Iterator.rangeClosed(0, 0) // = (0) Iterator.rangeClosed(2, 0) // = () Iterator.rangeClosed(-2, 2) // = (-2, -1, 0, 1, 2)- Parameters:
from- the first numbertoInclusive- the last number- Returns:
- a range of int values as specified or the empty range if
from > toInclusive
-
rangeClosedBy
Creates an Iterator of int numbers starting fromfrom, extending totoInclusive, withstep.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) // = ()- Parameters:
from- the first numbertoInclusive- the last numberstep- the step- Returns:
- a range of int values as specified or the empty range if
signum(step) == signum(from - toInclusive). - Throws:
IllegalArgumentException- ifstepis zero
-
rangeClosed
Creates an Iterator of long numbers starting fromfrom, extending totoInclusive.Examples:
Iterator.rangeClosed(0L, 0L) // = (0L) Iterator.rangeClosed(2L, 0L) // = () Iterator.rangeClosed(-2L, 2L) // = (-2L, -1L, 0L, 1L, 2L)- Parameters:
from- the first numbertoInclusive- the last number- Returns:
- a range of long values as specified or the empty range if
from > toInclusive
-
rangeClosedBy
Creates an Iterator of long numbers starting fromfrom, extending totoInclusive, withstep.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) // = ()- Parameters:
from- the first numbertoInclusive- the last numberstep- the step- Returns:
- a range of int values as specified or the empty range if
signum(step) == signum(from - toInclusive). - Throws:
IllegalArgumentException- ifstepis zero
-
from
-
from
Returns an infinite iterator of int values starting fromvalueand spaced bystep.The
Iteratorextends toInteger.MIN_VALUEwhen passingInteger.MAX_VALUE.- Parameters:
value- a start int valuestep- the step by which to advance on each iteration- Returns:
- a new
Iteratorof int values starting fromfrom
-
from
-
from
Returns an infinite iterator of long values starting fromvalueand spaced bystep.The
Iteratorextends toLong.MIN_VALUEwhen passingLong.MAX_VALUE.- Parameters:
value- a start long valuestep- the step by which to advance on each iteration- Returns:
- a new
Iteratorof long values starting fromfrom
-
continually
-
iterate
Creates an iterator that repeatedly invokes the supplier while it's aSomeand end on the firstNone- Type Parameters:
T- value type- Parameters:
supplier- A Supplier of iterator values- Returns:
- A new
Iterator - Throws:
NullPointerException- if supplier produces null value
-
iterate
Generates an infinite iterator using a function to calculate the next value based on the previous.- Type Parameters:
T- value type- Parameters:
seed- The first value in the iteratorf- A function to calculate the next value based on the previous- Returns:
- A new
Iterator
-
continually
Creates an infinite iterator returning the given element.- Type Parameters:
T- Element type- Parameters:
t- An element- Returns:
- A new Iterator containing infinite
t's.
-
collect
Description copied from interface:TraversableCollects all elements that are in the domain of the givenpartialFunctionby mapping the elements to typeR.More specifically, for each of this elements in iteration order first it is checked
If the elements makes it through that filter, the mapped instance is added to the result collectionpartialFunction.isDefinedAt(element)
Note:If thisR newElement = partialFunction.apply(element)Traversableis ordered (i.e. extendsOrdered, the caller ofcollecthas to ensure that the elements are comparable (i.e. extendComparable).- Specified by:
collectin interfaceTraversable<T>- Type Parameters:
R- The new element type- Parameters:
partialFunction- A function that is not necessarily defined of all elements of this traversable.- Returns:
- A new
Traversableinstance containing elements of typeR
-
concat
-
intersperse
-
transform
Transforms thisIterator.- Type Parameters:
U- Type of transformation result- Parameters:
f- A transformation- Returns:
- An instance of type
U - Throws:
NullPointerException- iffis null
-
zip
Description copied from interface:TraversableReturns a traversable formed from this traversable and another Iterable collection by combining corresponding elements in pairs. If one of the two iterables is longer than the other, its remaining elements are ignored.The length of the returned traversable is the minimum of the lengths of this traversable and
thatiterable.- Specified by:
zipin interfaceTraversable<T>- Type Parameters:
U- The type of the second half of the returned pairs.- Parameters:
that- The Iterable providing the second half of each result pair.- Returns:
- a new traversable containing pairs consisting of corresponding elements of this traversable and
thatiterable.
-
zipWith
default <U,R> Iterator<R> zipWith(Iterable<? extends U> that, BiFunction<? super T, ? super U, ? extends R> mapper) Description copied from interface:TraversableReturns a traversable formed from this traversable and another Iterable collection by mapping elements. If one of the two iterables is longer than the other, its remaining elements are ignored.The length of the returned traversable is the minimum of the lengths of this traversable and
thatiterable.- Specified by:
zipWithin interfaceTraversable<T>- Type Parameters:
U- The type of the second parameter of the mapper.R- The type of the mapped elements.- Parameters:
that- The Iterable providing the second parameter of the mapper.mapper- a mapper.- Returns:
- a new traversable containing mapped elements of this traversable and
thatiterable.
-
zipAll
Description copied from interface:TraversableReturns a traversable formed from this traversable and another Iterable by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.The length of the returned traversable is the maximum of the lengths of this traversable and
thatiterable.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.
- Specified by:
zipAllin interfaceTraversable<T>- Type Parameters:
U- The type of the second half of the returned pairs.- Parameters:
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.- Returns:
- A new traversable containing pairs consisting of corresponding elements of this traversable and that.
-
zipWithIndex
Description copied from interface:TraversableZips this traversable with its indices.- Specified by:
zipWithIndexin interfaceTraversable<T>- Returns:
- A new traversable containing all elements of this traversable paired with their index, starting with 0.
-
zipWithIndex
Description copied from interface:TraversableZips this traversable with its indices by applying mapper provided.- Specified by:
zipWithIndexin interfaceTraversable<T>- Type Parameters:
U- The type of the mapped elements.- Parameters:
mapper- a mapper.- Returns:
- a new traversable containing elements of this traversable, zipped with indices, and mapped with mapper provided.
-
unzip
default <T1,T2> Tuple2<Iterator<T1>, Iterator<T2>> unzip(Function<? super T, Tuple2<? extends T1, ? extends T2>> unzipper) Description copied from interface:TraversableUnzips this elements by mapping this elements to pairs which are subsequently split into two distinct sets.- Specified by:
unzipin interfaceTraversable<T>- Type Parameters:
T1- 1st element type of a pair returned by unzipperT2- 2nd element type of a pair returned by unzipper- Parameters:
unzipper- a function which converts elements of this to pairs- Returns:
- A pair of set containing elements split by unzipper
-
unzip3
default <T1,T2, Tuple3<Iterator<T1>, Iterator<T2>, Iterator<T3>> unzip3T3> (Function<? super T, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Description copied from interface:TraversableUnzips this elements by mapping this elements to triples which are subsequently split into three distinct sets.- Specified by:
unzip3in interfaceTraversable<T>- Type Parameters:
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 unzipper- Parameters:
unzipper- a function which converts elements of this to pairs- Returns:
- A triplet of set containing elements split by unzipper
-
unfold
static <T> Iterator<T> unfold(T seed, Function<? super T, Option<Tuple2<? extends T, ? extends T>>> f) Creates an iterator from a seed value and a function. The function takes the seed at first. The function should returnNonewhen it's done generating elements, otherwiseSomeTupleof the value to add to the resulting iterator and the element for the next call.Example:
Iterator.unfold(10, x -> x == 0 ? Option.none() : Option.of(new Tuple2<>(x-1, x))); // List(1, 2, 3, 4, 5, 6, 7, 8, 9, 10))- Type Parameters:
T- type of seeds and unfolded values- Parameters:
seed- the start value for the iterationf- the function to get the next step of the iteration- Returns:
- a list with the values built up by the iteration
- Throws:
NullPointerException- iffis null
-
unfoldLeft
static <T,U> Iterator<U> unfoldLeft(T seed, Function<? super T, Option<Tuple2<? extends T, ? extends U>>> f) Creates an iterator from a seed value and a function. The function takes the seed at first. The function should returnNonewhen it's done generating elements, otherwiseSomeTupleof the value to add to the resulting iterator and the element for the next call.Example:
Iterator.unfoldLeft(10, x -> x == 0 ? Option.none() : Option.of(new Tuple2<>(x-1, x))); // List(1, 2, 3, 4, 5, 6, 7, 8, 9, 10))- Type Parameters:
T- type of seedsU- type of unfolded values- Parameters:
seed- the start value for the iterationf- the function to get the next step of the iteration- Returns:
- a list with the values built up by the iteration
- Throws:
NullPointerException- iffis null
-
unfoldRight
static <T,U> Iterator<U> unfoldRight(T seed, Function<? super T, Option<Tuple2<? extends U, ? extends T>>> f) Creates an iterator from a seed value and a function. The function takes the seed at first. The function should returnNonewhen it's done generating elements, otherwiseSomeTupleof the element for the next call and the value to add to the resulting iterator.Example:
Iterator.unfoldRight(10, x -> x == 0 ? Option.none() : Option.of(new Tuple2<>(x, x-1))); // List(10, 9, 8, 7, 6, 5, 4, 3, 2, 1))- Type Parameters:
T- type of seedsU- type of unfolded values- Parameters:
seed- the start value for the iterationf- the function to get the next step of the iteration- Returns:
- a list with the values built up by the iteration
- Throws:
NullPointerException- iffis null
-
distinct
Description copied from interface:TraversableReturns a new version of this which contains no duplicates. Elements are compared usingequals.- Specified by:
distinctin interfaceTraversable<T>- Returns:
- a new
Traversablecontaining this elements without duplicates
-
distinctBy
Description copied from interface:TraversableReturns a new version of this which contains no duplicates. Elements are compared using the givencomparator.- Specified by:
distinctByin interfaceTraversable<T>- Parameters:
comparator- A comparator- Returns:
- a new
Traversablecontaining this elements without duplicates
-
distinctBy
Description copied from interface:TraversableReturns a new version of this which contains no duplicates. Elements mapped to keys which are compared usingequals.The elements of the result are determined in the order of their occurrence - first match wins.
- Specified by:
distinctByin interfaceTraversable<T>- Type Parameters:
U- key type- Parameters:
keyExtractor- A key extractor- Returns:
- a new
Traversablecontaining this elements without duplicates
-
drop
Removes up to n elements from this iterator.- Specified by:
dropin interfaceTraversable<T>- Parameters:
n- A number- Returns:
- The empty iterator, if
n <= 0or this is empty, otherwise a new iterator without the first n elements.
-
dropRight
Description copied from interface:TraversableDrops the last n elements of this or all elements, if this length < n.- Specified by:
dropRightin interfaceTraversable<T>- Parameters:
n- The number of elements to drop.- Returns:
- a new instance consisting of all elements of this except the last n ones, or else the empty instance, if this has less than n elements.
-
dropUntil
Description copied from interface:TraversableDrops elements until the predicate holds for the current element.- Specified by:
dropUntilin interfaceTraversable<T>- Parameters:
predicate- A condition tested subsequently for this elements.- Returns:
- a new instance consisting of all elements starting from the first one which does satisfy the given predicate.
-
dropWhile
Description copied from interface:TraversableDrops elements while the predicate holds for the current element.Note: This is essentially the same as
dropUntil(predicate.negate()). It is intended to be used with method references, which cannot be negated directly.- Specified by:
dropWhilein interfaceTraversable<T>- Parameters:
predicate- A condition tested subsequently for this elements.- Returns:
- a new instance consisting of all elements starting from the first one which does not satisfy the given predicate.
-
filter
-
reject
Description copied from interface:TraversableReturns a new traversable consisting of all elements which do not satisfy the given predicate.The default implementation is equivalent to
filter(predicate.negate()- Specified by:
rejectin interfaceTraversable<T>- Parameters:
predicate- A predicate- Returns:
- a new traversable
-
findLast
Description copied from interface:TraversableReturns the last element of this which satisfies the given predicate.Same as
reverse().find(predicate).- Specified by:
findLastin interfaceTraversable<T>- Parameters:
predicate- A predicate.- Returns:
- Some(element) or None, where element may be null (i.e.
List.of(null).find(e -> e == null)).
-
flatMap
FlatMaps the elements of this Iterator to Iterables, which are iterated in the order of occurrence.- Specified by:
flatMapin interfaceTraversable<T>- Type Parameters:
U- Component type- Parameters:
mapper- A mapper- Returns:
- A new Iterable
-
foldRight
Description copied from interface:FoldableFolds this elements from the right, starting withzeroand successively callingcombine.Example:
// = "!cba" List("a", "b", "c").foldRight("!", (x, xs) -> xs + x) -
get
Description copied from interface:TraversableGets the first value in iteration order if thisTraversableis not empty, otherwise throws. -
groupBy
Description copied from interface:TraversableGroups this elements by classifying the elements.- Specified by:
groupByin interfaceTraversable<T>- Type Parameters:
C- classified class type- Parameters:
classifier- A function which classifies elements into classes- Returns:
- A Map containing the grouped elements
- See Also:
-
grouped
Description copied from interface:TraversableGroups thisTraversableinto fixed size blocks.Let length be the length of this Iterable. Then grouped is defined as follows:
- If
this.isEmpty(), the resultingIteratoris empty. - If
size <= length, the resultingIteratorwill containlength / sizeblocks of sizesizeand maybe a non-empty block of sizelength % size, if there are remaining elements. - If
size > length, the resultingIteratorwill contain one block of sizelength.
Please note that[].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]]grouped(int)is a special case of Traversable.sliding(int, int), i.e.grouped(size)is the same assliding(size, size).- Specified by:
groupedin interfaceTraversable<T>- Parameters:
size- a positive block size- Returns:
- A new Iterator of grouped blocks of the given size
- If
-
hasDefiniteSize
default boolean hasDefiniteSize()Description copied from interface:TraversableChecks if this Traversable is known to have a finite size.This method should be implemented by classes only, i.e. not by interfaces.
- Specified by:
hasDefiniteSizein interfaceTraversable<T>- Returns:
- true, if this Traversable is known to have a finite size, false otherwise.
-
head
Description copied from interface:TraversableReturns the first element of a non-empty Traversable.- Specified by:
headin interfaceTraversable<T>- Returns:
- The first element of this Traversable.
-
init
Description copied from interface:TraversableDual of Traversable.tail(), returning all elements except the last.- Specified by:
initin interfaceTraversable<T>- Returns:
- a new instance containing all elements except the last.
-
initOption
Description copied from interface:TraversableDual of Traversable.tailOption(), returning all elements except the last asOption.- Specified by:
initOptionin interfaceTraversable<T>- Returns:
Some(traversable)orNoneif this is empty.
-
isAsync
-
isEmpty
default boolean isEmpty()Description copied from interface:TraversableChecks if this Traversable is empty. -
isLazy
-
isTraversableAgain
default boolean isTraversableAgain()Description copied from interface:TraversableChecks if this Traversable can be repeatedly traversed.This method should be implemented by classes only, i.e. not by interfaces.
- Specified by:
isTraversableAgainin interfaceTraversable<T>- Returns:
- true, if this Traversable is known to be traversable repeatedly, false otherwise.
-
isSequential
default boolean isSequential()Description copied from interface:TraversableChecks if the elements of this Traversable appear in encounter order.- Specified by:
isSequentialin interfaceTraversable<T>- Returns:
- true, if the insertion order of elements is preserved, false otherwise.
-
iterator
Description copied from interface:TraversableAn iterator by means of head() and tail(). Subclasses may want to override this method. -
last
Description copied from interface:TraversableDual of Traversable.head(), returning the last element.- Specified by:
lastin interfaceTraversable<T>- Returns:
- the last element.
-
length
default int length()Description copied from interface:TraversableComputes the number of elements of this Traversable.Same as
Traversable.size().- Specified by:
lengthin interfaceTraversable<T>- Returns:
- the number of elements
-
map
Maps the elements of this Iterator lazily using the givenmapper. -
orElse
Description copied from interface:TraversableReturns thisTraversableif it is nonempty, otherwise return the alternative.- Specified by:
orElsein interfaceTraversable<T>- Parameters:
other- An alternativeTraversable- Returns:
- this
Traversableif it is nonempty, otherwise return the alternative.
-
orElse
Description copied from interface:TraversableReturns thisTraversableif it is nonempty, otherwise return the result of evaluating supplier.- Specified by:
orElsein interfaceTraversable<T>- Parameters:
supplier- An alternativeTraversablesupplier- Returns:
- this
Traversableif it is nonempty, otherwise return the result of evaluating supplier.
-
partition
Description copied from interface:TraversableCreates a partition of thisTraversableby splitting this elements in two in distinct traversables according to a predicate.- Specified by:
partitionin interfaceTraversable<T>- Parameters:
predicate- A predicate which classifies an element if it is in the first or the second traversable.- Returns:
- A disjoint union of two traversables. The first
Traversablecontains all elements that satisfy the givenpredicate, the secondTraversablecontains all elements that don't. The original order of elements is preserved.
-
peek
Description copied from interface:ValuePerforms the givenactionon the first element if this is an eager implementation. Performs the givenactionon all elements (the first immediately, successive deferred), if this is a lazy implementation. -
reduceLeft
Description copied from interface:TraversableAccumulates the elements of this Traversable by successively calling the given operationopfrom the left.- Specified by:
reduceLeftin interfaceFoldable<T>- Specified by:
reduceLeftin interfaceTraversable<T>- Parameters:
op- A BiFunction of type T- Returns:
- the reduced value.
-
reduceRight
Description copied from interface:TraversableAccumulates the elements of this Traversable by successively calling the given operationopfrom the right.- Specified by:
reduceRightin interfaceFoldable<T>- Specified by:
reduceRightin interfaceTraversable<T>- Parameters:
op- An operation of type T- Returns:
- the reduced value.
-
replace
Description copied from interface:TraversableReplaces the first occurrence (if exists) of the given currentElement with newElement.- Specified by:
replacein interfaceTraversable<T>- Parameters:
currentElement- An element to be substituted.newElement- A replacement for currentElement.- Returns:
- a Traversable containing all elements of this where the first occurrence of currentElement is replaced with newElement.
-
replaceAll
Description copied from interface:TraversableReplaces all occurrences of the given currentElement with newElement.- Specified by:
replaceAllin interfaceTraversable<T>- Parameters:
currentElement- An element to be substituted.newElement- A replacement for currentElement.- Returns:
- a Traversable containing all elements of this where all occurrences of currentElement are replaced with newElement.
-
retainAll
Description copied from interface:TraversableKeeps all occurrences of the given elements from this.- Specified by:
retainAllin interfaceTraversable<T>- Parameters:
elements- Elements to be kept.- Returns:
- a Traversable containing all occurrences of the given elements.
-
scan
Description copied from interface:TraversableComputes a prefix scan of the elements of the collection. Note: The neutral element z may be applied more than once.- Specified by:
scanin interfaceTraversable<T>- Parameters:
zero- neutral element for the operator opoperation- the associative operator for the scan- Returns:
- a new traversable collection containing the prefix scan of the elements in this traversable collection
-
scanLeft
Description copied from interface:TraversableProduces a collection containing cumulative results of applying the operator going left to right. Note: will not terminate for infinite-sized collections. Note: might return different results for different runs, unless the underlying collection type is ordered.- Specified by:
scanLeftin interfaceTraversable<T>- Type Parameters:
U- the type of the elements in the resulting collection- Parameters:
zero- the initial valueoperation- the binary operator applied to the intermediate result and the element- Returns:
- collection with intermediate results
-
scanRight
Description copied from interface:TraversableProduces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result. Note: will not terminate for infinite-sized collections. Note: might return different results for different runs, unless the underlying collection type is ordered.- Specified by:
scanRightin interfaceTraversable<T>- Type Parameters:
U- the type of the elements in the resulting collection- Parameters:
zero- the initial valueoperation- the binary operator applied to the intermediate result and the element- Returns:
- collection with intermediate results
-
slideBy
Description copied from interface:TraversableSlides a non-overlapping window of a variable size over thisTraversable.Each window contains elements with the same class, as determined by
classifier. Two consecutive values in thisTraversablewill be in the same window only ifclassifierreturns equal values for them. Otherwise, the values will constitute the last element of the previous window and the first element of the next window.Examples:
[].slideBy(Function.identity()) = [] [1,2,3,4,4,5].slideBy(Function.identity()) = [[1],[2],[3],[4,4],[5]] [1,2,3,10,12,5,7,20,29].slideBy(x -> x/10) = [[1,2,3],[10,12],[5,7],[20,29]]- Specified by:
slideByin interfaceTraversable<T>- Parameters:
classifier- A function which classifies elements into classes- Returns:
- A new Iterator of windows of the grouped elements
-
sliding
Description copied from interface:TraversableSlides a window of a specificsizeand step size 1 over thisTraversableby callingTraversable.sliding(int, int).- Specified by:
slidingin interfaceTraversable<T>- Parameters:
size- a positive window size- Returns:
- a new Iterator of windows of a specific size using step size 1
-
sliding
Description copied from interface:TraversableSlides a window of a specificsizeandstepsize over thisTraversable.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]]- Specified by:
slidingin interfaceTraversable<T>- Parameters:
size- a positive window sizestep- a positive step size- Returns:
- a new Iterator of windows of a specific size using a specific step size
-
span
Description copied from interface:TraversableReturns a tuple where the first element is the longest prefix of elements that satisfy the givenpredicateand the second element is the remainder.- Specified by:
spanin interfaceTraversable<T>- Parameters:
predicate- A predicate.- Returns:
- a
Tuplecontaining the longest prefix of elements that satisfy p and the remainder.
-
stringPrefix
Description copied from interface:ValueReturns the name of this Value type, which is used by toString().- Specified by:
stringPrefixin interfaceValue<T>- Returns:
- This type name.
-
tail
Description copied from interface:TraversableDrops the first element of a non-empty Traversable.- Specified by:
tailin interfaceTraversable<T>- Returns:
- A new instance of Traversable containing all elements except the first.
-
tailOption
Description copied from interface:TraversableDrops the first element of a non-empty Traversable and returns anOption.- Specified by:
tailOptionin interfaceTraversable<T>- Returns:
Some(traversable)orNoneif this is empty.
-
take
Take the first n elements from this iterator.- Specified by:
takein interfaceTraversable<T>- Parameters:
n- A number- Returns:
- The empty iterator, if
n <= 0or this is empty, otherwise a new iterator without the first n elements.
-
takeRight
Description copied from interface:TraversableTakes the last n elements of this or all elements, if this length < n.The result is equivalent to
sublist(max(0, min(length(), length() - n)), n), i.e. takeRight will not throw ifn < 0orn > length().In the case of
n < 0the empty instance is returned, in the case ofn > length()this is returned.- Specified by:
takeRightin interfaceTraversable<T>- Parameters:
n- The number of elements to take.- Returns:
- A new instance consisting of the last n elements of this or all elements, if this has less than n elements.
-
takeUntil
Description copied from interface:TraversableTakes elements until the predicate holds for the current element.Note: This is essentially the same as
takeWhile(predicate.negate()). It is intended to be used with method references, which cannot be negated directly.- Specified by:
takeUntilin interfaceTraversable<T>- Parameters:
predicate- A condition tested subsequently for this elements.- Returns:
- a new instance consisting of all elements before the first one which does satisfy the given predicate.
-
takeWhile
Description copied from interface:TraversableTakes elements while the predicate holds for the current element.- Specified by:
takeWhilein interfaceTraversable<T>- Parameters:
predicate- A condition tested subsequently for the contained elements.- Returns:
- a new instance consisting of all elements before the first one which does not satisfy the given predicate.
-