walkAst function
void
walkAst(
- Ast node,
- void visit(
- Ast node
)
)
Implementation
void walkAst(Ast node, void Function(Ast node) visit) {
visit(node);
switch (node) {
case CompNode():
for (final a in node.args) {
walkAst(a, visit);
}
for (final a in node.mappedProps?.values ?? const <Ast>[]) {
walkAst(a, visit);
}
case ArrNode():
for (final e in node.elements) {
walkAst(e, visit);
}
case ObjNode():
for (final (_, v) in node.entries) {
walkAst(v, visit);
}
case BinOpNode():
walkAst(node.left, visit);
walkAst(node.right, visit);
case UnaryOpNode():
walkAst(node.operand, visit);
case TernaryNode():
walkAst(node.condition, visit);
walkAst(node.then, visit);
walkAst(node.otherwise, visit);
case MemberNode():
walkAst(node.object, visit);
case IndexNode():
walkAst(node.object, visit);
walkAst(node.index, visit);
case AssignNode():
walkAst(node.value, visit);
default:
}
}