iddqd 0.3.18

Maps where keys borrow from values, including bijective and trijective maps.
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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82

use crate::{
    TriHashItem,
    internal::{ValidateCompact, ValidationError},
    support::{
        alloc::{Allocator, Global, global_alloc},
        hash_table::MapHashTable,
        map_hash::MapHash,
    },
};
use core::hash::BuildHasher;

#[derive(Clone, Debug, Default)]
pub(super) struct TriHashMapTables<S, A: Allocator> {
    pub(super) state: S,
    pub(super) k1_to_item: MapHashTable<A>,
    pub(super) k2_to_item: MapHashTable<A>,
    pub(super) k3_to_item: MapHashTable<A>,
}

impl<S: BuildHasher> TriHashMapTables<S, Global> {
    pub(super) const fn with_hasher(hasher: S) -> Self {
        Self {
            state: hasher,
            k1_to_item: MapHashTable::new_in(global_alloc()),
            k2_to_item: MapHashTable::new_in(global_alloc()),
            k3_to_item: MapHashTable::new_in(global_alloc()),
        }
    }
}

impl<S: BuildHasher, A: Clone + Allocator> TriHashMapTables<S, A> {
    pub(super) fn with_capacity_and_hasher_in(
        capacity: usize,
        hasher: S,
        alloc: A,
    ) -> Self {
        Self {
            state: hasher,
            k1_to_item: MapHashTable::with_capacity_in(capacity, alloc.clone()),
            k2_to_item: MapHashTable::with_capacity_in(capacity, alloc.clone()),
            k3_to_item: MapHashTable::with_capacity_in(capacity, alloc),
        }
    }
}

impl<S: Clone + BuildHasher, A: Allocator> TriHashMapTables<S, A> {
    #[cfg(feature = "daft")]
    pub(super) fn hasher(&self) -> &S {
        &self.state
    }

    pub(super) fn validate(
        &self,
        expected_len: usize,
        compactness: ValidateCompact,
    ) -> Result<(), ValidationError> {
        // Check that all the maps are of the right size.
        self.k1_to_item.validate(expected_len, compactness).map_err(
            |error| ValidationError::Table { name: "k1_to_table", error },
        )?;
        self.k2_to_item.validate(expected_len, compactness).map_err(
            |error| ValidationError::Table { name: "k2_to_table", error },
        )?;
        self.k3_to_item.validate(expected_len, compactness).map_err(
            |error| ValidationError::Table { name: "k3_to_table", error },
        )?;

        Ok(())
    }

    pub(super) fn make_hashes<T: TriHashItem>(&self, item: &T) -> [MapHash; 3] {
        let k1 = item.key1();
        let k2 = item.key2();
        let k3 = item.key3();

        let h1 = self.k1_to_item.compute_hash(&self.state, k1);
        let h2 = self.k2_to_item.compute_hash(&self.state, k2);
        let h3 = self.k3_to_item.compute_hash(&self.state, k3);

        [h1, h2, h3]
    }
}