PerfectHashing

dotty.tools.dotc.util.PerfectHashing

See thePerfectHashing companion object

class PerfectHashing[Key](initialCapacity: Int, capacityMultiple: Int)

A map that maps keys to unique integers in a dense interval starting at 0.

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.

An index idx such that key(idx) == k. If no such index exists, create an entry with an index one larger than the previous one.

The number of keys that can be stored without growing the tables

Remove keys from this map and set back to initial configuration

An index idx such that key(idx) == k, or -1 if no such index exists

The key at index idx

The number of keys

In this article

Generated with