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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
use smallvec::SmallVec;
#[derive(Clone, Debug)]
pub struct PlainMap<Key, Value> {
pairs: SmallVec<[(Key, Value); 2]>,
}
impl<Key: PartialEq, Value> PlainMap<Key, Value> {
pub fn new() -> Self {
Self {
pairs: SmallVec::new(),
}
}
pub fn with_capacity(capacity: usize) -> Self {
Self {
pairs: SmallVec::with_capacity(capacity),
}
}
pub fn reserve(&mut self, additional: usize) {
self.pairs.reserve(additional)
}
pub fn shrink_to_fit(&mut self) {
self.pairs.shrink_to_fit();
}
fn find(&self, k: &Key) -> Option<usize> {
self.pairs.iter().position(|(x,_)| *x == *k)
}
pub fn insert(&mut self, k: Key, v: Value) -> Option<Value> {
match self.find(&k) {
Some(i) => {
Some(std::mem::replace(&mut self.pairs[i].1, v))
},
None => {
self.pairs.push((k,v));
None
}
}
}
pub fn get(&self, k: &Key) -> Option<&Value> {
match self.find(k) {
Some(i) => Some(&self.pairs[i].1),
None => None
}
}
pub fn get_mut(&mut self, k: &Key) -> Option<&mut Value> {
match self.find(k) {
Some(i) => Some(&mut self.pairs[i].1),
None => None
}
}
pub fn get_key_value(&self, k: &Key) -> Option<&(Key, Value)> {
match self.find(k) {
Some(i) => Some(&self.pairs[i]),
None => None
}
}
pub fn get_key_value_mut(&mut self, k: &Key) -> Option<&mut (Key, Value)> {
match self.find(k) {
Some(i) => Some(&mut self.pairs[i]),
None => None
}
}
pub fn contains_key(&self, k: &Key) -> bool {
self.find(k).is_some()
}
pub fn remove(&mut self, k: &Key) -> Option<Value> {
match self.find(k) {
Some(i) => Some(self.pairs.swap_remove(i).1),
None => None,
}
}
pub fn remove_entry(&mut self, k: &Key) -> Option<(Key, Value)> {
match self.find(k) {
Some(i) => Some(self.pairs.swap_remove(i)),
None => None,
}
}
pub fn entry(&mut self, k: Key) -> PlainMapEntry<Key, Value> {
PlainMapEntry {
parent: self,
k: k
}
}
pub fn capacity(&self) -> usize {
self.pairs.capacity()
}
pub fn len(&self) -> usize {
self.pairs.len()
}
pub fn is_empty(&self) -> bool {
self.pairs.is_empty()
}
pub fn clear(&mut self) {
self.pairs.clear();
}
pub fn iter(&self) -> std::slice::Iter<(Key, Value)> {
self.pairs.iter()
}
pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut (Key, Value)> {
self.pairs.iter_mut()
}
pub fn keys(&self) -> impl Iterator<Item = &Key> {
self.pairs.iter().map(|(k,_v)| k)
}
pub fn keys_mut(&mut self) -> impl Iterator<Item = &mut Key> {
self.pairs.iter_mut().map(|(k,_v)| k)
}
pub fn values(&self) -> impl Iterator<Item = &Value> {
self.pairs.iter().map(|(_k,v)| v)
}
pub fn values_mut(&mut self) -> impl Iterator<Item = &mut Value> {
self.pairs.iter_mut().map(|(_k,v)| v)
}
pub fn drain(&mut self) -> smallvec::Drain<'_, (Key, Value)> {
self.pairs.drain()
}
}
pub struct PlainMapEntry<'a, Key, Value> {
parent: &'a mut PlainMap<Key, Value>,
k: Key,
}
impl<'a, Key: PartialEq, Value> PlainMapEntry<'a, Key, Value> {
pub fn or_insert(self, default: Value) -> &'a mut Value {
match self.parent.find(&self.k) {
Some(i) => &mut self.parent.pairs[i].1,
None => {
self.parent.pairs.push((self.k, default));
&mut self.parent.pairs.last_mut().unwrap().1
}
}
}
pub fn or_insert_with<F: FnOnce() -> Value>(self, default: F) -> &'a mut Value {
match self.parent.find(&self.k) {
Some(i) => &mut self.parent.pairs[i].1,
None => {
self.parent.pairs.push((self.k, default()));
&mut self.parent.pairs.last_mut().unwrap().1
}
}
}
pub fn and_modify<F: FnOnce(&mut Value)>(self, f: F) -> Self {
match self.parent.find(&self.k) {
Some(i) => f(&mut self.parent.pairs[i].1),
None => {}
}
self
}
pub fn key(&self) -> &Key {
&self.k
}
}
impl<'a, Key: PartialEq, Value: Default> PlainMapEntry<'a, Key, Value> {
pub fn or_default(self) -> &'a mut Value {
self.or_insert_with(Value::default)
}
}