Struct geo_booleanop::splay::SplayTree

pub struct SplayTree<K, V, C> where
    C: Fn(&K, &K) -> Ordering,  { /* fields omitted */ }

Methods

impl<K, V, C> SplayTree<K, V, C> where     C: Fn(&K, &K) -> Ordering,

pub fn new(comparator: C) -> SplayTree<K, V, C>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

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

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

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

Return a mutable reference to the value corresponding to the key

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

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

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

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

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

pub fn min(&self) -> Option<&K>

pub fn max(&self) -> Option<&K>

Trait Implementations

impl<K, V, C> IntoIterator for SplayTree<K, V, C> where     C: Fn(&K, &K) -> Ordering,

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.

impl<K, V, C> Extend<(K, V)> for SplayTree<K, V, C> where     C: Fn(&K, &K) -> Ordering,

fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, i: I)

Extends a collection with the contents of an iterator.

impl<K, V, C> Drop for SplayTree<K, V, C> where     C: Fn(&K, &K) -> Ordering,

fn drop(&mut self)

Executes the destructor for this type.

impl<K, V, C> Debug for SplayTree<K, V, C> where     K: Debug,     V: Debug,     C: Fn(&K, &K) -> Ordering,

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

Formats the value using the given formatter.

impl<'a, K, V, C> Index<&'a K> for SplayTree<K, V, C> where     C: Fn(&K, &K) -> Ordering,

type Output = V

The returned type after indexing.

fn index(&self, index: &'a K) -> &V

Performs the indexing (container[index]) operation.

impl<'a, K, V, C> IndexMut<&'a K> for SplayTree<K, V, C> where     C: Fn(&K, &K) -> Ordering,

fn index_mut(&mut self, index: &K) -> &mut V

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