Struct rpds::set::red_black_tree_set::RedBlackTreeSet

pub struct RedBlackTreeSet<T, P = RcK> where
    T: Ord,
    P: SharedPointerKind,  { /* fields omitted */ }

A persistent set with structural sharing. This implementation uses a red-black tree.

Complexity

Let n be the number of elements in the set.

Temporal complexity

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

Implementation details

This is a thin wrapper around a RedBlackTreeMap.

Implementations

impl<T> RedBlackTreeSet<T, ArcK> where
    T: Ord, 

#[must_use]pub fn new_sync() -> RedBlackTreeSetSync<T>

impl<T> RedBlackTreeSet<T> where
    T: Ord, 

#[must_use]pub fn new() -> RedBlackTreeSet<T>

impl<T, P> RedBlackTreeSet<T, P> where
    T: Ord,
    P: SharedPointerKind, 

#[must_use]pub fn new_with_ptr_kind() -> RedBlackTreeSet<T, P>

#[must_use]pub fn insert(&self, v: T) -> RedBlackTreeSet<T, P>

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

#[must_use]pub fn remove<V: ?Sized>(&self, v: &V) -> RedBlackTreeSet<T, P> where
    T: Borrow<V>,
    V: Ord, 

pub fn remove_mut<V: ?Sized>(&mut self, v: &V) -> bool where
    T: Borrow<V>,
    V: Ord, 

#[must_use]pub fn contains<V: ?Sized>(&self, v: &V) -> bool where
    T: Borrow<V>,
    V: Ord, 

#[must_use]pub fn first(&self) -> Option<&T>

#[must_use]pub fn last(&self) -> Option<&T>

#[must_use]pub fn is_disjoint<PO>(&self, other: &RedBlackTreeSet<T, PO>) -> bool where
    PO: SharedPointerKind, 

#[must_use]pub fn is_subset<PO>(&self, other: &RedBlackTreeSet<T, PO>) -> bool where
    PO: SharedPointerKind, 

#[must_use]pub fn is_superset<PO>(&self, other: &RedBlackTreeSet<T, PO>) -> bool where
    PO: SharedPointerKind, 

#[must_use]pub fn size(&self) -> usize

#[must_use]pub fn is_empty(&self) -> bool

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

#[must_use]pub fn range<Q: ?Sized, RB>(&self, range: RB) -> RangeIter<'_, T, RB, Q, P> where
    T: Borrow<Q>,
    Q: Ord,
    RB: RangeBounds<Q>, 

Trait Implementations

impl<T, P> Clone for RedBlackTreeSet<T, P> where
    T: Ord,
    P: SharedPointerKind, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, P: Debug> Debug for RedBlackTreeSet<T, P> where
    T: Ord,
    P: SharedPointerKind, 

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

Formats the value using the given formatter.

impl<T, P> Default for RedBlackTreeSet<T, P> where
    T: Ord,
    P: SharedPointerKind, 

fn default() -> RedBlackTreeSet<T, P>

Returns the "default value" for a type.

impl<'de, T, P> Deserialize<'de> for RedBlackTreeSet<T, P> where
    T: Ord + Deserialize<'de>,
    P: SharedPointerKind, 

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

Deserialize this value from the given Serde deserializer.

impl<T, P> Display for RedBlackTreeSet<T, P> where
    T: Ord + Display,
    P: SharedPointerKind, 

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

Formats the value using the given formatter.

impl<T, P> Eq for RedBlackTreeSet<T, P> where
    T: Ord,
    P: SharedPointerKind, 

impl<T, P> FromIterator<T> for RedBlackTreeSet<T, P> where
    T: Ord,
    P: SharedPointerKind, 

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

Creates a value from an iterator.

impl<'a, T, P> IntoIterator for &'a RedBlackTreeSet<T, P> where
    T: Ord,
    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>

Creates an iterator from a value.

impl<T: Ord, P> Ord for RedBlackTreeSet<T, P> where
    P: SharedPointerKind, 

fn cmp(&self, other: &RedBlackTreeSet<T, P>) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<T, P, PO> PartialEq<RedBlackTreeSet<T, PO>> for RedBlackTreeSet<T, P> where
    T: Ord,
    P: SharedPointerKind,
    PO: SharedPointerKind, 

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

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

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T: Ord, P, PO> PartialOrd<RedBlackTreeSet<T, PO>> for RedBlackTreeSet<T, P> where
    P: SharedPointerKind,
    PO: SharedPointerKind, 

fn partial_cmp(&self, other: &RedBlackTreeSet<T, PO>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

#[must_use]pub fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]pub fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

#[must_use]pub fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]pub fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T, P> Serialize for RedBlackTreeSet<T, P> where
    T: Ord + Serialize,
    P: SharedPointerKind, 

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

Serialize this value into the given Serde serializer.