Struct prefix_tree::PrefixTreeMap

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

A map implemented with prefix tree.

Methods

impl<K: Eq + Clone, V> PrefixTreeMap<K, V>

pub fn new() -> PrefixTreeMap<K, V>

Creates an empty PrefixTreeMap.

Examples

use prefix_tree::PrefixTreeMap;

let mut map: PrefixTreeMap<u8, i32> = PrefixTreeMap::new();

pub fn contains_key<Q>(&self, key: Q) -> bool where
    Q: AsRef<[K]>, 

Returns true if the map contains a value for the specified key.

Examples

use prefix_tree::PrefixTreeMap;

let mut map: PrefixTreeMap<u8, i32> = PrefixTreeMap::new();
map.insert("foo", 1);
assert_eq!(map.contains_key("foo"), true);
assert_eq!(map.contains_key("bar"), false);

pub fn clear(&mut self)

Clears the map, removing all key-value pairs.

Examples

use prefix_tree::PrefixTreeMap;

let mut map: PrefixTreeMap<u8, i32> = PrefixTreeMap::new();
map.insert("foo", 1);
map.clear();
assert!(map.is_empty());

pub fn get<Q>(&self, key: Q) -> Option<&V> where
    Q: AsRef<[K]>, 

Returns a reference to the value corresponding to the key.

Examples

use prefix_tree::PrefixTreeMap;

let mut map: PrefixTreeMap<u8, i32> = PrefixTreeMap::new();
map.insert("foo", 1);
assert_eq!(map.get("foo"), Some(&1));
assert_eq!(map.get("bar"), None);

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

Returns a mutable reference to the value corresponding to the key.

Examples

use prefix_tree::PrefixTreeMap;

let mut map: PrefixTreeMap<u8, i32> = PrefixTreeMap::new();
map.insert("foo", 1);
if let Some(x) = map.get_mut("foo") {
    *x = 2;
}
assert_eq!(map.get("foo"), Some(&2));

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

Inserts a key-value pair into the map.

Examples

use prefix_tree::PrefixTreeMap;

let mut map: PrefixTreeMap<u8, i32> = PrefixTreeMap::new();
assert_eq!(map.insert("a", 42), None);
assert_eq!(map.is_empty(), false);
assert_eq!(map.insert("a", 5), Some(42));
assert_eq!(map.get("a"), Some(&5));

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Examples

use prefix_tree::PrefixTreeMap;

let mut map: PrefixTreeMap<u8, i32> = PrefixTreeMap::new();
assert_eq!(map.is_empty(), true);
map.insert("foo", 1);
assert_eq!(map.is_empty(), false);

pub fn len(&self) -> usize

Returns the number of elements in the map.

Examples

use prefix_tree::PrefixTreeMap;

let mut map: PrefixTreeMap<u8, i32> = PrefixTreeMap::new();
assert_eq!(map.len(), 0);
map.insert("foo", 1);
assert_eq!(map.len(), 1);

Trait Implementations

impl<K: Clone, V: Clone> Clone for PrefixTreeMap<K, V>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<K: Default, V: Default> Default for PrefixTreeMap<K, V>

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

Returns the "default value" for a type.