Module trees::linked::fully

Tree/Forest implemented in last-child/next-sibling Nodes, allocated on heap, with size information tracked.

Re-exports

pub use self::tree::Tree;

pub use self::forest::Forest;

pub use self::node::Node;

pub use self::notation::tr;

pub use self::notation::fr;

pub use self::iter::Iter;

pub use self::iter::IterMut;

pub use self::onto_iter::Subnode;

pub use self::onto_iter::OntoIter;

pub use self::walk::Visit;

pub use self::walk::TreeWalk;

pub use self::walk::ForestWalk;

Modules

forest

Forest composed of disjoint Trees.

heap

Dynamic allocation/deallocation on heap.

iter

node

Tree node implementation.

notation

Operator overloading of - and / for constructing tree expression.

onto_iter

A full functional mutable iterator implementation with the extra ability of inserting/removing Node at any position than IterMut.

tree

Tree composed of hierarchical Nodes.

walk

Walk on Tree/Node or Forest.