use ahash::RandomState;
pub type PlHashMap<K, V> = hashbrown::HashMap<K, V, RandomState>;
pub type PlHashSet<V> = hashbrown::HashSet<V, RandomState>;
pub type PlIndexMap<K, V> = indexmap::IndexMap<K, V, RandomState>;
pub type PlIndexSet<K> = indexmap::IndexSet<K, RandomState>;
pub trait InitHashMaps {
type HashMap;
fn new() -> Self::HashMap;
fn with_capacity(capacity: usize) -> Self::HashMap;
}
impl<K, V> InitHashMaps for PlHashMap<K, V> {
type HashMap = Self;
fn new() -> Self::HashMap {
Self::with_capacity_and_hasher(0, Default::default())
}
fn with_capacity(capacity: usize) -> Self {
Self::with_capacity_and_hasher(capacity, Default::default())
}
}
impl<K> InitHashMaps for PlHashSet<K> {
type HashMap = Self;
fn new() -> Self::HashMap {
Self::with_capacity_and_hasher(0, Default::default())
}
fn with_capacity(capacity: usize) -> Self {
Self::with_capacity_and_hasher(capacity, Default::default())
}
}
impl<K> InitHashMaps for PlIndexSet<K> {
type HashMap = Self;
fn new() -> Self::HashMap {
Self::with_capacity_and_hasher(0, Default::default())
}
fn with_capacity(capacity: usize) -> Self::HashMap {
Self::with_capacity_and_hasher(capacity, Default::default())
}
}
impl<K, V> InitHashMaps for PlIndexMap<K, V> {
type HashMap = Self;
fn new() -> Self::HashMap {
Self::with_capacity_and_hasher(0, Default::default())
}
fn with_capacity(capacity: usize) -> Self::HashMap {
Self::with_capacity_and_hasher(capacity, Default::default())
}
}