1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
package query
type Node struct {
Parent *Node
Children []*Node
Token
}
type AST struct {
root Node
size uint64
}
// Walk an ast depth first
func (T AST) dfWalk() func() (*Node, bool) {
stack := nodeStack{make([]*Node, 0, T.size)}
stack.Push(&T.root)
return func() (*Node, bool) {
n := stack.Pop()
for _, child := range n.Children {
stack.Push(child)
}
if stack.IsEmpty() {
return n, false
}
return n, true
}
}
// Walk an ast breadth first
func (T AST) bfWalk() func() (*Node, bool) {
queue := nodeQueue{}
queue.buf = make([]*Node, 0, T.size)
queue.Enqueue(&T.root)
return func() (*Node, bool) {
n, err := queue.Dequeue()
if err != nil {
return nil, false
}
for _, child := range n.Children {
queue.Enqueue(child)
}
return n, true
}
}
|
