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