Interface | Description |
---|---|
IntSet |
A generic set of ints that has an efficient implementation, BitSet,
which is a compressed bitset and is useful for ints that
are small, for example less than 500 or so, and w/o many ranges.
|
Class | Description |
---|---|
Barrier |
A very simple barrier wait.
|
BitSet |
A BitSet to replace java.util.BitSet.
|
Graph<T> |
A generic graph with edges; Each node as a single Object payload.
|
Graph.Node<T> | |
IntArrayList |
An ArrayList based upon int members.
|
Interval |
An immutable inclusive interval a..b
|
IntervalSet |
A set of integers that relies on ranges being common to do
"run-length-encoded" like compression (if you view an IntSet like
a BitSet with runs of 0s and 1s).
|
MultiMap<K,V> |
A hash table that maps a key to a list of elements not just a single.
|
MutableInteger |
Java won't let you modify an Integer; not sure how that's more
efficient, but...here's one that let's you modify it.
|
OrderedHashSet<T> |
A HashMap that remembers the order that the elements were added.
|
Utils |
Copyright © 1992–2019 ANTLR. All rights reserved.