-
Notifications
You must be signed in to change notification settings - Fork 171
/
hashMap.go
79 lines (58 loc) · 1.26 KB
/
hashMap.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
package power
import (
"github.com/ArtisanCloud/PowerLibs/v3/object"
)
type HashMap object.HashMap
func MergeHashMap(toMap *HashMap, subMaps ...*HashMap) *HashMap {
if toMap == nil {
toMap = &HashMap{}
}
// 拍平subMaps
for _, subMap := range subMaps {
if subMap != nil {
// 迭代每个HashMap
for k, v := range *subMap {
toV := (*toMap)[k]
// if the key is not exist in toMap
if toV == nil {
(*toMap)[k] = v
continue
}
// if the toMap by the key is ""
switch toV.(type) {
case string:
if (*toMap)[k] == "" && v != "" {
(*toMap)[k] = v
}
break
}
}
}
}
return toMap
}
func (obj *HashMap) ToHashMap() *object.HashMap {
hObj, _ := object.StructToHashMap(obj)
return hObj
}
// ------------------------------- Conversion ---------------------------------------
func HashMapToPower(obj *object.HashMap) (newMap *HashMap, err error) {
newMap = &HashMap{}
if obj == nil {
return newMap, err
}
for k, v := range *obj {
(*newMap)[k] = v
}
return newMap, err
}
func PowerHashMapToObjectHashMap(obj *HashMap) (newMap *object.HashMap, err error) {
newMap = &object.HashMap{}
if obj == nil {
return newMap, err
}
for k, v := range *obj {
(*newMap)[k] = v
}
return newMap, err
}