use crate::map::hash_trie_map;
use crate::HashTrieMap;
use std::borrow::Borrow;
use std::collections::hash_map::RandomState;
use std::fmt::Display;
use std::hash::BuildHasher;
use std::hash::Hash;
use std::iter::FromIterator;
pub type Iter<'a, T> = hash_trie_map::IterKeys<'a, T, ()>;
#[macro_export]
macro_rules! ht_set {
($($e:expr),*) => {
{
#[allow(unused_mut)]
let mut s = $crate::HashTrieSet::new();
$(
s.insert_mut($e);
)*
s
}
};
}
#[derive(Debug)]
pub struct HashTrieSet<T, H: BuildHasher = RandomState>
where
T: Eq + Hash,
H: Clone,
{
map: HashTrieMap<T, (), H>,
}
impl<T> HashTrieSet<T, RandomState>
where
T: Eq + Hash,
{
#[must_use]
pub fn new() -> HashTrieSet<T> {
HashTrieSet {
map: HashTrieMap::new(),
}
}
pub fn new_with_degree(degree: u8) -> HashTrieSet<T> {
HashTrieSet::new_with_hasher_and_degree(RandomState::new(), degree)
}
}
impl<T, H: BuildHasher> HashTrieSet<T, H>
where
T: Eq + Hash,
H: Clone,
{
pub fn new_with_hasher(hasher_builder: H) -> HashTrieSet<T, H> {
HashTrieSet {
map: HashTrieMap::new_with_hasher(hasher_builder),
}
}
pub fn new_with_hasher_and_degree(hasher_builder: H, degree: u8) -> HashTrieSet<T, H> {
HashTrieSet {
map: HashTrieMap::new_with_hasher_and_degree(hasher_builder, degree),
}
}
#[must_use]
pub fn insert(&self, v: T) -> HashTrieSet<T, H> {
HashTrieSet {
map: self.map.insert(v, ()),
}
}
pub fn insert_mut(&mut self, v: T) {
self.map.insert_mut(v, ());
}
#[must_use]
pub fn remove<V: ?Sized>(&self, v: &V) -> HashTrieSet<T, H>
where
T: Borrow<V>,
V: Hash + Eq,
{
HashTrieSet {
map: self.map.remove(v),
}
}
pub fn remove_mut<V: ?Sized>(&mut self, v: &V) -> bool
where
T: Borrow<V>,
V: Hash + Eq,
{
self.map.remove_mut(v)
}
#[must_use]
pub fn contains<V: ?Sized>(&self, v: &V) -> bool
where
T: Borrow<V>,
V: Hash + Eq,
{
self.map.contains_key(v)
}
#[must_use]
pub fn is_disjoint<I: BuildHasher + Clone>(&self, other: &HashTrieSet<T, I>) -> bool {
self.iter().all(|v| !other.contains(v))
}
#[must_use]
pub fn is_subset<I: BuildHasher + Clone>(&self, other: &HashTrieSet<T, I>) -> bool {
self.iter().all(|v| other.contains(v))
}
#[must_use]
pub fn is_superset<I: BuildHasher + Clone>(&self, other: &HashTrieSet<T, I>) -> bool {
other.is_subset(self)
}
#[must_use]
#[inline]
pub fn size(&self) -> usize {
self.map.size()
}
#[must_use]
#[inline]
pub fn is_empty(&self) -> bool {
self.size() == 0
}
#[must_use]
pub fn iter(&self) -> Iter<'_, T> {
self.map.keys()
}
}
impl<T, H: BuildHasher> Clone for HashTrieSet<T, H>
where
T: Eq + Hash,
H: Clone,
{
fn clone(&self) -> HashTrieSet<T, H> {
HashTrieSet {
map: self.map.clone(),
}
}
}
impl<T, H: BuildHasher> Default for HashTrieSet<T, H>
where
T: Eq + Hash,
H: Default + Clone,
{
fn default() -> HashTrieSet<T, H> {
HashTrieSet::new_with_hasher(H::default())
}
}
impl<T: Eq, H: BuildHasher> PartialEq for HashTrieSet<T, H>
where
T: Hash,
H: Clone,
{
fn eq(&self, other: &HashTrieSet<T, H>) -> bool {
self.map.eq(&other.map)
}
}
impl<T: Eq, H: BuildHasher> Eq for HashTrieSet<T, H>
where
T: Hash,
H: Clone,
{
}
impl<T, H: BuildHasher> Display for HashTrieSet<T, H>
where
T: Eq + Hash + Display,
H: Clone,
{
fn fmt(&self, fmt: &mut ::std::fmt::Formatter<'_>) -> ::std::fmt::Result {
let mut first = true;
fmt.write_str("{")?;
for v in self.iter() {
if !first {
fmt.write_str(", ")?;
}
v.fmt(fmt)?;
first = false;
}
fmt.write_str("}")
}
}
impl<'a, T, H: BuildHasher> IntoIterator for &'a HashTrieSet<T, H>
where
T: Eq + Hash,
H: Default + Clone,
{
type Item = &'a T;
type IntoIter = Iter<'a, T>;
fn into_iter(self) -> Iter<'a, T> {
self.iter()
}
}
impl<T, H> FromIterator<T> for HashTrieSet<T, H>
where
T: Eq + Hash,
H: BuildHasher + Clone + Default,
{
fn from_iter<I: IntoIterator<Item = T>>(into_iter: I) -> HashTrieSet<T, H> {
let mut set = HashTrieSet::new_with_hasher(Default::default());
for v in into_iter {
set.insert_mut(v);
}
set
}
}
#[cfg(feature = "serde")]
pub mod serde {
use super::*;
use ::serde::de::{Deserialize, Deserializer, SeqAccess, Visitor};
use ::serde::ser::{Serialize, Serializer};
use std::fmt;
use std::marker::PhantomData;
impl<T, H> Serialize for HashTrieSet<T, H>
where
T: Eq + Hash + Serialize,
H: BuildHasher + Clone + Default,
{
fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
serializer.collect_seq(self)
}
}
impl<'de, T, H> Deserialize<'de> for HashTrieSet<T, H>
where
T: Eq + Hash + Deserialize<'de>,
H: BuildHasher + Clone + Default,
{
fn deserialize<D: Deserializer<'de>>(
deserializer: D,
) -> Result<HashTrieSet<T, H>, D::Error> {
deserializer.deserialize_seq(HashTrieSetVisitor {
phantom: PhantomData,
})
}
}
struct HashTrieSetVisitor<T, H> {
phantom: PhantomData<(T, H)>,
}
impl<'de, T, H> Visitor<'de> for HashTrieSetVisitor<T, H>
where
T: Eq + Hash + Deserialize<'de>,
H: BuildHasher + Clone + Default,
{
type Value = HashTrieSet<T, H>;
fn expecting(&self, formatter: &mut fmt::Formatter<'_>) -> fmt::Result {
formatter.write_str("a sequence")
}
fn visit_seq<A>(self, mut seq: A) -> Result<HashTrieSet<T, H>, A::Error>
where
A: SeqAccess<'de>,
{
let mut set = HashTrieSet::new_with_hasher(Default::default());
while let Some(value) = seq.next_element()? {
set.insert_mut(value);
}
Ok(set)
}
}
}
#[cfg(test)]
mod test;