entropy-map 1.1.0

Ultra-low latency hash map using minimal perfect hash functions and compact encoding of values, minimizing memory footprint and storage size for efficient data retrieval.
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

use entropy_map::{Mphf, DEFAULT_GAMMA};

fn main() {
    // Initialize MPHF with a small set of keys using `B = 32` (group size), `S = 8` (max seed)
    // and `gamma = 2.0` (speed/size tradeoff). See `README.md` for more details.
    let keys = [1, 2, 3, 4, 5];
    let mphf = Mphf::<32, 8>::from_slice(&keys, DEFAULT_GAMMA).expect("failed to create MPHF");

    // Test keys that are present in the MPHF
    assert!(mphf.get(&1).is_some());
    assert!(mphf.get(&5).is_some());

    // Test a key that is not present in the MPHF
    assert!(mphf.get(&6).is_none());

    #[cfg(feature = "rkyv_derive")]
    {
        // Serialize mphf to rkyv and test again
        let rkyv_bytes = rkyv::to_bytes::<_, 1024>(&mphf).unwrap();
        let rkyv_mphf = rkyv::check_archived_root::<Mphf<32, 8>>(&rkyv_bytes).unwrap();

        assert!(rkyv_mphf.get(&1).is_some());
        assert!(rkyv_mphf.get(&5).is_some());
        assert!(rkyv_mphf.get(&6).is_none());
    }
}