All Classes and Interfaces
Class
Description
AbstractHeap provides a skeletal implementation of
the Heap interface, to minimize the effort required
to implement this interface.An
AbstractMapEntry takes care of most of the grunge
work involved in subclassing Map.Entry.This class provides a skeletal implementation of the
MultiMap
interface, to minimize the effort requires to implement this interface.AggregateMapFactory uses a single HashMap
as backing store for the many smaller Maps created
by this MapFactory.AggregateSetFactory uses a single HashMap
as backing store for the many smaller Sets created
by this SetFactory.BinaryHeap is an implementation of a binary heap.A
BinaryTree is a Tree where each node has
at most two children.A
BinomialHeap allows
O(lg n) time bounds for insert, minimum, extract-min, union,
decrease-key, and delete operations.BitSetFactory is a SetFactory that,
given a complete universe of possible values, produces low space
overhead representations of Sets.Deprecated.
CollectionFactory is a Collection
generator.CollectionWrapper is a class that acts as a wrapper
around another Collection, using it as its backing store.A
CombineIterator combines several different
Iterators into one.Default contains one-off or 'standard, no-frills'
implementations of simple Iterators,
Collections, and Comparators.Deprecated.
Use
Pair, an immutable record whose
Pair.left() and Pair.right() replace the methods
of the same name.DisjointSet is an implementation of disjoint-set forests
using the path compression and union-by-rank heuristics to achieve
O(m * alpha(m, n)) runtime, where 'm' is the total number of
operations, 'n' is the total number of elements in the set, and
'alpha' denotes the *extremely* slowly-growing inverse Ackermann
function.An
Environment is a Map with scoping:
you can save marks into the environment and undo all changes
since a mark.A mark into an environment.
Factories consists exclusively of static methods that
operate on or return CollectionFactorys.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.A
FilterIterator filters and maps a source
Iterator to generate a new one: it returns
map.apply(o) for each element o of the
source for which filter.test(o) is true.Deprecated.
Use a
Predicate and a Function, which
can be lambdas, with
FilterIterator(Iterator,Predicate,Function),
FilterIterator.filter(Iterator,Predicate) or
FilterIterator.map(Iterator,Function).GenericInvertibleMap is a default implementation of
InvertibleMap.GenericInvertibleMultiMap is a default implementation of
InvertibleMultiMap.GenericMultiMap is a default implementation of a
MultiMap.Heaps support create, insert, minimum, extract-min,
union, decrease-key, and delete operations.Indexer is an object for extracting unique indices
for a set of objects.An
IntervalTree is a mutable collection
of IntervalTree.Intervals.Immutable record representing a closed interval
[
low,high] holding an object
obj.An
InvertibleMap is an extension of the
Map interface to allow users to do reverse lookups on
the mappings maintained.An
InvertibleMultiMap is an extension of the
MultiMap interface to allow users to do reverse lookups on
the mappings maintained.ListFactory is a List generator.ListWrapper is an abstract class designed to make it easier
to write wrappers around Lists.MapFactory is a Map generator.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 maps a key to a collection of values.MultiMapFactory is a MultiMap generator.An immutable pair of values, either of which may be
null.PairMapEntry is the easiest implementation of a
Map.Entry ever: a pair!PersistentMap implements a persistent map, based on a
persistent randomized treap.A
PersistentMapFactory uses hash-consing to ensure that
the Maps created by it maximally reuse space.A
PersistentMultiMapFactory uses hash-consing to ensure that
the MultiMaps created by it maximally reuse space.PersistentSet implements a persistent set, based on a
persistent randomized treap.A
PersistentSetFactory uses hash-consing to ensure that
the Sets created by it maximally reuse space.A
RedBlackTree is a BinaryTree that uses
red-black properties to maintain a balanced form.ReferenceUnique is a property indicating that, for
all instances of a class, (a==b)==(a.equals(b)).A
ReverseIterator iterates through an Iterator
in reverse order.ReverseListIterator takes a List and gives
you an Iterator that traverses the list in reverse
order.SetFactory is a Set generator.A
SnapshotIterator takes a "snapshot" of an iterator,
and iterates over that snapshot.The
UniqueStack class represents a last-in-first-out
stack of unique objects.A unique vector refuses to addElement duplicates.
Deprecated.
UnmodifiableListIterator is an abstract superclass to
save you the trouble of implementing the UnmodifiableListIterator.remove(),
UnmodifiableListIterator.add(Object) and UnmodifiableListIterator.set(Object) methods over and over again
for those list iterators which don't implement them.UnmodifiableMapSet prevents mutation of a wrapped
MapSet.UnmodifiableMultiMap is an abstract superclass to
save developers the trouble of implementing the various mutator
methds of the MultiMap interface.UnmodifiableMultiMapSet prevents mutation of a wrapped
MultiMapSet.Miscellaneous static utility functions.
The
Version object contains fields naming the current version
of the jutil library (2.0).Deprecated.
Use
LinkedHashSet instead.
BitSet, which grows as needed:firstSet(where)isnextSetBit(where+1), andlastSet(where)ispreviousSetBit(where-1);setUpTo(bit)isset(0, bit+1), andclearUpTo(bit)isclear(0, bit+1);setAll()isset(0, n)for a sizen;clearAll()isclear();intersectionEmpty(o)is!intersects(o);isZero()isisEmpty();copyBits(o)isclear()thenor(o);numberOfOnes()iscardinality(), andnumberOfOnes(where)isget(0, where+1).cardinality();or_upTo(o, bit)isor(o.get(0, bit+1)).