| Class and Description |
|---|
AbstractHeap
AbstractHeap provides a skeletal implementation of
the Heap interface, to minimize the effort required
to implement this interface. |
| AbstractMapEntry
An
AbstractMapEntry takes care of most of the grunge
work involved in subclassing Map.Entry. |
| AbstractMultiMap
This class provides a skeletal implementation of the
MultiMap
interface, to minimize the effort requires to implement this interface. |
| BinaryTree
A
BinaryTree is a Tree where each node has
at most two children. |
| BinaryTree.Node
A
BinaryTree.Node is an element of this tree. |
| BinomialHeap
A
BinomialHeap allows
O(lg n) time bounds for insert, minimum, extract-min, union,
decrease-key, and delete operations. |
BitString
BitString implements a vector of bits
|
CollectionFactory
CollectionFactory is a Collection
generator. |
CollectionWrapper
CollectionWrapper is a class that acts as a wrapper
around another Collection, using it as its backing store. |
| Default.PairList
Pairs, implemented as a
List. |
| Environment
An
Environment is a Map with scoping:
you can save marks into the environment and undo all changes
since a mark. |
| Environment.Mark
A abstract property for marks into an environment.
|
| FibonacciHeap
A
FibonacciHeap allows amortized O(1) time bounds for
create, insert, minimum, union, and decrease-key operations, and
amortized O(lg n) run times for extract-min and delete. |
| FilterIterator.Filter |
GenericMultiMap
GenericMultiMap is a default implementation of a
MultiMap. |
Heap
Heaps support create, insert, minimum, extract-min,
union, decrease-key, and delete operations. |
Indexer
Indexer is an object for extracting unique indices
for a set of objects. |
| IntervalTree.Interval
Immutable record representing a closed interval
[
low,high] holding an object
obj. |
| InvertibleMap
An
InvertibleMap is an extension of the
Map interface to allow users to do reverse lookups on
the mappings maintained. |
| InvertibleMultiMap
An
InvertibleMultiMap is an extension of the
MultiMap interface to allow users to do reverse lookups on
the mappings maintained. |
LinearSet
LinearSet is a simplistic light-weight
Set designed for use when the number of entries is
small. |
ListFactory
ListFactory is a List generator. |
MapFactory
MapFactory is a Map generator. |
| MapSet |
MapWrapper
MapWrapper is a class that acts as a proxy for
another backing map, to allow for easy extension of
Map functionality while not restricting developers to
one particular Map implementation. |
MultiMap
MultiMap maps a key to a collection of values. |
MultiMapFactory
MultiMapFactory is a MultiMap generator. |
| MultiMapSet |
PersistentMap
PersistentMap implements a persistent map, based on a
persistent randomized treap. |
PersistentSet
PersistentSet implements a persistent set, based on a
persistent randomized treap. |
| RedBlackTree
A
RedBlackTree is a BinaryTree that uses
red-black properties to maintain a balanced form. |
SetFactory
SetFactory is a Set generator. |
| SetWrapper |
| SnapshotIterator
A
SnapshotIterator takes a "snapshot" of an iterator,
and iterates over that snapshot. |
| UniqueVector
A unique vector refuses to addElement duplicates.
|
UnmodifiableIterator
UnmodifiableIterator is an abstract superclass to save
you the trouble of implementing the UnmodifiableIterator.remove() method
over and over again for those iterators which don't implement it. |
| UnmodifiableMap |
UnmodifiableMapSet
UnmodifiableMapSet prevents mutation of a wrapped
MapSet. |
UnmodifiableMultiMap
UnmodifiableMultiMap is an abstract superclass to
save developers the trouble of implementing the various mutator
methds of the MultiMap interface. |
UnmodifiableMultiMapSet
UnmodifiableMultiMapSet prevents mutation of a wrapped
MultiMapSet. |
Copyright (c) 2006 C. Scott Ananian