SkimpyOffsetMap
The number of bytes of space each entry uses (the number of bytes in the hash plus an 8 byte offset)
Change the salt used for key hashing making all existing keys unfindable.
Change the salt used for key hashing making all existing keys unfindable. Doesn't actually zero out the array.
The rate of collisions in the lookups
Get the offset associated with this key.
Get the offset associated with this key.
The key
The offset associated with this key or -1 if the key is not found
The hash algorithm instance to use: MD2, MD5, SHA-1, SHA-256, SHA-384, SHA-512
The amount of memory this map can use
Associate this offset to the given key.
Associate this offset to the given key.
The key
The offset
The number of entries put into the map (note that not all may remain)
The number of entries put into the map (note that not all may remain)
The maximum number of entries this map can contain
The maximum number of entries this map can contain
An hash table used for deduplicating the log. This hash table uses a cryptographicly secure hash of the key as a proxy for the key for comparisons and to save space on object overhead. Collisions are resolved by probing. This hash table does not support deletes.