|
Class Summary |
| ArrayIntEnumerator |
A utility class which conveniently converts an array of integers into
an IntEnumerator (an enumeration of integers). |
| ArrayIntIterator |
A utility class which conveniently converts an array of integers into
an IntIterator (an iteration of integers). |
| IntArray |
A dynamically growing array of integers. |
| IntBTree |
An in-memory B+-tree that stores integers. |
| IntHash |
An insert-only hashtable that has non-negative 32 bit integer keys;
no satellite data is stored in this hashtable. |
| IntIntHash |
An insert-only hashtable that has non-negative 32 bit integer keys and
non-negative 32 bit integer values. |
| IntObjHash |
An insert-only hashtable that has non-negative 32 bit integer keys and
non-null object values. |
| IntQueue |
A first-in, first-out container of 32 bit integers. |
| IntStack |
A first-in, last-out container of 32 bit integers. |
| IntTHash<T> |
An insert-only hashtable that has non-negative 32 bit integer keys and
non-null object values. |
| LongLongHash |
An insert-only hashtable that has non-negative 64 bit integer keys and
non-negative 64 bit integer values. |
| MinIntHeap |
A heap is an implementation of a priority queue. |