-
Notifications
You must be signed in to change notification settings - Fork 3
/
snek.go
74 lines (56 loc) · 1.41 KB
/
snek.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
package snek
import (
"unicode"
stringcase "github.com/reiver/go-stringcase"
)
func DesnekKeysRecursive(in map[string]interface{}) map[string]interface{} {
out := make(map[string]interface{}, len(in))
for k, v := range in {
if m, ok := v.(map[string]interface{}); ok {
out[Desnek(k)] = DesnekKeysRecursive(m)
} else {
out[Desnek(k)] = v
}
}
return out
}
func DesnekKeys(in map[string]interface{}) map[string]interface{} {
out := make(map[string]interface{}, len(in))
for k, v := range in {
out[Desnek(k)] = v
}
return out
}
func Desnek(str string) string {
return stringcase.ToCamelCase(str)
}
func SnekKeysRecursive(in map[string]interface{}) map[string]interface{} {
out := make(map[string]interface{}, len(in))
for k, v := range in {
if m, ok := v.(map[string]interface{}); ok {
out[Snek(k)] = SnekKeysRecursive(m)
} else {
out[Snek(k)] = v
}
}
return out
}
func SnekKeys(in map[string]interface{}) map[string]interface{} {
out := make(map[string]interface{}, len(in))
for k, v := range in {
out[Snek(k)] = v
}
return out
}
func Snek(str string) string {
runes := []rune(str)
length := len(runes)
var out []rune
for i := 0; i < length; i++ {
if i > 0 && unicode.IsUpper(runes[i]) && ((i+1 < length && unicode.IsLower(runes[i+1])) || unicode.IsLower(runes[i-1])) {
out = append(out, '_')
}
out = append(out, unicode.ToLower(runes[i]))
}
return string(out)
}