Uses of Interface
io.vavr.Value
Packages that use Value
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 Value in io.vavr
Modifier and TypeMethodDescriptionstatic <T,
V extends Value<T>>
PartialFunction<V, T> PartialFunction.getIfDefined()
Factory method for creating a partial function that maps a givenValue
to its underlying value.Modifier and TypeMethodDescription<U> Value
<U> Maps the underlying value to a different component type.static <T> Value
<T> Narrows a widenedValue<? extends T>
toValue<T>
by performing a type-safe cast.Performs the givenaction
on the first element if this is an eager implementation.Modifier and TypeMethodDescriptionstatic <T> Value
<T> Narrows a widenedValue<? extends T>
toValue<T>
by performing a type-safe cast.static <T,
R extends Collection<T>>
RValueModule.toJavaCollection
(Value<T> value, Function<Integer, R> containerSupplier) static <T,
R extends Collection<T>>
RValueModule.toJavaCollection
(Value<T> value, Function<Integer, R> containerSupplier, int defaultInitialCapacity) ValueModule.toMap
(Value<T> value, R empty, Function<E, R> ofElement, Function<Iterable<E>, R> ofAll, Function<? super T, ? extends E> f) static <T,
R extends Traversable<T>>
RValueModule.toTraversable
(Value<T> value, R empty, Function<T, R> ofElement, Function<Iterable<T>, R> ofAll) -
Uses of Value in io.vavr.collection
Subinterfaces of Value in io.vavr.collectionModifier and TypeInterfaceDescriptioninterface
BitSet<T>
An immutableBitSet
implementation.interface
IndexedSeq<T>
Interface for immutable, indexed sequences.interface
Iterator<T>
io.vavr.collection.Iterator
is a compositional replacement forjava.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 immutableList
is an eager sequence of elements.interface
Map<K,
V> An immutableMap
interface.interface
Multimap<K,
V> An immutableMultimap
interface.interface
Seq<T>
Interface for immutable sequential data structures.interface
Set<T>
An immutableSet
interface.interface
SortedMap<K,
V> An immutableSortedMap
interface.interface
SortedMultimap<K,
V> An immutableSortedMultimap
interface.interface
SortedSet<T>
An immutableSortedSet
interface.interface
Stream<T>
An immutableStream
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.Classes in io.vavr.collection that implement ValueModifier and TypeClassDescription(package private) class
Provides a commonObject.toString()
implementation.(package private) class
AbstractMultimap<K,
V, M extends Multimap<K, V>> AnMultimap
implementation (not intended to be public).(package private) class
AbstractQueue<T,
Q extends AbstractQueue<T, Q>> final class
Array<T>
Array is a Traversable wrapper forObject[]
containing elements of typeT
.static class
static class
static class
static class
static class
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 class
final class
HashMap<K,
V> An immutableHashMap
implementation based on a Hash array mapped trie (HAMT).final class
HashMultimap<K,
V> final class
HashSet<T>
An immutableHashSet
implementation.static final class
static final class
static final class
static final class
static final class
final class
LinkedHashMap<K,
V> An immutableLinkedHashMap
implementation that has predictable (insertion-order) iteration.final class
LinkedHashMultimap<K,
V> ALinkedHashMap
-based implementation ofMultimap
final class
An immutableHashSet
implementation that has predictable (insertion-order) iteration.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
A PriorityQueue.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
static final class
static final class
static final class
Tree.Empty<T>
The empty tree.static final class
Tree.Node<T>
Represents a tree node.final class
TreeMap<K,
V> SortedMap implementation, backed by a Red/Black Tree.final class
TreeMultimap<K,
V> final class
TreeSet<T>
SortedSet implementation, backed by a Red/Black Tree.final class
Vector<T>
Vector is the default Seq implementation that provides effectively constant time access to any element. -
Uses of Value in io.vavr.concurrent
Subinterfaces of Value in io.vavr.concurrentModifier and TypeInterfaceDescriptioninterface
Future<T>
A Future is a computation result that becomes available at some point.Classes in io.vavr.concurrent that implement ValueModifier and TypeClassDescription(package private) final class
FutureImpl<T>
INTERNAL API - This class is subject to change. -
Uses of Value in io.vavr.control
Subinterfaces of Value in io.vavr.controlModifier and TypeInterfaceDescriptioninterface
Either<L,
R> Either represents a value of two possible types.interface
Option<T>
Replacement forOptional
.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.Classes in io.vavr.control that implement ValueModifier and TypeClassDescriptionstatic final class
Either.Left<L,
R> TheLeft
version of anEither
.static final class
Deprecated.Either is right-biased.static final class
Either.Right<L,
R> TheRight
version of anEither
.static final class
Deprecated.Either is right-biased.static final class
Option.None<T>
None is a singleton representation of the undefinedOption
.static final class
Option.Some<T>
Some represents a definedOption
.static final class
Try.Failure<T>
A failed Try.static final class
Try.Success<T>
A succeeded Try.static final class
Validation.Invalid<E,
T> An invalid Validationstatic final class
Validation.Valid<E,
T> A valid Validation