-
Notifications
You must be signed in to change notification settings - Fork 1
/
util.go
84 lines (78 loc) · 1.63 KB
/
util.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
package db_handler
import "strings"
// camel string to snake string XxYy = > xx_yy
func ToSnakeString(s string) string {
data := make([]byte, 0, len(s)*2)
j := false
num := len(s)
for i := 0; i < num; i++ {
d := s[i]
if i > 0 && d >= 'A' && d <= 'Z' && j {
data = append(data, '_')
}
if d != '_' {
j = true
}
data = append(data, d)
}
return strings.ToLower(string(data[:]))
}
// snake string to camel string xx_yy => XxYy
func ToCamelString(s string) string {
data := make([]byte, 0, len(s))
j := false
k := false
num := len(s) - 1
for i := 0; i <= num; i++ {
d := s[i]
if k == false && d >= 'A' && d <= 'Z' {
k = true
}
if d >= 'a' && d <= 'z' && (j || k == false) {
d = d - 32
j = false
k = true
}
if k && d == '_' && num > i && s[i+1] >= 'a' && s[i+1] <= 'z' {
j = true
continue
}
data = append(data, d)
}
return string(data[:])
}
func ArrayJoin(arr []string, sep string) string {
switch len(arr) {
case 0:
return ""
case 1:
return arr[0]
case 2:
// Special case for common small values.
// Remove if golang.org/issue/6714 is fixed
return arr[0] + sep + arr[1]
case 3:
// Special case for common small values.
// Remove if golang.org/issue/6714 is fixed
return arr[0] + sep + arr[1] + sep + arr[2]
}
n := len(sep) * (len(arr) - 1)
for i := 0; i < len(arr); i++ {
n += len(arr[i])
}
b := make([]byte, n)
bp := copy(b, arr[0])
for _, s := range arr[1:] {
bp += copy(b[bp:], sep)
bp += copy(b[bp:], s)
}
return string(b)
}
func StringArrayContains(arr []string, item string) bool {
for _, v := range arr {
if v == item {
return true
}
}
return false
}