Uses of Package
io.vavr.collection

Packages that use io.vavr.collection

Package	Description
io.vavr	Beside API the io.vavr package contains core types like (Checked)Functions and Tuples.
io.vavr.collection	Purely functional collections based on Traversable.
io.vavr.concurrent	This package contains basic building blocks for creating fast, asynchronous, non-blocking parallel code.
io.vavr.control	Control structures like the disjoint union type Either, the optional value type Option and Try for exception handling.

Classes in io.vavr.collection used by io.vavr

Class	Description
Array	Array is an immutable Traversable wrapper for Object[] containing elements of type T.
CharSeq	The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.
IndexedSeq	Represents an immutable, indexed sequence of elements.
Iterator	A compositional alternative to java.util.Iterator designed for single-pass traversal of a sequence.
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.
PriorityQueue	A PriorityQueue.
Queue	An immutable Queue stores elements allowing a first-in-first-out (FIFO) retrieval.
Seq	Base interface for immutable, sequential collections.
Set	An immutable Set interface.
SortedMap	An immutable SortedMap interface.
SortedSet	An immutable SortedSet interface.
Stream	An immutable Stream is lazy sequence of elements which may be infinitely long.
Traversable	Represents a recursive, multi-valued data structure whose elements can be traversed in order.
Tree	A general Tree interface.
Tree.Node	Represents a tree node.
Vector	Vector is the default Seq implementation that provides effectively constant time access to any element.

Classes in io.vavr.collection used by io.vavr.collection

Class	Description
AbstractIterator	Provides a common Object.toString() implementation.
AbstractMultimap	An abstract base implementation of the Multimap interface that provides common functionality for concrete Multimap implementations.
AbstractMultimap.SerializableSupplier
AbstractQueue
Array	Array is an immutable 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	Builder of the BitSet.
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	Represents a function that accepts a char-valued argument and produces a result.
CharSeq.CharUnaryOperator	Represents an operation on a single char-valued operand that produces a char-valued result.
Collections.IterableWithSize
Foldable	Represents a data structure that can be folded (reduced) into a single value.
GwtIncompatible
HashArrayMappedTrie	An immutable Hash array mapped trie (HAMT).
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	An immutable HashMap implementation based on a Hash array mapped trie (HAMT).
HashMultimap	A HashMap-based implementation of Multimap
HashMultimap.Builder	Builder for creating HashMultimap instances with different container types.
HashSet	An immutable HashSet implementation.
IndexedSeq	Represents an immutable, indexed sequence of elements.
Iterator	A compositional alternative to java.util.Iterator designed for single-pass traversal of a sequence.
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	A LinkedHashMap-based implementation of Multimap
LinkedHashMultimap.Builder	Builder class for creating LinkedHashMultimap instances.
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	Defines the type of container used to store values associated with keys in a Multimap.
NaturalComparator
NodeModifier
Ordered	A collection whose elements are arranged according to a well-defined order.
PriorityQueue	A PriorityQueue.
PriorityQueueBase.Node
Queue	An immutable Queue stores elements allowing a first-in-first-out (FIFO) retrieval.
RedBlackTree	Purely functional Red/Black Tree, inspired by Kazu Yamamoto's Haskell implementation.
RedBlackTree.Color
RedBlackTreeModule.Empty	The empty tree node.
RedBlackTreeModule.Node	A non-empty tree node.
Seq	Base interface for immutable, sequential collections.
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	Represents a recursive, multi-valued data structure whose elements can be traversed in order.
Tree	A general Tree interface.
Tree.Empty	The empty tree.
Tree.Node	Represents a tree node.
Tree.Order	Tree traversal order.
TreeMap	An immutable SortedMap implementation backed by a Red-Black tree.
TreeMap.EntryComparator
TreeMap.EntryComparator.Natural
TreeMultimap	A TreeMap-based implementation of Multimap
TreeMultimap.Builder	Builder class for creating TreeMultimap instances.
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.

Classes in io.vavr.collection used by io.vavr.concurrent

Class	Description
Iterator	A compositional alternative to java.util.Iterator designed for single-pass traversal of a sequence.
Queue	An immutable Queue stores elements allowing a first-in-first-out (FIFO) retrieval.
Seq	Base interface for immutable, sequential collections.

Classes in io.vavr.collection used by io.vavr.control

Class	Description
Iterator	A compositional alternative to java.util.Iterator designed for single-pass traversal of a sequence.
Seq	Base interface for immutable, sequential collections.