mxp 1.2.0

Rust implementation of the MXP (Mud eXtension Protocol) standard
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152

use std::borrow::Cow;
use std::collections::{HashMap, hash_map};
use std::hash::{BuildHasher, RandomState};
use std::ops::{Deref, DerefMut};
use std::{fmt, iter};

use uncased::{Uncased, UncasedStr};

#[derive(Default)]
pub(crate) struct CaseFoldMap<'a, V, S = RandomState> {
    inner: HashMap<Uncased<'a>, V, S>,
}

impl<V, S> PartialEq for CaseFoldMap<'_, V, S>
where
    V: PartialEq,
    S: BuildHasher,
{
    #[inline]
    fn eq(&self, other: &Self) -> bool {
        self.inner == other.inner
    }
}

impl<V, S> Eq for CaseFoldMap<'_, V, S>
where
    V: Eq,
    S: BuildHasher,
{
}

impl<V, S> Clone for CaseFoldMap<'_, V, S>
where
    V: Clone,
    S: Clone,
{
    #[inline]
    fn clone(&self) -> Self {
        Self {
            inner: self.inner.clone(),
        }
    }

    #[inline]
    fn clone_from(&mut self, source: &Self) {
        self.inner.clone_from(&source.inner);
    }
}

impl<V: fmt::Debug, S> fmt::Debug for CaseFoldMap<'_, V, S> {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        self.inner.fmt(f)
    }
}

impl<V> CaseFoldMap<'_, V> {
    pub fn new() -> Self {
        Self {
            inner: HashMap::new(),
        }
    }

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

impl<'a, V, S: BuildHasher> CaseFoldMap<'a, V, S> {
    pub fn contains_key(&self, key: &str) -> bool {
        self.inner.contains_key(UncasedStr::new(key))
    }

    pub fn get(&self, key: &str) -> Option<&V> {
        self.inner.get(UncasedStr::new(key))
    }

    pub fn get_mut(&mut self, key: &str) -> Option<&mut V> {
        self.inner.get_mut(UncasedStr::new(key))
    }

    pub fn insert<K: Into<Uncased<'a>>>(&mut self, key: K, value: V) -> Option<V> {
        self.inner.insert(key.into(), value)
    }

    pub fn remove(&mut self, key: &str) -> Option<V> {
        self.inner.remove(UncasedStr::new(key))
    }
}

impl<'a, V, S> Deref for CaseFoldMap<'a, V, S> {
    type Target = HashMap<Uncased<'a>, V, S>;

    #[inline]
    fn deref(&self) -> &Self::Target {
        &self.inner
    }
}

impl<V, S> DerefMut for CaseFoldMap<'_, V, S> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.inner
    }
}

impl<'a, K, V, S> Extend<(K, V)> for CaseFoldMap<'a, V, S>
where
    K: Into<Cow<'a, str>>,
    S: BuildHasher,
{
    fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T) {
        self.inner.extend(
            iter.into_iter()
                .map(|(key, value)| (Uncased::new(key), value)),
        );
    }
}

impl<'a, K, V> FromIterator<(K, V)> for CaseFoldMap<'a, V>
where
    K: Into<Cow<'a, str>>,
{
    fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self {
        let mut map = Self::new();
        map.extend(iter);
        map
    }
}

impl<'a, V, S> IntoIterator for &'a CaseFoldMap<'a, V, S> {
    type Item = (&'a str, &'a V);

    type IntoIter = iter::Map<
        hash_map::Iter<'a, Uncased<'a>, V>,
        fn((&'a Uncased<'a>, &'a V)) -> (&'a str, &'a V),
    >;

    fn into_iter(self) -> Self::IntoIter {
        self.inner.iter().map(|(k, v)| (k.as_str(), v))
    }
}

impl<'a, V, S> IntoIterator for CaseFoldMap<'a, V, S> {
    type Item = (Uncased<'a>, V);

    type IntoIter = hash_map::IntoIter<Uncased<'a>, V>;

    fn into_iter(self) -> Self::IntoIter {
        self.inner.into_iter()
    }
}