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

use super::IdOrdItem;
use crate::{
    internal::{ValidateCompact, ValidationError},
    support::{btree_table::MapBTreeTable, map_hash::MapHash},
};
use core::hash::Hash;

#[derive(Clone, Debug, Default)]
pub(super) struct IdOrdMapTables {
    pub(super) key_to_item: MapBTreeTable,
}

impl IdOrdMapTables {
    pub(super) const fn new() -> Self {
        Self { key_to_item: MapBTreeTable::new() }
    }

    pub(super) fn state(&self) -> &foldhash::fast::FixedState {
        self.key_to_item.state()
    }

    #[doc(hidden)]
    pub(super) fn validate(
        &self,
        expected_len: usize,
        compactness: ValidateCompact,
    ) -> Result<(), ValidationError> {
        self.key_to_item.validate(expected_len, compactness).map_err(
            |error| ValidationError::Table { name: "key_to_item", error },
        )?;

        Ok(())
    }

    pub(super) fn make_hash<'a, T>(&self, item: &'a T) -> MapHash
    where
        T::Key<'a>: Hash,
        T: 'a + IdOrdItem,
    {
        self.key_to_item.compute_hash(item.key())
    }
}