Struct RedBlackTreeSet

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

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, ArcTK>

where T: Ord,

pub fn new_sync() -> RedBlackTreeSetSync<T>

impl<T> RedBlackTreeSet<T>

where T: Ord,

pub fn new() -> RedBlackTreeSet<T>

impl<T, P> RedBlackTreeSet<T, P>

where T: Ord, P: SharedPointerKind,

pub fn new_with_ptr_kind() -> RedBlackTreeSet<T, P>

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

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

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

where T: Borrow<V>, V: Ord + ?Sized,

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

where T: Borrow<V>, V: Ord + ?Sized,

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

where T: Borrow<V>, V: Ord + ?Sized,

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

where T: Borrow<V>, V: Ord + ?Sized,

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

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

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

where PO: SharedPointerKind,

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

where PO: SharedPointerKind,

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

where PO: SharedPointerKind,

pub fn size(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn range<Q, RB>(&self, range: RB) -> RangeIter<'_, T, RB, Q, P>

where T: Borrow<Q>, Q: Ord + ?Sized, 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.

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

Performs copy-assignment from source.

impl<T, P> Debug for RedBlackTreeSet<T, P>

where T: Ord + Debug, P: SharedPointerKind + Debug,

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> 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<T, P: SharedPointerKind> Hash for RedBlackTreeSet<T, P>

where T: Ord + Hash,

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

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 = 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: 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.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

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

Tests for self and other values to be equal, and is used by ==.

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

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

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.

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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.

impl<T, P> Eq for RedBlackTreeSet<T, P>

where T: Ord, P: SharedPointerKind,