All Classes and Interfaces
Class
Description
INTERNAL TYPE - turned to io.vavr.Patterns by vavr-match annotation processor.
Provides a common
Object.toString() implementation.An
Multimap implementation (not intended to be public).The most basic Vavr functionality is accessed through this API class.
For-comprehension with one Iterable.
For-comprehension with one Future.
For-comprehension with one List.
For-comprehension with one Option.
For-comprehension with one Try.
For-comprehension with two Iterables.
For-comprehension with two Futures.
For-comprehension with two Lists.
For-comprehension with two Options.
For-comprehension with two Trys.
For-comprehension with three Iterables.
For-comprehension with three Futures.
For-comprehension with three Lists.
For-comprehension with three Options.
For-comprehension with three Trys.
For-comprehension with 4 Iterables.
For-comprehension with 4 Futures.
For-comprehension with 4 Lists.
For-comprehension with 4 Options.
For-comprehension with 4 Trys.
For-comprehension with 5 Iterables.
For-comprehension with 5 Futures.
For-comprehension with 5 Lists.
For-comprehension with 5 Options.
For-comprehension with 5 Trys.
For-comprehension with 6 Iterables.
For-comprehension with 6 Futures.
For-comprehension with 6 Lists.
For-comprehension with 6 Options.
For-comprehension with 6 Trys.
For-comprehension with 7 Iterables.
For-comprehension with 7 Futures.
For-comprehension with 7 Lists.
For-comprehension with 7 Options.
For-comprehension with 7 Trys.
For-comprehension with 8 Iterables.
For-comprehension with 8 Futures.
For-comprehension with 8 Lists.
For-comprehension with 8 Options.
For-comprehension with 8 Trys.
Scala-like structural pattern matching for Java.
A Pattern is a partial
Function in the sense that a function applications returns an
optional result of type Option<R>.Represents an arbitrary object of type T.
Array is a Traversable wrapper for
Object[] containing elements of type T.Helper to replace reflective array access.
A `bit-mapped trie` is a very wide and shallow tree (for integer indices the depth will be `≤6`).
An immutable
BitSet implementation.The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations
we know from the functional Vavr collections.
Interface for checkable properties, allowing composition via Checkable.and(Checkable) and Checkable.or(Checkable).
A consumer that may throw, equivalent to Consumer.
Represents a function with no arguments.
Represents a function with one argument.
Represents a function with two arguments.
Represents a function with three arguments.
Represents a function with 4 arguments.
Represents a function with 5 arguments.
Represents a function with 6 arguments.
Represents a function with 7 arguments.
Represents a function with 8 arguments.
A Predicate which may throw.
A Runnable which may throw.
Represents the result of a property check which is
Satisfied, if all tests satisfied the given property
Falsified, if a counter-example could be discovered that falsified the given property
Erroneous, if an exception occurred executing the property check
Please note that a Satisfied property check may be Exhausted, if the property is an implication
and no sample could be found that satisfied the pre-condition.Represents an erroneous property check.
Represents a falsified property check.
Represents a satisfied property check.
Representation of a class.
Internal class, containing helpers.
INTERNAL: Common
Comparator related functions (not intended to be public).Either represents a value of two possible types.
The
Left version of an Either.Deprecated.
Either is right-biased.
The
Right version of an Either.Deprecated.
Either is right-biased.
Interface of foldable data structures.
Represents a function with no arguments.
Represents a function with one argument.
Represents a function with two arguments.
Represents a function with three arguments.
Represents a function with 4 arguments.
Represents a function with 5 arguments.
Represents a function with 6 arguments.
Represents a function with 7 arguments.
Represents a function with 8 arguments.
A Future is a computation result that becomes available at some point.
INTERNAL API - This class is subject to change.
Generators are the building blocks for providing arbitrary objects.
Code generator for structural pattern matching patterns.
An immutable Hash array mapped trie (HAMT).
An abstract base class for nodes of a HAMT.
Representation of a HAMT array node.
The empty node.
Representation of a HAMT indexed node.
Representation of a HAMT leaf node with more than one element.
Representation of a HAMT leaf.
Representation of a HAMT leaf node with single element.
Deprecated.
Will be removed from public API
An immutable
HashMap implementation based on a
Hash array mapped trie (HAMT).An immutable
HashSet implementation.A serialization proxy which, in this context, is used to deserialize immutable, linked Lists with final
instance fields.
A stateful ImportManager which generates an import section of a Java class file.
Interface for immutable, indexed sequences.
io.vavr.collection.Iterator is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements.THIS CLASS IS INTENDED TO BE USED INTERNALLY ONLY!
Encapsulates the access to delegate and performs mutability checks.
Represents a lazy evaluated value.
Interface for immutable, linear sequences.
An immutable
LinkedHashMap implementation that has predictable (insertion-order) iteration.A
LinkedHashMap-based implementation of MultimapAn immutable
HashSet implementation that has predictable (insertion-order) iteration.A serialization proxy which, in this context, is used to deserialize immutable, linked Lists with final
instance fields.
An immutable
List is an eager sequence of elements.Non-empty
List, consisting of a head and a tail.A serialization proxy which, in this context, is used to deserialize immutable, linked Lists with final
instance fields.
Representation of the singleton empty
List.An immutable
Map interface.INTERNAL: Common
Map functions (not intended to be public).A
API.Match throws a MatchError if no case matches the applied object.INTERNAL.
Representation of a method.
An immutable
Multimap interface.INTERNAL: Common
Multimap functions (not intended to be public).This exception is temporarily used during development in order to indicate that an implementation is missing.
Replacement for
Optional.None is a singleton representation of the undefined
Option.Some represents a defined
Option.An ordered collection interface.
Representation of a method parameter.
Represents a partial function T -> R that is not necessarily defined for all input values of type T.
Structural pattern matching annotation for pattern declarations.
A code generator for Vavr structural pattern matching patterns.
Defines general-purpose predicates which are particularly useful when working with
API.Match.A PriorityQueue.
A Promise is a write-once wrapper around a read-only Future which can complete the underlying Future with a value
or an exception.
Internal
Promise implementation.A property builder which provides a fluent API to build checkable properties.
Internally used to provide more specific error messages.
Internally used to model conditions composed of pre- and post-condition.
Represents a logical for all quantor.
Represents a logical for all quantor.
Represents a logical for all quantor.
Represents a logical for all quantor.
Represents a logical for all quantor.
Represents a logical for all quantor.
Represents a logical for all quantor.
Represents a logical for all quantor.
Represents a 1-ary checkable property.
Represents a 2-ary checkable property.
Represents a 3-ary checkable property.
Represents a 4-ary checkable property.
Represents a 5-ary checkable property.
Represents a 6-ary checkable property.
Represents a 7-ary checkable property.
Represents a 8-ary checkable property.
An immutable
Queue stores elements allowing a first-in-first-out (FIFO) retrieval.Purely functional Red/Black Tree, inspired by Kazu Yamamoto's Haskell implementation.
The empty tree node.
A non-empty tree node.
Interface for immutable sequential data structures.
An immutable
Set interface.An immutable
SortedMap interface.An immutable
SortedMultimap interface.An immutable
SortedSet interface.An immutable
Stream is lazy sequence of elements which may be infinitely long.Non-empty
Stream, consisting of a head, and tail.The empty Stream.
A serialization proxy which, in this context, is used to deserialize immutable, linked Streams with final
instance fields.
Deprecated.
Experimental API
Completes a task.
An interface for inherently recursive, multi-valued data structures.
A general Tree interface.
The empty tree.
Represents a tree node.
A serialization proxy which, in this context, is used to deserialize immutable nodes with final
instance fields.
Tree traversal order.
SortedMap implementation, backed by a Red/Black Tree.
Because the empty tree
Empty cannot be a child of an existing tree, method implementations distinguish between the
empty and non-empty case.SortedSet implementation, backed by a Red/Black Tree.
The Try control gives us the ability write safe code without focusing on try-catch blocks in the presence of exceptions.
A failed Try.
A succeeded Try.
A
Try-with-resources builder that operates on one AutoCloseable resource.A
Try-with-resources builder that operates on two AutoCloseable resources.A
Try-with-resources builder that operates on three AutoCloseable resources.A
Try-with-resources builder that operates on four AutoCloseable resources.A
Try-with-resources builder that operates on five AutoCloseable resources.A
Try-with-resources builder that operates on six AutoCloseable resources.A
Try-with-resources builder that operates on seven AutoCloseable resources.A
Try-with-resources builder that operates on eight AutoCloseable resources.The base interface of all tuples.
A tuple of no elements which can be seen as cartesian product of no components.
A tuple of one element which can be seen as cartesian product of one component.
A tuple of two elements which can be seen as cartesian product of two components.
A tuple of three elements which can be seen as cartesian product of three components.
A tuple of 4 elements which can be seen as cartesian product of 4 components.
A tuple of 5 elements which can be seen as cartesian product of 5 components.
A tuple of 6 elements which can be seen as cartesian product of 6 components.
A tuple of 7 elements which can be seen as cartesian product of 7 components.
A tuple of 8 elements which can be seen as cartesian product of 8 components.
Representation of a generic type parameter.
Structural pattern matching annotation for unapply methods.
Checks if an
ExecutableElement is a valid @Unapply method.An implementation similar to scalaz's Validation control.
An invalid Validation
A valid Validation
Functional programming is all about values and transformation of values using functions.
Vector is the default Seq implementation that provides effectively constant time access to any element.