token-value-map 0.2.5

A token-value map with interpolation of values: what you need for DCCs
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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131

use crate::*;
use std::{
    collections::HashMap,
    hash::{Hash, Hasher},
};

/// A collection of named values indexed by string tokens.
///
/// [`TokenValueMap`] `struct` stores a mapping from string tokens to [`Value`]
/// instances, allowing efficient lookup of named parameters or attributes by
/// token.
#[derive(Clone, Debug, Default, PartialEq)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
#[cfg_attr(feature = "facet", derive(Facet))]
#[cfg_attr(feature = "facet", facet(opaque))]
#[cfg_attr(feature = "rkyv", derive(Archive, RkyvSerialize, RkyvDeserialize))]
pub struct TokenValueMap {
    attributes: HashMap<Token, Value>,
}

impl Hash for TokenValueMap {
    fn hash<H: Hasher>(&self, state: &mut H) {
        self.attributes.len().hash(state);
        // Note: HashMap iteration order is not deterministic,
        // so we need to sort for consistent hashing
        let mut items: Vec<_> = self.attributes.iter().collect();
        items.sort_by_key(|(k, _)| *k);
        for (token, value) in items {
            token.hash(state);
            value.hash(state);
        }
    }
}

impl TokenValueMap {
    pub fn new() -> Self {
        Self::default()
    }

    pub fn with_capacity(capacity: usize) -> Self {
        Self {
            attributes: HashMap::with_capacity(capacity),
        }
    }

    pub fn insert<V: Into<Value>>(&mut self, token: impl Into<Token>, value: V) {
        self.attributes.insert(token.into(), value.into());
    }

    pub fn get(&self, token: &Token) -> Option<&Value> {
        self.attributes.get(token)
    }

    pub fn get_mut(&mut self, token: &Token) -> Option<&mut Value> {
        self.attributes.get_mut(token)
    }

    pub fn remove(&mut self, token: &Token) -> Option<Value> {
        self.attributes.remove(token)
    }

    pub fn contains(&self, token: &Token) -> bool {
        self.attributes.contains_key(token)
    }

    pub fn len(&self) -> usize {
        self.attributes.len()
    }

    pub fn is_empty(&self) -> bool {
        self.attributes.is_empty()
    }

    pub fn clear(&mut self) {
        self.attributes.clear();
    }

    pub fn iter(&self) -> impl Iterator<Item = (&Token, &Value)> {
        self.attributes.iter()
    }

    pub fn iter_mut(&mut self) -> impl Iterator<Item = (&Token, &mut Value)> {
        self.attributes.iter_mut()
    }

    pub fn tokens(&self) -> impl Iterator<Item = &Token> {
        self.attributes.keys()
    }

    pub fn values(&self) -> impl Iterator<Item = &Value> {
        self.attributes.values()
    }

    pub fn values_mut(&mut self) -> impl Iterator<Item = &mut Value> {
        self.attributes.values_mut()
    }

    pub fn extend<I>(&mut self, iter: I)
    where
        I: IntoIterator<Item = (Token, Value)>,
    {
        self.attributes.extend(iter);
    }

    pub fn retain<F>(&mut self, mut f: F)
    where
        F: FnMut(&Token, &Value) -> bool,
    {
        self.attributes.retain(|k, v| f(k, v));
    }
}

// Manual Eq implementation for TokenValueMap
// This is safe because we handle floating point comparison deterministically
impl Eq for TokenValueMap {}

impl FromIterator<(Token, Value)> for TokenValueMap {
    fn from_iter<T: IntoIterator<Item = (Token, Value)>>(iter: T) -> Self {
        Self {
            attributes: HashMap::from_iter(iter),
        }
    }
}

impl<const N: usize> From<[(Token, Value); N]> for TokenValueMap {
    fn from(arr: [(Token, Value); N]) -> Self {
        Self {
            attributes: HashMap::from(arr),
        }
    }
}