Uses of Interface
org.javimmutable.collections.InvariantCheckable
Package
Description
-
Uses of InvariantCheckable in org.javimmutable.collections
Modifier and TypeInterfaceDescriptioninterface
IArray<T>
Immutable sparse array implementation using integers as keys.interface
IDeque<T>
Interface for containers that store items in list form with individual items available for get() and assign() using their indexes.interface
IList<T>
Interface for containers that store items in list form with individual items available for get() and assign() using their indexes.interface
IListMap<K,
V> Interface for maps that map keys to lists of values.interface
IMap<K,
V> Interface for immutable data structures that allow storage and retrieval of key/value pairs.interface
IMultiset<T>
Keeps a set of distinct values, as well as the count corresponding to each value.interface
ISet<T>
Interface for immutable sets.interface
ISetMap<K,
V> Interface for maps that map keys to sets of values. -
Uses of InvariantCheckable in org.javimmutable.collections.array
-
Uses of InvariantCheckable in org.javimmutable.collections.common
-
Uses of InvariantCheckable in org.javimmutable.collections.deque
Modifier and TypeClassDescriptionclass
ArrayDeque<T>
IDeque implementation using 32-way trees.static class
-
Uses of InvariantCheckable in org.javimmutable.collections.hash
Modifier and TypeClassDescriptionclass
EmptyHashMap<K,
V> Singleton implementation ofIMap
that contains no elements.class
EmptyHashSet<T>
class
HashMap<T,
K, V> class
HashMultiset<T>
class
HashSet<T>
-
Uses of InvariantCheckable in org.javimmutable.collections.inorder
Modifier and TypeClassDescriptionclass
OrderedMap<K,
V> IMap
implementation that allows iteration over members in the order in which they were inserted into the map.class
IMultiset
implementation built on top of an ordered map.class
OrderedSet<T>
ISet
implementation built on top of an ordered set. -
Uses of InvariantCheckable in org.javimmutable.collections.list
-
Uses of InvariantCheckable in org.javimmutable.collections.listmap
Modifier and TypeClassDescriptionclass
HashListMap<K,
V> IListMap
using a hash map for fast lookup.class
OrderedListMap<K,
V> IListMap
implementation that allows keys to be traversed in the same order as they were inserted into the collection.class
TreeListMap<K,
V> IListMap
implementation that allows keys to be traversed in sorted order using a Comparator of the natural ordering of the keys if they implement Comparable. -
Uses of InvariantCheckable in org.javimmutable.collections.setmap
Modifier and TypeClassDescriptionclass
HashSetMap<K,
V> ISetMap
using a hash map for fast lookup.class
OrderedSetMap<K,
V> ISetMap
implementation that allows keys to be traversed in the same order as they were inserted into the collectionclass
TemplateSetMap<K,
V> ISetMap
implementation that uses arbitrary Map and Set templates.class
TreeSetMap<K,
V> ISetMap
implementation that allows keys to be traversed in sorted order using a Comparator of the natural ordering of the keys if they implement Comparable. -
Uses of InvariantCheckable in org.javimmutable.collections.tree