ph 0.11.0

The library of data structures based on perfect hashing.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

//! Perfect Hashing with fast evaluation.

pub mod compressed_array;
pub use compressed_array::{CompressedArray, CompressedBuilder, DefaultCompressedArray};

mod builder;
mod conf;
pub use conf::{Params, bits_per_seed_to_100_bucket_size};

mod cyclic;
mod evaluator;
pub use evaluator::{BucketToActivateEvaluator, Weights};

mod function;
pub use function::Function;

mod function2;
pub use function2::Function2;

mod perfect;
pub use perfect::Perfect;

mod partial;
pub use partial::Partial;

mod seed_chooser;
pub use seed_chooser::{SeedChooser, SeedOnly, ShiftOnly, ShiftOnlyWrapped, ShiftSeedWrapped, SeedOnlyK};

/// Power of two grater or equal than `WINDOW_SIZE`.
const MAX_WINDOW_SIZE: usize = 256;

/// Power of two grater or equal then range of values covered by the window.
//const MAX_VALUES: usize = 4096;
const MAX_VALUES: usize = 4096 * 2  *2; // TODO only MT require last *2; maybe switch to dynamic allocation?

/// Window size. Maximum number of elements in the priority queue.
const WINDOW_SIZE: u16 = 256;