-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patharray.go
More file actions
294 lines (265 loc) · 6.38 KB
/
array.go
File metadata and controls
294 lines (265 loc) · 6.38 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
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
package php2go
import (
"fmt"
"reflect"
"sort"
"strings"
"time"
)
type Integer interface {
uint | uint8 | uint16 | uint32 | uint64 | int | int8 | int16 | int32 | int64 | float32 | float64
}
type IntegerString interface {
uint | uint8 | uint16 | uint32 | uint64 | int | int8 | int16 | int32 | int64 | float32 | float64 | string
}
// ArrayReverse 数组翻转
func ArrayReverse[T IntegerString](s []T) []T {
l := len(s)
r := make([]T, l)
for i, ele := range s {
r[l-i-1] = ele
}
return r
}
// ArrayColumn 获取二维数组中的某一列,组合成一维数组
func ArrayColumn[T IntegerString](s interface{}, col string) (retCol []T) {
rv := reflect.ValueOf(s)
ln := rv.Len()
for i := 0; i < ln; i++ {
tmpRv := rv.Index(i)
// 处理指针类型
if tmpRv.Kind() == reflect.Ptr {
tmpRv = tmpRv.Elem()
}
value := tmpRv.FieldByName(col)
if !value.IsValid() {
fmt.Println("unknown field:", col)
return
}
switch value.Kind() {
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Float32, reflect.Float64, reflect.String:
value := value.Interface().(T)
retCol = append(retCol, value)
default:
fmt.Println("unknown case:", value.Kind())
return
}
}
return
}
// ArraySum 计算数组中某一列的和,一维数组时计算全部
func ArraySum[T Integer](s interface{}, col string) (sum T) {
rv := reflect.ValueOf(s)
ln := rv.Len()
for i := 0; i < ln; i++ {
tmpRv := rv.Index(i)
// 处理指针类型
if tmpRv.Kind() == reflect.Ptr {
tmpRv = tmpRv.Elem()
}
// 一维数组,直接相加即可
if col == "" {
sum = sum + tmpRv.Interface().(T)
continue
}
value := tmpRv.FieldByName(col)
if !value.IsValid() {
return
}
switch value.Kind() {
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Float32, reflect.Float64:
value := value.Interface().(T)
sum = sum + value
default:
return
}
}
return
}
// ArrayUnique 数组去重,只限一维数组
func ArrayUnique[T IntegerString](s []T) (retData []T) {
tmpMap := make(map[T]bool, len(s))
for i := 0; i < len(s); i++ {
// map去重
if _, ok := tmpMap[s[i]]; ok != true {
tmpMap[s[i]] = true
retData = append(retData, s[i])
}
}
return
}
// InArray 值是否存在
func InArray(needle interface{}, haystack interface{}) bool {
val := reflect.ValueOf(haystack)
switch val.Kind() {
case reflect.Slice, reflect.Array:
for i := 0; i < val.Len(); i++ {
if reflect.DeepEqual(needle, val.Index(i).Interface()) {
return true
}
}
case reflect.Map:
for _, k := range val.MapKeys() {
if reflect.DeepEqual(needle, val.MapIndex(k).Interface()) {
return true
}
}
default:
return false
}
return false
}
// ArrayIntersect 数组交集,只限一维数组
func ArrayIntersect[T IntegerString](s1, s2 []T) (intersectArr []T) {
mp := make(map[T]bool)
for _, s := range s1 {
if _, ok := mp[s]; !ok {
mp[s] = true
}
}
for _, s := range s2 {
if _, ok := mp[s]; ok {
intersectArr = append(intersectArr, s)
}
}
return
}
// ArrayDiff 求差集,s1-s2 = s1去除s2在s1中存在的值,只限一维数组
func ArrayDiff[T IntegerString](s1, s2 []T) (diffArr []T) {
temp := make(map[T]bool, len(s2))
for _, val := range s2 {
if _, ok := temp[val]; !ok {
temp[val] = true
}
}
for _, val := range s1 {
if _, ok := temp[val]; !ok {
diffArr = append(diffArr, val)
}
}
return
}
// Max 求最大值
func Max[T IntegerString](s1 []T) (retVal T) {
if len(s1) == 0 {
return
}
retVal = s1[0]
for _, val := range s1 {
if val > retVal {
retVal = val
}
}
return
}
// Min 求最小值
func Min[T IntegerString](s1 []T) (retVal T) {
if len(s1) == 0 {
return
}
retVal = s1[0]
for _, val := range s1 {
if val < retVal {
retVal = val
}
}
return
}
// SliceRemove 根据index删除值
func SliceRemove[T any](ori []T, idx []int, flag ...int) (ret []T) {
if len(idx) == 0 {
ret = ori
return
}
if len(flag) == 0 {
sort.IntSlice(idx).Sort()
} else {
for ii, _ := range idx {
idx[ii] = idx[ii] - 1
}
}
return SliceRemove(append(ori[:idx[0]], ori[idx[0]+1:]...), idx[1:], 1)
}
// Slice2Chunk 将切片按指定大小分块
func Slice2Chunk[T any](ori []T, chunkSize int) [][]T {
if chunkSize <= 0 {
return nil
}
total := len(ori)
chunkCount := (total + chunkSize - 1) / chunkSize // 计算分块数
result := make([][]T, 0, chunkCount) // 预分配结果切片
for i := 0; i < total; i += chunkSize {
end := i + chunkSize
if end > total {
end = total
}
result = append(result, ori[i:end])
}
return result
}
// Struct2Map struct To MapInterface
func Struct2Map(src interface{}) (map[string]interface{}, error) {
v := reflect.ValueOf(src)
if v.Kind() == reflect.Ptr {
v = v.Elem()
}
if v.Kind() != reflect.Struct {
return nil, fmt.Errorf("input is not a struct")
}
out := make(map[string]interface{}, v.NumField())
t := v.Type()
for i := 0; i < t.NumField(); i++ {
field := t.Field(i)
fieldValue := v.Field(i)
if !fieldValue.CanInterface() {
continue
}
// 获取 JSON 标签
key := field.Name
if jsonTag := field.Tag.Get("json"); jsonTag != "" {
key = strings.Split(jsonTag, ",")[0]
}
// 特殊类型处理
if fieldValue.Type() == reflect.TypeOf(time.Time{}) {
out[key] = fieldValue.Interface()
continue
}
// 递归处理嵌套类型
switch fieldValue.Kind() {
case reflect.Struct:
nested, err := Struct2Map(fieldValue.Interface())
if err != nil {
return nil, err
}
out[key] = nested
case reflect.Ptr:
if !fieldValue.IsNil() && fieldValue.Elem().Kind() == reflect.Struct {
nested, err := Struct2Map(fieldValue.Interface())
if err != nil {
return nil, err
}
out[key] = nested
} else {
out[key] = fieldValue.Interface()
}
case reflect.Slice, reflect.Array:
sliceVal := make([]interface{}, fieldValue.Len())
for j := 0; j < fieldValue.Len(); j++ {
elem := fieldValue.Index(j)
if elem.Kind() == reflect.Struct {
nested, err := Struct2Map(elem.Interface())
if err != nil {
return nil, err
}
sliceVal[j] = nested
} else {
sliceVal[j] = elem.Interface()
}
}
out[key] = sliceVal
default:
out[key] = fieldValue.Interface()
}
}
return out, nil
}