quiver.collection library
Collection classes and related utilities.
Classes

AvlNode<
V>  Private class used to track element insertions in the TreeSet.

AvlTreeSet<
V>  AVL implementation of a selfbalancing binary tree. Optimized for lookup operations. [...]

BiMap<
K, V> 
A bidirectional map whose keyvalue pairs form a onetoone
correspondence. BiMaps support an
inverse
property which gives access to an inverted view of the map, such that there is a mapping (v, k) for each pair (k, v) in the original map. Since a onetoone keyvalue invariant applies, it is an error to insert duplicate values into this map. It is also an error to insert null keys or values into this map. 
DelegatingIterable<
E> 
An implementation of
Iterable
that delegates all methods to anotherIterable
. For instance you can create a FruitIterable like this : [...] 
DelegatingList<
E> 
An implementation of
List
that delegates all methods to anotherList
. For instance you can create a FruitList like this : [...] 
DelegatingMap<
K, V> 
An implementation of
Map
that delegates all methods to anotherMap
. For instance you can create a FruitMap like this : [...] 
DelegatingQueue<
E> 
An implementation of
Queue
that delegates all methods to anotherQueue
. For instance you can create a FruitQueue like this : [...] 
DelegatingSet<
E> 
An implementation of
Set
that delegates all methods to anotherSet
. For instance you can create a FruitSet like this : [...] 
HashBiMap<
K, V>  A hashtable based implementation of BiMap.

LinkedLruHashMap<
K, V>  A linked hashtable based implementation of LruMap.

ListMultimap<
K, V> 
A multimap implementation that uses
List
s to store the values associated with each key. 
LruMap<
K, V> 
An implementation of a
Map
which has a maximum size and uses a Least Recently Used algorithm to remove items from theMap
when the maximumSize is reached and new items are added. [...] 
Multimap<
K, V>  An associative container that maps a key to multiple values. [...]

SetMultimap<
K, V> 
A multimap implementation that uses
Set
s to store the values associated with each key. 
TreeSet<
V> 
A
Set
of items stored in a binary tree according to comparator. Supports bidirectional iteration.
Functions

indexOf<
T> (Iterable< T> elements, bool predicate(T element)) → int 
Returns the index of the first item in
elements
wherepredicate
evaluates to true. [...] 
listsEqual(
List a, List b) → bool 
Checks
List
sa
andb
for equality. [...] 
mapsEqual(
Map a, Map b) → bool 
Checks
Map
sa
andb
for equality. [...] 
setsEqual(
Set a, Set b) → bool 
Checks
Set
sa
andb
for equality. [...]
Enums
 TreeSearch
 Controls the results for TreeSet.searchNearest