-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathutil.go
605 lines (522 loc) · 10.5 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
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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
// Package util
package util
import (
"encoding/json"
"errors"
"math/rand"
"sort"
"strconv"
"strings"
"time"
)
// util tool 基础函数工具集合
func Map2JSON[K comparable, V any](m map[K]V) (string, error) {
mapJSON, err := Map2Bytes(m)
if err != nil {
return "", err
}
return string(mapJSON), nil
}
func Any2JSON(i any) (string, error) {
interfaceJSON, err := json.Marshal(i)
if err != nil {
return "", err
}
return string(interfaceJSON), nil
}
func Map2Bytes[K comparable, V any](m map[K]V) ([]byte, error) {
mapJSON, err := json.Marshal(m)
if err != nil {
return nil, err
}
return mapJSON, nil
}
type intType interface {
~int | ~int8 | ~int16 | ~int32 | ~int64
}
func Str2Int[T intType](s string) (T, error) {
i, err := strconv.ParseInt(s, 10, 64)
if err != nil {
return 0, err
}
return T(i), nil
}
func IntToStr[T intType](i T) string {
return strconv.FormatInt(int64(i), 10)
}
func Str2IntArr[T intType](s string, sep string) ([]T, error) {
arr := strings.Split(s, sep)
arrLen := len(arr)
if arrLen <= 0 {
return nil, errors.New("have no data")
}
intArr := make([]T, arrLen)
var err error
for i, v := range arr {
intArr[i], err = Str2Int[T](v)
if err != nil {
return nil, err
}
}
return intArr, nil
}
type uintType interface {
~uint | ~uint8 | ~uint16 | ~uint32 | ~uint64
}
func Str2Uint[T uintType](s string) (T, error) {
i, err := strconv.ParseUint(s, 10, 64)
if err != nil {
return 0, err
}
return T(i), nil
}
func UintToStr[T uintType](i T) string {
return strconv.FormatUint(uint64(i), 10)
}
func Str2FloatArr[T floatType](s string, sep string) ([]T, error) {
arr := strings.Split(s, sep)
arrLen := len(arr)
if arrLen <= 0 {
return nil, errors.New("have no data")
}
float64Arr := make([]T, arrLen)
var err error
for i, v := range arr {
float64Arr[i], err = Str2Float[T](v)
if err != nil {
return nil, err
}
}
return float64Arr, nil
}
func Str2Bool(s string) (bool, error) {
b, err := strconv.ParseBool(s)
if err != nil {
return false, err
}
return b, nil
}
func BoolToStr(b bool) string {
return strconv.FormatBool(b)
}
type floatType interface {
~float32 | ~float64
}
func Str2Float[T floatType](s string) (T, error) {
f, err := strconv.ParseFloat(s, 64)
if err != nil {
return 0, err
}
return T(f), nil
}
func FloatToStr[T floatType](f T) string {
return strconv.FormatFloat(float64(f), 'f', -1, 64)
}
func StartWith(s string, sub string, ignoreCase bool) (found bool) {
if len(s) < len(sub) {
return false
}
if ignoreCase {
return strings.ToUpper(s[:len(sub)]) == strings.ToUpper(sub)
}
return s[:len(sub)] == sub
}
func EndWith(s string, sub string, ignoreCase bool) (found bool) {
if len(s) < len(sub) {
return false
}
startIndex := len(s) - len(sub)
if ignoreCase {
return strings.ToUpper(s[startIndex:]) == strings.ToUpper(sub)
}
return s[startIndex:] == sub
}
// ElemIn 判断数据是否在数组中
func ElemIn[T comparable](target T, arr []T) bool {
for _, e := range arr {
if target == e {
return true
}
}
return false
}
// Intersection 交集
func Intersection[T comparable](arr1 []T, arr2 []T) []T {
len1 := len(arr1)
len2 := len(arr2)
if len1 <= 0 || len2 <= 0 {
return []T{}
}
minLen := len1
if minLen > len2 {
minLen = len2
}
map1 := map[T]struct{}{}
for _, v := range arr1 {
map1[v] = struct{}{}
}
if minLen > len(map1) {
minLen = len(map1)
}
resultArr := make([]T, minLen)
resultLen := 0
for _, v := range arr2 {
_, ok := map1[v]
if ok {
resultArr[resultLen] = v
resultLen++
}
}
if resultLen <= 0 {
return []T{}
}
return resultArr[:resultLen]
}
// Union 并集
func Union[T comparable](arr1 []T, arr2 []T) []T {
len1 := len(arr1)
len2 := len(arr2)
if len1 <= 0 && len2 <= 0 {
return []T{}
}
allMap := map[T]struct{}{}
for _, v := range arr1 {
allMap[v] = struct{}{}
}
for _, v := range arr2 {
allMap[v] = struct{}{}
}
maxLen := len(allMap)
if maxLen <= 0 {
return []T{}
}
resultArr := make([]T, maxLen)
resultCount := 0
for k := range allMap {
resultArr[resultCount] = k
resultCount++
}
return resultArr
}
// Difference 差集
func Difference[T comparable](arr1 []T, arr2 []T) []T {
len1 := len(arr1)
if len1 <= 0 {
return []T{}
}
len2 := len(arr2)
if len2 <= 0 {
return arr1
}
map2 := map[T]struct{}{}
for _, v := range arr2 {
map2[v] = struct{}{}
}
resultArr := make([]T, len1)
resultCount := 0
map1 := map[T]struct{}{}
for _, v := range arr1 {
_, ok := map2[v]
if !ok {
_, ok = map1[v]
if !ok {
map1[v] = struct{}{}
resultArr[resultCount] = v
resultCount++
}
}
}
return resultArr[:resultCount]
}
// JoinArr 链接数组
func JoinArr[T any](arr []T, linkStr string) string {
var ret strings.Builder
if len(arr) >= 1 {
ret.WriteString(Any2String(arr[0]))
}
for i, lenArr := 1, len(arr); i < lenArr; i++ {
ret.WriteString(linkStr)
ret.WriteString(Any2String(arr[i]))
}
return ret.String()
}
// GetMapValue 获取map数据
func GetMapValue[K comparable, V any](raw map[K]V, key K, def V) V {
if raw == nil {
return def
}
val, ok := raw[key]
if ok {
return val
}
return def
}
// Any2String 任意数据转string
func Any2String(v any) (ret string) {
defer func() {
if p := recover(); p != nil {
ret = ""
}
}()
ret = ""
if v == nil {
return ret
}
switch v := v.(type) {
case float64:
ret = strconv.FormatFloat(v, 'f', -1, 64)
case float32:
ret = strconv.FormatFloat(float64(v), 'f', -1, 64)
case int:
ret = strconv.Itoa(v)
case uint:
ret = strconv.Itoa(int(v))
case int8:
ret = strconv.Itoa(int(v))
case uint8:
ret = strconv.Itoa(int(v))
case int16:
ret = strconv.Itoa(int(v))
case uint16:
ret = strconv.Itoa(int(v))
case int32:
ret = strconv.Itoa(int(v))
case uint32:
ret = strconv.Itoa(int(v))
case int64:
ret = strconv.FormatInt(v, 10)
case uint64:
ret = strconv.FormatUint(v, 10)
case string:
ret = v
case []byte:
ret = string(v)
default:
newValue, _ := json.Marshal(v)
ret = string(newValue)
}
return ret
}
// MergeMap 合并map
func MergeMap[K comparable, V any](data ...map[K]V) map[K]V {
if len(data) <= 0 {
return nil
}
var raw map[K]V
for _, e := range data {
if e == nil {
continue
}
if raw == nil {
raw = map[K]V{}
}
for k, v := range e {
raw[k] = v
}
}
return raw
}
// Any2Any 数据结构转换
func Any2Any(raw any, target any) error {
marshal, err := json.Marshal(raw)
if err != nil {
return err
}
err = json.Unmarshal(marshal, target)
if err != nil {
return err
}
return nil
}
// ParamsSorted 参数计算排序字符串
func ParamsSorted[V any](params map[string]V) string {
if len(params) <= 0 {
return ""
}
keys := make([]string, len(params))
i := 0
for k := range params {
keys[i] = k
i++
}
sort.Strings(keys)
var ret strings.Builder
for ii, k := range keys {
if ii == 0 {
ret.WriteString(k)
ret.WriteByte('=')
ret.WriteString(Any2String(params[k]))
} else {
ret.WriteByte('&')
ret.WriteString(k)
ret.WriteByte('=')
ret.WriteString(Any2String(params[k]))
}
}
return ret.String()
}
// ArrSplit 按照给定的子数组长度进行数组切分,返回二维数组
func ArrSplit[T any](arr []T, batchSize int) [][]T {
s := len(arr)
if s <= 0 {
return nil
}
if batchSize <= 0 {
return [][]T{arr}
}
splitSize := s / batchSize
if s%batchSize != 0 {
splitSize++
}
if splitSize <= 0 {
return nil
}
var ret [][]T
for i := 0; i < splitSize; i++ {
if i == splitSize-1 {
ret = append(ret, arr[i*batchSize:])
} else {
ret = append(ret, arr[i*batchSize:(i+1)*batchSize])
}
}
return ret
}
type numType interface {
~int | ~int8 | ~int16 | ~int32 | int64 | uint | ~uint8 | ~uint16 | ~uint32 | uint64 | ~float32 | ~float64
}
// NumArrTransfer 数字型的数组转换
func NumArrTransfer[T1 numType, T2 numType](arr []T1) []T2 {
if len(arr) <= 0 {
return nil
}
ret := make([]T2, 0, len(arr))
for _, v := range arr {
ret = append(ret, T2(v))
}
return ret
}
// RandomInt64 returns, as an int64, a non-negative pseudo-random number in the half-open interval [min,max)
func RandomInt64(min, max int64) int64 {
if min < 0 {
panic("min must gte 0")
}
if max <= 0 {
panic("max must gt 0")
}
if min >= max {
panic("max must gt min")
}
rand.Seed(time.Now().UnixNano())
r := rand.Int63n(max - min)
return r + min
}
// HumpFormatToUnderLine 驼峰转下划线命名
func HumpFormatToUnderLine(s string) string {
lowerStr := strings.ToLower(s)
var index []int
for i := 0; i < len(s); i++ {
if lowerStr[i] != s[i] {
index = append(index, i)
}
}
var newStr strings.Builder
prefixIndex := 0
for _, i := range index {
if newStr.Len() > 0 {
newStr.WriteByte('_')
}
newStr.WriteString(lowerStr[prefixIndex:i])
prefixIndex = i
}
newStr.WriteByte('_')
newStr.WriteString(lowerStr[prefixIndex:])
return strings.TrimLeft(newStr.String(), "_")
}
// MapHumpFormatToUnderLine map key 驼峰转下滑线命名
func MapHumpFormatToUnderLine[V any](raw map[string]V) map[string]V {
newMap := make(map[string]V, len(raw))
for k, v := range raw {
newMap[HumpFormatToUnderLine(k)] = v
}
return newMap
}
// StrSplit 多分隔符切分字符串
// 返回拆分的字符串数组以及实际的分割标识数组
func StrSplit(s string, seq []string, trimSpace bool) ([]string, []string) {
if len(s) <= 0 {
return nil, seq
}
if len(seq) <= 0 {
return []string{s}, nil
}
var seqArr []string
var arr []string
sLen := len(s)
lastIndex := 0
for i := 0; i < sLen; {
tagSeq := ""
for _, ss := range seq {
l := len(ss)
if i+l >= sLen {
continue
}
if s[i:i+l] == ss {
tagSeq = ss
break
}
}
if len(tagSeq) <= 0 {
i++
} else {
seqArr = append(seqArr, tagSeq)
if trimSpace {
arr = append(arr, strings.TrimSpace(s[lastIndex:i]))
} else {
arr = append(arr, s[lastIndex:i])
}
i += len(tagSeq)
lastIndex = i
}
}
if trimSpace {
arr = append(arr, strings.TrimSpace(s[lastIndex:]))
} else {
arr = append(arr, s[lastIndex:])
}
return arr, seqArr
}
func SafeGo(f func()) {
go func() {
defer func() {
if p := recover(); p != nil {
}
}()
f()
}()
}
type char interface {
byte | rune
}
// CharMerge 合并字符串中相邻的多个指定的字符
func CharMerge[T char](s string, ch T) []T {
if s == "" {
return nil
}
str := make([]T, 1, len(s))
str[0] = T(s[0])
for i := 1; i < len(s); i++ {
c := T(s[i])
if c != ch || c != str[len(str)-1] {
str = append(str, c)
}
}
return str
}
func Cast[T any](raw any) (*T, error) {
var t T
err := Any2Any(raw, &t)
if err != nil {
return nil, err
}
return &t, nil
}