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 givenValueto its underlying value. -
Uses of Value in io.vavr.collection
Subinterfaces of Value in io.vavr.collectionModifier and TypeInterfaceDescriptioninterfaceBitSet<T>An immutableBitSetimplementation.interfaceIndexedSeq<T>Interface for immutable, indexed sequences.interfaceIterator<T>io.vavr.collection.Iteratoris a compositional replacement forjava.util.Iteratorwhose purpose is to iterate once over a sequence of elements.interfaceLinearSeq<T>Interface for immutable, linear sequences.interfaceList<T>An immutableListis an eager sequence of elements.interfaceMap<K,V> An immutableMapinterface.interfaceMultimap<K,V> An immutableMultimapinterface.interfaceSeq<T>Interface for immutable sequential data structures.interfaceSet<T>An immutableSetinterface.interfaceSortedMap<K,V> An immutableSortedMapinterface.interfaceSortedMultimap<K,V> An immutableSortedMultimapinterface.interfaceSortedSet<T>An immutableSortedSetinterface.interfaceStream<T>An immutableStreamis lazy sequence of elements which may be infinitely long.interfaceTraversable<T>An interface for inherently recursive, multi-valued data structures.interfaceTree<T>A general Tree interface.Classes in io.vavr.collection that implement ValueModifier and TypeClassDescriptionfinal classArray<T>Array is a Traversable wrapper forObject[]containing elements of typeT.final classThe CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.final classHashMap<K,V> An immutableHashMapimplementation based on a Hash array mapped trie (HAMT).final classHashMultimap<K,V> final classHashSet<T>An immutableHashSetimplementation.final classLinkedHashMap<K,V> An immutableLinkedHashMapimplementation that has predictable (insertion-order) iteration.final classLinkedHashMultimap<K,V> ALinkedHashMap-based implementation ofMultimapfinal classAn immutableHashSetimplementation that has predictable (insertion-order) iteration.static final classList.Cons<T>Non-emptyList, consisting of aheadand atail.static final classList.Nil<T>Representation of the singleton emptyList.final classA PriorityQueue.final classQueue<T>An immutableQueuestores elements allowing a first-in-first-out (FIFO) retrieval.static classStream.Cons<T>Non-emptyStream, consisting of ahead, andtail.static final classStream.Empty<T>The empty Stream.static final classTree.Empty<T>The empty tree.static final classTree.Node<T>Represents a tree node.final classTreeMap<K,V> SortedMap implementation, backed by a Red/Black Tree.final classTreeMultimap<K,V> final classTreeSet<T>SortedSet implementation, backed by a Red/Black Tree.final classVector<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 TypeInterfaceDescriptioninterfaceFuture<T>A Future is a computation result that becomes available at some point. -
Uses of Value in io.vavr.control
Subinterfaces of Value in io.vavr.controlModifier and TypeInterfaceDescriptioninterfaceEither<L,R> Either represents a value of two possible types.interfaceOption<T>Replacement forOptional.interfaceTry<T>The Try control gives us the ability write safe code without focusing on try-catch blocks in the presence of exceptions.interfaceValidation<E,T> An implementation similar to scalaz's Validation control.Classes in io.vavr.control that implement ValueModifier and TypeClassDescriptionstatic final classEither.Left<L,R> TheLeftversion of anEither.static final classDeprecated.Either is right-biased.static final classEither.Right<L,R> TheRightversion of anEither.static final classDeprecated.Either is right-biased.static final classOption.None<T>None is a singleton representation of the undefinedOption.static final classOption.Some<T>Some represents a definedOption.static final classTry.Failure<T>A failed Try.static final classTry.Success<T>A succeeded Try.static final classValidation.Invalid<E,T> An invalid Validationstatic final classValidation.Valid<E,T> A valid Validation