Struct rpds::set::hash_trie_set::HashTrieSet [−][src]
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) |
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,
[src]
T: Eq + Hash,
#[must_use]pub fn new() -> HashTrieSet<T>
[src]
#[must_use]pub fn new_with_degree(degree: u8) -> HashTrieSet<T>
[src]
impl<T> HashTrieSet<T, ArcK, H> where
T: Eq + Hash,
[src]
T: Eq + Hash,
#[must_use]pub fn new_sync() -> HashTrieSetSync<T>
[src]
#[must_use]pub fn new_with_degree_sync(degree: u8) -> HashTrieSetSync<T>
[src]
impl<T, P, H: BuildHasher> HashTrieSet<T, P, H> where
T: Eq + Hash,
H: Clone,
P: SharedPointerKind,
[src]
T: Eq + Hash,
H: Clone,
P: SharedPointerKind,
#[must_use]pub fn new_with_hasher_with_ptr_kind(hasher_builder: H) -> HashTrieSet<T, P, H>
[src]
#[must_use]pub fn new_with_hasher_and_degree_and_ptr_kind(
hasher_builder: H,
degree: u8
) -> HashTrieSet<T, P, H>
[src]
hasher_builder: H,
degree: u8
) -> HashTrieSet<T, P, H>
#[must_use]pub fn insert(&self, v: T) -> HashTrieSet<T, P, H>
[src]
pub fn insert_mut(&mut self, v: T)
[src]
#[must_use]pub fn remove<V: ?Sized>(&self, v: &V) -> HashTrieSet<T, P, H> where
T: Borrow<V>,
V: Hash + Eq,
[src]
T: Borrow<V>,
V: Hash + Eq,
pub fn remove_mut<V: ?Sized>(&mut self, v: &V) -> bool where
T: Borrow<V>,
V: Hash + Eq,
[src]
T: Borrow<V>,
V: Hash + Eq,
#[must_use]pub fn contains<V: ?Sized>(&self, v: &V) -> bool where
T: Borrow<V>,
V: Hash + Eq,
[src]
T: Borrow<V>,
V: Hash + Eq,
#[must_use]pub fn is_disjoint<I: BuildHasher + Clone>(
&self,
other: &HashTrieSet<T, P, I>
) -> bool
[src]
&self,
other: &HashTrieSet<T, P, I>
) -> bool
#[must_use]pub fn is_subset<I: BuildHasher + Clone>(
&self,
other: &HashTrieSet<T, P, I>
) -> bool
[src]
&self,
other: &HashTrieSet<T, P, I>
) -> bool
#[must_use]pub fn is_superset<I: BuildHasher + Clone>(
&self,
other: &HashTrieSet<T, P, I>
) -> bool
[src]
&self,
other: &HashTrieSet<T, P, I>
) -> bool
#[must_use]pub fn size(&self) -> usize
[src]
#[must_use]pub fn is_empty(&self) -> bool
[src]
#[must_use]pub fn iter(&self) -> Iter<'_, T, P>
[src]
Trait Implementations
impl<T, P, H: BuildHasher> Clone for HashTrieSet<T, P, H> where
T: Eq + Hash,
H: Clone,
P: SharedPointerKind,
[src]
T: Eq + Hash,
H: Clone,
P: SharedPointerKind,
fn clone(&self) -> HashTrieSet<T, P, H>
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<T: Debug, P: Debug, H: Debug + BuildHasher> Debug for HashTrieSet<T, P, H> where
T: Eq + Hash,
H: Clone,
P: SharedPointerKind,
[src]
T: Eq + Hash,
H: Clone,
P: SharedPointerKind,
impl<T, P, H: BuildHasher> Default for HashTrieSet<T, P, H> where
T: Eq + Hash,
H: Default + Clone,
P: SharedPointerKind,
[src]
T: Eq + Hash,
H: Default + Clone,
P: SharedPointerKind,
fn default() -> HashTrieSet<T, P, H>
[src]
impl<'de, T, P, H> Deserialize<'de> for HashTrieSet<T, P, H> where
T: Eq + Hash + Deserialize<'de>,
H: BuildHasher + Clone + Default,
P: SharedPointerKind,
[src]
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>
[src]
deserializer: D
) -> Result<HashTrieSet<T, P, H>, D::Error>
impl<T, P, H: BuildHasher> Display for HashTrieSet<T, P, H> where
T: Eq + Hash + Display,
H: Clone,
P: SharedPointerKind,
[src]
T: Eq + Hash + Display,
H: Clone,
P: SharedPointerKind,
impl<T: Eq, P, H: BuildHasher> Eq for HashTrieSet<T, P, H> where
T: Hash,
H: Clone,
P: SharedPointerKind,
[src]
T: Hash,
H: Clone,
P: SharedPointerKind,
impl<T, P, H> FromIterator<T> for HashTrieSet<T, P, H> where
T: Eq + Hash,
H: BuildHasher + Clone + Default,
P: SharedPointerKind,
[src]
T: Eq + Hash,
H: BuildHasher + Clone + Default,
P: SharedPointerKind,
fn from_iter<I: IntoIterator<Item = T>>(into_iter: I) -> HashTrieSet<T, P, H>
[src]
impl<'a, T, P, H: BuildHasher> IntoIterator for &'a HashTrieSet<T, P, H> where
T: Eq + Hash,
H: Default + Clone,
P: SharedPointerKind,
[src]
T: Eq + Hash,
H: Default + Clone,
P: SharedPointerKind,
type Item = &'a T
The type of the elements being iterated over.
type IntoIter = Iter<'a, T, P>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Iter<'a, T, P>
[src]
impl<T: Eq, P, PO, H: BuildHasher> PartialEq<HashTrieSet<T, PO, H>> for HashTrieSet<T, P, H> where
T: Hash,
H: Clone,
P: SharedPointerKind,
PO: SharedPointerKind,
[src]
T: Hash,
H: Clone,
P: SharedPointerKind,
PO: SharedPointerKind,
fn eq(&self, other: &HashTrieSet<T, PO, H>) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<T, P, H> Serialize for HashTrieSet<T, P, H> where
T: Eq + Hash + Serialize,
H: BuildHasher + Clone + Default,
P: SharedPointerKind,
[src]
T: Eq + Hash + Serialize,
H: BuildHasher + Clone + Default,
P: SharedPointerKind,
Auto Trait Implementations
impl<T, P, H> RefUnwindSafe for HashTrieSet<T, P, H> where
H: RefUnwindSafe,
P: RefUnwindSafe,
T: RefUnwindSafe,
H: RefUnwindSafe,
P: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, P, H> Send for HashTrieSet<T, P, H> where
H: Send,
P: Send,
T: Send,
H: Send,
P: Send,
T: Send,
impl<T, P, H> Sync for HashTrieSet<T, P, H> where
H: Sync,
P: Sync,
T: Sync,
H: Sync,
P: Sync,
T: Sync,
impl<T, P, H> Unpin for HashTrieSet<T, P, H> where
H: Unpin,
P: Unpin,
T: Unpin,
H: Unpin,
P: Unpin,
T: Unpin,
impl<T, P, H> UnwindSafe for HashTrieSet<T, P, H> where
H: UnwindSafe,
P: UnwindSafe,
T: UnwindSafe,
H: UnwindSafe,
P: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,