Struct v_trie::Trie

pub struct Trie<K: Eq + Clone, V> { /* private fields */ }

compressed prefix tree

holds arbitrary values, uses string keys common slices of stored keys are compressed by not storing duplicates of those common slices.

Implementations

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

pub fn new() -> Self

constructs an empty prefix tree

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

gets the value of a key as mutable

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

checks if a key exists

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

sets a key to a value returns the key evicted if there was already a key.

pub fn try_put(&mut self, key: &[K], val: V) -> Result<(), KeyExistsError>

sets a key to a value returns an Err() if the key already existed.

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

removes a key

Ok() if key existed, Err() otherwise

pub fn size(&self) -> usize

Gets the size of the tree in terms of nodes.

impl<V> Trie<u8, V>

pub fn put_str(&mut self, key: &str, val: V) -> Option<V>

Puts a value in with a certain string key. The old value is ejected if it exists.

pub fn try_put_str(&mut self, key: &str, val: V) -> Result<(), KeyExistsError>

Puts a value in with a certain string key. Errors if there is already a value for the given string.

pub fn get_str(&mut self, key: &str) -> Option<&V>

Gets a reference to the value associated to the bytes of a given string key.

pub fn get_mut_str(&mut self, key: &str) -> Option<&mut V>

Gets a mutable reference to the value associated to the bytes of a given string key.

pub fn has_str(&mut self, key: &str) -> bool

Checks if a given string key is associated to a value.

pub fn remove_str(&mut self, key: &str) -> Result<V, KeyNotFoundError>

Removes a given string key from the Trie.

Trait Implementations

impl<K: Debug + Eq + Clone, V: Debug> Debug for Trie<K, V>

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

Formats the value using the given formatter.

impl<K: PartialEq + Eq + Clone, V: PartialEq> PartialEq<Trie<K, V>> for Trie<K, V>

fn eq(&self, other: &Trie<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 !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Eq + Eq + Clone, V: Eq> Eq for Trie<K, V>

impl<K: Eq + Clone, V> StructuralEq for Trie<K, V>

impl<K: Eq + Clone, V> StructuralPartialEq for Trie<K, V>