Like get_recursive_nodes_breadth_first, but follows each child's subtree to the end before moving to the next child.
get_recursive_nodes_depth_first :: (
node: *C.Code_Node,
pointers: *[..] *C.Code_Node
)Parameters
- node: *C.Code_Node
- pointers: *[..] *C.Code_Node
Compiler :: #import "Compiler";
n := Compiler.make_integer_literal(7);
all: [..] *Compiler.Code_Node;
get_recursive_nodes_depth_first(cast(*Compiler.Code_Node) n, *all);
assert(all.count == 1);