forked from sahib/brig
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.go
222 lines (182 loc) · 3.94 KB
/
tree.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
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
package cmd
import (
"fmt"
"sort"
"strings"
"unicode"
"github.com/fatih/color"
"github.com/sahib/brig/client"
)
var (
treeRunePipe = "│"
treeRuneTri = "├"
treeRuneBar = "──"
treeRuneCorner = "└"
)
type treeNode struct {
name string
order []*treeNode
children map[string]*treeNode
isLast bool
parent *treeNode
depth int
entry client.StatInfo
}
type treeCfg struct {
showPin bool
format func(n *treeNode) string
}
// This is a very stripped down version of util.Trie.Insert()
// but with support for ordering the elements.
func (n *treeNode) Insert(entry client.StatInfo) {
parts := strings.Split(entry.Path, "/")
if len(parts) > 0 && parts[0] == "" {
parts = parts[1:]
}
curr := n
currParts := []string{""}
for depth, name := range parts {
if curr.children == nil {
curr.children = make(map[string]*treeNode)
}
currParts = append(currParts, name)
currPath := strings.Join(currParts, "/")
child, ok := curr.children[name]
if !ok {
childEntry := entry
if currPath != entry.Path {
childEntry = client.StatInfo{
IsPinned: false,
Path: currPath,
}
}
child = &treeNode{
name: name,
depth: depth + 1,
entry: childEntry,
}
child.isLast = true
if len(curr.order) > 0 {
curr.order[len(curr.order)-1].isLast = false
}
child.parent = curr
curr.children[name] = child
curr.order = append(curr.order, child)
}
curr = child
}
}
func (n *treeNode) Len() int {
return len(n.order)
}
func (n *treeNode) Swap(i, j int) {
n.order[i], n.order[j] = n.order[j], n.order[i]
// This is not very clever, but works and is obvious:
n.order[i].isLast = i == len(n.order)-1
n.order[j].isLast = j == len(n.order)-1
}
func (n *treeNode) Less(i, j int) bool {
// Sort case insensitive.
iRunes := []rune(n.order[i].name)
jRunes := []rune(n.order[j].name)
for idx := 0; idx < len(iRunes) && idx < len(jRunes); idx++ {
ir := iRunes[idx]
jr := jRunes[idx]
lir := unicode.ToLower(ir)
ljr := unicode.ToLower(jr)
if lir != ljr {
return lir < ljr
}
if ir != jr {
return ir < jr
}
}
return false
}
func (n *treeNode) Print(cfg *treeCfg) {
parents := make([]*treeNode, n.depth)
curr := n
sort.Sort(n)
// You could do probably go upwards and print to
// a string buffer for performance, but this is probably
// not necessary/critical here.
for i := 0; i < n.depth; i++ {
parents[n.depth-i-1] = curr
curr = curr.parent
}
for i := 0; i < n.depth; i++ {
if i == n.depth-1 {
if n.isLast {
fmt.Printf("%s", treeRuneCorner)
} else {
fmt.Printf("%s", treeRuneTri)
}
} else {
if parents[i].isLast {
fmt.Printf("%s ", " ")
} else {
fmt.Printf("%s ", treeRunePipe)
}
}
}
// Default to an auto-formatter:
format := cfg.format
if format == nil {
format = func(n *treeNode) string {
switch {
case n.name == "/":
return color.MagentaString("•")
case n.entry.IsDir:
return " " + color.GreenString(n.name+"/")
}
return " " + n.name
}
}
prefix := treeRuneBar
if n.name == "/" {
prefix = ""
}
formatted := format(n)
pinState := ""
if cfg.showPin && n.entry.IsPinned {
pinState += " " + color.CyanString("🖈")
}
fmt.Printf("%s%s%s\n", prefix, formatted, pinState)
for _, child := range n.order {
child.Print(cfg)
}
}
func showTree(entries []client.StatInfo, cfg *treeCfg) {
root := &treeNode{name: "/"}
nfiles, ndirs := 0, 0
hasRoot := false
for _, entry := range entries {
if entry.Path == "/" {
root.entry = entry
hasRoot = true
} else {
root.Insert(entry)
}
if entry.IsDir {
ndirs++
} else {
nfiles++
}
}
if !hasRoot {
root.entry = client.StatInfo{
Path: "/",
}
}
root.Print(cfg)
// Speak understandable english:
dirLabel := "directories"
if ndirs == 1 {
dirLabel = "directory"
}
fileLabel := "files"
if nfiles == 1 {
fileLabel = "file"
}
fmt.Printf("\n%d %s, %d %s\n", ndirs, dirLabel, nfiles, fileLabel)
}