| IntHashMap<E> |
an efficient map with ints as keys.
|
| IntMap<E> |
|
| IntPriorityQueue |
A mix of a priority queue and a hashmap, specialized for ints
|
| IntPriorityQueue.Node |
a node containing the data associated with each int
|
| IntQueue |
Special class for unboxed int FIFO
|
| IntSet |
an efficient Set for unboxed int.
|
| IntStack |
Special class for unboxed int stack
|
| IntTrie<N extends IntTrie.Node<N>> |
A class that implements, (hopefully) efficiently, a Trie on integers.
|
| IntTrie.Node<E> |
class of nodes of the Trie.
|
| IntTrie.SimpleNode |
The most simple node possible
|
| IntVec |
low level, efficient int vector
|