potato 0.3.12

A very simple and high performance http library.
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
153
154
155
156
157
158
159
160

use smallvec::SmallVec;
use std::collections::HashMap;
use std::hash::Hash;

#[derive(Clone)]
pub struct SMap<K, V>
where
    K: Eq + Hash + Ord,
{
    pub data: SmallVec<[(K, V); 64]>,
    pub ext_data: Option<HashMap<K, V>>,
}

impl<K, V> Default for SMap<K, V>
where
    K: Eq + Hash + Ord,
{
    fn default() -> Self {
        Self::new()
    }
}

impl<K, V> SMap<K, V>
where
    K: Eq + Hash + Ord,
{
    pub fn new() -> Self {
        Self {
            data: SmallVec::new(),
            ext_data: None,
        }
    }

    pub fn insert(&mut self, key: K, mut value: V) -> Option<V> {
        if let Some(ext_data) = &mut self.ext_data {
            ext_data.insert(key, value)
        } else if self.data.len() == 64 {
            let mut ext_data = HashMap::with_capacity(128);
            for (k, v) in self.data.drain(..) {
                ext_data.insert(k, v);
            }
            ext_data.insert(key, value)
        } else {
            match self.data.binary_search_by(|probe| probe.0.cmp(&key)) {
                Ok(index) => {
                    std::mem::swap(&mut value, &mut self.data[index].1);
                    Some(value)
                }
                Err(index) => {
                    self.data.insert(index, (key, value));
                    None
                }
            }
        }
    }

    pub fn get(&self, key: &K) -> Option<&V> {
        if let Some(ext_data) = &self.ext_data {
            ext_data.get(key)
        } else {
            match self.data.binary_search_by(|probe| probe.0.cmp(&key)) {
                Ok(index) => Some(&self.data[index].1),
                Err(_) => None,
            }
        }
    }

    pub fn remove(&mut self, key: &K) -> Option<V> {
        if let Some(ext_data) = &mut self.ext_data {
            ext_data.remove(key)
        } else {
            match self.data.binary_search_by(|probe| probe.0.cmp(&key)) {
                Ok(index) => Some(self.data.remove(index).1),
                Err(_) => None,
            }
        }
    }

    pub fn len(&self) -> usize {
        self.data.len() + self.ext_data.as_ref().map_or(0, HashMap::len)
    }

    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    pub fn iter(&self) -> SMapIter<'_, K, V> {
        let state = match &self.ext_data {
            Some(ext) => IterState::HashMap(ext.iter()),
            None => IterState::SmallVec(self.data.iter()),
        };
        SMapIter { inner: state }
    }

    pub fn keys(&self) -> SMapKeys<'_, K, V> {
        let state = match &self.ext_data {
            Some(ext) => IterState::HashMap(ext.iter()),
            None => IterState::SmallVec(self.data.iter()),
        };
        SMapKeys { inner: state }
    }

    pub fn values(&self) -> SMapValues<'_, K, V> {
        let state = match &self.ext_data {
            Some(ext) => IterState::HashMap(ext.iter()),
            None => IterState::SmallVec(self.data.iter()),
        };
        SMapValues { inner: state }
    }
}

enum IterState<'a, K, V> {
    SmallVec(std::slice::Iter<'a, (K, V)>),
    HashMap(std::collections::hash_map::Iter<'a, K, V>),
}

pub struct SMapIter<'a, K, V> {
    inner: IterState<'a, K, V>,
}

impl<'a, K, V> Iterator for SMapIter<'a, K, V> {
    type Item = (&'a K, &'a V);
    fn next(&mut self) -> Option<Self::Item> {
        match &mut self.inner {
            IterState::SmallVec(iter) => {
                let item = iter.next()?;
                Some((&item.0, &item.1))
            }
            IterState::HashMap(iter) => iter.next(),
        }
    }
}

pub struct SMapKeys<'a, K, V> {
    inner: IterState<'a, K, V>,
}

impl<'a, K, V> Iterator for SMapKeys<'a, K, V> {
    type Item = &'a K;
    fn next(&mut self) -> Option<Self::Item> {
        match &mut self.inner {
            IterState::SmallVec(iter) => Some(&iter.next()?.0),
            IterState::HashMap(iter) => iter.next().map(|(k, _)| k),
        }
    }
}

pub struct SMapValues<'a, K, V> {
    inner: IterState<'a, K, V>,
}

impl<'a, K, V> Iterator for SMapValues<'a, K, V> {
    type Item = &'a V;
    fn next(&mut self) -> Option<Self::Item> {
        match &mut self.inner {
            IterState::SmallVec(iter) => Some(&iter.next()?.1),
            IterState::HashMap(iter) => iter.next().map(|(_, v)| v),
        }
    }
}