Guile Library

(container nodal-tree)

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.

Usage

nodal-tree? a
[Function]

Predicate to determine if x is a nodal tree. Not particularly efficient: intended for debugging purposes.

make-node . rest
[Function]
node-ref a b
[Function]
node-set! a b c
[Function]
node-children a
[Function]