Package com.globalmentor.collections

package com.globalmentor.collections

Related Packages

Package	Description
com.globalmentor.collections.comparators
com.globalmentor.collections.iterables
com.globalmentor.collections.iterators

Class	Description
AbstractConverterCollection<S,D>	A collection that provides access to another collection, automatically converting elements to objects possibly of a different type.
AbstractConverterList<S,D>	A list that provides access to another list, automatically converting elements to objects possibly of a different type.
AbstractDecoratorCollectionMap<K,V,C extends Collection<V>>	An abstract collection map that decorates an existing map.
AbstractPurgeOnWriteReferenceValueMap<K,V,R extends Reference<V> & AbstractPurgeOnWriteReferenceValueMap.Keyed<K>>	A map that uses references to store map values.
AbstractPurgeOnWriteReferenceValueMap.Keyed<K>	An object that remembers the key associated with it.
AbstractRunnableBlockingQueueConsumer<E>	A runnable consumer that takes elements from a blocking queue and consume them.
AbstractSuffixTree<E extends SuffixTree.Edge>	An abstract base implementation of a suffix tree for a sequence of elements (most commonly characters).
ArrayListHashMap<K,V>	An implementation of a HashMap that stores an ArrayList of values for each key, with special methods for retrieving single values.
ArrayListMap<K,V>	An decorator map that stores an ArrayList of values for each key, with special methods for retrieving single values.
ArraySubList<E>	Represents a list that is a subset of some larger list, based upon an array.
CharSequenceSuffixTree	A suffix tree for a sequence of characters.
CharSequenceSuffixTree.AbstractEdgeKey	An abstract base class that implements hashing and equality for an edge key.
CharSequenceSuffixTree.EdgeKey	A key identifying an edge of a node, uniquely identified by its parent node and first character (as no node in a suffix tree contains more than one edge starting with the same character).
CharSequenceSuffixTrees	Utilities for working with suffix trees of sequences of characters.
CharSequenceSuffixTrees.AbstractCharSequenceVisitor	An abstract implementation of a visitor for character sequences.
CollectionBuilder	Utility methods for building collections using a fluent interface.
CollectionDecorator<E>	A collection that wraps an existing collection, providing access through the Collection interface.
CollectionMap<K,V,C extends Collection<V>>	A map that stores a collection of values for each key, using a pair of read and write locks to access its data, with special methods for retrieving single values.
Collections	Various utilities to be used with collections.
CopyOnWriteArrayListConcurrentHashMap<K,V>	An implementation of a ConcurrentHashMap that stores a CopyOnWriteArrayList of values for each key, with special methods for retrieving single values.
DecoratorIDedMappedList<K,E extends IDed<K>>	A list that allows quick lookup of IDed objects.
DecoratorReadWriteLockCollection<E>	A thread-safe collection decorator that allows many readers but only one writer to access a collection at a time.
DecoratorReadWriteLockCollectionMap<K,V,C extends Collection<V>>	A thread-safe collection map decorator that allows many readers but only one writer to access a map at a time.
DecoratorReadWriteLockMap<K,V>	A thread-safe map decorator that allows many readers but only one writer to access a map at a time.
DecoratorReadWriteLockReverseMap<K,V>	A thread-safe map decorator that allows many readers but only one writer to access a map at a time, and that also allows lookup of the map keys keyed to the values by decorating two maps.
DecoratorReadWriteLockSet<E>	A thread-safe collection decorator that allows many readers but only one writer to access a set at a time.
DecoratorReverseMap<K,V>	A map that also allows lookup of the map keys keyed to the values by decorating two maps.
HashSetHashMap<K,V>	An implementation of a HashMap that stores an HashSet of values for each key, with special methods for retrieving single values.
IdentityHashSet<E>	A set that is backed by an identity hash map.
IdentityHashSetMap<K,V>	An decorator map that stores an IdentityHashSet of values for each key, with special methods for retrieving single values.
ImmutableCollection<E>	A marker interface indicating that the collection is immutable.
ImmutableMap<K,V>	A marker interface indicating that the map is immutable.
ListDecorator<E>	A list that wraps an existing list, providing access through the List interface.
Lists	Utilities to be used with lists.
MapDecorator<K,V>	A map that wraps an existing map, providing access through the Map interface.
MappedList<K,E>	A list that allows quick lookup of its elements.
Maps	Various utilities to be used with objects implementing the Map interface.
ModifiableCollection<E>	Deprecated.
ModifiableSet<E>	Deprecated.
NameValuePairMapEntry<K,V>	A read-only map entry that is also a name/value pair.
ObjectList<E>	Deprecated. Replace with Collections.singletonList(Object).
PurgeOnWriteSoftValueHashMap<K,V>	A map that uses soft references to store map values.
PurgeOnWriteSoftValueHashMap.SoftValueReference<K,V>	A soft reference that keeps track of the key with which a value was associated.
PurgeOnWriteWeakValueHashMap<K,V>	A map that uses weak references to store map values.
PurgeOnWriteWeakValueHashMap.WeakValueReference<K,V>	A weak reference that keeps track of the key with which a value was associated.
ReadWriteLockCollection<E>	A thread-safe collection that uses a pair of read and write locks to access its data.
ReadWriteLockCollectionMap<K,V,C extends Collection<V>>	A thread-safe map that stores a collection of values for each key, with special methods for retrieving single values.
ReadWriteLockDecorator	A read/write lock that decorates another read/write lock.
ReadWriteLockMap<K,V>	A thread-safe map that uses a pair of read and write locks to access its data.
ReadWriteLockReverseMap<K,V>	A thread-safe reverse map that uses a pair of read and write locks to access its data.
ReadWriteLockSet<E>	A thread-safe set that uses a pair of read and write locks to access its data.
ReverseMap<K,V>	A map that also allows lookup of the map keys keyed to the values.
Sets	Utilities to be used with sets.
SubList<E>	Represents a list that is a subset of some larger list.
SuffixTree	A general interface for a suffix tree for a sequence of elements (most commonly characters).
SuffixTree.Edge	Represents an edge between a parent node and a child node in a suffix tree.
SuffixTree.Node	Represents a node in a suffix tree.
SuffixTrees	Utilities for working with suffix trees.
SuffixTrees.Visitor<N extends SuffixTree.Node,E extends SuffixTree.Edge>	A general visitor strategy for visiting nodes.
SynchronizedCollectionDecorator<E>	A collection that wraps an existing collection, providing access through the Collection interface.
SynchronizedCollectionMapDecorator<K,V,C extends Collection<V>>	A collection map that wraps an existing collection map, providing access through the CollectionMap interface.
SynchronizedListDecorator<E>	A list that wraps an existing list, providing access through the List interface.
SynchronizedMapDecorator<K,V>	A map that wraps an existing map, providing access through the Map interface.
SynchronizedSetDecorator<E>	A set that wraps an existing set, providing access through the Set interface.
TreeSetMap<K,V>	An decorator map that stores a TreeSet of values for each key, with special methods for retrieving single values.
Vectors	Various vector manipulating functions.
WeakHashSet<E>	A class that implements the Set interface, backed by a WeakHashMap.