Struct SortedSet 

pub struct SortedSet { /* private fields */ }

An immutable sorted set backed by rpds::RedBlackTreeSet.

A set derived by conj or disj from a GC-allocated set reports only its path-copied nodes from gc_size_extra; see collections::share_charge for the full rule.

Implementations

impl SortedSet

pub fn empty() -> Self

pub fn count(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn contains(&self, value: &Value) -> bool

pub fn conj(&self, value: Value) -> Self

Return a new set with val added.

pub fn conj_mut(&mut self, value: Value) -> &mut Self

pub fn disj(&self, value: &Value) -> Self

Return a new set with val removed.

pub fn iter(&self) -> impl Iterator<Item = &Value>

Iterate over all elements in sorted order

Trait Implementations

impl Clone for SortedSet

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortedSet

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

Formats the value using the given formatter.

impl FromIterator<Value> for SortedSet

fn from_iter<I: IntoIterator<Item = Value>>(iter: I) -> Self

Creates a value from an iterator.

impl PartialEq for SortedSet

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Trace for SortedSet

fn trace(&self, visitor: &mut MarkVisitor)

fn gc_size_extra(&self) -> usize