/
conn_list.go
77 lines (69 loc) · 1.46 KB
/
conn_list.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
package main
import (
"fmt"
"sort"
)
func max(a, b int) int {
if a < b {
return b
}
return a
}
type ConnList []ConnDetails
func (c ConnList) Selections() []string {
kvList := make([]map[string]string, len(c))
keyToMaxWidth := make(map[string]int)
for i, details := range c {
kvList[i] = map[string]string{
"uname": details.Username,
"db": details.Database,
}
keyToMaxWidth["uname"] = max(keyToMaxWidth["uname"], len(details.Username))
keyToMaxWidth["db"] = max(keyToMaxWidth["db"], len(details.Database))
for k, v := range details.Labels {
kvList[i][k] = v
keyToMaxWidth[k] = max(keyToMaxWidth[k], len(v))
}
}
type keywidth struct {
key string
width int
}
keys := make([]keywidth, 0, len(keyToMaxWidth))
for key, width := range keyToMaxWidth {
keys = append(keys, keywidth{key, width})
}
sort.Slice(keys, func(i, j int) bool {
var rank1, rank2 int
switch keys[i].key {
case "db":
rank1 = -2
case "uname":
rank1 = -1
default:
rank1 = keys[i].width
}
switch keys[j].key {
case "db":
rank2 = -2
case "uname":
rank2 = -1
default:
rank2 = keys[j].width
}
return rank1 < rank2
})
var format string
for _, kw := range keys {
format += fmt.Sprintf("%s:%%-%ds ", kw.key, kw.width)
}
out := make([]string, len(c))
for i := range c {
args := make([]interface{}, len(keys))
for j, kw := range keys {
args[j] = kvList[i][kw.key]
}
out[i] = fmt.Sprintf(format, args...)
}
return out
}