|
| 1 | +use std::borrow::Borrow; |
| 2 | +use std::collections::HashMap; |
| 3 | +use std::hash::Hash; |
| 4 | + |
| 5 | +#[derive(Clone, Debug, PartialEq, Eq)] |
| 6 | +pub struct Map<K: Eq + Hash, V> { |
| 7 | + indices: HashMap<K, usize>, |
| 8 | + entries: Vec<V>, |
| 9 | +} |
| 10 | + |
| 11 | +impl<K: Eq + Hash, V: Default> Map<K, V> { |
| 12 | + pub fn new() -> Self { |
| 13 | + Self::default() |
| 14 | + } |
| 15 | + |
| 16 | + pub fn insert(&mut self, k: K, v: V) -> Option<V> { |
| 17 | + match self.indices.get(&k) { |
| 18 | + Some(i) => { |
| 19 | + self.entries.push(v); |
| 20 | + Some(self.entries.swap_remove(*i)) |
| 21 | + } |
| 22 | + None => { |
| 23 | + self.indices.insert(k, self.entries.len()); |
| 24 | + self.entries.push(v); |
| 25 | + None |
| 26 | + } |
| 27 | + } |
| 28 | + } |
| 29 | + |
| 30 | + pub fn remove<Q>(&mut self, k: &Q) -> Option<V> |
| 31 | + where |
| 32 | + K: Borrow<Q>, |
| 33 | + Q: Hash + Eq + ?Sized, |
| 34 | + { |
| 35 | + match self.indices.remove(k) { |
| 36 | + Some(i) => { |
| 37 | + self.entries.push(V::default()); |
| 38 | + Some(self.entries.swap_remove(i)) |
| 39 | + } |
| 40 | + None => None, |
| 41 | + } |
| 42 | + } |
| 43 | + |
| 44 | + pub fn get<Q>(&self, k: &Q) -> Option<&V> |
| 45 | + where |
| 46 | + K: Borrow<Q>, |
| 47 | + Q: Hash + Eq + ?Sized, |
| 48 | + { |
| 49 | + match self.indices.get(k) { |
| 50 | + Some(i) => self.entries.get(*i), |
| 51 | + None => None, |
| 52 | + } |
| 53 | + } |
| 54 | + |
| 55 | + pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V> |
| 56 | + where |
| 57 | + K: Borrow<Q>, |
| 58 | + Q: Hash + Eq + ?Sized, |
| 59 | + { |
| 60 | + match self.indices.get(k) { |
| 61 | + Some(i) => self.entries.get_mut(*i), |
| 62 | + None => None, |
| 63 | + } |
| 64 | + } |
| 65 | + |
| 66 | + pub fn iter(&self) -> Iter<K, V> { |
| 67 | + Iter { |
| 68 | + indices: self.indices.iter(), |
| 69 | + entries: &self.entries, |
| 70 | + } |
| 71 | + } |
| 72 | + |
| 73 | + pub fn is_empty(&self) -> bool { |
| 74 | + self.indices.is_empty() |
| 75 | + } |
| 76 | + |
| 77 | + pub fn len(&self) -> usize { |
| 78 | + self.indices.len() |
| 79 | + } |
| 80 | + |
| 81 | + pub fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T) { |
| 82 | + for (k, v) in iter { |
| 83 | + self.insert(k, v); |
| 84 | + } |
| 85 | + } |
| 86 | +} |
| 87 | + |
| 88 | +impl<K: Eq + Hash, V> Default for Map<K, V> { |
| 89 | + fn default() -> Self { |
| 90 | + Self { |
| 91 | + indices: HashMap::default(), |
| 92 | + entries: Vec::default(), |
| 93 | + } |
| 94 | + } |
| 95 | +} |
| 96 | + |
| 97 | +impl<K: Eq + Hash, V: Default> FromIterator<(K, V)> for Map<K, V> { |
| 98 | + fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self { |
| 99 | + let mut map = Map::default(); |
| 100 | + for (key, value) in iter { |
| 101 | + map.insert(key, value); |
| 102 | + } |
| 103 | + map |
| 104 | + } |
| 105 | +} |
| 106 | + |
| 107 | +impl<K: Eq + Hash, V: Default> IntoIterator for Map<K, V> { |
| 108 | + type Item = (K, V); |
| 109 | + type IntoIter = IntoIter<K, V>; |
| 110 | + |
| 111 | + fn into_iter(self) -> Self::IntoIter { |
| 112 | + IntoIter { |
| 113 | + indices: self.indices.into_iter(), |
| 114 | + entries: self.entries, |
| 115 | + } |
| 116 | + } |
| 117 | +} |
| 118 | + |
| 119 | +pub struct IntoIter<K, V> { |
| 120 | + indices: std::collections::hash_map::IntoIter<K, usize>, |
| 121 | + entries: Vec<V>, |
| 122 | +} |
| 123 | + |
| 124 | +impl<K, V: Default> Iterator for IntoIter<K, V> { |
| 125 | + type Item = (K, V); |
| 126 | + |
| 127 | + fn next(&mut self) -> Option<Self::Item> { |
| 128 | + let (k, i) = self.indices.next()?; |
| 129 | + self.entries.push(V::default()); |
| 130 | + let v = self.entries.swap_remove(i); |
| 131 | + Some((k, v)) |
| 132 | + } |
| 133 | +} |
| 134 | + |
| 135 | +pub struct Iter<'a, K, V> { |
| 136 | + indices: std::collections::hash_map::Iter<'a, K, usize>, |
| 137 | + entries: &'a [V], |
| 138 | +} |
| 139 | + |
| 140 | +impl<'a, K, V> Iterator for Iter<'a, K, V> { |
| 141 | + type Item = (&'a K, &'a V); |
| 142 | + |
| 143 | + fn next(&mut self) -> Option<Self::Item> { |
| 144 | + let (k, &i) = self.indices.next()?; |
| 145 | + self.entries.get(i).map(|v| (k, v)) |
| 146 | + } |
| 147 | +} |
0 commit comments