Package | Description |
---|---|
io.vavr | |
io.vavr.collection |
Purely functional collections based on Traversable.
|
io.vavr.concurrent |
This package contains basic building blocks creating fast, asynchronous, non-blocking parallel code.
|
io.vavr.control |
Modifier and Type | Class and Description |
---|---|
class |
Lazy<T>
Represents a lazy evaluated value.
|
Modifier and Type | Method and Description |
---|---|
<U> Value<U> |
Value.map(Function<? super T,? extends U> mapper)
Maps the underlying value to a different component type.
|
static <T> Value<T> |
Value.narrow(Value<? extends T> value)
Narrows a widened
Value<? extends T> to Value<T>
by performing a type-safe cast. |
Value<T> |
Value.peek(Consumer<? super T> action)
Performs the given
action on the first element if this is an eager implementation. |
Modifier and Type | Method and Description |
---|---|
static <T> Value<T> |
Value.narrow(Value<? extends T> value)
Narrows a widened
Value<? extends T> to Value<T>
by performing a type-safe cast. |
Modifier and Type | Interface and Description |
---|---|
interface |
BitSet<T>
An immutable
BitSet implementation. |
interface |
IndexedSeq<T>
Interface for immutable, indexed sequences.
|
interface |
Iterator<T>
io.vavr.collection.Iterator is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements. |
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 |
Set<T>
An immutable
Set interface. |
interface |
SortedMap<K,V>
An immutable
SortedMap interface. |
interface |
SortedMultimap<K,V>
An immutable
SortedMultimap interface. |
interface |
SortedSet<T>
An immutable
SortedSet interface. |
interface |
Stream<T>
An immutable
Stream is lazy sequence of elements which may be infinitely long. |
interface |
Traversable<T>
An interface for inherently recursive, multi-valued data structures.
|
interface |
Tree<T>
A general Tree interface.
|
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 |
HashSet<T>
An immutable
HashSet implementation. |
class |
LinkedHashMap<K,V>
An immutable
LinkedHashMap implementation. |
class |
LinkedHashMultimap<K,V>
A
LinkedHashMap -based implementation of Multimap |
class |
LinkedHashSet<T>
An immutable
HashSet implementation. |
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 |
PriorityQueue<T>
A PriorityQueue.
|
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.
|
static class |
Tree.Empty<T>
The empty tree.
|
static class |
Tree.Node<T>
Represents a tree node.
|
class |
TreeMap<K,V>
SortedMap implementation, backed by a Red/Black Tree.
|
class |
TreeMultimap<K,V>
|
class |
TreeSet<T>
SortedSet implementation, backed by a Red/Black Tree.
|
class |
Vector<T>
Vector is the default Seq implementation that provides effectively constant time access to any element.
|
Modifier and Type | Interface and Description |
---|---|
interface |
Future<T>
A Future is a computation result that becomes available at some point.
|
Modifier and Type | Interface and Description |
---|---|
interface |
Either<L,R>
Either represents a value of two possible types.
|
interface |
Option<T>
Replacement for
Optional . |
interface |
Try<T>
The Try control gives us the ability write safe code without focusing on try-catch blocks in the presence of exceptions.
|
interface |
Validation<E,T>
An implementation similar to scalaz's Validation control.
|
Modifier and Type | Class and Description |
---|---|
static class |
Either.Left<L,R>
The
Left version of an Either . |
static class |
Either.LeftProjection<L,R>
A left projection of an Either.
|
static class |
Either.Right<L,R>
The
Right version of an Either . |
static class |
Either.RightProjection<L,R>
A right projection of an Either.
|
static class |
Option.None<T>
None is a singleton representation of the undefined
Option . |
static class |
Option.Some<T>
Some represents a defined
Option . |
static class |
Try.Failure<T>
A failed Try.
|
static class |
Try.Success<T>
A succeeded Try.
|
static class |
Validation.Invalid<E,T>
An invalid Validation
|
static class |
Validation.Valid<E,T>
A valid Validation
|
Copyright © 2017. All Rights Reserved.