All Classes and Interfaces

Class	Description
API	The most basic Vavr functionality is accessed through this API class.
API.For1<T1>	For-comprehension with one Iterable.
API.For1Future<T1>	For-comprehension with one Future.
API.For1List<T1>	For-comprehension with one List.
API.For1Option<T1>	For-comprehension with one Option.
API.For1Try<T1>	For-comprehension with one Try.
API.For2<T1,T2>	For-comprehension with two Iterables.
API.For2Future<T1,T2>	For-comprehension with two Futures.
API.For2List<T1,T2>	For-comprehension with two Lists.
API.For2Option<T1,T2>	For-comprehension with two Options.
API.For2Try<T1,T2>	For-comprehension with two Trys.
API.For3<T1,T2,T3>	For-comprehension with three Iterables.
API.For3Future<T1,T2,T3>	For-comprehension with three Futures.
API.For3List<T1,T2,T3>	For-comprehension with three Lists.
API.For3Option<T1,T2,T3>	For-comprehension with three Options.
API.For3Try<T1,T2,T3>	For-comprehension with three Trys.
API.For4<T1,T2,T3,T4>	For-comprehension with 4 Iterables.
API.For4Future<T1,T2,T3,T4>	For-comprehension with 4 Futures.
API.For4List<T1,T2,T3,T4>	For-comprehension with 4 Lists.
API.For4Option<T1,T2,T3,T4>	For-comprehension with 4 Options.
API.For4Try<T1,T2,T3,T4>	For-comprehension with 4 Trys.
API.For5<T1,T2,T3,T4,T5>	For-comprehension with 5 Iterables.
API.For5Future<T1,T2,T3,T4,T5>	For-comprehension with 5 Futures.
API.For5List<T1,T2,T3,T4,T5>	For-comprehension with 5 Lists.
API.For5Option<T1,T2,T3,T4,T5>	For-comprehension with 5 Options.
API.For5Try<T1,T2,T3,T4,T5>	For-comprehension with 5 Trys.
API.For6<T1,T2,T3,T4,T5,T6>	For-comprehension with 6 Iterables.
API.For6Future<T1,T2,T3,T4,T5,T6>	For-comprehension with 6 Futures.
API.For6List<T1,T2,T3,T4,T5,T6>	For-comprehension with 6 Lists.
API.For6Option<T1,T2,T3,T4,T5,T6>	For-comprehension with 6 Options.
API.For6Try<T1,T2,T3,T4,T5,T6>	For-comprehension with 6 Trys.
API.For7<T1,T2,T3,T4,T5,T6,T7>	For-comprehension with 7 Iterables.
API.For7Future<T1,T2,T3,T4,T5,T6,T7>	For-comprehension with 7 Futures.
API.For7List<T1,T2,T3,T4,T5,T6,T7>	For-comprehension with 7 Lists.
API.For7Option<T1,T2,T3,T4,T5,T6,T7>	For-comprehension with 7 Options.
API.For7Try<T1,T2,T3,T4,T5,T6,T7>	For-comprehension with 7 Trys.
API.For8<T1,T2,T3,T4,T5,T6,T7,T8>	For-comprehension with 8 Iterables.
API.For8Future<T1,T2,T3,T4,T5,T6,T7,T8>	For-comprehension with 8 Futures.
API.For8List<T1,T2,T3,T4,T5,T6,T7,T8>	For-comprehension with 8 Lists.
API.For8Option<T1,T2,T3,T4,T5,T6,T7,T8>	For-comprehension with 8 Options.
API.For8Try<T1,T2,T3,T4,T5,T6,T7,T8>	For-comprehension with 8 Trys.
API.Match<T>	Scala-like structural pattern matching for Java.
API.Match.Case<T,R>
API.Match.Case0<T,R>
API.Match.Case1<T,T1,R>
API.Match.Case2<T,T1,T2,R>
API.Match.Case3<T,T1,T2,T3,R>
API.Match.Case4<T,T1,T2,T3,T4,R>
API.Match.Case5<T,T1,T2,T3,T4,T5,R>
API.Match.Case6<T,T1,T2,T3,T4,T5,T6,R>
API.Match.Case7<T,T1,T2,T3,T4,T5,T6,T7,R>
API.Match.Case8<T,T1,T2,T3,T4,T5,T6,T7,T8,R>
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>.
API.Match.Pattern0<T>
API.Match.Pattern1<T,T1>
API.Match.Pattern2<T,T1,T2>
API.Match.Pattern3<T,T1,T2,T3>
API.Match.Pattern4<T,T1,T2,T3,T4>
API.Match.Pattern5<T,T1,T2,T3,T4,T5>
API.Match.Pattern6<T,T1,T2,T3,T4,T5,T6>
API.Match.Pattern7<T,T1,T2,T3,T4,T5,T6,T7>
API.Match.Pattern8<T,T1,T2,T3,T4,T5,T6,T7,T8>
Array<T>	Array is a Traversable wrapper for Object[] containing elements of type T.
BitSet<T>	An immutable BitSet implementation.
BitSet.Builder<T>
CharSeq	The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.
CharSeq.CharFunction<R>
CharSeq.CharUnaryOperator
CheckedConsumer<T>	A consumer that may throw, equivalent to Consumer.
CheckedFunction0<R>	Represents a function with no arguments.
CheckedFunction1<T1,R>	Represents a function with one argument.
CheckedFunction2<T1,T2,R>	Represents a function with two arguments.
CheckedFunction3<T1,T2,T3,R>	Represents a function with three arguments.
CheckedFunction4<T1,T2,T3,T4,R>	Represents a function with 4 arguments.
CheckedFunction5<T1,T2,T3,T4,T5,R>	Represents a function with 5 arguments.
CheckedFunction6<T1,T2,T3,T4,T5,T6,R>	Represents a function with 6 arguments.
CheckedFunction7<T1,T2,T3,T4,T5,T6,T7,R>	Represents a function with 7 arguments.
CheckedFunction8<T1,T2,T3,T4,T5,T6,T7,T8,R>	Represents a function with 8 arguments.
CheckedPredicate<T>	A Predicate which may throw.
CheckedRunnable	A Runnable which may throw.
Either<L,R>	Either represents a value of two possible types.
Either.Left<L,R>	The Left version of an Either.
Either.LeftProjection<L,R>	Deprecated. Either is right-biased.
Either.Right<L,R>	The Right version of an Either.
Either.RightProjection<L,R>	Deprecated. Either is right-biased.
Foldable<T>	Interface of foldable data structures.
Function0<R>	Represents a function with no arguments.
Function1<T1,R>	Represents a function with one argument.
Function2<T1,T2,R>	Represents a function with two arguments.
Function3<T1,T2,T3,R>	Represents a function with three arguments.
Function4<T1,T2,T3,T4,R>	Represents a function with 4 arguments.
Function5<T1,T2,T3,T4,T5,R>	Represents a function with 5 arguments.
Function6<T1,T2,T3,T4,T5,T6,R>	Represents a function with 6 arguments.
Function7<T1,T2,T3,T4,T5,T6,T7,R>	Represents a function with 7 arguments.
Function8<T1,T2,T3,T4,T5,T6,T7,T8,R>	Represents a function with 8 arguments.
Future<T>	A Future is a computation result that becomes available at some point.
HashCodes	Deprecated. Will be removed from public API
HashMap<K,V>	An immutable HashMap implementation based on a Hash array mapped trie (HAMT).
HashMultimap<K,V>	A HashMap-based implementation of Multimap
HashMultimap.Builder<V>
HashSet<T>	An immutable HashSet implementation.
IndexedSeq<T>	Interface for immutable, indexed sequences.
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.
Lazy<T>	Represents a lazy evaluated value.
LinearSeq<T>	Interface for immutable, linear sequences.
LinkedHashMap<K,V>	An immutable LinkedHashMap implementation that has predictable (insertion-order) iteration.
LinkedHashMultimap<K,V>	A LinkedHashMap-based implementation of Multimap
LinkedHashMultimap.Builder<V>
LinkedHashSet<T>	An immutable HashSet implementation that has predictable (insertion-order) iteration.
List<T>	An immutable List is an eager sequence of elements.
List.Cons<T>	Non-empty List, consisting of a head and a tail.
List.Nil<T>	Representation of the singleton empty List.
Map<K,V>	An immutable Map interface.
MatchError	A API.Match throws a MatchError if no case matches the applied object.
Multimap<K,V>	An immutable Multimap interface.
Multimap.ContainerType
NotImplementedError	This exception is temporarily used during development in order to indicate that an implementation is missing.
Option<T>	Replacement for Optional.
Option.None<T>	None is a singleton representation of the undefined Option.
Option.Some<T>	Some represents a defined Option.
Ordered<T>	An ordered collection interface.
PartialFunction<T,R>	Represents a partial function T -> R that is not necessarily defined for all input values of type T.
Patterns
Predicates	Defines general-purpose predicates which are particularly useful when working with API.Match.
PriorityQueue<T>	A PriorityQueue.
Promise<T>	A Promise is a write-once wrapper around a read-only Future which can complete the underlying Future with a value or an exception.
Queue<T>	An immutable Queue stores elements allowing a first-in-first-out (FIFO) retrieval.
Seq<T>	Interface for immutable sequential data structures.
Set<T>	An immutable Set interface.
SortedMap<K,V>	An immutable SortedMap interface.
SortedMultimap<K,V>	An immutable SortedMultimap interface.
SortedSet<T>	An immutable SortedSet interface.
Stream<T>	An immutable Stream is lazy sequence of elements which may be infinitely long.
Stream.Cons<T>	Non-empty Stream, consisting of a head, and tail.
Stream.Empty<T>	The empty Stream.
Task<T>	Deprecated. Experimental API
Task.Complete<T>	Completes a task.
Traversable<T>	An interface for inherently recursive, multi-valued data structures.
Tree<T>	A general Tree interface.
Tree.Empty<T>	The empty tree.
Tree.Node<T>	Represents a tree node.
Tree.Order	Tree traversal order.
TreeMap<K,V>	SortedMap implementation, backed by a Red/Black Tree.
TreeMultimap<K,V>	A TreeMap-based implementation of Multimap
TreeMultimap.Builder<V>
TreeSet<T>	SortedSet implementation, backed by a Red/Black Tree.
Try<T>	The Try control gives us the ability write safe code without focusing on try-catch blocks in the presence of exceptions.
Try.Failure<T>	A failed Try.
Try.Success<T>	A succeeded Try.
Try.WithResources1<T1>	A Try-with-resources builder that operates on one AutoCloseable resource.
Try.WithResources2<T1,T2>	A Try-with-resources builder that operates on two AutoCloseable resources.
Try.WithResources3<T1,T2,T3>	A Try-with-resources builder that operates on three AutoCloseable resources.
Try.WithResources4<T1,T2,T3,T4>	A Try-with-resources builder that operates on four AutoCloseable resources.
Try.WithResources5<T1,T2,T3,T4,T5>	A Try-with-resources builder that operates on five AutoCloseable resources.
Try.WithResources6<T1,T2,T3,T4,T5,T6>	A Try-with-resources builder that operates on six AutoCloseable resources.
Try.WithResources7<T1,T2,T3,T4,T5,T6,T7>	A Try-with-resources builder that operates on seven AutoCloseable resources.
Try.WithResources8<T1,T2,T3,T4,T5,T6,T7,T8>	A Try-with-resources builder that operates on eight AutoCloseable resources.
Tuple	The base interface of all tuples.
Tuple0	A tuple of no elements which can be seen as cartesian product of no components.
Tuple1<T1>	A tuple of one element which can be seen as cartesian product of one component.
Tuple2<T1,T2>	A tuple of two elements which can be seen as cartesian product of two components.
Tuple3<T1,T2,T3>	A tuple of three elements which can be seen as cartesian product of three components.
Tuple4<T1,T2,T3,T4>	A tuple of 4 elements which can be seen as cartesian product of 4 components.
Tuple5<T1,T2,T3,T4,T5>	A tuple of 5 elements which can be seen as cartesian product of 5 components.
Tuple6<T1,T2,T3,T4,T5,T6>	A tuple of 6 elements which can be seen as cartesian product of 6 components.
Tuple7<T1,T2,T3,T4,T5,T6,T7>	A tuple of 7 elements which can be seen as cartesian product of 7 components.
Tuple8<T1,T2,T3,T4,T5,T6,T7,T8>	A tuple of 8 elements which can be seen as cartesian product of 8 components.
Validation<E,T>	An implementation similar to scalaz's Validation control.
Validation.Builder<E,T1,T2>
Validation.Builder3<E,T1,T2,T3>
Validation.Builder4<E,T1,T2,T3,T4>
Validation.Builder5<E,T1,T2,T3,T4,T5>
Validation.Builder6<E,T1,T2,T3,T4,T5,T6>
Validation.Builder7<E,T1,T2,T3,T4,T5,T6,T7>
Validation.Builder8<E,T1,T2,T3,T4,T5,T6,T7,T8>
Validation.Invalid<E,T>	An invalid Validation
Validation.Valid<E,T>	A valid Validation
Value<T>	Functional programming is all about values and transformation of values using functions.
Vector<T>	Vector is the default Seq implementation that provides effectively constant time access to any element.