query

Module nu.tree.query.

Tree queries -- read-only inspection of Term structures.

Domain-free: predicates and counts over any Term tree.

Name	Call	Meaning
count	`tree.count(root, pred=None)`	Count nodes matching predicate. `None` counts all.
depth	`tree.depth(root)`	Maximum depth. A leaf has depth 0.
find	`tree.find(root, pred)`	Find all nodes matching predicate (pre-order).
find_first	`tree.find_first(root, pred)`	Find first matching node (pre-order), or None.
size	`tree.size(root)`	Total number of nodes.

count

Count nodes matching predicate. None counts all.

tree.count(root, pred=None)

Path nu.tree.count. Defined on nu.tree.query, bound as a function. Builds int.

Arguments

Name	Type	Default	Meaning
`root`	`Nu`
`pred`	`Callable[[Nu], bool] \| None`	`None`

Undocumented: example.

Maximum depth. A leaf has depth 0.

tree.depth(root)

Path nu.tree.depth. Defined on nu.tree.query, bound as a function. Builds int.

Arguments

Name	Type	Default	Meaning
`root`	`Nu`

Undocumented: example.

Find all nodes matching predicate (pre-order).

tree.find(root, pred)

Path nu.tree.find. Defined on nu.tree.query, bound as a function. Builds list[Nu].

Arguments

Name	Type	Default	Meaning
`root`	`Nu`
`pred`	`Callable[[Nu], bool]`

Undocumented: example.

Find first matching node (pre-order), or None.

tree.find_first(root, pred)

Path nu.tree.find_first. Defined on nu.tree.query, bound as a function. Builds Nu | None.

Arguments

Name	Type	Default	Meaning
`root`	`Nu`
`pred`	`Callable[[Nu], bool]`

Undocumented: example.

Total number of nodes.

tree.size(root)

Path nu.tree.size. Defined on nu.tree.query, bound as a function. Builds int.

Arguments

Name	Type	Default	Meaning
`root`	`Nu`

Undocumented: example.