Struct ZipTree 

pub struct ZipTree<K, V> { /* private fields */ }

Tarjan’s zip tree implementation.

The ZipTree API mimics the standard library’s BTreeMap. It provides look-ups, insertions, deletions and iterator interface. Cloning this tree will deep copy overall tree structure, and thus takes O(n) time.

Implementations

impl<K, V> ZipTree<K, V>

where K: Ord,

pub fn new() -> ZipTree<K, V>

pub fn len(&self) -> usize

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

where K: Borrow<Q>, Q: Ord + ?Sized,

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

where K: Borrow<Q>, Q: Ord + ?Sized,

pub fn contains_key<Q>(&self, key: &Q) -> bool

where K: Borrow<Q>, Q: Ord + ?Sized,

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

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

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

where K: Borrow<Q>, Q: Ord + ?Sized,

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

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

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

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

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

Trait Implementations

impl<K: Clone, V: Clone> Clone for ZipTree<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

fn drop(&mut self)

Executes the destructor for this type.

impl<K, V, Q> Index<&Q> for ZipTree<K, V>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

type Output = V

The returned type after indexing.

fn index(&self, key: &Q) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K, V, Q> IndexMut<&Q> for ZipTree<K, V>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

fn index_mut<'a>(&'a mut self, key: &Q) -> &'a mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<K, V> IntoIterator for ZipTree<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.