Returns a map from (clones of) values to the lengths of their codes.

Returns array indexed by values that contains the lengths of their codes.

Returns a map from (references to) values to the lengths of their codes.

Returns a map from (references to) values to their codes.

Conditionally (if `new_value` does not return [`None`]) changes the value `old` stored at bits `[begin, begin+v_size)` to the one returned by `new_val

Maps value of each key to code fragment, and adds the fragment to collision solver.

Constructs array for values to fill with `set_value` method.

Counts number of positive collisions in each group.

Returns the number of `item` occurrences in the given `range`, or panics if `range` is out of bounds.

Returns configuration that uses custom [`cache_threshold`](BuildConf::cache_threshold) to build [Function].

Returns configuration that uses custom [`cache_threshold`](BuildConf::cache_threshold) and potentially uses [multiple threads](BuildConf::use_multiple

fn default() -> Self { Self { ..Default::default() } }

fn default() -> Self { Self { ..Default::default() } }

Creates a configuration in which the seed and group sizes are 4 and 16 bits respectively, which (when relative level size is 100) leads to a minimum p

Creates a configuration in which the seed and group sizes are 2 and 16 bits respectively, which (when relative level size is 100) leads to a minimum p

Creates a configuration in which the seed and group sizes are 1 and 8 bits respectively, which (when relative level size is 100) leads to a minimum pe

Creates a configuration in which the seed and group sizes are 8 and 32 bits respectively, which (when relative level size is 100) leads to a minimum p

Constructs cached [`DynamicKeySet`] that obtains the keys by `keys` that returns iterator over keys. The keys are cloned and cached as soon as their n

Constructs cached [`DynamicKeySet`] that obtains the keys by `keys` that returns iterator over exactly `len` keys. The keys are cloned and cached as s