-
Notifications
You must be signed in to change notification settings - Fork 230
/
collection.go
99 lines (91 loc) · 1.74 KB
/
collection.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
package util
import (
"reflect"
)
// Contains check whether obj exist in target, the type of target can be an array, slice or map
func Contains(obj any, target any) bool {
targetValue := reflect.ValueOf(target)
switch reflect.TypeOf(target).Kind() {
case reflect.Slice, reflect.Array:
for i := 0; i < targetValue.Len(); i++ {
if targetValue.Index(i).Interface() == obj {
return true
}
}
case reflect.Map:
if targetValue.MapIndex(reflect.ValueOf(obj)).IsValid() {
return true
}
}
return false
}
func MapContains(subset, fullset map[string]string) bool {
for sk, sv := range subset {
if fullset[sk] != sv {
return false
}
}
return true
}
func MapEquals(src, target map[string]string) bool {
return len(src) == len(target) && MapContains(src, target)
}
func MapPut(m map[string]string, k, v string) map[string]string {
if m == nil {
return map[string]string{k: v}
}
m[k] = v
return m
}
func MergeMap(m1, m2 map[string]string) map[string]string {
cp := make(map[string]string)
if m1 != nil {
for key, value := range m1 {
cp[key] = value
}
}
if m2 != nil {
for key, value := range m2 {
cp[key] = value
}
}
return cp
}
func ArrayEquals(src, target []string) bool {
if len(src) != len(target) {
return false
}
for i := 0; i < len(src); i++ {
found := false
for j := 0; j < len(target); j++ {
if src[i] == target[j] {
found = true
break
}
}
if !found {
return false
}
}
return true
}
func ArrayDelete(arr []string, item string) []string {
count := 0
for _, v := range arr {
if v == item {
count++
}
}
if count == 0 {
return arr
}
newArr := make([]string, len(arr) - count)
i := 0
for _, v := range arr {
if v != item {
newArr[i] = v
i++
}
}
return newArr
}