Uses of Interface
io.vavr.collection.Seq
-
Packages that use Seq Package Description io.vavr BesideAPI
the io.vavr package contains core types like (Checked)Functions and Tuples.io.vavr.collection Purely functional collections based on Traversable.io.vavr.concurrent This package contains basic building blocks for creating fast, asynchronous, non-blocking parallel code.io.vavr.control -
-
Uses of Seq in io.vavr
Methods in io.vavr that return Seq Modifier and Type Method Description static <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()
Methods in io.vavr that return types with arguments of type Seq Modifier and Type Method Description static <T> Lazy<Seq<T>>
Lazy. sequence(java.lang.Iterable<? extends Lazy<? extends T>> values)
Reduces manyLazy
values into a singleLazy
by transforming anIterable<Lazy<? extends T>>
into aLazy<Seq<T>>
.static <T1> Tuple1<Seq<T1>>
Tuple. sequence1(java.lang.Iterable<? extends Tuple1<? extends T1>> tuples)
Turns a sequence ofTuple1
into a Tuple1 ofSeq
.static <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Tuple. sequence2(java.lang.Iterable<? extends Tuple2<? extends T1,? extends T2>> tuples)
Turns a sequence ofTuple2
into a Tuple2 ofSeq
s.static <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Tuple. sequence2(java.lang.Iterable<? extends Tuple2<? extends T1,? extends T2>> tuples)
Turns a sequence ofTuple2
into a Tuple2 ofSeq
s.static <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Tuple. sequence3(java.lang.Iterable<? extends Tuple3<? extends T1,? extends T2,? extends T3>> tuples)
Turns a sequence ofTuple3
into a Tuple3 ofSeq
s.static <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Tuple. sequence3(java.lang.Iterable<? extends Tuple3<? extends T1,? extends T2,? extends T3>> tuples)
Turns a sequence ofTuple3
into a Tuple3 ofSeq
s.static <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Tuple. sequence3(java.lang.Iterable<? extends Tuple3<? extends T1,? extends T2,? extends T3>> tuples)
Turns a sequence ofTuple3
into a Tuple3 ofSeq
s.static <T1,T2,T3,T4>
Tuple4<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>>Tuple. sequence4(java.lang.Iterable<? extends Tuple4<? extends T1,? extends T2,? extends T3,? extends T4>> tuples)
Turns a sequence ofTuple4
into a Tuple4 ofSeq
s.static <T1,T2,T3,T4>
Tuple4<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>>Tuple. sequence4(java.lang.Iterable<? extends Tuple4<? extends T1,? extends T2,? extends T3,? extends T4>> tuples)
Turns a sequence ofTuple4
into a Tuple4 ofSeq
s.static <T1,T2,T3,T4>
Tuple4<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>>Tuple. sequence4(java.lang.Iterable<? extends Tuple4<? extends T1,? extends T2,? extends T3,? extends T4>> tuples)
Turns a sequence ofTuple4
into a Tuple4 ofSeq
s.static <T1,T2,T3,T4>
Tuple4<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>>Tuple. sequence4(java.lang.Iterable<? extends Tuple4<? extends T1,? extends T2,? extends T3,? extends T4>> tuples)
Turns a sequence ofTuple4
into a Tuple4 ofSeq
s.static <T1,T2,T3,T4,T5>
Tuple5<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>>Tuple. sequence5(java.lang.Iterable<? extends Tuple5<? extends T1,? extends T2,? extends T3,? extends T4,? extends T5>> tuples)
Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.static <T1,T2,T3,T4,T5>
Tuple5<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>>Tuple. sequence5(java.lang.Iterable<? extends Tuple5<? extends T1,? extends T2,? extends T3,? extends T4,? extends T5>> tuples)
Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.static <T1,T2,T3,T4,T5>
Tuple5<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>>Tuple. sequence5(java.lang.Iterable<? extends Tuple5<? extends T1,? extends T2,? extends T3,? extends T4,? extends T5>> tuples)
Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.static <T1,T2,T3,T4,T5>
Tuple5<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>>Tuple. sequence5(java.lang.Iterable<? extends Tuple5<? extends T1,? extends T2,? extends T3,? extends T4,? extends T5>> tuples)
Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.static <T1,T2,T3,T4,T5>
Tuple5<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>>Tuple. sequence5(java.lang.Iterable<? extends Tuple5<? extends T1,? extends T2,? extends T3,? extends T4,? extends T5>> tuples)
Turns a sequence ofTuple5
into a Tuple5 ofSeq
s.static <T1,T2,T3,T4,T5,T6>
Tuple6<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>>Tuple. sequence6(java.lang.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.static <T1,T2,T3,T4,T5,T6>
Tuple6<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>>Tuple. sequence6(java.lang.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.static <T1,T2,T3,T4,T5,T6>
Tuple6<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>>Tuple. sequence6(java.lang.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.static <T1,T2,T3,T4,T5,T6>
Tuple6<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>>Tuple. sequence6(java.lang.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.static <T1,T2,T3,T4,T5,T6>
Tuple6<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>>Tuple. sequence6(java.lang.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.static <T1,T2,T3,T4,T5,T6>
Tuple6<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>>Tuple. sequence6(java.lang.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.static <T1,T2,T3,T4,T5,T6,T7>
Tuple7<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>,Seq<T7>>Tuple. sequence7(java.lang.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>
Tuple7<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>,Seq<T7>>Tuple. sequence7(java.lang.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>
Tuple7<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>,Seq<T7>>Tuple. sequence7(java.lang.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>
Tuple7<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>,Seq<T7>>Tuple. sequence7(java.lang.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>
Tuple7<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>,Seq<T7>>Tuple. sequence7(java.lang.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>
Tuple7<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>,Seq<T7>>Tuple. sequence7(java.lang.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>
Tuple7<Seq<T1>,Seq<T2>,Seq<T3>,Seq<T4>,Seq<T5>,Seq<T6>,Seq<T7>>Tuple. sequence7(java.lang.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(java.lang.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(java.lang.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(java.lang.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(java.lang.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(java.lang.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(java.lang.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(java.lang.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(java.lang.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 Seq Modifier and Type Class Description (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.collection Modifier and Type Interface Description interface
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 Seq Modifier and Type Class Description class
Array<T>
Array is a Traversable wrapper forObject[]
containing elements of typeT
.class
CharSeq
The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.static class
List.Cons<T>
Non-emptyList
, consisting of ahead
and atail
.static class
List.Nil<T>
Representation of the singleton emptyList
.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 class
Stream.Empty<T>
The empty Stream.static class
StreamModule.AppendElements<T>
static class
StreamModule.ConsImpl<T>
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 Seq Modifier and Type Field Description (package private) Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase.Node. children
private Seq<PriorityQueueBase.Node<T>>
PriorityQueue. forest
Methods in io.vavr.collection with type parameters of type Seq Modifier and Type Method Description (package private) static <T,C extends Seq<T>>
CCollections. asJava(C source, java.util.function.Consumer<? super java.util.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)
(package private) static <T,S extends Seq<T>>
Iterator<S>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>>
SCollections. shuffle(S source, java.util.function.Function<? super java.lang.Iterable<T>,S> ofAll)
(package private) static <T,U,R extends Seq<T>>
RCollections. sortBy(Seq<? extends T> source, java.util.Comparator<? super U> comparator, java.util.function.Function<? super T,? extends U> mapper, java.util.stream.Collector<T,?,R> collector)
(package private) static <T,U extends Seq<T>,V extends Seq<U>>
VCollections. transpose(V matrix, java.util.function.Function<java.lang.Iterable<U>,V> rowFactory, java.util.function.Function<T[],U> columnFactory)
(package private) static <T,U extends Seq<T>,V extends Seq<U>>
VCollections. transpose(V matrix, java.util.function.Function<java.lang.Iterable<U>,V> rowFactory, java.util.function.Function<T[],U> columnFactory)
private static <T,U extends Seq<T>,V extends Seq<U>>
VCollections. transposeNonEmptyMatrix(V matrix, java.util.function.Function<java.lang.Iterable<U>,V> rowFactory, java.util.function.Function<T[],U> columnFactory)
private static <T,U extends Seq<T>,V extends Seq<U>>
VCollections. transposeNonEmptyMatrix(V matrix, java.util.function.Function<java.lang.Iterable<U>,V> rowFactory, java.util.function.Function<T[],U> columnFactory)
Methods in io.vavr.collection that return Seq Modifier and Type Method Description Seq<T>
Seq. append(T element)
Appends an element to this.Seq<T>
Seq. appendAll(java.lang.Iterable<? extends T> elements)
Appends all given elements to this.(package private) Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase.Node. appendTo(Seq<PriorityQueueBase.Node<T>> forest)
Seq<T>
Seq. asJava(java.util.function.Consumer<? super java.util.List<T>> action)
Creates an immutableList
view on top of thisSeq
that is passed to the givenaction
.Seq<T>
Seq. asJavaMutable(java.util.function.Consumer<? super java.util.List<T>> action)
Creates a mutableList
view on top of thisSeq
that is passed to the givenaction
.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<? extends Seq<T>>
Seq. combinations()
Returns the union of all combinations from k = 0 to length().Seq<? extends Seq<T>>
Seq. combinations(int k)
Returns the k-combination of this traversable, i.e.Seq<T>
Seq. distinct()
default Seq<T>
Tree. distinct()
Seq<T>
Seq. distinctBy(java.util.Comparator<? super T> comparator)
<U> Seq<T>
Seq. distinctBy(java.util.function.Function<? super T,? extends U> keyExtractor)
default Seq<T>
Tree. distinctBy(java.util.Comparator<? super T> comparator)
default <U> Seq<T>
Tree. distinctBy(java.util.function.Function<? super T,? extends U> keyExtractor)
Seq<T>
Seq. drop(int n)
default Seq<T>
Tree. drop(int n)
Seq<T>
Seq. dropRight(int n)
default Seq<T>
Tree. dropRight(int n)
Seq<T>
Seq. dropRightUntil(java.util.function.Predicate<? super T> predicate)
Drops elements until the predicate holds for the current element, starting from the end.Seq<T>
Seq. dropRightWhile(java.util.function.Predicate<? super T> predicate)
Drops elements while the predicate holds for the current element, starting from the end.Seq<T>
Seq. dropUntil(java.util.function.Predicate<? super T> predicate)
default Seq<T>
Tree. dropUntil(java.util.function.Predicate<? super T> predicate)
Seq<T>
Seq. dropWhile(java.util.function.Predicate<? super T> predicate)
default Seq<T>
Tree. dropWhile(java.util.function.Predicate<? super T> predicate)
Seq<T>
Seq. filter(java.util.function.Predicate<? super T> predicate)
default Seq<T>
Tree. filter(java.util.function.Predicate<? super T> predicate)
default <U> Seq<U>
Map. flatMap(java.util.function.Function<? super Tuple2<K,V>,? extends java.lang.Iterable<? extends U>> mapper)
Flat-maps this entries to a sequence of values.default <U> Seq<U>
Multimap. flatMap(java.util.function.Function<? super Tuple2<K,V>,? extends java.lang.Iterable<? extends U>> mapper)
Flat-maps this entries to a sequence of values.<U> Seq<U>
Seq. flatMap(java.util.function.Function<? super T,? extends java.lang.Iterable<? extends U>> mapper)
Seq<T>
Seq. init()
default Seq<T>
Tree. init()
private static <T> Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase. ins(java.util.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 < rank t' then t :: t' :: ts * else ins (link (t, t'), ts)(package private) static <T> Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase. insert(java.util.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,[]) :: tsSeq<T>
Seq. insert(int index, T element)
Inserts the given element at the specified index.Seq<T>
Seq. insertAll(int index, java.lang.Iterable<? extends T> elements)
Inserts the given elements at the specified index.Seq<T>
Seq. intersperse(T element)
Inserts an element between all elements of this Traversable.Seq<T>
Seq. leftPadTo(int length, T element)
A copy of this sequence with an element prepended until a given target length is reached.default <U> Seq<U>
Map. map(java.util.function.Function<? super Tuple2<K,V>,? extends U> mapper)
Maps theMap
entries to a sequence of values.default <U> Seq<U>
Multimap. map(java.util.function.Function<? super Tuple2<K,V>,? extends U> mapper)
Maps theMultimap
entries to a sequence of values.<U> Seq<U>
Seq. map(java.util.function.Function<? super T,? extends U> mapper)
(package private) static <T> Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase. meld(java.util.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(java.util.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 < rank t2 then t1 :: meldUniq (ts1, t2 :: ts2) * else if rank t2 < rank t1 then t2 :: meldUniq (t1 :: ts1, ts2) * else ins (link (t1, t2), meldUniq (ts1, ts2))static <T> Seq<T>
Seq. narrow(Seq<? extends T> seq)
Narrows a widenedSeq<? extends T>
toSeq<T>
by performing a type-safe cast.Seq<T>
IteratorModule.GroupedIterator. next()
Seq<T>
Seq. orElse(java.lang.Iterable<? extends T> other)
Seq<T>
Seq. orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends T>> supplier)
Seq<T>
Seq. padTo(int length, T element)
A copy of this sequence with an element appended until a given target length is reached.Seq<T>
Seq. patch(int from, java.lang.Iterable<? extends T> that, int replaced)
Produces a new list where a slice of elements in this list is replaced by another sequence.Seq<T>
Seq. peek(java.util.function.Consumer<? super T> action)
Seq<? extends Seq<T>>
Seq. permutations()
Computes all unique permutations.Seq<T>
Seq. prepend(T element)
Prepends an element to this.Seq<T>
Seq. prependAll(java.lang.Iterable<? extends T> elements)
Prepends all given elements to this.private static <T> Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase. rebuild(java.util.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 backSeq<T>
Seq. reject(java.util.function.Predicate<? super T> predicate)
default Seq<T>
Tree. reject(java.util.function.Predicate<? super T> predicate)
Seq<T>
Seq. remove(T element)
Removes the first occurrence of the given element.Seq<T>
Seq. removeAll(java.lang.Iterable<? extends T> elements)
Removes all occurrences of the given elements.Seq<T>
Seq. removeAll(java.util.function.Predicate<? super T> predicate)
Deprecated.Please usereject(Predicate)
Seq<T>
Seq. removeAll(T element)
Removes all occurrences of the given element.Seq<T>
Seq. removeAt(int index)
Removes the element at the specified position in this sequence.Seq<T>
Seq. removeFirst(java.util.function.Predicate<T> predicate)
Removes the first occurrence that satisfy predicateSeq<T>
Seq. removeLast(java.util.function.Predicate<T> predicate)
Removes the last occurrence that satisfy predicateSeq<T>
Seq. replace(T currentElement, T newElement)
Seq<T>
Seq. replaceAll(T currentElement, T newElement)
Seq<T>
Seq. retainAll(java.lang.Iterable<? extends T> elements)
default Seq<T>
Tree. retainAll(java.lang.Iterable<? extends T> elements)
Seq<T>
Seq. reverse()
Reverses the order of elements.Seq<T>
Seq. rotateLeft(int n)
Circular rotates the elements by the specified distance to the left direction.Seq<T>
Seq. rotateRight(int n)
Circular rotates the elements by the specified distance to the right direction.Seq<T>
Seq. scan(T zero, java.util.function.BiFunction<? super T,? super T,? extends T> operation)
default Seq<T>
Tree. scan(T zero, java.util.function.BiFunction<? super T,? super T,? extends T> operation)
default <U> Seq<U>
Map. scanLeft(U zero, java.util.function.BiFunction<? super U,? super Tuple2<K,V>,? extends U> operation)
default <U> Seq<U>
Multimap. scanLeft(U zero, java.util.function.BiFunction<? super U,? super Tuple2<K,V>,? extends U> operation)
<U> Seq<U>
Seq. scanLeft(U zero, java.util.function.BiFunction<? super U,? super T,? extends U> operation)
default <U> Seq<U>
Tree. scanLeft(U zero, java.util.function.BiFunction<? super U,? super T,? extends U> operation)
default <U> Seq<U>
Map. scanRight(U zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends U> operation)
default <U> Seq<U>
Multimap. scanRight(U zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends U> operation)
<U> Seq<U>
Seq. scanRight(U zero, java.util.function.BiFunction<? super T,? super U,? extends U> operation)
default <U> Seq<U>
Tree. scanRight(U zero, java.util.function.BiFunction<? super T,? super U,? extends U> operation)
Seq<T>
Seq. shuffle()
Randomize the order of the elements in the current sequence.Seq<T>
Seq. slice(int beginIndex, int endIndex)
Returns a Seq that is a slice of this.<U> Seq<T>
Seq. sortBy(java.util.Comparator<? super U> comparator, java.util.function.Function<? super T,? extends U> mapper)
Sorts this elements by comparing the elements in a different domain, using the givenmapper
.<U extends java.lang.Comparable<? super U>>
Seq<T>Seq. sortBy(java.util.function.Function<? super T,? extends U> mapper)
Sorts this elements by comparing the elements in a different domain, using the givenmapper
.Seq<T>
Seq. sorted()
Sorts this elements according to their natural order.Seq<T>
Seq. sorted(java.util.Comparator<? super T> comparator)
Sorts this elements according to the providedComparator
.Seq<CharSeq>
CharSeq. split(java.lang.String regex)
Splits this string around matches of the given regular expression.Seq<CharSeq>
CharSeq. split(java.lang.String regex, int limit)
Splits this string around matches of the given regular expression.Seq<T>
Seq. subSequence(int beginIndex)
Returns a Seq that is a subsequence of this.Seq<T>
Seq. subSequence(int beginIndex, int endIndex)
Returns a Seq that is a subsequence of this.Seq<T>
Seq. tail()
default Seq<T>
Tree. tail()
Seq<T>
Seq. take(int n)
default Seq<T>
Tree. take(int n)
Seq<T>
Seq. takeRight(int n)
default Seq<T>
Tree. takeRight(int n)
Seq<T>
Seq. takeRightUntil(java.util.function.Predicate<? super T> predicate)
Takes elements until the predicate holds for the current element, starting from the end.Seq<T>
Seq. takeRightWhile(java.util.function.Predicate<? super T> predicate)
Takes elements while the predicate holds for the current element, starting from the end.Seq<T>
Seq. takeUntil(java.util.function.Predicate<? super T> predicate)
default Seq<T>
Tree. takeUntil(java.util.function.Predicate<? super T> predicate)
Seq<T>
Seq. takeWhile(java.util.function.Predicate<? super T> predicate)
default Seq<T>
Tree. takeWhile(java.util.function.Predicate<? super T> predicate)
default Seq<Tree.Node<T>>
Tree. traverse()
Traverses this tree inTree.Order.PRE_ORDER
.default Seq<Tree.Node<T>>
Tree. traverse(Tree.Order order)
Traverses this tree in a specific order.private static <T> Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase. uniqify(java.util.Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest)
fun uniqify [] = [] * | uniqify (t :: ts) = ins (t, ts) (∗ eliminate initial duplicate ∗)Seq<T>
Seq. update(int index, java.util.function.Function<? super T,? extends T> updater)
Updates the given element at the specified index using the specified function.Seq<T>
Seq. update(int index, T element)
Updates the given element at the specified index.Seq<V>
LinkedHashMap. values()
Seq<V>
Map. values()
Returns a newSeq
that contains the values of thisMap
.default Seq<T>
Tree. values()
Traverses this tree values inTree.Order.PRE_ORDER
.default Seq<T>
Tree. values(Tree.Order order)
Traverses this tree values in a specific order.Seq<V>
TreeMap. values()
default <U> Seq<Tuple2<Tuple2<K,V>,U>>
Map. zip(java.lang.Iterable<? extends U> that)
default <U> Seq<Tuple2<Tuple2<K,V>,U>>
Multimap. zip(java.lang.Iterable<? extends U> that)
<U> Seq<Tuple2<T,U>>
Seq. zip(java.lang.Iterable<? extends U> that)
default <U> Seq<Tuple2<Tuple2<K,V>,U>>
Map. zipAll(java.lang.Iterable<? extends U> that, Tuple2<K,V> thisElem, U thatElem)
default <U> Seq<Tuple2<Tuple2<K,V>,U>>
Multimap. zipAll(java.lang.Iterable<? extends U> that, Tuple2<K,V> thisElem, U thatElem)
<U> Seq<Tuple2<T,U>>
Seq. zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)
default <U,R>
Seq<R>Map. zipWith(java.lang.Iterable<? extends U> that, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends R> mapper)
default <U,R>
Seq<R>Multimap. zipWith(java.lang.Iterable<? extends U> that, java.util.function.BiFunction<? super Tuple2<K,V>,? super U,? extends R> mapper)
<U,R>
Seq<R>Seq. zipWith(java.lang.Iterable<? extends U> that, java.util.function.BiFunction<? super T,? super U,? extends R> mapper)
default Seq<Tuple2<Tuple2<K,V>,java.lang.Integer>>
Map. zipWithIndex()
default <U> Seq<U>
Map. zipWithIndex(java.util.function.BiFunction<? super Tuple2<K,V>,? super java.lang.Integer,? extends U> mapper)
default Seq<Tuple2<Tuple2<K,V>,java.lang.Integer>>
Multimap. zipWithIndex()
default <U> Seq<U>
Multimap. zipWithIndex(java.util.function.BiFunction<? super Tuple2<K,V>,? super java.lang.Integer,? extends U> mapper)
Seq<Tuple2<T,java.lang.Integer>>
Seq. zipWithIndex()
<U> Seq<U>
Seq. zipWithIndex(java.util.function.BiFunction<? super T,? super java.lang.Integer,? extends U> mapper)
Methods in io.vavr.collection that return types with arguments of type Seq Modifier and Type Method Description Seq<? extends Seq<T>>
Seq. combinations()
Returns the union of all combinations from k = 0 to length().Seq<? extends Seq<T>>
Seq. combinations(int k)
Returns the k-combination of this traversable, i.e.Iterator<? extends Seq<T>>
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(java.util.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')) end<C> Map<C,? extends Seq<T>>
Seq. groupBy(java.util.function.Function<? super T,? extends C> classifier)
default <C> Map<C,Seq<T>>
Tree. groupBy(java.util.function.Function<? super T,? extends C> classifier)
default Iterator<Seq<T>>
Iterator. grouped(int size)
Iterator<? extends Seq<T>>
Seq. grouped(int size)
default Iterator<Seq<T>>
Tree. grouped(int size)
Option<? extends Seq<T>>
Seq. initOption()
default Option<Seq<T>>
Tree. initOption()
Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. partition(java.util.function.Predicate<? super T> predicate)
Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. partition(java.util.function.Predicate<? super T> predicate)
default Tuple2<Seq<T>,Seq<T>>
Tree. partition(java.util.function.Predicate<? super T> predicate)
default Tuple2<Seq<T>,Seq<T>>
Tree. partition(java.util.function.Predicate<? super T> predicate)
Seq<? extends Seq<T>>
Seq. permutations()
Computes all unique permutations.default Iterator<Seq<T>>
Iterator. slideBy(java.util.function.Function<? super T,?> classifier)
Iterator<? extends Seq<T>>
Seq. slideBy(java.util.function.Function<? super T,?> classifier)
default Iterator<Seq<T>>
Tree. slideBy(java.util.function.Function<? super T,?> classifier)
default Iterator<Seq<T>>
Iterator. sliding(int size)
default Iterator<Seq<T>>
Iterator. sliding(int size, int step)
Iterator<? extends Seq<T>>
Seq. sliding(int size)
Iterator<? extends Seq<T>>
Seq. sliding(int size, int step)
default Iterator<Seq<T>>
Tree. sliding(int size)
default Iterator<Seq<T>>
Tree. sliding(int size, int step)
Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. span(java.util.function.Predicate<? super T> predicate)
Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. span(java.util.function.Predicate<? super T> predicate)
default Tuple2<Seq<T>,Seq<T>>
Tree. span(java.util.function.Predicate<? super T> predicate)
default Tuple2<Seq<T>,Seq<T>>
Tree. span(java.util.function.Predicate<? super T> predicate)
Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. splitAt(int n)
Splits a Seq at the specified index.Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. splitAt(int n)
Splits a Seq at the specified index.Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. splitAt(java.util.function.Predicate<? super T> predicate)
Splits a sequence at the first element which satisfies thePredicate
, e.g.Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. splitAt(java.util.function.Predicate<? super T> predicate)
Splits a sequence at the first element which satisfies thePredicate
, e.g.Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. splitAtInclusive(java.util.function.Predicate<? super T> predicate)
Splits a sequence at the first element which satisfies thePredicate
, e.g.Tuple2<? extends Seq<T>,? extends Seq<T>>
Seq. splitAtInclusive(java.util.function.Predicate<? super T> predicate)
Splits a sequence at the first element which satisfies thePredicate
, e.g.Option<? extends Seq<T>>
Seq. tailOption()
default Option<Seq<T>>
Tree. tailOption()
default Tuple2<Seq<K>,Seq<V>>
Map. unzip()
default Tuple2<Seq<K>,Seq<V>>
Map. unzip()
default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper)
default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper)
default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)
default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Map. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)
default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper)
default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.BiFunction<? super K,? super V,Tuple2<? extends T1,? extends T2>> unzipper)
default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)
default <T1,T2>
Tuple2<Seq<T1>,Seq<T2>>Multimap. unzip(java.util.function.Function<? super Tuple2<K,V>,Tuple2<? extends T1,? extends T2>> unzipper)
<T1,T2>
Tuple2<? extends Seq<T1>,? extends Seq<T2>>Seq. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)
<T1,T2>
Tuple2<? extends Seq<T1>,? extends Seq<T2>>Seq. unzip(java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Map. unzip3(java.util.function.BiFunction<? super K,? super V,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Map. unzip3(java.util.function.BiFunction<? super K,? super V,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Map. unzip3(java.util.function.BiFunction<? super K,? super V,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Map. unzip3(java.util.function.Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Map. unzip3(java.util.function.Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Map. unzip3(java.util.function.Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Multimap. unzip3(java.util.function.BiFunction<? super K,? super V,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Multimap. unzip3(java.util.function.BiFunction<? super K,? super V,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Multimap. unzip3(java.util.function.BiFunction<? super K,? super V,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Multimap. unzip3(java.util.function.Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Multimap. unzip3(java.util.function.Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
default <T1,T2,T3>
Tuple3<Seq<T1>,Seq<T2>,Seq<T3>>Multimap. unzip3(java.util.function.Function<? super Tuple2<K,V>,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
<T1,T2,T3>
Tuple3<? extends Seq<T1>,? extends Seq<T2>,? extends Seq<T3>>Seq. unzip3(java.util.function.Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
<T1,T2,T3>
Tuple3<? extends Seq<T1>,? extends Seq<T2>,? extends Seq<T3>>Seq. unzip3(java.util.function.Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
<T1,T2,T3>
Tuple3<? extends Seq<T1>,? extends Seq<T2>,? extends Seq<T3>>Seq. unzip3(java.util.function.Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
Methods in io.vavr.collection with parameters of type Seq Modifier and Type Method Description (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(java.util.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
IndexedSeq. endsWith(Seq<? extends T> that)
default boolean
Seq. endsWith(Seq<? extends T> that)
Tests whether this sequence ends with the given sequence.(package private) static <V> boolean
Collections. equals(Seq<V> source, java.lang.Object object)
(package private) static <T> PriorityQueueBase.Node<T>
PriorityQueueBase. findMin(java.util.Comparator<? super T> comparator, Seq<PriorityQueueBase.Node<T>> forest)
Find the minimum root in the forestprivate static <T> Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase. ins(java.util.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 < rank t' then t :: t' :: ts * else ins (link (t, t'), ts)(package private) static <T> Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase. insert(java.util.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(java.util.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(java.util.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 < rank t2 then t1 :: meldUniq (ts1, t2 :: ts2) * else if rank t2 < rank t1 then t2 :: meldUniq (t1 :: ts1, ts2) * else ins (link (t1, t2), meldUniq (ts1, ts2))static <T> Seq<T>
Seq. narrow(Seq<? extends T> seq)
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(java.util.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, java.util.Comparator<? super U> comparator, java.util.function.Function<? super T,? extends U> mapper, java.util.stream.Collector<T,?,R> collector)
private static <T> Seq<PriorityQueueBase.Node<T>>
PriorityQueueBase. uniqify(java.util.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 Seq Constructor Description Node(T root, int rank, Seq<PriorityQueueBase.Node<T>> children)
PriorityQueue(java.util.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 Seq Modifier and Type Method Description static <T> Future<Seq<T>>
Future. sequence(java.lang.Iterable<? extends Future<? extends T>> futures)
Reduces manyFuture
s into a singleFuture
by transforming anIterable<Future<? extends T>>
into aFuture<Seq<T>>
.static <T> Future<Seq<T>>
Future. sequence(java.util.concurrent.Executor executor, java.lang.Iterable<? extends Future<? extends T>> futures)
Reduces manyFuture
s into a singleFuture
by transforming anIterable<Future<? extends T>>
into aFuture<Seq<T>>
.static <T,U>
Future<Seq<U>>Future. traverse(java.lang.Iterable<? extends T> values, java.util.function.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>>
.static <T,U>
Future<Seq<U>>Future. traverse(java.util.concurrent.Executor executor, java.lang.Iterable<? extends T> values, java.util.function.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 Seq Modifier and Type Method Description default <U> Validation<Seq<E>,U>
Validation. ap(Validation<Seq<E>,? extends java.util.function.Function<? super T,? extends U>> validation)
<R> Validation<Seq<E>,R>
Validation.Builder. ap(Function2<T1,T2,R> f)
<R> Validation<Seq<E>,R>
Validation.Builder3. ap(Function3<T1,T2,T3,R> f)
<R> Validation<Seq<E>,R>
Validation.Builder4. ap(Function4<T1,T2,T3,T4,R> f)
<R> Validation<Seq<E>,R>
Validation.Builder5. ap(Function5<T1,T2,T3,T4,T5,R> f)
<R> Validation<Seq<E>,R>
Validation.Builder6. ap(Function6<T1,T2,T3,T4,T5,T6,R> f)
<R> Validation<Seq<E>,R>
Validation.Builder7. ap(Function7<T1,T2,T3,T4,T5,T6,T7,R> f)
<R> Validation<Seq<E>,R>
Validation.Builder8. ap(Function8<T1,T2,T3,T4,T5,T6,T7,T8,R> f)
static <L,R>
Either<Seq<L>,Seq<R>>Either. sequence(java.lang.Iterable<? extends Either<? extends L,? extends R>> eithers)
Reduces manyEither
s into a singleEither
by transforming anIterable<Either<L, R>>
into aEither<Seq<L>, Seq<R>>
.static <L,R>
Either<Seq<L>,Seq<R>>Either. sequence(java.lang.Iterable<? extends Either<? extends L,? extends R>> eithers)
Reduces manyEither
s into a singleEither
by transforming anIterable<Either<L, R>>
into aEither<Seq<L>, Seq<R>>
.static <T> Option<Seq<T>>
Option. sequence(java.lang.Iterable<? extends Option<? extends T>> values)
Reduces manyOption
s into a singleOption
by transforming anIterable<Option<? extends T>>
into aOption<Seq<T>>
.static <T> Try<Seq<T>>
Try. sequence(java.lang.Iterable<? extends Try<? extends T>> values)
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(java.lang.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(java.lang.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 <L,R>
Either<L,Seq<R>>Either. sequenceRight(java.lang.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>>
.static <L,R,T>
Either<Seq<L>,Seq<R>>Either. traverse(java.lang.Iterable<? extends T> values, java.util.function.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>>
.static <L,R,T>
Either<Seq<L>,Seq<R>>Either. traverse(java.lang.Iterable<? extends T> values, java.util.function.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>>
.static <T,U>
Option<Seq<U>>Option. traverse(java.lang.Iterable<? extends T> values, java.util.function.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>>
.static <T,U>
Try<Seq<U>>Try. traverse(java.lang.Iterable<? extends T> values, java.util.function.Function<? super T,? extends Try<? extends U>> mapper)
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(java.lang.Iterable<? extends T> values, java.util.function.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(java.lang.Iterable<? extends T> values, java.util.function.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 <L,R,T>
Either<L,Seq<R>>Either. traverseRight(java.lang.Iterable<? extends T> values, java.util.function.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 Seq Modifier and Type Method Description default <U> Validation<Seq<E>,U>
Validation. ap(Validation<Seq<E>,? extends java.util.function.Function<? super T,? extends U>> validation)
static <E,T>
Validation<Seq<E>,Seq<T>>Validation. sequence(java.lang.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(java.lang.Iterable<? extends T> values, java.util.function.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>>
.
-