Walk traverses nodes Walk is invoked recursively until v.EnterNode returns true
(v walker.Visitor)
| 44 | // Walk traverses nodes |
| 45 | // Walk is invoked recursively until v.EnterNode returns true |
| 46 | func (n *Array) Walk(v walker.Visitor) { |
| 47 | if v.EnterNode(n) == false { |
| 48 | return |
| 49 | } |
| 50 | |
| 51 | if n.Expr != nil { |
| 52 | v.EnterChildNode("Expr", n) |
| 53 | n.Expr.Walk(v) |
| 54 | v.LeaveChildNode("Expr", n) |
| 55 | } |
| 56 | |
| 57 | v.LeaveNode(n) |
| 58 | } |
nothing calls this directly
no test coverage detected