The G mapping (see minimum perfect hashing algorithm) that provides the initial mapping from the first colliding hash function to the secondary disambiguation hash function.
The mapping to the actual key buffer in the form of a prefix sum table.
The slots in the hash mapped back to their enum values.
The blob of keys indexed by the prefix sum.
Get the number of keys/slots in this.
The number of keys/slots.
Get the corresponding value in this map for a particular key.
The buffer to get the key to match from.
Optional
offset: numberAn optional offset into the buffer (will be 0 if not specified)
Optional
end: numberThe end offset in the buffer (non inclusive, will be length if specified.
The matching value if the key is in the map, otherwise undefined.
Does this map have a particular key.
The buffer to get the key to match from.
Optional
offset: numberAn optional offset into the buffer (will be 0 if not specified)
Optional
end: numberThe end offset in the buffer (non inclusive, will be length if specified.
True if the key is in the map.
A minimal perfect hash indexing lookup that