Enum Tree 

pub enum Tree<T> {
    Node(HashMap<String, Tree<T>>),
    Leaf(T),
}

Generic type for a string-indexed tree.

Variants

Node(HashMap<String, Tree<T>>)

Leaf(T)

Implementations

impl<T> Tree<T>

pub fn map<U, F>(self, f: F) -> Tree<U>

where F: Fn(T) -> U,

Map every leaf element with a function, consuming this tree and returning a new one with the same structure.

pub fn map_with_path<U, F>(self, f: F) -> Tree<U>

where F: Fn(T, &Vec<String>) -> U,

Like map, but gives you an argument containing the leaf’s path.

pub fn _map_with_path<U, F>(self, f: Rc<F>, path: &mut Vec<String>) -> Tree<U>

where F: Fn(T, &Vec<String>) -> U,

pub fn zip<U>(self, tree: Tree<U>) -> Tree<(T, U)>

pub fn get<'a>(&'a self, path: &Vec<String>) -> Option<&'a Self>

Get a reference to a node in the tree at the given path.

pub fn get_leaf<'a>(&'a self, path: &Vec<String>) -> Option<&'a T>

Get a reference to a leaf in the tree at the given path.

pub fn get_mut<'a>(&'a mut self, path: &Vec<String>) -> Option<&'a mut Self>

Get a mutable reference to a node in the tree at the given path.

pub fn insert( &mut self, path: Vec<String>, tree: Tree<T>, allow_overwrite: bool, ) -> bool

Insert a subtree into the tree at the given path.

Returns whether the operation completed successfully - will fail if the insertion would have to override a preexisting part of the tree.

pub fn contains_leaf(&self, path: &Vec<String>) -> bool

Return whether the tree contains a leaf at the given path.

pub fn remove(&mut self, path: &Vec<String>) -> Option<Self>

Remove the subtree at the given path. Returns the removed subtree, if one exists.

pub fn is_dead(&self) -> bool

Return whether this tree is “dead” (has no leaves).

impl<T, E> Tree<Result<T, E>>

pub fn transpose(self) -> Result<Tree<T>, E>

Turns a Tree<Result<T, E>> into a Result<Tree, Vec>.

Only one error is returned. Multiple may have been generated, but whichever one is reached first gets returned.

impl<T> Tree<Option<T>>

pub fn prune(self) -> Tree<T>

Turn a tree of Option into a tree of T by pruning None leaves.

impl<T> Tree<HashMap<String, T>>

pub fn get_leaf_ext<'a>(&'a self, path: &Vec<String>) -> Option<&'a T>

Get the “leaf of a leaf” from a tree.

impl<T> Tree<BTreeMap<String, T>>

pub fn get_leaf_ext<'a>(&'a self, path: &Vec<String>) -> Option<&'a T>

Get the “leaf of a leaf” from a tree.

impl Tree<Namespace>

pub fn advance_path( &self, rel: &Vec<String>, abs: &Vec<String>, ) -> Option<(Vec<String>, Vec<String>)>

Get an item given an absolute path. Advance a relative path as far as possible.

Two paths are returned: the resulting absolute path and the remainder of the relative path, which may be needed to index into the resulting item.

impl Tree<Namespace>

pub fn build_ty(&self, ty_expr: &TyExpression, abs: &Vec<String>) -> CResult<Ty>

Trait Implementations

impl<T: Clone> Clone for Tree<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Tree<T>

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

Formats the value using the given formatter.

impl ToTokens for Tree<Option<String>>

fn to_tokens(&self, tokens: &mut TokenStream)

Write self to the given TokenStream.

fn to_token_stream(&self) -> TokenStream

Convert self directly into a TokenStream object.

fn into_token_stream(self) -> TokenStream

where Self: Sized,

Convert self directly into a TokenStream object.