Walk traverses nodes Walk is invoked recursively until v.EnterNode returns true
(v walker.Visitor)
| 48 | // Walk traverses nodes |
| 49 | // Walk is invoked recursively until v.EnterNode returns true |
| 50 | func (n *StaticCall) Walk(v walker.Visitor) { |
| 51 | if v.EnterNode(n) == false { |
| 52 | return |
| 53 | } |
| 54 | |
| 55 | if n.Class != nil { |
| 56 | v.EnterChildNode("Class", n) |
| 57 | n.Class.Walk(v) |
| 58 | v.LeaveChildNode("Class", n) |
| 59 | } |
| 60 | |
| 61 | if n.Call != nil { |
| 62 | v.EnterChildNode("Call", n) |
| 63 | n.Call.Walk(v) |
| 64 | v.LeaveChildNode("Call", n) |
| 65 | } |
| 66 | |
| 67 | if n.ArgumentList != nil { |
| 68 | v.EnterChildNode("ArgumentList", n) |
| 69 | n.ArgumentList.Walk(v) |
| 70 | v.LeaveChildNode("ArgumentList", n) |
| 71 | } |
| 72 | |
| 73 | v.LeaveNode(n) |
| 74 | } |
nothing calls this directly
no test coverage detected