Expand description
Tree
/Forest
implemented in last-child/next-sibling Node
s, 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
composed of disjoint Tree
s.Dynamic allocation/deallocation on heap.
Tree node implementation.
Operator overloading of
-
and /
for constructing tree expression.A full functional mutable iterator implementation with the extra ability of inserting/removing
Node
at any position than IterMut
.Tree
composed of hierarchical Node
s.Walk on
Tree
/Node
or Forest
.