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
27
28
29
30

use entropy_map::Set;
use std::collections::HashSet;

fn main() {
    // Initialize `Set` with default parameters from Rust's `HashSet`
    let mut hash_set = HashSet::<u64>::new();
    hash_set.insert(1);
    hash_set.insert(2);
    hash_set.insert(3);
    let set = Set::try_from(hash_set).expect("failed to create Set");

    // Test keys that are present in the set
    assert!(set.contains(&1));
    assert!(set.contains(&2));
    assert!(set.contains(&3));

    // Test a key that is not present in the MPHF
    assert!(!set.contains(&4));

    #[cfg(feature = "rkyv_derive")]
    {
        let rkyv_bytes = rkyv::to_bytes::<_, 1024>(&set).unwrap();
        let rkyv = rkyv::check_archived_root::<Set<u64>>(&rkyv_bytes).unwrap();

        assert!(rkyv.contains(&1));
        assert!(rkyv.contains(&2));
        assert!(rkyv.contains(&3));
        assert!(!rkyv.contains(&4));
    }
}