Package | Description |
---|---|
io.vavr |
Beside
API 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 |
Modifier and Type | Interface and Description |
---|---|
static interface |
API.Match.Case<T,R> |
static interface |
API.Match.Pattern<T,R>
A Pattern is a partial
Function in the sense that a function applications returns an
optional result of type Option<R> . |
Modifier and Type | Class and Description |
---|---|
static class |
API.Match.Case0<T,R> |
static class |
API.Match.Case1<T,T1,R> |
static class |
API.Match.Case2<T,T1,T2,R> |
static class |
API.Match.Case3<T,T1,T2,T3,R> |
static class |
API.Match.Case4<T,T1,T2,T3,T4,R> |
static class |
API.Match.Case5<T,T1,T2,T3,T4,T5,R> |
static class |
API.Match.Case6<T,T1,T2,T3,T4,T5,T6,R> |
static class |
API.Match.Case7<T,T1,T2,T3,T4,T5,T6,T7,R> |
static class |
API.Match.Case8<T,T1,T2,T3,T4,T5,T6,T7,T8,R> |
static class |
API.Match.Pattern0<T> |
static class |
API.Match.Pattern1<T,T1> |
static class |
API.Match.Pattern2<T,T1,T2> |
static class |
API.Match.Pattern3<T,T1,T2,T3> |
static class |
API.Match.Pattern4<T,T1,T2,T3,T4> |
static class |
API.Match.Pattern5<T,T1,T2,T3,T4,T5> |
static class |
API.Match.Pattern6<T,T1,T2,T3,T4,T5,T6> |
static class |
API.Match.Pattern7<T,T1,T2,T3,T4,T5,T6,T7> |
static class |
API.Match.Pattern8<T,T1,T2,T3,T4,T5,T6,T7,T8> |
Modifier and Type | Method and Description |
---|---|
static <T,V extends Value<T>> |
PartialFunction.getIfDefined()
Factory method for creating a partial function that maps a given
Value to its underlying value. |
default PartialFunction<T1,R> |
Function1.partial(Predicate<? super T1> isDefinedAt)
|
static <T,R> PartialFunction<T,R> |
PartialFunction.unlift(Function<? super T,? extends Option<? extends R>> totalFunction)
Unlifts a
totalFunction that returns an Option result into a partial function. |
Modifier and Type | Interface and Description |
---|---|
interface |
IndexedSeq<T>
Interface for immutable, indexed sequences.
|
interface |
LinearSeq<T>
Interface for immutable, linear sequences.
|
interface |
List<T>
An immutable
List is an eager sequence of elements. |
interface |
Map<K,V>
An immutable
Map interface. |
interface |
Multimap<K,V>
An immutable
Multimap interface. |
interface |
Seq<T>
Interface for immutable sequential data structures.
|
interface |
SortedMap<K,V>
An immutable
SortedMap interface. |
interface |
SortedMultimap<K,V>
An immutable
SortedMultimap interface. |
interface |
Stream<T>
An immutable
Stream is lazy sequence of elements which may be infinitely long. |
Modifier and Type | Class and Description |
---|---|
class |
Array<T>
Array is a Traversable wrapper for
Object[] containing elements of type T . |
class |
CharSeq
The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations
we know from the functional Vavr collections.
|
class |
HashMap<K,V>
An immutable
HashMap implementation based on a
Hash array mapped trie (HAMT). |
class |
HashMultimap<K,V>
|
class |
LinkedHashMap<K,V>
An immutable
LinkedHashMap implementation that has predictable (insertion-order) iteration. |
class |
LinkedHashMultimap<K,V>
A
LinkedHashMap -based implementation of Multimap |
static class |
List.Cons<T>
Non-empty
List , consisting of a head and a tail . |
static class |
List.Nil<T>
Representation of the singleton empty
List . |
class |
Queue<T>
An immutable
Queue stores elements allowing a first-in-first-out (FIFO) retrieval. |
static class |
Stream.Cons<T>
Non-empty
Stream , consisting of a head , and tail . |
static class |
Stream.Empty<T>
The empty Stream.
|
class |
TreeMap<K,V>
SortedMap implementation, backed by a Red/Black Tree.
|
class |
TreeMultimap<K,V>
|
class |
Vector<T>
Vector is the default Seq implementation that provides effectively constant time access to any element.
|
Modifier and Type | Method and Description |
---|---|
default PartialFunction<K,V> |
Map.asPartialFunction()
Turns this
Map into a PartialFunction which is defined at a specific index, if this Map
contains the given key. |
default PartialFunction<Integer,T> |
IndexedSeq.asPartialFunction() |
PartialFunction<Integer,T> |
Seq.asPartialFunction()
Turns this
Seq into a PartialFunction which is defined at a specific index, if this Seq
contains at least index + 1 elements. |
default PartialFunction<K,Traversable<V>> |
Multimap.asPartialFunction()
Turns this
Multimap into a PartialFunction which is defined at a specific index, if this Multimap
contains the given key. |
default PartialFunction<Integer,T> |
LinearSeq.asPartialFunction() |
Modifier and Type | Method and Description |
---|---|
<R> IndexedSeq<R> |
CharSeq.collect(PartialFunction<? super Character,? extends R> partialFunction) |
<R> Set<R> |
Set.collect(PartialFunction<? super T,? extends R> partialFunction) |
default <R> Iterator<R> |
Iterator.collect(PartialFunction<? super T,? extends R> partialFunction) |
default <R> SortedSet<R> |
BitSet.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> IndexedSeq<R> |
IndexedSeq.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> PriorityQueue<R> |
PriorityQueue.collect(PartialFunction<? super T,? extends R> partialFunction) |
default <R> Tree<R> |
Tree.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> TreeSet<R> |
TreeSet.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> Queue<R> |
Queue.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> Vector<R> |
Vector.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> Seq<R> |
Seq.collect(PartialFunction<? super T,? extends R> partialFunction) |
default <R> List<R> |
List.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> HashSet<R> |
HashSet.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> LinkedHashSet<R> |
LinkedHashSet.collect(PartialFunction<? super T,? extends R> partialFunction) |
default <R> Stream<R> |
Stream.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> SortedSet<R> |
SortedSet.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> Array<R> |
Array.collect(PartialFunction<? super T,? extends R> partialFunction) |
<R> Traversable<R> |
Traversable.collect(PartialFunction<? super T,? extends R> partialFunction)
Collects all elements that are in the domain of the given
partialFunction by mapping the elements to type R . |
<R> LinearSeq<R> |
LinearSeq.collect(PartialFunction<? super T,? extends R> partialFunction) |
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) |
Modifier and Type | Method and Description |
---|---|
default <R> Future<R> |
Future.collect(PartialFunction<? super T,? extends R> partialFunction)
Collects value that is in the domain of the given
partialFunction by mapping the value to type R . |
Modifier and Type | Method and Description |
---|---|
default <R> Try<R> |
Try.collect(PartialFunction<? super T,? extends R> partialFunction)
Collects value that is in the domain of the given
partialFunction by mapping the value to type R . |
default <R> Option<R> |
Option.collect(PartialFunction<? super T,? extends R> partialFunction)
Collects value that is in the domain of the given
partialFunction by mapping the value to type R . |
Copyright © 2021. All Rights Reserved.