-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtree.go
More file actions
170 lines (156 loc) · 3.57 KB
/
tree.go
File metadata and controls
170 lines (156 loc) · 3.57 KB
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
package main
import (
"fmt"
"strings"
)
type treeNode struct {
name string
isDir bool
children []*treeNode
tokens int
annotation string
showTokens bool
}
type treeLine struct {
prefix string
tokens int
annotation string
isDir bool
showTokens bool
}
func buildTree(filePaths []string, tokenMap map[string]int, modTimeMap map[string]string) *treeNode {
root := &treeNode{isDir: true}
for _, path := range filePaths {
parts := strings.Split(path, "/")
current := root
for i, part := range parts {
isLast := i == len(parts)-1
var child *treeNode
for _, c := range current.children {
if c.name == part {
child = c
break
}
}
if child == nil {
child = &treeNode{
name: part,
isDir: !isLast,
}
if isLast {
child.tokens = tokenMap[path]
if modTime := modTimeMap[path]; modTime != "" {
child.annotation = fmt.Sprintf("[mod: %s]", modTime)
}
child.showTokens = true
}
current.children = append(current.children, child)
}
current = child
}
}
aggregateTokens(root)
return root
}
func buildSinceTree(changes []fileChange, tokenMap map[string]int, statusMap map[string]string) *treeNode {
root := &treeNode{isDir: true}
for _, c := range changes {
parts := strings.Split(c.Path, "/")
current := root
for i, part := range parts {
isLast := i == len(parts)-1
var child *treeNode
for _, ch := range current.children {
if ch.name == part {
child = ch
break
}
}
if child == nil {
child = &treeNode{
name: part,
isDir: !isLast,
}
if isLast {
child.tokens = tokenMap[c.Path]
status := statusMap[c.Path]
child.annotation = fmt.Sprintf("[%s]", status)
child.showTokens = (status != "D")
}
current.children = append(current.children, child)
}
current = child
}
}
aggregateTokens(root)
return root
}
func aggregateTokens(node *treeNode) int {
if !node.isDir {
return node.tokens
}
total := 0
for _, child := range node.children {
total += aggregateTokens(child)
}
node.tokens = total
return total
}
func renderTreeLines(root *treeNode) []treeLine {
var lines []treeLine
renderChildren(root, "", &lines)
return lines
}
func renderChildren(node *treeNode, prefix string, lines *[]treeLine) {
for i, child := range node.children {
isLast := i == len(node.children)-1
connector := "├── "
if isLast {
connector = "└── "
}
name := child.name
if child.isDir {
name += "/"
}
*lines = append(*lines, treeLine{
prefix: prefix + connector + name,
tokens: child.tokens,
annotation: child.annotation,
isDir: child.isDir,
showTokens: child.showTokens,
})
if child.isDir {
childPrefix := prefix + "│ "
if isLast {
childPrefix = prefix + " "
}
renderChildren(child, childPrefix, lines)
}
}
}
func formatTreeOutput(lines []treeLine) string {
maxWidth := 0
for _, l := range lines {
if w := displayWidth(l.prefix); w > maxWidth {
maxWidth = w
}
}
var sb strings.Builder
for _, l := range lines {
sb.WriteString(l.prefix)
padding := maxWidth - displayWidth(l.prefix) + 2
sb.WriteString(strings.Repeat(" ", padding))
if l.isDir {
sb.WriteString(fmt.Sprintf("(~%s tok)", formatNumber(l.tokens)))
} else if !l.showTokens {
sb.WriteString(fmt.Sprintf("(deleted) %s", l.annotation))
} else {
sb.WriteString(fmt.Sprintf("(~%s tok)", formatNumber(l.tokens)))
if l.annotation != "" {
sb.WriteString(fmt.Sprintf(" %s", l.annotation))
}
}
sb.WriteString("\n")
}
return sb.String()
}