AbstractIterator |
Provides a common Object.toString() implementation.
|
AbstractMultimap |
An Multimap implementation (not intended to be public).
|
AbstractMultimap.SerializableSupplier |
|
AbstractQueue |
|
Array |
Array is a Traversable wrapper for Object[] containing elements of type T .
|
ArrayType |
Helper to replace reflective array access.
|
ArrayType.BooleanArrayType |
|
ArrayType.ByteArrayType |
|
ArrayType.CharArrayType |
|
ArrayType.DoubleArrayType |
|
ArrayType.FloatArrayType |
|
ArrayType.IntArrayType |
|
ArrayType.LongArrayType |
|
ArrayType.ObjectArrayType |
|
ArrayType.ShortArrayType |
|
BitMappedTrie |
A `bit-mapped trie` is a very wide and shallow tree (for integer indices the depth will be `≤6`).
|
BitSet |
An immutable BitSet implementation.
|
BitSet.Builder |
|
BitSetModule.AbstractBitSet |
|
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 |
|
CharSeq.CharUnaryOperator |
|
Collections.IterableWithSize |
|
Foldable |
Interface of foldable data structures.
|
GwtIncompatible |
|
HashArrayMappedTrie |
|
HashArrayMappedTrieModule.AbstractNode |
An abstract base class for nodes of a HAMT.
|
HashArrayMappedTrieModule.Action |
|
HashArrayMappedTrieModule.ArrayNode |
Representation of a HAMT array node.
|
HashArrayMappedTrieModule.EmptyNode |
The empty node.
|
HashArrayMappedTrieModule.IndexedNode |
Representation of a HAMT indexed node.
|
HashArrayMappedTrieModule.LeafNode |
Representation of a HAMT leaf.
|
HashArrayMappedTrieModule.LeafSingleton |
Representation of a HAMT leaf node with single element.
|
HashMap |
|
HashMultimap |
|
HashMultimap.Builder |
|
HashSet |
An immutable HashSet implementation.
|
IndexedSeq |
Interface for immutable, indexed sequences.
|
Iterator |
io.vavr.collection.Iterator is a compositional replacement for java.util.Iterator
whose purpose is to iterate once over a sequence of elements.
|
IteratorModule.ConcatIterator.Cell |
|
IteratorModule.EmptyIterator |
|
JavaConverters.ChangePolicy |
|
JavaConverters.HasDelegate |
Encapsulates the access to delegate and performs mutability checks.
|
JavaConverters.ListView |
|
JavaConverters.ListView.Iterator |
|
LeafVisitor |
|
LinearSeq |
Interface for immutable, linear sequences.
|
LinkedHashMap |
An immutable LinkedHashMap implementation that has predictable (insertion-order) iteration.
|
LinkedHashMultimap |
|
LinkedHashMultimap.Builder |
|
LinkedHashSet |
An immutable HashSet implementation that has predictable (insertion-order) iteration.
|
List |
An immutable List is an eager sequence of elements.
|
List.Cons |
Non-empty List , consisting of a head and a tail .
|
List.Nil |
Representation of the singleton empty List .
|
Map |
An immutable Map interface.
|
Maps.OfEntries |
|
Multimap |
An immutable Multimap interface.
|
Multimap.ContainerType |
|
NaturalComparator |
|
NodeModifier |
|
Ordered |
An ordered collection interface.
|
PriorityQueue |
A PriorityQueue.
|
PriorityQueueBase.Node |
|
Queue |
An immutable Queue stores elements allowing a first-in-first-out (FIFO) retrieval.
|
RedBlackTree |
|
RedBlackTree.Color |
|
RedBlackTreeModule.Empty |
The empty tree node.
|
RedBlackTreeModule.Node |
A non-empty tree node.
|
Seq |
Interface for immutable sequential data structures.
|
Set |
An immutable Set interface.
|
SortedMap |
An immutable SortedMap interface.
|
SortedMultimap |
An immutable SortedMultimap interface.
|
SortedSet |
An immutable SortedSet interface.
|
Stream |
An immutable Stream is lazy sequence of elements which may be infinitely long.
|
Stream.Cons |
Non-empty Stream , consisting of a head , and tail .
|
Stream.Empty |
The empty Stream.
|
Traversable |
An interface for inherently recursive, multi-valued data structures.
|
Tree |
A general Tree interface.
|
Tree.Empty |
The empty tree.
|
Tree.Node |
Represents a tree node.
|
Tree.Order |
Tree traversal order.
|
TreeMap |
SortedMap implementation, backed by a Red/Black Tree.
|
TreeMap.EntryComparator |
|
TreeMap.EntryComparator.Natural |
|
TreeMultimap |
|
TreeMultimap.Builder |
|
TreeSet |
SortedSet implementation, backed by a Red/Black Tree.
|
Vector |
Vector is the default Seq implementation that provides effectively constant time access to any element.
|