use std::collections::{HashMap as StdMap, HashSet as StdSet};
#[derive(Debug, Clone)]
pub struct HashMap<K, V> {
data: StdMap<K, V>,
}
impl<K, V> HashMap<K, V>
where
K: Eq + std::hash::Hash,
{
pub fn new() -> Self {
Self {
data: StdMap::new(),
}
}
pub fn set(&mut self, key: K, value: V) {
self.data.insert(key, value);
}
pub fn get(&self, key: &K) -> Option<&V> {
self.data.get(key)
}
pub fn has(&self, key: &K) -> bool {
self.data.contains_key(key)
}
pub fn delete(&mut self, key: &K) -> Option<V> {
self.data.remove(key)
}
pub fn len(&self) -> usize {
self.data.len()
}
pub fn is_empty(&self) -> bool {
self.data.is_empty()
}
pub fn keys(&self) -> Vec<&K> {
self.data.keys().collect()
}
pub fn values(&self) -> Vec<&V> {
self.data.values().collect()
}
}
impl<K, V> Default for HashMap<K, V>
where
K: Eq + std::hash::Hash,
{
fn default() -> Self {
Self::new()
}
}
#[derive(Debug, Clone)]
pub struct HashSet<T> {
data: StdSet<T>,
}
impl<T> HashSet<T>
where
T: Eq + std::hash::Hash,
{
pub fn new() -> Self {
Self {
data: StdSet::new(),
}
}
pub fn add(&mut self, value: T) {
self.data.insert(value);
}
pub fn remove(&mut self, value: &T) -> bool {
self.data.remove(value)
}
pub fn has(&self, value: &T) -> bool {
self.data.contains(value)
}
pub fn len(&self) -> usize {
self.data.len()
}
pub fn is_empty(&self) -> bool {
self.data.is_empty()
}
pub fn to_vec(&self) -> Vec<&T> {
self.data.iter().collect()
}
}
impl<T> Default for HashSet<T>
where
T: Eq + std::hash::Hash,
{
fn default() -> Self {
Self::new()
}
}