|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Interface Summary | |
|---|---|
| DoubleIterator | Iterator interface for primitive double iteration. |
| FloatIterator | Iterator interface for primitive int iteration. |
| IntIterator | Iterator interface for primitive int iteration. |
| Class Summary | |
|---|---|
| ArrayHashMap<K,V> | An Array-based hashtable which maps, similar to Java's HashMap, only performance tests showed it performs better. |
| FloatToObjectMap<T> | An Array-based hashtable which maps primitive float to Objects of generic type
T. The hashtable is constracted with a given capacity, or 16 as a default. |
| IntArray | A Class wrapper for a grow-able int[] which can be sorted and intersect with other IntArrays. |
| IntHashSet | A Set or primitive int. |
| IntToDoubleMap | An Array-based hashtable which maps primitive int to a primitive double. The hashtable is constracted with a given capacity, or 16 as a default. |
| IntToIntMap | An Array-based hashtable which maps primitive int to primitive int. The hashtable is constracted with a given capacity, or 16 as a default. |
| IntToObjectMap<T> | An Array-based hashtable which maps primitive int to Objects of generic type
T. The hashtable is constracted with a given capacity, or 16 as a default. |
| LRUHashMap<K,V> | LRUHashMap is an extension of Java's HashMap, which has a bounded size(); When it reaches that size, each time a new element is added, the least recently used (LRU) entry is removed. |
| ObjectToFloatMap<K> | An Array-based hashtable which maps Objects of generic type
T to primitive float values. The hashtable is constructed with a given capacity, or 16 as a default. |
| ObjectToIntMap<K> | An Array-based hashtable which maps Objects of generic type
T to primitive int values. The hashtable is constructed with a given capacity, or 16 as a default. |
Various optimized Collections implementations.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||