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 and supports fast insert(), remove(), and contains().

Complexity

Let n be the number of elements in the set.

Temporal complexity

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

Implementation details

This is a thin wrapper around a RedBlackTreeMap.

Methods

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

pub fn new() -> RedBlackTreeSet<T>

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

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

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

pub fn first(&self) -> Option<&T>

pub fn last(&self) -> Option<&T>

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

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

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

pub fn size(&self) -> usize

pub fn is_empty(&self) -> bool

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

Trait Implementations

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.

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

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

Formats the value using the given formatter.

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> Default for RedBlackTreeSet<T> where
    T: Ord, 

fn default() -> RedBlackTreeSet<T>

Returns the "default value" for a type.

impl<T> PartialEq 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 ==.

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

This method tests for !=.

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

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<'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> 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.