Struct ConcurrentBTreeMap 

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

A concurrent map that can be used to store key-value pairs in a sorted order.

Examples

use handy::collections::{ConcurrentBTreeMap, Map};

let map: ConcurrentBTreeMap<usize, u32> = ConcurrentBTreeMap::new();

Errors

• ConcurrentCollectionError::Poison: The lock is poisoned

Trait Implementations

impl<K: Debug, V: Debug> Debug for ConcurrentBTreeMap<K, V>

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

Formats the value using the given formatter.

impl<K, V> Default for ConcurrentBTreeMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> Map<K, V> for ConcurrentBTreeMap<K, V>

where K: Eq + Ord + Send + Sync, V: Copy,

fn new() -> Self

Creates a new concurrent map.

Examples

use handy::collections::{ConcurrentBTreeMap, Map};

let map: ConcurrentBTreeMap<usize, u32> = ConcurrentBTreeMap::new();

fn insert(&self, key: K, value: V) -> Result<(), ConcurrentCollectionError>

Inserts a key-value pair into the map.

Examples

use handy::collections::{ConcurrentBTreeMap, Map};

let map: ConcurrentBTreeMap<usize, u32> = ConcurrentBTreeMap::new();

map.insert(1, 2).unwrap();

Errors

• ConcurrentCollectionError::Poison: The lock is poisoned

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

Retrieves the value associated with the specified key.

Examples

use handy::collections::{ConcurrentBTreeMap, Map};

let map: ConcurrentBTreeMap<usize, u32> = ConcurrentBTreeMap::new();

if let Some(value) = map.get(&1) {
    // do something
}

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

Checks if the map contains the specified key.

Examples

use handy::collections::{ConcurrentBTreeMap, Map};

let map: ConcurrentBTreeMap<usize, u32> = ConcurrentBTreeMap::new();

if map.contains_key(&1) {
    // do something
}

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

Removes the value associated with the specified key.

Examples

use handy::collections::{ConcurrentBTreeMap, Map};

let map: ConcurrentBTreeMap<usize, u32> = ConcurrentBTreeMap::new();

map.remove(&1).unwrap();

fn len(&self) -> usize

Returns the number of key-value pairs in the map.

Example

use handy::collections::{ConcurrentBTreeMap, Map};

let map: ConcurrentBTreeMap<usize, u32> = ConcurrentBTreeMap::new();

map.insert(1, 2).unwrap();
assert_eq!(map.len(), 1);

fn is_empty(&self) -> bool

Checks if the map is empty.

Example

use handy::collections::{ConcurrentBTreeMap, Map};

let map: ConcurrentBTreeMap<usize, u32> = ConcurrentBTreeMap::new();

map.insert(1, 2).unwrap();
assert!(!map.is_empty());