Struct avl::AvlTreeSet

pub struct AvlTreeSet<T> { /* fields omitted */ }

A sorted set implemented with a nearly balanced binary search tree.

Implementations

impl<T: Ord> Set<T>

pub fn new() -> Self

Creates an empty set. No memory is allocated until the first item is inserted.

impl<T: Ord> Set<T>

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

Returns a reference to the value in the set that is equal to the given value.

pub fn insert(&mut self, value: T) -> bool

Inserts a value into the set.

pub fn remove(&mut self, value: &T) -> bool

Removes a value from the set. Returns whether the value was previously in the set.

pub fn take(&mut self, value: &T) -> Option<T>

Removes a value from the set. Returns the value if it was previously in the set.

impl<T> Set<T>

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

pub fn len(&self) -> usize

Returns the number of elements in the set.

pub fn clear(&mut self)

Clears the set, deallocating all memory.

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

Gets an iterator over the values of the map in sorted order.

Trait Implementations

impl<T: Debug> Debug for Set<T>

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

Formats the value using the given formatter.

impl<T: Ord> Default for Set<T>

fn default() -> Self

Creates an empty set.

impl<'a, T> IntoIterator for &'a Set<T>

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) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for Set<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.