gene 0.7.2

Crate providing a log matching framework written in Rust
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

use serde::{de, Deserialize, Deserializer, Serialize};
use std::{
    collections::HashMap,
    fmt,
    ops::{Deref, DerefMut},
};

/// HashMap implementation providing key uniqueness at Deserialization
#[derive(Default, Debug, Clone, Serialize)]
pub(crate) struct UKHashMap<K, V>(HashMap<K, V>);

impl<K, V> From<UKHashMap<K, V>> for HashMap<K, V> {
    fn from(value: UKHashMap<K, V>) -> Self {
        value.0
    }
}

impl<K, V> From<HashMap<K, V>> for UKHashMap<K, V> {
    fn from(value: HashMap<K, V>) -> Self {
        Self(value)
    }
}

impl<K, V> Deref for UKHashMap<K, V> {
    type Target = HashMap<K, V>;
    fn deref(&self) -> &Self::Target {
        &self.0
    }
}

impl<K, V> DerefMut for UKHashMap<K, V> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.0
    }
}

/// helper to deserialize a UKHashMap into a HashMap
#[inline(always)]
pub(crate) fn deserialize_uk_hashmap<'de, D, K, V>(
    deserializer: D,
) -> Result<Option<HashMap<K, V>>, D::Error>
where
    D: Deserializer<'de>,
    K: Deserialize<'de> + Eq + std::hash::Hash + fmt::Debug,
    V: Deserialize<'de>,
{
    let s = Option::<UKHashMap<K, V>>::deserialize(deserializer)?;
    Ok(s.map(|m| m.into()))
}

impl<'de, K, V> Deserialize<'de> for UKHashMap<K, V>
where
    K: Deserialize<'de> + Eq + std::hash::Hash + fmt::Debug,
    V: Deserialize<'de>,
{
    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
    where
        D: Deserializer<'de>,
    {
        struct MatchMapVisitor<K, V>(std::marker::PhantomData<(K, V)>);

        impl<'de, K, V> de::Visitor<'de> for MatchMapVisitor<K, V>
        where
            K: Deserialize<'de> + Eq + std::hash::Hash + fmt::Debug,
            V: Deserialize<'de>,
        {
            type Value = UKHashMap<K, V>;

            fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
                formatter.write_str("a map with unique keys")
            }

            fn visit_map<A>(self, mut map: A) -> Result<Self::Value, A::Error>
            where
                A: de::MapAccess<'de>,
            {
                let mut values = HashMap::new();

                while let Some((key, value)) = map.next_entry()? {
                    if values.contains_key(&key) {
                        return Err(de::Error::custom(format!("duplicate key found: {key:?}")));
                    }
                    values.insert(key, value);
                }

                Ok(UKHashMap(values))
            }
        }

        deserializer.deserialize_map(MatchMapVisitor(std::marker::PhantomData))
    }
}