Uses of Package
io.vavr.collection
Packages that use io.vavr.collection
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.
A property check framework built around Property which integrates well with unit test frameworks like junit.
-
Classes in io.vavr.collection used by io.vavrClassDescriptionArray is a Traversable wrapper for
Object[]
containing elements of typeT
.The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.Interface for immutable, indexed sequences.io.vavr.collection.Iterator
is a compositional replacement forjava.util.Iterator
whose purpose is to iterate once over a sequence of elements.An immutableList
is an eager sequence of elements.Non-emptyList
, consisting of ahead
and atail
.Representation of the singleton emptyList
.An immutableMap
interface.A PriorityQueue.An immutableQueue
stores elements allowing a first-in-first-out (FIFO) retrieval.Interface for immutable sequential data structures.An immutableSet
interface.An immutableSortedMap
interface.An immutableSortedSet
interface.An immutableStream
is lazy sequence of elements which may be infinitely long.An interface for inherently recursive, multi-valued data structures.A general Tree interface.Represents a tree node.Vector is the default Seq implementation that provides effectively constant time access to any element. -
Classes in io.vavr.collection used by io.vavr.collectionClassDescriptionProvides a common
Object.toString()
implementation.AnMultimap
implementation (not intended to be public).Array is a Traversable wrapper forObject[]
containing elements of typeT
.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 immutableBitSet
implementation.The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.Interface of foldable data structures.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.Representation of a HAMT leaf node with single element.An immutableHashMap
implementation based on a Hash array mapped trie (HAMT).An immutableHashSet
implementation.Interface for immutable, indexed sequences.io.vavr.collection.Iterator
is a compositional replacement forjava.util.Iterator
whose purpose is to iterate once over a sequence of elements.Encapsulates the access to delegate and performs mutability checks.Interface for immutable, linear sequences.An immutableLinkedHashMap
implementation that has predictable (insertion-order) iteration.ALinkedHashMap
-based implementation ofMultimap
An immutableHashSet
implementation that has predictable (insertion-order) iteration.An immutableList
is an eager sequence of elements.Non-emptyList
, consisting of ahead
and atail
.Representation of the singleton emptyList
.An immutableMap
interface.An immutableMultimap
interface.An ordered collection interface.A PriorityQueue.An immutableQueue
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 immutableSet
interface.An immutableSortedMap
interface.An immutableSortedMultimap
interface.An immutableSortedSet
interface.An immutableStream
is lazy sequence of elements which may be infinitely long.Non-emptyStream
, consisting of ahead
, andtail
.The empty Stream.An interface for inherently recursive, multi-valued data structures.A general Tree interface.The empty tree.Represents a tree node.Tree traversal order.SortedMap implementation, backed by a Red/Black Tree.SortedSet implementation, backed by a Red/Black Tree.Vector is the default Seq implementation that provides effectively constant time access to any element. -
Classes in io.vavr.collection used by io.vavr.concurrentClassDescription
io.vavr.collection.Iterator
is a compositional replacement forjava.util.Iterator
whose purpose is to iterate once over a sequence of elements.An immutableQueue
stores elements allowing a first-in-first-out (FIFO) retrieval.Interface for immutable sequential data structures. -
Classes in io.vavr.collection used by io.vavr.control
-
Classes in io.vavr.collection used by io.vavr.test