Struct AdaptiveRadixTree 

pub struct AdaptiveRadixTree<V> { /* private fields */ }

An adaptive radix tree for string-keyed data.

Implementations

impl<V: Clone> AdaptiveRadixTree<V>

pub fn new() -> Self

Create a new empty tree.

pub fn len(&self) -> usize

Number of entries in the tree.

pub fn is_empty(&self) -> bool

Whether the tree is empty.

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

Insert a key-value pair. Returns the previous value if the key existed.

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

Look up a value by exact key.

pub fn prefix_scan(&self, prefix: &str) -> Vec<(&str, &V)>

Return all key-value pairs whose keys start with the given prefix, sorted by key.

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

Delete a key. Returns the value if it existed.

pub fn iter(&self) -> Vec<(&str, &V)>

Iterate all entries in sorted key order.

pub fn node_distribution(&self) -> NodeDistribution

Get node type distribution for diagnostics.

Trait Implementations

impl<V: Clone> Clone for AdaptiveRadixTree<V>

fn clone(&self) -> AdaptiveRadixTree<V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug> Debug for AdaptiveRadixTree<V>

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

Formats the value using the given formatter.

impl<V: Clone> Default for AdaptiveRadixTree<V>

fn default() -> Self

Returns the “default value” for a type.