IterativeGraphWalker

Constructors

Link copied to clipboard

Functions

Link copied to clipboard
Link copied to clipboard
Link copied to clipboard
fun iterate(root: Node)

The core iterative AST traversal algorithm: In a depth-first way we descend into the tree, providing callbacks for graph modification.

Link copied to clipboard
Link copied to clipboard
Link copied to clipboard

Properties

Link copied to clipboard
var backlog: Deque<Node>? = null