Struct concurrent_map::ConcurrentMap

pub struct ConcurrentMap<K, V>where
    K: 'static + Debug + Minimum + Ord + Send + Sync,
    V: 'static + Debug + Send + Sync,{ /* private fields */ }

A lock-free B+ tree.

If you want to use a custom key type, you must implement the concurrent_map::Minimum trait, allowing the left-most side of the tree to be created before inserting any data.

Implementations

impl<K, V> ConcurrentMap<K, V>where
    K: 'static + Debug + Minimum + Ord + Send + Sync,
    V: 'static + Debug + Send + Sync,

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

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

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

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

pub fn range<'a, R: RangeBounds<K>>(&'a mut self, range: R) -> Iter<'a, K, V, R>

Trait Implementations

impl<K: Clone, V: Clone> Clone for ConcurrentMap<K, V>where
    K: 'static + Debug + Minimum + Ord + Send + Sync,
    V: 'static + Debug + Send + Sync,

fn clone(&self) -> ConcurrentMap<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Default for ConcurrentMap<K, V>where
    K: 'static + Debug + Minimum + Ord + Send + Sync,
    V: 'static + Debug + Send + Sync,

fn default() -> ConcurrentMap<K, V>

Returns the “default value” for a type.