Package io.vavr.collection

package io.vavr.collection

Purely functional collections based on Traversable.

Performance Characteristics of Vavr Collections

Time Complexity of Sequential Operations

	head()	tail()	get(int)	update(int, T)	prepend(T)	append(T)
Array	const	linear	const	linear	linear	linear
CharSeq	const	linear	const	linear	linear	linear
Iterator	const	const	—	—	—	—
List	const	const	linear	linear	const	linear
Queue	const	consta	linear	linear	const	const
PriorityQueue	log	log	—	—	log	log
Stream	const	const	linear	linear	constlazy	constlazy
Vector	consteff	consteff	consteff	consteff	consteff	consteff

Time Complexity of Map/Set Operations

	contains/Key	add/put	remove	min
HashMap	consteff	consteff	consteff	linear
HashSet	consteff	consteff	consteff	linear
LinkedHashMap	consteff	linear	linear	linear
LinkedHashSet	consteff	linear	linear	linear
Tree	log	log	log	log
TreeMap	log	log	log	log
TreeSet	log	log	log	log

• const · constant time
• const^a · amortized constant time, few operations may take longer
• const^eff · effectively constant time, depending on assumptions like distribution of hash keys
• const^lazy · lazy constant time, the operation is deferred
• log · logarithmic time
• linear · linear time

Related Packages

Package	Description
io.vavr	Beside API the io.vavr package contains core types like (Checked)Functions and Tuples.
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.

Class	Description
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
Foldable<T>	Interface of foldable data structures.
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.
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.
Multimap<K,V>	An immutable Multimap interface.
Multimap.ContainerType
Ordered<T>	An ordered collection interface.
PriorityQueue<T>	A PriorityQueue.
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.
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.
Vector<T>	Vector is the default Seq implementation that provides effectively constant time access to any element.