cpg-core/de.fraunhofer.aisec.cpg.helpers/SubgraphWalker/IterativeGraphWalker

IterativeGraphWalker

open class IterativeGraphWalker

Functions

open fun clearCallbacks()

open fun getTodo(): Deque<Node>

open 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.

registerOnNodeVisit

open fun registerOnNodeVisit(callback: Consumer<Node>)

registerOnNodeVisit2

open fun registerOnNodeVisit2(callback: BiConsumer<Node, Node>)

registerOnScopeExit

open fun registerOnScopeExit(callback: Consumer<Node>)

Properties

open val backlog: Deque<Node>