Struct hash_ord::ord_map::OrdMap

pub struct OrdMap<K, V> where
    K: Ord,  { /* fields omitted */ }

Methods

impl<K, V> OrdMap<K, V> where
    K: Ord, 

pub fn find_cursors<Q>(&mut self, q: &Q) -> Cursors<K, V> where
    K: Borrow<Q>,
    Q: Ord, 

pub fn max_height(&self) -> i32

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn new() -> Self

pub fn clone_from(t: &OrdMap<K, V>) -> Self where
    K: Clone,
    V: Clone, 

pub fn find_node<Q: ?Sized>(&self, q: &Q) -> *mut AVLNode where
    K: Borrow<Q>,
    Q: Ord, 

pub fn check_valid(&self) -> bool

pub fn remove<Q: ?Sized>(&mut self, q: &Q) -> Option<(K, V)> where
    K: Borrow<Q>,
    Q: Ord, 

pub fn contains_key<Q: ?Sized>(&self, q: &Q) -> bool where
    K: Borrow<Q>,
    Q: Ord, 

pub fn get<Q: ?Sized>(&self, q: &Q) -> Option<&V> where
    K: Borrow<Q>,
    Q: Ord, 

pub fn get_mut<Q: ?Sized>(&mut self, q: &Q) -> Option<&mut V> where
    K: Borrow<Q>,
    Q: Ord, 

pub fn clear(&mut self)

pub fn link_post_insert(
    &mut self,
    new_node: *mut AVLNode,
    parent: *mut AVLNode,
    cmp_node_ref: *mut *mut AVLNode
)

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

Important traits for Keys<'a, K, V>

impl<'a, K: Ord, V> Iterator for Keys<'a, K, V> type Item = &'a K;

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

Important traits for Values<'a, K, V>

impl<'a, K: Ord, V> Iterator for Values<'a, K, V> type Item = &'a V;

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

Important traits for ValuesMut<'a, K, V>

impl<'a, K: Ord, V> Iterator for ValuesMut<'a, K, V> type Item = &'a mut V;

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

Important traits for Iter<'a, K, V>

impl<'a, K: Ord + 'a, V: 'a> Iterator for Iter<'a, K, V> type Item = (&'a K, &'a V);

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

Important traits for IterMut<'a, K, V>

impl<'a, K: Ord + 'a, V: 'a> Iterator for IterMut<'a, K, V> type Item = (&'a K, &'a mut V);

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

Trait Implementations

impl<K, V> Drop for OrdMap<K, V> where
    K: Ord, 

fn drop(&mut self)

Executes the destructor for this type.

impl<K, V> Clone for OrdMap<K, V> where
    K: Ord + Clone,
    V: Clone, 

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> PartialEq for OrdMap<K, V> where
    K: Eq + Ord,
    V: PartialEq, 

fn eq(&self, other: &OrdMap<K, V>) -> bool

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<K, V> Eq for OrdMap<K, V> where
    K: Eq + Ord,
    V: Eq, 

impl<'a, K, V> Index<&'a K> for OrdMap<K, V> where
    K: Ord, 

type Output = V

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<K, V> FromIterator<(K, V)> for OrdMap<K, V> where
    K: Ord, 

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> OrdMap<K, V>

Creates a value from an iterator.

impl<K, V> Extend<(K, V)> for OrdMap<K, V> where
    K: Ord, 

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

Extends a collection with the contents of an iterator.

impl<K, V> IntoIterator for OrdMap<K, V> where
    K: Ord, 

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?

Important traits for IntoIter<K, V>

impl<K, V> Iterator for IntoIter<K, V> where
    K: Ord,  type Item = (K, V);

fn into_iter(self) -> IntoIter<K, V>

Creates an iterator from a value.