-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathstr.go
152 lines (129 loc) · 3.61 KB
/
str.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
149
150
151
152
package pgo
import (
"errors"
"fmt"
"net/url"
"strings"
"unsafe"
)
type replaceParams struct {
search interface{}
replace interface{}
subject string
count int
countSlices int
}
// StrIReplace replaces all occurrences of the search case-insensitive string|slice with the replacement string
// If search and replace are arrays, then str_replace() takes a value from each array
// and uses them to search and replace on subject.
func StrIReplace(args ...interface{}) (string, error) {
params := &replaceParams{}
params.prepareParams(args...)
if params.countSlices == 2 { // prepare an array to lower
search := params.search.([]string)
for k, v := range search {
search[k] = strings.ToLower(v)
}
params.search = search
return params.doReplaceSlices(), nil
}
// prepare string to lower
val, _ := params.search.(string)
search := strings.ToLower(val)
params.search = search
return params.doReplace(), nil
}
func (params *replaceParams) prepareParams(args ...interface{}) {
params.count = -1
params.countSlices = 0
for i, p := range args {
switch i {
case 0:
param, ok := p.(string)
params.search = param
if !ok {
param, ok := p.([]string)
isOk(ok, "You must provide search parameter as []string or string")
params.countSlices++
params.search = param
}
case 1:
param, ok := p.(string)
params.replace = param
if !ok {
param, ok := p.([]string)
isOk(ok, "You must provide replace parameter as []string or string")
params.countSlices++
params.replace = param
}
case 2:
param, ok := p.(string)
params.subject = param
isOk(ok, "3d parameter must be passed as string")
case 3:
param, ok := p.(int)
params.count = param
isOk(ok, "4th parameter must be passed as int")
}
}
}
// StrReplace replaces all occurrences of the search string|slice with the replacement string
// If search and replace are arrays, then str_replace() takes a value from each array
// and uses them to search and replace on subject.
func StrReplace(args ...interface{}) (string, error) {
params := &replaceParams{}
params.prepareParams(args...)
if params.countSlices == 1 {
return params.subject, errors.New("both slices must be provided for search and replace")
}
if params.countSlices == 2 {
return params.doReplaceSlices(), nil
}
return params.doReplace(), nil
}
func (params *replaceParams) doReplace() string {
return strings.Replace(params.subject, params.search.(string), params.replace.(string), params.count)
}
func (params *replaceParams) doReplaceSlices() string {
search := params.search.([]string)
replace := params.replace.([]string)
for k, v := range search {
params.subject = strings.Replace(params.subject, v, replace[k], params.count)
}
return params.subject
}
// HTTPBuildQuery Generates a URL-encoded query string from the associative map
func HTTPBuildQuery(pairs map[string]interface{}) string {
q := url.Values{}
for k, v := range pairs {
switch val := v.(type) {
case string:
q.Add(k, v.(string))
case []string:
q[k] = v.([]string)
case uint, uint8, uint16, uint32, uint64, int, int8, int16, int32, int64:
q.Add(k, fmt.Sprintf("%d", val))
case float32, float64:
q.Add(k, fmt.Sprintf("%v", val))
case bool:
q.Add(k, fmt.Sprintf("%t", val))
}
}
return q.Encode()
}
// ConcatFast concatenates strings faster than strings.Builder (see benchmarks)
func ConcatFast(s ...string) string {
l := len(s)
if l == 0 {
return ""
}
n := 0
for i := 0; i < l; i++ {
n += len(s[i])
}
b := make([]byte, 0, n)
for i := 0; i < l; i++ {
b = append(b, s[i]...)
}
return *(*string)(unsafe.Pointer(&b))
}