Struct transact::scheduler::parallel::tree::RadixTree

pub struct RadixTree<T> { /* fields omitted */ }

Methods

impl<T: Clone> RadixTree<T>

This radix tree is a prefix tree: a node's address is always a strict prefix of the addresses of its children, and every node either has data or has multiple children.

pub fn new() -> Self

pub fn walk(&self, address: &str) -> Vec<(String, Option<T>)>

Return a vector of tuple pairs of node addresses and data The Node address is the key, the data is the value. First the ancestors of ADDRESS (including self) are yielded, earliest to latest, and then the descendants of ADDRESS are yielded

pub fn update(
    &self,
    address: &str,
    updater: &dyn Fn(Option<T>) -> Option<T>,
    prune: bool
)

Walk to ADDRESS, creating nodes if necessary, and set the data there to UPDATER(data)

pub fn prune(&self, address: &str)

Remove all children (and descendants) below ADDRESS

Trait Implementations

impl<T: Default> Default for RadixTree<T>

fn default() -> RadixTree<T>

Returns the "default value" for a type.

impl<T: Clone> Clone for RadixTree<T>

fn clone(&self) -> RadixTree<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for RadixTree<T>

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

Formats the value using the given formatter.