4 (container nodal-tree)
4.1 Overview
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.
4.2 Usage
— Function:
nodal-tree? x
Predicate to determine if x is a nodal tree. Not particularly efficient:
intended for debugging purposes.
— Function:
make-node . attributes
— Function:
node-ref node name
— Function:
node-set! node name val
— Function:
node-children node