Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 20 additions & 7 deletions internal/engine/utils.go
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,14 @@ func IsTrivialLeaf(n *treesitter.ASTNode) bool {

// Returns all descendants in the subtree, excluding n itself.
func Descendants(n *treesitter.ASTNode) []*treesitter.ASTNode {
var out []*treesitter.ASTNode
if n == nil {
return nil
}
size := n.Size()
if size <= 1 {
return nil
}
out := make([]*treesitter.ASTNode, 0, size-1)
collectDescendants(n, &out)
return out
}
Expand Down Expand Up @@ -137,12 +144,14 @@ func PostOrder(n *treesitter.ASTNode) []*treesitter.ASTNode {
if n == nil {
return nil
}
var out []*treesitter.ASTNode
return appendPostOrder(make([]*treesitter.ASTNode, 0, n.Size()), n)
}

func appendPostOrder(out []*treesitter.ASTNode, n *treesitter.ASTNode) []*treesitter.ASTNode {
for _, c := range n.Children {
out = append(out, PostOrder(c)...)
out = appendPostOrder(out, c)
}
out = append(out, n)
return out
return append(out, n)
}

// PreOrder returns all nodes in the subtree rooted at n
Expand All @@ -152,9 +161,13 @@ func PreOrder(n *treesitter.ASTNode) []*treesitter.ASTNode {
if n == nil {
return nil
}
out := []*treesitter.ASTNode{n}
return appendPreOrder(make([]*treesitter.ASTNode, 0, n.Size()), n)
}

func appendPreOrder(out []*treesitter.ASTNode, n *treesitter.ASTNode) []*treesitter.ASTNode {
out = append(out, n)
for _, c := range n.Children {
out = append(out, PreOrder(c)...)
out = appendPreOrder(out, c)
}
return out
}
Expand Down
6 changes: 6 additions & 0 deletions internal/engine/utils_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -173,6 +173,9 @@ func TestStructureIsomorphic(t *testing.T) {
}

func TestPostOrder(t *testing.T) {
if PostOrder(nil) != nil {
t.Error("PostOrder(nil) should return nil")
}
leaf := testutil.Leaf("id", "x")
root := testutil.Node("call", "", leaf)
order := PostOrder(root)
Expand All @@ -186,6 +189,9 @@ func TestPostOrder(t *testing.T) {
}

func TestPreOrder(t *testing.T) {
if PreOrder(nil) != nil {
t.Error("PreOrder(nil) should return nil")
}
leaf := testutil.Leaf("id", "x")
root := testutil.Node("call", "", leaf)
order := PreOrder(root)
Expand Down
Loading