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().first().expect("no values in entry")
}
pub fn get_vec(&self) -> &Vec<V> {
self.inner.get()
}
pub fn get_mut(&mut self) -> &mut V {
self.inner
.get_mut()
.first_mut()
.expect("no values in entry")
}
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),
}
}
}