Struct rpds::set::red_black_tree_set::RedBlackTreeSet

pub struct RedBlackTreeSet<T> where
    T: Ord,  { /* 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.

Methods

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

#[must_use]

pub fn new() -> RedBlackTreeSet<T>

#[must_use]

pub fn insert(&self, v: T) -> RedBlackTreeSet<T>

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

#[must_use]

pub fn remove<V: ?Sized>(&self, v: &V) -> RedBlackTreeSet<T> 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(&self, other: &RedBlackTreeSet<T>) -> bool

#[must_use]

pub fn is_subset(&self, other: &RedBlackTreeSet<T>) -> bool

#[must_use]

pub fn is_superset(&self, other: &RedBlackTreeSet<T>) -> bool

#[must_use]

pub fn size(&self) -> usize

#[must_use]

pub fn is_empty(&self) -> bool

#[must_use]

pub fn iter(&self) -> Iter<T>

#[must_use]

pub fn range<Q: ?Sized, RB>(&self, range: RB) -> RangeIter<T, RB, Q> where
    T: Borrow<Q>,
    Q: Ord,
    RB: RangeBounds<Q>, 

Trait Implementations

impl<'a, T> IntoIterator for &'a RedBlackTreeSet<T> where
    T: Ord, 

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

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

Creates an iterator from a value.

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

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

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

#[must_use]

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

This method tests for !=.

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

fn default() -> RedBlackTreeSet<T>

Returns the "default value" for a type.

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

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

Creates a value from an iterator.

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

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

Formats the value using the given formatter.

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

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

Formats the value using the given formatter.

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

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

Serialize this value into the given Serde serializer.

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

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

Deserialize this value from the given Serde deserializer.