Uses of Interface
io.vavr.collection.Seq
Packages that use Seq
Package
Description
Beside
API
the io.vavr package contains core types like (Checked)Functions and Tuples.Purely functional collections based on Traversable.
This package contains basic building blocks for creating fast, asynchronous, non-blocking parallel code.
-
Uses of Seq in io.vavr
Modifier and TypeMethodDescriptionstatic <T> Seq
<T> API.Seq()
Alias forList.empty()
static <T> Seq
<T> API.Seq
(T element) Alias forList.of(Object)
static <T> Seq
<T> API.Seq
(T... elements) Alias forList.of(Object...)
Seq
<?> Tuple.toSeq()
Converts this tuple to a sequence.Seq
<?> Tuple0.toSeq()
Seq
<?> Tuple1.toSeq()
Seq
<?> Tuple2.toSeq()
Seq
<?> Tuple3.toSeq()
Seq
<?> Tuple4.toSeq()
Seq
<?> Tuple5.toSeq()
Seq
<?> Tuple6.toSeq()
Seq
<?> Tuple7.toSeq()
Seq
<?> Tuple8.toSeq()
Modifier and TypeMethodDescriptionReduces manyLazy
values into a singleLazy
by transforming anIterable<Lazy<? extends T>>
into aLazy<Seq<T>>
.Turns a sequence ofTuple1
into a Tuple1 ofSeq
.Turns a sequence ofTuple2
into a Tuple2 ofSeq
s.Turns a sequence ofTuple2
into a Tuple2 ofSeq
s.Turns a sequence ofTuple3
into a Tuple3 ofSeq
s.Turns a sequence ofTuple3
into a Tuple3 ofSeq
s.Turns a sequence ofTuple3
into a Tuple3 ofSeq
s.Tuple.sequence4
(Iterable<? extends Tuple4<? extends T1, ? extends T2, ? extends T3, ? extends T4>> tuples) Turns a sequence ofTuple4
into a Tuple4 ofSeq
s.Tuple.sequence4
(Iterable<? extends Tuple4<? extends T1, ? extends T2, ? extends T3, ? extends T4>> tuples) Turns a sequence ofTuple4
into a Tuple4 ofSeq
s.Tuple.sequence4
(Iterable<? extends Tuple4<? extends T1, ? extends T2, ? extends T3, ? extends T4>> tuples) Turns a sequence ofTuple4
into a Tuple4 ofSeq
s.Tuple.sequence4
(Iterable<? extends Tuple4<? extends T1, ? extends T2, ? extends T3, ? extends T4>> tuples) Turns a sequence ofTuple4
into a Tuple4 ofSeq
s.Tuple.sequence5
(Iterable<? extends Tuple5<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5>> tuples) Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.Tuple.sequence5
(Iterable<? extends Tuple5<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5>> tuples) Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.Tuple.sequence5
(Iterable<? extends Tuple5<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5>> tuples) Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.Tuple.sequence5
(Iterable<? extends Tuple5<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5>> tuples) Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.Tuple.sequence5
(Iterable<? extends Tuple5<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5>> tuples) Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.Tuple.sequence6
(Iterable<? extends Tuple6<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6>> tuples) Turns a sequence ofTuple6
into a Tuple6 ofSeq
s.Tuple.sequence6
(Iterable<? extends Tuple6<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6>> tuples) Turns a sequence ofTuple6
into a Tuple6 ofSeq
s.Tuple.sequence6
(Iterable<? extends Tuple6<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6>> tuples) Turns a sequence ofTuple6
into a Tuple6 ofSeq
s.Tuple.sequence6
(Iterable<? extends Tuple6<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6>> tuples) Turns a sequence ofTuple6
into a Tuple6 ofSeq
s.Tuple.sequence6
(Iterable<? extends Tuple6<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6>> tuples) Turns a sequence ofTuple6
into a Tuple6 ofSeq
s.Tuple.sequence6
(Iterable<? extends Tuple6<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6>> tuples) Turns a sequence ofTuple6
into a Tuple6 ofSeq
s.Tuple.sequence7
(Iterable<? extends Tuple7<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7>> tuples) Turns a sequence ofTuple7
into a Tuple7 ofSeq
s.Tuple.sequence7
(Iterable<? extends Tuple7<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7>> tuples) Turns a sequence ofTuple7
into a Tuple7 ofSeq
s.Tuple.sequence7
(Iterable<? extends Tuple7<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7>> tuples) Turns a sequence ofTuple7
into a Tuple7 ofSeq
s.Tuple.sequence7
(Iterable<? extends Tuple7<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7>> tuples) Turns a sequence ofTuple7
into a Tuple7 ofSeq
s.Tuple.sequence7
(Iterable<? extends Tuple7<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7>> tuples) Turns a sequence ofTuple7
into a Tuple7 ofSeq
s.Tuple.sequence7
(Iterable<? extends Tuple7<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7>> tuples) Turns a sequence ofTuple7
into a Tuple7 ofSeq
s.Tuple.sequence7
(Iterable<? extends Tuple7<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7>> tuples) Turns a sequence ofTuple7
into a Tuple7 ofSeq
s.static <T1,
T2, T3, T4, T5, T6, T7, T8>
Tuple8<Seq<T1>, Seq<T2>, Seq<T3>, Seq<T4>, Seq<T5>, Seq<T6>, Seq<T7>, Seq<T8>> Tuple.sequence8
(Iterable<? extends Tuple8<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7, ? extends T8>> tuples) Turns a sequence ofTuple8
into a Tuple8 ofSeq
s.static <T1,
T2, T3, T4, T5, T6, T7, T8>
Tuple8<Seq<T1>, Seq<T2>, Seq<T3>, Seq<T4>, Seq<T5>, Seq<T6>, Seq<T7>, Seq<T8>> Tuple.sequence8
(Iterable<? extends Tuple8<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7, ? extends T8>> tuples) Turns a sequence ofTuple8
into a Tuple8 ofSeq
s.static <T1,
T2, T3, T4, T5, T6, T7, T8>
Tuple8<Seq<T1>, Seq<T2>, Seq<T3>, Seq<T4>, Seq<T5>, Seq<T6>, Seq<T7>, Seq<T8>> Tuple.sequence8
(Iterable<? extends Tuple8<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7, ? extends T8>> tuples) Turns a sequence ofTuple8
into a Tuple8 ofSeq
s.static <T1,
T2, T3, T4, T5, T6, T7, T8>
Tuple8<Seq<T1>, Seq<T2>, Seq<T3>, Seq<T4>, Seq<T5>, Seq<T6>, Seq<T7>, Seq<T8>> Tuple.sequence8
(Iterable<? extends Tuple8<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7, ? extends T8>> tuples) Turns a sequence ofTuple8
into a Tuple8 ofSeq
s.static <T1,
T2, T3, T4, T5, T6, T7, T8>
Tuple8<Seq<T1>, Seq<T2>, Seq<T3>, Seq<T4>, Seq<T5>, Seq<T6>, Seq<T7>, Seq<T8>> Tuple.sequence8
(Iterable<? extends Tuple8<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7, ? extends T8>> tuples) Turns a sequence ofTuple8
into a Tuple8 ofSeq
s.static <T1,
T2, T3, T4, T5, T6, T7, T8>
Tuple8<Seq<T1>, Seq<T2>, Seq<T3>, Seq<T4>, Seq<T5>, Seq<T6>, Seq<T7>, Seq<T8>> Tuple.sequence8
(Iterable<? extends Tuple8<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7, ? extends T8>> tuples) Turns a sequence ofTuple8
into a Tuple8 ofSeq
s.static <T1,
T2, T3, T4, T5, T6, T7, T8>
Tuple8<Seq<T1>, Seq<T2>, Seq<T3>, Seq<T4>, Seq<T5>, Seq<T6>, Seq<T7>, Seq<T8>> Tuple.sequence8
(Iterable<? extends Tuple8<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7, ? extends T8>> tuples) Turns a sequence ofTuple8
into a Tuple8 ofSeq
s.static <T1,
T2, T3, T4, T5, T6, T7, T8>
Tuple8<Seq<T1>, Seq<T2>, Seq<T3>, Seq<T4>, Seq<T5>, Seq<T6>, Seq<T7>, Seq<T8>> Tuple.sequence8
(Iterable<? extends Tuple8<? extends T1, ? extends T2, ? extends T3, ? extends T4, ? extends T5, ? extends T6, ? extends T7, ? extends T8>> tuples) Turns a sequence ofTuple8
into a Tuple8 ofSeq
s. -
Uses of Seq in io.vavr.collection
Classes in io.vavr.collection with type parameters of type SeqModifier and TypeClassDescription(package private) static class
JavaConverters.ListView<T,
C extends Seq<T>> private static class
JavaConverters.ListView.Iterator<T,
C extends Seq<T>> private static class
JavaConverters.ListView.ListIterator<T,
C extends Seq<T>> Subinterfaces of Seq in io.vavr.collectionModifier and TypeInterfaceDescriptioninterface
IndexedSeq<T>
Interface for immutable, indexed sequences.interface
LinearSeq<T>
Interface for immutable, linear sequences.interface
List<T>
An immutableList
is an eager sequence of elements.interface
Stream<T>
An immutableStream
is lazy sequence of elements which may be infinitely long.Classes in io.vavr.collection that implement SeqModifier and TypeClassDescriptionfinal class
Array<T>
Array is a Traversable wrapper forObject[]
containing elements of typeT
.final class
The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.static final class
List.Cons<T>
Non-emptyList
, consisting of ahead
and atail
.static final class
List.Nil<T>
Representation of the singleton emptyList
.final class
Queue<T>
An immutableQueue
stores elements allowing a first-in-first-out (FIFO) retrieval.static class
Stream.Cons<T>
Non-emptyStream
, consisting of ahead
, andtail
.static final class
Stream.Empty<T>
The empty Stream.static final class
static final class
final class
Vector<T>
Vector is the default Seq implementation that provides effectively constant time access to any element.Fields in io.vavr.collection declared as SeqModifier and TypeFieldDescription(package private) final Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.Node.children
private final Seq
<PriorityQueueBase.Node<T>> PriorityQueue.forest
Methods in io.vavr.collection with type parameters of type SeqModifier and TypeMethodDescription(package private) static <T,
C extends Seq<T>>
CCollections.asJava
(C source, Consumer<? super List<T>> action, JavaConverters.ChangePolicy changePolicy) (package private) static <T,
C extends Seq<T>>
JavaConverters.ListView<T, C> JavaConverters.asJava
(C seq, JavaConverters.ChangePolicy changePolicy) Collections.crossProduct
(S empty, S seq, int power) (package private) static <T,
C extends Seq<T>>
CCollections.rotateLeft
(C source, int n) (package private) static <T,
C extends Seq<T>>
CCollections.rotateRight
(C source, int n) (package private) static <T,
S extends Seq<T>>
S(package private) static <T,
U, R extends Seq<T>>
RCollections.sortBy
(Seq<? extends T> source, Comparator<? super U> comparator, Function<? super T, ? extends U> mapper, Collector<T, ?, R> collector) Collections.transposeNonEmptyMatrix
(V matrix, Function<Iterable<U>, V> rowFactory, Function<T[], U> columnFactory) Collections.transposeNonEmptyMatrix
(V matrix, Function<Iterable<U>, V> rowFactory, Function<T[], U> columnFactory) Methods in io.vavr.collection that return SeqModifier and TypeMethodDescriptionAppends an element to this.Appends all given elements to this.(package private) Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.Node.appendTo
(Seq<PriorityQueueBase.Node<T>> forest) Seq.asJavaMutable
(Consumer<? super List<T>> action) default <R> Seq
<R> Map.collect
(PartialFunction<? super Tuple2<K, V>, ? extends R> partialFunction) default <R> Seq
<R> Multimap.collect
(PartialFunction<? super Tuple2<K, V>, ? extends R> partialFunction) <R> Seq
<R> Seq.collect
(PartialFunction<? super T, ? extends R> partialFunction) Seq.combinations()
Returns the union of all combinations from k = 0 to length().Seq.combinations
(int k) Returns the k-combination of this traversable, i.e.Seq.distinct()
Tree.distinct()
Seq.distinctBy
(Comparator<? super T> comparator) Seq.distinctBy
(Function<? super T, ? extends U> keyExtractor) Tree.distinctBy
(Comparator<? super T> comparator) Tree.distinctBy
(Function<? super T, ? extends U> keyExtractor) Seq.drop
(int n) Tree.drop
(int n) Seq.dropRight
(int n) Tree.dropRight
(int n) Seq.dropRightUntil
(Predicate<? super T> predicate) Drops elements until the predicate holds for the current element, starting from the end.Seq.dropRightWhile
(Predicate<? super T> predicate) Drops elements while the predicate holds for the current element, starting from the end.default <U> Seq
<U> Flat-maps this entries to a sequence of values.default <U> Seq
<U> Flat-maps this entries to a sequence of values.<U> Seq
<U> Seq.init()
Tree.init()
private static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.ins
(Comparator<? super T> comparator, PriorityQueueBase.Node<T> tree, Seq<PriorityQueueBase.Node<T>> forest) fun ins (t, []) = [t] * | ins (t, t' :: ts) = (∗ rank t ≤ rank t' ∗) * if rank t invalid input: '<' rank t' then t :: t' :: ts * else ins (link (t, t'), ts)(package private) static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.insert
(Comparator<? super T> comparator, T element, Seq<PriorityQueueBase.Node<T>> forest) fun insert (x, ts as t1 :: t2 :: rest) = * if rank t1 = rank t2 then skewLink(Node(x,0,[]),t1,t2) :: rest * else Node (x,0,[]) :: ts * | insert (x, ts) = Node (x,0,[]) :: tsInserts the given element at the specified index.Inserts the given elements at the specified index.Seq.intersperse
(T element) Inserts an element between all elements of this Traversable.A copy of this sequence with an element prepended until a given target length is reached.default <U> Seq
<U> Maps theMap
entries to a sequence of values.default <U> Seq
<U> Maps theMultimap
entries to a sequence of values.<U> Seq
<U> (package private) static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.meld
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> source, Seq<PriorityQueueBase.Node<T>> target) fun meld (ts, ts') = meldUniq (uniqify ts, uniqify ts')private static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.meldUnique
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest1, Seq<PriorityQueueBase.Node<T>> forest2) fun meldUniq ([], ts) = ts * | meldUniq (ts, []) = ts * | meldUniq (t1 :: ts1, t2 :: ts2) = * if rank t1 invalid input: '<' rank t2 then t1 :: meldUniq (ts1, t2 :: ts2) * else if rank t2 invalid input: '<' rank t1 then t2 :: meldUniq (t1 :: ts1, ts2) * else ins (link (t1, t2), meldUniq (ts1, ts2))static <T> Seq
<T> Narrows a widenedSeq<? extends T>
toSeq<T>
by performing a type-safe cast.IteratorModule.GroupedIterator.next()
A copy of this sequence with an element appended until a given target length is reached.Produces a new list where a slice of elements in this list is replaced by another sequence.Seq.permutations()
Computes all unique permutations.Prepends an element to this.Seq.prependAll
(Iterable<? extends T> elements) Prepends all given elements to this.private static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.rebuild
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest) Separate the rank 0 trees from the rest, rebuild the 0 rank ones and merge them backRemoves the first occurrence of the given element.Removes all occurrences of the given elements.Deprecated.Removes all occurrences of the given element.Seq.removeAt
(int index) Removes the element at the specified position in this sequence.Seq.removeFirst
(Predicate<T> predicate) Removes the first occurrence that satisfy predicateSeq.removeLast
(Predicate<T> predicate) Removes the last occurrence that satisfy predicateSeq.replaceAll
(T currentElement, T newElement) Seq.reverse()
Reverses the order of elements.Seq.rotateLeft
(int n) Circular rotates the elements by the specified distance to the left direction.Seq.rotateRight
(int n) Circular rotates the elements by the specified distance to the right direction.default <U> Seq
<U> Map.scanLeft
(U zero, BiFunction<? super U, ? super Tuple2<K, V>, ? extends U> operation) default <U> Seq
<U> Multimap.scanLeft
(U zero, BiFunction<? super U, ? super Tuple2<K, V>, ? extends U> operation) <U> Seq
<U> Seq.scanLeft
(U zero, BiFunction<? super U, ? super T, ? extends U> operation) default <U> Seq
<U> Tree.scanLeft
(U zero, BiFunction<? super U, ? super T, ? extends U> operation) default <U> Seq
<U> Map.scanRight
(U zero, BiFunction<? super Tuple2<K, V>, ? super U, ? extends U> operation) default <U> Seq
<U> Multimap.scanRight
(U zero, BiFunction<? super Tuple2<K, V>, ? super U, ? extends U> operation) <U> Seq
<U> Seq.scanRight
(U zero, BiFunction<? super T, ? super U, ? extends U> operation) default <U> Seq
<U> Tree.scanRight
(U zero, BiFunction<? super T, ? super U, ? extends U> operation) Seq.shuffle()
Randomize the order of the elements in the current sequence.Seq.slice
(int beginIndex, int endIndex) Returns a Seq that is a slice of this.Seq.sortBy
(Comparator<? super U> comparator, Function<? super T, ? extends U> mapper) Sorts this elements by comparing the elements in a different domain, using the givenmapper
.<U extends Comparable<? super U>>
Seq<T> Sorts this elements by comparing the elements in a different domain, using the givenmapper
.Seq.sorted()
Sorts this elements according to their natural order.Seq.sorted
(Comparator<? super T> comparator) Sorts this elements according to the providedComparator
.Splits this string around matches of the given regular expression.Splits this string around matches of the given regular expression.Seq.subSequence
(int beginIndex) Returns a Seq that is a subsequence of this.Seq.subSequence
(int beginIndex, int endIndex) Returns a Seq that is a subsequence of this.Seq.tail()
Tree.tail()
Seq.take
(int n) Tree.take
(int n) Seq.takeRight
(int n) Tree.takeRight
(int n) Seq.takeRightUntil
(Predicate<? super T> predicate) Takes elements until the predicate holds for the current element, starting from the end.Seq.takeRightWhile
(Predicate<? super T> predicate) Takes elements while the predicate holds for the current element, starting from the end.Tree.traverse()
Traverses this tree inTree.Order.PRE_ORDER
.Tree.traverse
(Tree.Order order) Traverses this tree in a specific order.private static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.uniqify
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest) fun uniqify [] = [] * | uniqify (t :: ts) = ins (t, ts) (∗ eliminate initial duplicate ∗)Updates the given element at the specified index using the specified function.Updates the given element at the specified index.LinkedHashMap.values()
Map.values()
Returns a newSeq
that contains the values of thisMap
.Tree.values()
Traverses this tree values inTree.Order.PRE_ORDER
.Tree.values
(Tree.Order order) Traverses this tree values in a specific order.TreeMap.values()
default <U,
R> Seq <R> Map.zipWith
(Iterable<? extends U> that, BiFunction<? super Tuple2<K, V>, ? super U, ? extends R> mapper) default <U,
R> Seq <R> Multimap.zipWith
(Iterable<? extends U> that, BiFunction<? super Tuple2<K, V>, ? super U, ? extends R> mapper) <U,
R> Seq <R> Seq.zipWith
(Iterable<? extends U> that, BiFunction<? super T, ? super U, ? extends R> mapper) Map.zipWithIndex()
default <U> Seq
<U> Map.zipWithIndex
(BiFunction<? super Tuple2<K, V>, ? super Integer, ? extends U> mapper) Multimap.zipWithIndex()
default <U> Seq
<U> Multimap.zipWithIndex
(BiFunction<? super Tuple2<K, V>, ? super Integer, ? extends U> mapper) Seq.zipWithIndex()
<U> Seq
<U> Seq.zipWithIndex
(BiFunction<? super T, ? super Integer, ? extends U> mapper) Methods in io.vavr.collection that return types with arguments of type SeqModifier and TypeMethodDescriptionSeq.combinations()
Returns the union of all combinations from k = 0 to length().Seq.combinations
(int k) Returns the k-combination of this traversable, i.e.Seq.crossProduct
(int power) Calculates the n-ary cartesian power (or cross product or simply product) of this.(package private) static <T> Tuple2
<T, Seq<PriorityQueueBase.Node<T>>> PriorityQueueBase.deleteMin
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest) fun deleteMin [] = raise EMPTY * | deleteMin ts = * val (Node (x,r,c), ts) = getMin ts * val (ts',xs') = split ([],[],c) * in fold insert xs' (meld (ts, ts')) endIterator.grouped
(int size) Seq.grouped
(int size) Tree.grouped
(int size) Seq.initOption()
Tree.initOption()
Seq.permutations()
Computes all unique permutations.Iterator.sliding
(int size) Iterator.sliding
(int size, int step) Seq.sliding
(int size) Seq.sliding
(int size, int step) Tree.sliding
(int size) Tree.sliding
(int size, int step) Seq.splitAt
(int n) Splits a Seq at the specified index.Seq.splitAt
(int n) Splits a Seq at the specified index.Splits a sequence at the first element which satisfies thePredicate
, e.g.Splits a sequence at the first element which satisfies thePredicate
, e.g.Seq.splitAtInclusive
(Predicate<? super T> predicate) Splits a sequence at the first element which satisfies thePredicate
, e.g.Seq.splitAtInclusive
(Predicate<? super T> predicate) Splits a sequence at the first element which satisfies thePredicate
, e.g.Seq.tailOption()
Tree.tailOption()
Map.unzip()
Map.unzip()
Map.unzip
(BiFunction<? super K, ? super V, Tuple2<? extends T1, ? extends T2>> unzipper) Map.unzip
(BiFunction<? super K, ? super V, Tuple2<? extends T1, ? extends T2>> unzipper) Multimap.unzip
(BiFunction<? super K, ? super V, Tuple2<? extends T1, ? extends T2>> unzipper) Multimap.unzip
(BiFunction<? super K, ? super V, Tuple2<? extends T1, ? extends T2>> unzipper) Map.unzip3
(BiFunction<? super K, ? super V, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Map.unzip3
(BiFunction<? super K, ? super V, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Map.unzip3
(BiFunction<? super K, ? super V, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Multimap.unzip3
(BiFunction<? super K, ? super V, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Multimap.unzip3
(BiFunction<? super K, ? super V, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Multimap.unzip3
(BiFunction<? super K, ? super V, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Multimap.unzip3
(Function<? super Tuple2<K, V>, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Multimap.unzip3
(Function<? super Tuple2<K, V>, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Multimap.unzip3
(Function<? super Tuple2<K, V>, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper) Methods in io.vavr.collection with parameters of type SeqModifier and TypeMethodDescription(package private) Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.Node.appendTo
(Seq<PriorityQueueBase.Node<T>> forest) (package private) static <T> Tuple2
<T, Seq<PriorityQueueBase.Node<T>>> PriorityQueueBase.deleteMin
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest) fun deleteMin [] = raise EMPTY * | deleteMin ts = * val (Node (x,r,c), ts) = getMin ts * val (ts',xs') = split ([],[],c) * in fold insert xs' (meld (ts, ts')) enddefault boolean
default boolean
Tests whether this sequence ends with the given sequence.(package private) static <V> boolean
(package private) static <T> PriorityQueueBase.Node
<T> PriorityQueueBase.findMin
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest) Find the minimum root in the forestprivate static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.ins
(Comparator<? super T> comparator, PriorityQueueBase.Node<T> tree, Seq<PriorityQueueBase.Node<T>> forest) fun ins (t, []) = [t] * | ins (t, t' :: ts) = (∗ rank t ≤ rank t' ∗) * if rank t invalid input: '<' rank t' then t :: t' :: ts * else ins (link (t, t'), ts)(package private) static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.insert
(Comparator<? super T> comparator, T element, Seq<PriorityQueueBase.Node<T>> forest) fun insert (x, ts as t1 :: t2 :: rest) = * if rank t1 = rank t2 then skewLink(Node(x,0,[]),t1,t2) :: rest * else Node (x,0,[]) :: ts * | insert (x, ts) = Node (x,0,[]) :: ts(package private) static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.meld
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> source, Seq<PriorityQueueBase.Node<T>> target) fun meld (ts, ts') = meldUniq (uniqify ts, uniqify ts')private static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.meldUnique
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest1, Seq<PriorityQueueBase.Node<T>> forest2) fun meldUniq ([], ts) = ts * | meldUniq (ts, []) = ts * | meldUniq (t1 :: ts1, t2 :: ts2) = * if rank t1 invalid input: '<' rank t2 then t1 :: meldUniq (ts1, t2 :: ts2) * else if rank t2 invalid input: '<' rank t1 then t2 :: meldUniq (t1 :: ts1, ts2) * else ins (link (t1, t2), meldUniq (ts1, ts2))static <T> Seq
<T> Narrows a widenedSeq<? extends T>
toSeq<T>
by performing a type-safe cast.(package private) static <T> PriorityQueueBase.Node
<T> PriorityQueueBase.Node.of
(T value, int rank, Seq<PriorityQueueBase.Node<T>> children) private static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.rebuild
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest) Separate the rank 0 trees from the rest, rebuild the 0 rank ones and merge them back(package private) static <T,
U, R extends Seq<T>>
RCollections.sortBy
(Seq<? extends T> source, Comparator<? super U> comparator, Function<? super T, ? extends U> mapper, Collector<T, ?, R> collector) private static <T> Seq
<PriorityQueueBase.Node<T>> PriorityQueueBase.uniqify
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest) fun uniqify [] = [] * | uniqify (t :: ts) = ins (t, ts) (∗ eliminate initial duplicate ∗)private PriorityQueue
<T> PriorityQueue.with
(Seq<PriorityQueueBase.Node<T>> forest, int size) Constructors in io.vavr.collection with parameters of type SeqModifierConstructorDescriptionprivate
Node
(T root, int rank, Seq<PriorityQueueBase.Node<T>> children) private
PriorityQueue
(Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest, int size) -
Uses of Seq in io.vavr.concurrent
Methods in io.vavr.concurrent that return types with arguments of type SeqModifier and TypeMethodDescriptionReduces manyFuture
s into a singleFuture
by transforming anIterable<Future<? extends T>>
into aFuture<Seq<T>>
.Reduces manyFuture
s into a singleFuture
by transforming anIterable<Future<? extends T>>
into aFuture<Seq<T>>
.Future.traverse
(Iterable<? extends T> values, Function<? super T, ? extends Future<? extends U>> mapper) Maps the values of an iterable in parallel to a sequence of mapped values into a singleFuture
by transforming anIterable<? extends T>
into aFuture<Seq<U>>
.Future.traverse
(Executor executor, Iterable<? extends T> values, Function<? super T, ? extends Future<? extends U>> mapper) Maps the values of an iterable in parallel to a sequence of mapped values into a singleFuture
by transforming anIterable<? extends T>
into aFuture<Seq<U>>
. -
Uses of Seq in io.vavr.control
Methods in io.vavr.control that return types with arguments of type SeqModifier and TypeMethodDescriptiondefault <U> Validation
<Seq<E>, U> <R> Validation
<Seq<E>, R> <R> Validation
<Seq<E>, R> <R> Validation
<Seq<E>, R> <R> Validation
<Seq<E>, R> <R> Validation
<Seq<E>, R> <R> Validation
<Seq<E>, R> <R> Validation
<Seq<E>, R> Reduces manyEither
s into a singleEither
by transforming anIterable<Either<L, R>>
into aEither<Seq<L>, Seq<R>>
.Reduces manyEither
s into a singleEither
by transforming anIterable<Either<L, R>>
into aEither<Seq<L>, Seq<R>>
.Reduces manyOption
s into a singleOption
by transforming anIterable<Option<? extends T>>
into aOption<Seq<T>>
.Reduces manyTry
s into a singleTry
by transforming anIterable<Try<? extends T>>
into aTry<Seq<T>>
.static <E,
T> Validation <Seq<E>, Seq<T>> Validation.sequence
(Iterable<? extends Validation<? extends Seq<? extends E>, ? extends T>> values) Reduces manyValidation
instances into a singleValidation
by transforming anIterable<Validation<? extends T>>
into aValidation<Seq<T>>
.static <E,
T> Validation <Seq<E>, Seq<T>> Validation.sequence
(Iterable<? extends Validation<? extends Seq<? extends E>, ? extends T>> values) Reduces manyValidation
instances into a singleValidation
by transforming anIterable<Validation<? extends T>>
into aValidation<Seq<T>>
.Either.sequenceRight
(Iterable<? extends Either<? extends L, ? extends R>> eithers) Reduces manyEither
s into a singleEither
by transforming anIterable<Either<L, R>>
into aEither<L, Seq<R>>
.Either.traverse
(Iterable<? extends T> values, Function<? super T, ? extends Either<? extends L, ? extends R>> mapper) Maps the values of an iterable to a sequence of mapped values into a singleEither
by transforming anIterable<? extends T>
into aEither<Seq<U>>
.Either.traverse
(Iterable<? extends T> values, Function<? super T, ? extends Either<? extends L, ? extends R>> mapper) Maps the values of an iterable to a sequence of mapped values into a singleEither
by transforming anIterable<? extends T>
into aEither<Seq<U>>
.Option.traverse
(Iterable<? extends T> values, Function<? super T, ? extends Option<? extends U>> mapper) Maps the values of an iterable to a sequence of mapped values into a singleOption
by transforming anIterable<? extends T>
into aOption<Seq<U>>
.Maps the values of an iterable to a sequence of mapped values into a singleTry
by transforming anIterable<? extends T>
into aTry<Seq<U>>
.static <E,
T, U> Validation <Seq<E>, Seq<U>> Validation.traverse
(Iterable<? extends T> values, Function<? super T, ? extends Validation<? extends Seq<? extends E>, ? extends U>> mapper) Maps the values of an iterable to a sequence of mapped values into a singleValidation
by transforming anIterable<? extends T>
into aValidation<Seq<U>>
.static <E,
T, U> Validation <Seq<E>, Seq<U>> Validation.traverse
(Iterable<? extends T> values, Function<? super T, ? extends Validation<? extends Seq<? extends E>, ? extends U>> mapper) Maps the values of an iterable to a sequence of mapped values into a singleValidation
by transforming anIterable<? extends T>
into aValidation<Seq<U>>
.Either.traverseRight
(Iterable<? extends T> values, Function<? super T, ? extends Either<? extends L, ? extends R>> mapper) Maps the values of an iterable to a sequence of mapped values into a singleEither
by transforming anIterable<? extends T>
into aEither<Seq<U>>
.Method parameters in io.vavr.control with type arguments of type SeqModifier and TypeMethodDescriptiondefault <U> Validation
<Seq<E>, U> static <E,
T> Validation <Seq<E>, Seq<T>> Validation.sequence
(Iterable<? extends Validation<? extends Seq<? extends E>, ? extends T>> values) Reduces manyValidation
instances into a singleValidation
by transforming anIterable<Validation<? extends T>>
into aValidation<Seq<T>>
.static <E,
T, U> Validation <Seq<E>, Seq<U>> Validation.traverse
(Iterable<? extends T> values, Function<? super T, ? extends Validation<? extends Seq<? extends E>, ? extends U>> mapper) Maps the values of an iterable to a sequence of mapped values into a singleValidation
by transforming anIterable<? extends T>
into aValidation<Seq<U>>
.
reject(Predicate)