-
Notifications
You must be signed in to change notification settings - Fork 19
Expand file tree
/
Copy pathstrings.go
More file actions
133 lines (114 loc) · 2.69 KB
/
Copy pathstrings.go
File metadata and controls
133 lines (114 loc) · 2.69 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
package toolbelt
import "strings"
func Pascal(s string) string {
return toCamel(s, true)
}
func Camel(s string) string {
return toCamel(s, false)
}
func Snake(s string) string {
return strings.ToLower(splitAndJoin(s, "_"))
}
func ScreamingSnake(s string) string {
return strings.ToUpper(splitAndJoin(s, "_"))
}
func Kebab(s string) string {
return strings.ToLower(splitAndJoin(s, "-"))
}
func Upper(s string) string {
return strings.ToUpper(s)
}
func Lower(s string) string {
return strings.ToLower(s)
}
type CasedFn func(string) string
func Cased(s string, fn ...CasedFn) string {
for _, f := range fn {
s = f(s)
}
return s
}
type CasedString struct {
Original string
Pascal string
Camel string
Snake string
ScreamingSnake string
Kebab string
Upper string
Lower string
}
func ToCasedString(s string) CasedString {
return CasedString{
Original: s,
Pascal: Pascal(s),
Camel: Camel(s),
Snake: Snake(s),
ScreamingSnake: ScreamingSnake(s),
Kebab: Kebab(s),
Upper: Upper(s),
Lower: Lower(s),
}
}
// toCamel is adapted to avoid external deps; splits on non-alnum and case boundaries.
func toCamel(s string, upperFirst bool) string {
parts := splitWords(s)
for i, p := range parts {
if p == "" {
continue
}
if i == 0 && !upperFirst {
parts[i] = strings.ToLower(p[:1]) + strings.ToLower(p[1:])
} else {
parts[i] = strings.ToUpper(p[:1]) + strings.ToLower(p[1:])
}
}
return strings.Join(parts, "")
}
func splitWords(s string) []string {
var parts []string
var cur []rune
for _, r := range s {
if !(isLetter(r) || isDigit(r)) {
if len(cur) > 0 {
parts = append(parts, string(cur))
cur = cur[:0]
}
continue
}
if len(cur) > 0 && isBoundary(cur[len(cur)-1], r) {
parts = append(parts, string(cur))
cur = cur[:0]
}
cur = append(cur, r)
}
if len(cur) > 0 {
parts = append(parts, string(cur))
}
return parts
}
func splitAndJoin(s, sep string) string {
parts := splitWords(s)
for i, p := range parts {
parts[i] = strings.ToLower(p)
}
return strings.Join(parts, sep)
}
func isLetter(r rune) bool {
return (r >= 'a' && r <= 'z') || (r >= 'A' && r <= 'Z')
}
func isDigit(r rune) bool {
return r >= '0' && r <= '9'
}
func isUpper(r rune) bool { return r >= 'A' && r <= 'Z' }
func isLower(r rune) bool { return r >= 'a' && r <= 'z' }
func isBoundary(prev rune, curr rune) bool {
// Boundary between lower->upper (camelCase) or letter->digit or digit->letter.
if isLower(prev) && isUpper(curr) {
return true
}
if (isLetter(prev) && isDigit(curr)) || (isDigit(prev) && isLetter(curr)) {
return true
}
return false
}