/
gtx.go
80 lines (65 loc) · 1.42 KB
/
gtx.go
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
package main
import (
"github.com/simulatedsimian/neo"
"os"
"path/filepath"
)
type nodeData struct {
path string
info os.FileInfo
}
func createNodes(rootPath string, parent *treeNode) ([]*treeNode, error) {
var res []*treeNode
err := filepath.Walk(rootPath, func(path string, info os.FileInfo, err error) error {
if err == nil && path != rootPath {
res = append(res, newTreeNode(parent, len(res), nodeData{path, info}))
if info.IsDir() {
return filepath.SkipDir
}
}
return nil
})
return res, err
}
func populateChildren(node *treeNode) error {
if node.data.(nodeData).info.IsDir() {
children, err := createNodes(node.data.(nodeData).path, node)
neo.PanicOnError(err)
node.children = children
node.expanded = true
}
return nil
}
func nodeToStrings(node *treeNode) (string, string) {
preamble := ""
for n := node; n.parent != nil; n = n.parent {
if n.parent.isLast() {
preamble = " " + preamble
} else {
preamble = "│ " + preamble
}
}
if node.isLast() {
preamble += "└─"
} else {
preamble += "├─"
}
if node.data.(nodeData).info.IsDir() {
if node.expanded {
preamble += "[-]"
} else {
preamble += "[+]"
}
} else {
preamble += "── "
}
return preamble, node.data.(nodeData).info.Name()
}
func filltree(nodes []*treeNode) {
for _, node := range nodes {
populateChildren(node)
if len(node.children) > 0 {
filltree(node.children)
}
}
}