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

IterativeGraphWalker

class IterativeGraphWalker

Constructors

constructor()

Properties

strategy

var strategy: (Node) -> Iterator<Node>

Functions

iterate

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

fun registerOnNodeVisit(callback: Callback)

Registers a Callback.

registerReplacement

fun registerReplacement(from: Node, to: Node)

Sometimes during walking the graph, we are replacing the current node. This causes problems, that the walker still assumes the old node. Calling this function will ensure that the walker knows about the new node.