-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.go
148 lines (116 loc) · 2.55 KB
/
main.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
package main
import (
"bufio"
"go/token"
"log"
"os"
"sort"
"strings"
"unicode"
"github.com/dave/jennifer/jen"
"github.com/mitchellh/hashstructure"
)
func identifier(id string) string {
words := strings.FieldsFunc(id, func(r rune) bool {
return !unicode.IsLetter(r) && !unicode.IsDigit(r)
})
for i, v := range words {
words[i] = strings.Title(strings.ToLower(v))
}
return strings.Join(words, "")
}
func groupname(x []int) string {
r := make([]rune, len(x))
for i, v := range x {
r[i] = 'A' + rune(v)
}
return string(r)
}
func main() {
// headers
scanner := bufio.NewScanner(os.Stdin)
var headers [][]string
for scanner.Scan() {
headers = append(headers, strings.Split(scanner.Text(), ","))
}
if err := scanner.Err(); err != nil {
log.Fatalf("error reading header from stdin: %s")
}
// fields to header indexes
fields := make(map[string][]int)
for i, header := range headers {
for _, field := range header {
fields[field] = append(fields[field], i)
}
}
// header index group
var groups [][]int
// header index group hash to fields
parts := make(map[uint64][]string)
for k, v := range fields {
hash, err := hashstructure.Hash(v, nil)
if err != nil {
log.Fatal(err)
}
if _, ok := parts[hash]; !ok {
groups = append(groups, v)
}
parts[hash] = append(parts[hash], k)
}
// sort groups
sort.Slice(groups, func(i, j int) bool {
li := len(groups[i])
lj := len(groups[j])
if li == lj {
for x := 0; x < li; x++ {
xi := groups[i][x]
xj := groups[j][x]
if xi != xj {
return xi < xj
}
}
}
// descending, biggest group (most common part) to least
return li > lj
})
// header index to header groups
backrefs := make([][]int, len(headers))
for i, group := range groups {
if len(group) == 1 {
break
}
for _, v := range group {
backrefs[v] = append(backrefs[v], i)
}
}
// output
f := jen.NewFile("main")
for _, v := range groups {
hash, err := hashstructure.Hash(v, nil)
if err != nil {
log.Fatal(err)
}
sort.Strings(parts[hash])
// spew.Dump(parts[hash])
f.Type().Id(groupname(v)).StructFunc(func(g *jen.Group) {
// common parts
if len(v) == 1 {
for _, v := range backrefs[v[0]] {
g.Id(groupname(groups[v]))
}
g.Line()
}
// fields
for _, v := range parts[hash] {
id := identifier(v)
if !token.IsIdentifier(id) {
log.Fatalf("invalid identifier: %q", id)
}
g.Id(id).String().Tag(map[string]string{"csv": v})
}
}).Line()
}
if err := f.Render(os.Stdout); err != nil {
log.Fatal(err)
}
}