[−][src]Struct vector_trees::btree::BVecTreeMap

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

Implementations

impl<K: Ord + Debug, V: Debug> BVecTreeMap<Vec<BVecTreeNode<K, V>>, K, V>[src]

pub fn new() -> Self[src]

impl<S: Vector<BVecTreeNode<K, V>>, K: Ord + Debug, V: Debug> BVecTreeMap<S, K, V>[src]

pub fn new_in(buf: S) -> Self[src]

pub fn len(&self) -> usize[src]

pub fn is_empty(&self) -> bool[src]

pub fn clear(&mut self)[src]

pub fn height(&self) -> usize[src]

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

pub fn contains_key(&self, key: &K) -> bool[src]

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

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

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

Trait Implementations

impl<S: Default + Vector<BVecTreeNode<K, V>>, K, V> Default for BVecTreeMap<S, K, V>[src]

Auto Trait Implementations

impl<S, K, V> Send for BVecTreeMap<S, K, V> where
    K: Send,
    S: Send,
    V: Send, 

impl<S, K, V> Sync for BVecTreeMap<S, K, V> where
    K: Sync,
    S: Sync,
    V: Sync, 

impl<S, K, V> Unpin for BVecTreeMap<S, K, V> where
    K: Unpin,
    S: Unpin,
    V: Unpin, 

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.