Struct avl::set::AvlTreeSet

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

An ordered set implemented with an AVL tree.

use avl::AvlTreeSet;
let mut set = AvlTreeSet::new();
set.insert(0);
set.insert(1);
set.insert(2);
assert_eq!(set.get(&1), Some(&1));
set.remove(&1);
assert!(set.get(&1).is_none());

Implementations

impl<T: Ord> AvlTreeSet<T>

pub fn new() -> Self

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

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 contains(&self, value: &T) -> bool

Returns true if the set contains a 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.

pub fn append(&mut self, other: &mut Self)

Moves all values from other into self, leaving other empty.

pub fn range<R: RangeBounds<T>>(&self, range: R) -> Range<'_, T>

Gets an iterator over a sub-range of values in the set in sorted order.

impl<T> AvlTreeSet<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(&self) -> Iter<'_, T>

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

Trait Implementations

impl<T: Clone> Clone for AvlTreeSet<T>

fn clone(&self) -> AvlTreeSet<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for AvlTreeSet<T>

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

Formats the value using the given formatter.

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

fn default() -> Self

Creates an empty set.

impl<T: Eq> Eq for AvlTreeSet<T>

impl<'a, T> Extend<&'a T> for AvlTreeSet<T> where
    T: Ord + Copy,
    T: 'a, 

fn extend<I>(&mut self, iter: I) where
    I: IntoIterator<Item = &'a T>, 

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<T> for AvlTreeSet<T> where
    T: Ord + Copy, 

fn extend<I>(&mut self, iter: I) where
    I: IntoIterator<Item = T>, 

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T: Ord> FromIterator<T> for AvlTreeSet<T>

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

Creates a value from an iterator.

impl<'a, T> IntoIterator for &'a AvlTreeSet<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 AvlTreeSet<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.

impl<T: Ord> Ord for AvlTreeSet<T>

fn cmp(&self, other: &AvlTreeSet<T>) -> Ordering

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq<AvlTreeSet<T>> for AvlTreeSet<T>

fn eq(&self, other: &AvlTreeSet<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &AvlTreeSet<T>) -> bool

This method tests for !=.

impl<T: PartialOrd> PartialOrd<AvlTreeSet<T>> for AvlTreeSet<T>

fn partial_cmp(&self, other: &AvlTreeSet<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &AvlTreeSet<T>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &AvlTreeSet<T>) -> bool

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

fn gt(&self, other: &AvlTreeSet<T>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &AvlTreeSet<T>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> StructuralEq for AvlTreeSet<T>

impl<T> StructuralPartialEq for AvlTreeSet<T>