Struct avl::AvlTreeMap

pub struct AvlTreeMap<K, V> { /* fields omitted */ }

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

Implementations

impl<K: Ord, V> Map<K, V>

pub fn new() -> Self

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

pub fn get(&self, key: &K) -> Option<&V>

Returns a reference to the value corresponding to the key.

pub fn get_mut(&mut self, key: &K) -> Option<&mut V>

Returns a mutable reference to the value corresponding to the key.

pub fn get_key_value(&self, key: &K) -> Option<(&K, &V)>

Returns references to the key-value pair corresponding to the key.

pub fn insert(&mut self, key: K, value: V) -> bool

Inserts a key-value pair into the map.

pub fn remove(&mut self, key: &K) -> Option<V>

Removes a key from the map. Returns the value at the key if the key was previously in the map.

pub fn remove_entry(&mut self, key: &K) -> Option<(K, V)>

Removes a key from the map. Returns the stored key and value if the key was previously in the map.

impl<K, V> Map<K, V>

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

pub fn len(&self) -> usize

Returns the number of elements in the map.

pub fn clear(&mut self)

Clears the map, deallocating all memory.

impl<K, V> Map<K, V>

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

Gets an iterator over the entries of the map, sorted by key.

pub fn keys<'a>(&'a self) -> Keys<'a, K, V>

Gets an iterator over the keys of the map, in sorted order.

pub fn values<'a>(&'a self) -> Values<'a, K, V>

Gets an iterator over the values of the map, in order by key.

pub fn values_mut<'a>(&'a self) -> ValuesMut<'a, K, V>

Gets a mutable iterator over the values of the map, in order by key.

pub fn iter_mut<'a>(&'a mut self) -> IterMut<'a, K, V>

Gets a mutable iterator over the entries of the map, sorted by key.

Trait Implementations

impl<K, V> Debug for Map<K, V> where
    K: Debug,
    V: Debug, 

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

Formats the value using the given formatter.

impl<K: Ord, V> Default for Map<K, V>

fn default() -> Self

Creates an empty map.

impl<K, V> Drop for Map<K, V>

fn drop(&mut self)

Executes the destructor for this type.

impl<'a, K, V> IntoIterator for &'a Map<K, V>

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, K, V> IntoIterator for &'a mut Map<K, V>

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V> IntoIterator for Map<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.