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
use std::collections::hash_map::OccupiedEntry as HashMapOccupiedEntry;
use std::collections::hash_map::VacantEntry as HashMapVacantEntry;
pub struct OccupiedEntry<'a, K: 'a, V: 'a> {
#[doc(hidden)]
pub inner: HashMapOccupiedEntry<'a, K, Vec<V>>,
}
pub struct VacantEntry<'a, K: 'a, V: 'a> {
#[doc(hidden)]
pub inner: HashMapVacantEntry<'a, K, Vec<V>>,
}
pub enum Entry<'a, K: 'a, V: 'a> {
Occupied(OccupiedEntry<'a, K, V>),
Vacant(VacantEntry<'a, K, V>),
}
impl<'a, K: 'a, V: 'a> OccupiedEntry<'a, K, V> {
pub fn get(&self) -> &V {
&self.inner.get()[0]
}
pub fn get_vec(&self) -> &Vec<V> {
self.inner.get()
}
pub fn get_mut(&mut self) -> &mut V {
&mut self.inner.get_mut()[0]
}
pub fn get_vec_mut(&mut self) -> &mut Vec<V> {
self.inner.get_mut()
}
pub fn into_mut(self) -> &'a mut V {
&mut self.inner.into_mut()[0]
}
pub fn into_vec_mut(self) -> &'a mut Vec<V> {
self.inner.into_mut()
}
pub fn insert(&mut self, value: V) {
self.get_vec_mut().push(value);
}
pub fn insert_vec(&mut self, values: Vec<V>) {
self.get_vec_mut().extend(values);
}
pub fn remove(self) -> Vec<V> {
self.inner.remove()
}
}
impl<'a, K: 'a, V: 'a> VacantEntry<'a, K, V> {
pub fn insert(self, value: V) -> &'a mut V {
&mut self.inner.insert(vec![value])[0]
}
pub fn insert_vec(self, values: Vec<V>) -> &'a mut Vec<V> {
self.inner.insert(values)
}
}
impl<'a, K: 'a, V: 'a> Entry<'a, K, V> {
pub fn or_insert(self, default: V) -> &'a mut V {
match self {
Entry::Occupied(entry) => entry.into_mut(),
Entry::Vacant(entry) => entry.insert(default),
}
}
pub fn or_insert_vec(self, defaults: Vec<V>) -> &'a mut Vec<V> {
match self {
Entry::Occupied(entry) => entry.into_vec_mut(),
Entry::Vacant(entry) => entry.insert_vec(defaults),
}
}
}