Struct TreeSet 

pub struct TreeSet<K>(/* private fields */)
where
    K: Clone + Ord;

Implementations

impl<K> TreeSet<K>

where K: Clone + Ord,

pub fn from_ordered_entries(entries: impl IntoIterator<Item = K>) -> Self

pub fn is_empty(&self) -> bool

pub fn insert(&mut self, key: K)

pub fn remove(&mut self, key: &K) -> bool

pub fn extend(&mut self, iter: impl IntoIterator<Item = K>)

pub fn contains(&self, key: &K) -> bool

pub fn iter(&self) -> impl Iterator<Item = &K> + '_

pub fn iter_from<'a>(&'a self, key: &K) -> impl Iterator<Item = &'a K> + 'a

Trait Implementations

impl<K> Clone for TreeSet<K>

where K: Clone + Ord + Clone,

fn clone(&self) -> TreeSet<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K> Debug for TreeSet<K>

where K: Clone + Ord + Debug,

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

Formats the value using the given formatter.

impl<K> Default for TreeSet<K>

where K: Clone + Ord,

fn default() -> Self

Returns the “default value” for a type.

impl<K> PartialEq for TreeSet<K>

where K: Clone + Ord + PartialEq,

fn eq(&self, other: &TreeSet<K>) -> 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<K> Eq for TreeSet<K>

where K: Clone + Ord + Eq,

impl<K> StructuralPartialEq for TreeSet<K>

where K: Clone + Ord,