Module phast 

Perfect Hashing with fast evaluation.

Re-exports

pub use compressed_array::CompressedArray;

pub use compressed_array::CompressedBuilder;

pub use compressed_array::DefaultCompressedArray;

Modules

compressed_array

Structs

Function

PHast (Perfect Hashing made fast) - Minimal Perfect Hash Function with very fast evaluation and size below 2 bits/key developed by Piotr Beling and Peter Sanders.

Function2

PHast (Perfect Hashing made fast) - Minimal Perfect Hash Function with very fast evaluation and size below 2 bits/key developed by Piotr Beling and Peter Sanders.

Params

Partial

Map-or-bump function that assigns different numbers to some keys and None to other.

Perfect

PHast (Perfect Hashing made fast) - (K-)Perfect (not necessary minimal) Hash Function with very fast evaluation developed by Piotr Beling and Peter Sanders. Experimental.

SeedOnly

SeedChooser to build (1-)perfect functions.

SeedOnlyK

SeedChooser to build k-perfect functions. k is given as a parameter of this chooser.

ShiftOnly

SeedChooser to build (1-)perfect functions called PHast+ without wrapping.

ShiftOnlyWrapped

SeedChooser to build (1-)perfect functions called PHast+ with wrapping.

ShiftSeedWrapped

SeedChooser to build (1-)perfect functions which uses both shifting with wrapping and regular hashing. The parameter points the number of bits of seed used for regular hashing. Increasing it reduces size but slows down construction.

Weights

Traits

BucketToActivateEvaluator

Evaluate bucket to be activate.

SeedChooser

Choose best seed in bucket. It affects the trade-off between size and evaluation and construction time.

Functions

bits_per_seed_to_100_bucket_size

Returns bucket size proper for given number of bits_per_seed.