26 class path_node_stack;
87 path_node_stack *_stack;
Root object for any class that knows its own name.
Outcomes describe the state of completion for an operation.
An object representing the interstitial cell in most linked data structures.
A method for tracing a route from a tree's root to a particular node.
bool generate_path(node *to_locate, path &to_follow) const
finds the way to get from the root to the "to_locate" node.
path & operator=(const path &to_copy)
node * root() const
returns the relative root node for this path.
int size() const
returns the number of items in the path.
node * follow() const
Returns the node specified by this path.
path(const node *root)
the path is relative to the "root" node.
DEFINE_CLASS_NAME("path")
basis::outcome push(node *to_add)
puts the node "to_add" on the top of the stack.
node * operator[](int index) const
returns the node stored at "index", or NULL_POINTER if "index" is invalid.
node * pop()
returns the top node on the path stack.