-
Notifications
You must be signed in to change notification settings - Fork 0
/
xstr_slice.go
109 lines (99 loc) · 1.67 KB
/
xstr_slice.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
package xstrSlice
import (
. "github.com/go-xe2/x/type/slice/comm"
"github.com/go-xe2/x/type/t"
"sort"
)
func Contain(arr []string, item string) bool {
for _, v := range arr {
if v == item {
return true
}
}
return false
}
func ForEach(arr []string, fn StrArrForEachFunc) {
if fn == nil {
return
}
for k, v := range arr {
fn(k, v)
}
}
func Map(arr []string, fn StrArrMapFunc) {
if fn == nil {
return
}
for k, v := range arr {
nv := fn(k, v)
arr[k] = nv
}
}
func Find(arr []string, fn StrArrSearchFunc) string {
if fn == nil {
return ""
}
for k, v := range arr {
if fn(k, v) {
return v
}
}
return ""
}
func FindIndex(arr []string, fn StrArrSearchFunc) int {
if fn == nil {
return -1
}
for k, v := range arr {
if fn(k, v) {
return k
}
}
return -1
}
func Sort(arr []string, comparer ...ArrSortCompareFunc) {
var defComparer = func(aIndex int, bIndex int) int {
s1 := arr[aIndex]
s2 := arr[bIndex]
if s1 < s2 {
return -1
} else if s1 > s2 {
return 1
} else {
return 0
}
}
if len(comparer) > 0 && comparer[0] != nil {
defComparer = comparer[0]
}
sort.Slice(arr, func(i, j int) bool {
return defComparer(i, j) < 0
})
}
func Join(arr []string, sep string) string {
var result = ""
for _, s := range arr {
if result != "" {
result += sep
}
result += s
}
return result
}
func String(this []string) string {
var result = ""
for _, v := range this {
if result != "" {
result += ","
}
result += t.String(v)
}
return "[" + result + "]"
}
func AsInterface(this []string) []interface{} {
var result = make([]interface{}, 0)
for _, v := range this {
result = append(result, v)
}
return result
}