final class IntMap[Key](initialCapacity: Int = ..., capacityMultiple: Int = ...) extends PerfectHashing[Key]
A dense map from some Key type to Int. Dense means: All keys and values are stored in arrays from 0 up to the size of the map. Keys and values can be obtained by index using key(index) and value(index). Values can also be stored using setValue(index, value).
ome privileged protected access to its internals
Value parameters
capacityMultiple
The minimum multiple of capacity relative to used elements. The hash table will be re-sized once the number of elements multiplied by capacityMultiple exceeds the current size of the hash table. However, a table of size up to DenseLimit will be re-sized only once the number of elements reaches the table's size.
initialCapacity
Indicates the initial number of slots in the hash table. The actual number of slots is always a power of 2, so the initial size of the table will be the smallest power of two that is equal or greater than the given initialCapacity. Minimum value is 4.
