A nodal tree is a tree composed of nodes, each of which may have children. Nodes are represented as alists. The only alist entry that is specified is children, which must hold a list of child nodes. Other entries are intentionally left unspecified, so as to allow for extensibility.
nodal-tree? x | [Function] |
Predicate to determine if x is a nodal tree. Not particularly efficient: intended for debugging purposes.
make-node . attributes | [Function] |
node-ref node name | [Function] |
node-set! node name val | [Function] |
node-children node | [Function] |