Struct rpds::set::hash_trie_set::HashTrieSet

pub struct HashTrieSet<T, P = RcK, H = RandomState>
where
    T: Eq + Hash,
    H: Clone + BuildHasher,
    P: SharedPointerKind,
{ /* private fields */ }

A persistent set with structural sharing. This implementation uses a hash array mapped trie.

Complexity

Let n be the number of elements in the set.

Temporal complexity

Operation	Average	Worst case
new()	Θ(1)	Θ(1)
insert()	Θ(1)	Θ(n)
remove()	Θ(1)	Θ(n)
get()	Θ(1)	Θ(n)
contains()	Θ(1)	Θ(n)
size()	Θ(1)	Θ(1)
clone()	Θ(1)	Θ(1)
iterator creation	Θ(1)	Θ(1)
iterator step	Θ(1)	Θ(1)
iterator full	Θ(n)	Θ(n)

Implementation details

This is a thin wrapper around a HashTrieMap.

Implementations

impl<T> HashTrieSet<T, RcK, RandomState>

where T: Eq + Hash,

pub fn new() -> HashTrieSet<T>

pub fn new_with_degree(degree: u8) -> HashTrieSet<T>

impl<T> HashTrieSet<T, ArcTK>

where T: Eq + Hash,

pub fn new_sync() -> HashTrieSetSync<T>

pub fn new_with_degree_sync(degree: u8) -> HashTrieSetSync<T>

impl<T, P, H> HashTrieSet<T, P, H>

where T: Eq + Hash, H: Clone + BuildHasher, P: SharedPointerKind,

pub fn new_with_hasher_with_ptr_kind(hasher_builder: H) -> HashTrieSet<T, P, H>

pub fn new_with_hasher_and_degree_and_ptr_kind( hasher_builder: H, degree: u8 ) -> HashTrieSet<T, P, H>

pub fn insert(&self, v: T) -> HashTrieSet<T, P, H>

pub fn insert_mut(&mut self, v: T)

pub fn remove<V>(&self, v: &V) -> HashTrieSet<T, P, H>

where T: Borrow<V>, V: Hash + Eq + ?Sized,

pub fn remove_mut<V>(&mut self, v: &V) -> bool

where T: Borrow<V>, V: Hash + Eq + ?Sized,

pub fn get<V>(&self, v: &V) -> Option<&T>

where T: Borrow<V>, V: Hash + Eq + ?Sized,

pub fn contains<V>(&self, v: &V) -> bool

where T: Borrow<V>, V: Hash + Eq + ?Sized,

pub fn is_disjoint<HO: BuildHasher + Clone>( &self, other: &HashTrieSet<T, P, HO> ) -> bool

pub fn is_subset<HO: BuildHasher + Clone>( &self, other: &HashTrieSet<T, P, HO> ) -> bool

pub fn is_superset<HO: BuildHasher + Clone>( &self, other: &HashTrieSet<T, P, HO> ) -> bool

pub fn size(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> Iter<'_, T, P>

Trait Implementations

impl<T, P, H> Clone for HashTrieSet<T, P, H>

where T: Eq + Hash, H: Clone + BuildHasher, P: SharedPointerKind,

fn clone(&self) -> HashTrieSet<T, P, H>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T, P, H> Debug for HashTrieSet<T, P, H>

where T: Eq + Hash + Debug, H: Clone + Debug + BuildHasher, P: SharedPointerKind + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T, P, H> Default for HashTrieSet<T, P, H>

where T: Eq + Hash, H: Default + Clone + BuildHasher, P: SharedPointerKind,

fn default() -> HashTrieSet<T, P, H>

Returns the “default value” for a type.

impl<'de, T, P, H> Deserialize<'de> for HashTrieSet<T, P, H>

where T: Eq + Hash + Deserialize<'de>, H: BuildHasher + Clone + Default, P: SharedPointerKind,

fn deserialize<D: Deserializer<'de>>( deserializer: D ) -> Result<HashTrieSet<T, P, H>, D::Error>

Deserialize this value from the given Serde deserializer.

impl<T, P, H> Display for HashTrieSet<T, P, H>

where T: Eq + Hash + Display, H: Clone + BuildHasher, P: SharedPointerKind,

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T, P, H> FromIterator<T> for HashTrieSet<T, P, H>

where T: Eq + Hash, H: BuildHasher + Clone + Default, P: SharedPointerKind,

fn from_iter<I: IntoIterator<Item = T>>(into_iter: I) -> HashTrieSet<T, P, H>

Creates a value from an iterator.

impl<'a, T, P, H> IntoIterator for &'a HashTrieSet<T, P, H>

where T: Eq + Hash, H: Default + Clone + BuildHasher, P: SharedPointerKind,

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Map<Map<IterPtr<'a, T, (), P>, fn(_: &'a SharedPointer<Entry<T, ()>, P>) -> (&'a T, &'a ())>, fn(_: (&'a T, &())) -> &'a T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, T, P>

Creates an iterator from a value.

impl<T, P, PO, H> PartialEq<HashTrieSet<T, PO, H>> for HashTrieSet<T, P, H>

where T: Hash + Eq, H: Clone + BuildHasher, P: SharedPointerKind, PO: SharedPointerKind,

fn eq(&self, other: &HashTrieSet<T, PO, H>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T, P, H> Serialize for HashTrieSet<T, P, H>

where T: Eq + Hash + Serialize, H: BuildHasher + Clone + Default, P: SharedPointerKind,

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl<T, P, H> Eq for HashTrieSet<T, P, H>

where T: Hash + Eq, H: Clone + BuildHasher, P: SharedPointerKind,