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.Items != nil { |
| 52 | v.EnterChildList("Items", n) |
| 53 | for _, nn := range n.Items { |
| 54 | if nn != nil { |
| 55 | nn.Walk(v) |
| 56 | } |
| 57 | } |
| 58 | v.LeaveChildList("Items", n) |
| 59 | } |
| 60 | |
| 61 | v.LeaveNode(n) |
| 62 | } |
nothing calls this directly
no test coverage detected