-
Notifications
You must be signed in to change notification settings - Fork 16
/
map.go
105 lines (93 loc) · 1.65 KB
/
map.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
package machine
import (
"encoding/json"
"fmt"
)
// Map is a functional map for storing arbitrary data. It is not concurrency safe
type Map map[interface{}]interface{}
func (m Map) Exists(key interface{}) bool {
if m == nil {
return false
}
if _, ok := m[key]; ok {
return true
}
return false
}
func (m Map) Set(k, v interface{}) {
m[k] = v
}
func (m Map) Get(k interface{}) (interface{}, bool) {
if m == nil {
return nil, false
}
if !m.Exists(k) {
return nil, false
}
return m[k], true
}
func (m Map) Del(k interface{}) {
if m == nil {
return
}
delete(m, k)
}
func (m Map) Range(iterator func(k, v interface{}) bool) {
if m == nil {
return
}
for k, v := range m {
if !iterator(k, v) {
break
}
}
}
func (m Map) Filter(filter func(k, v interface{}) bool) Map {
data := Map{}
if m == nil {
return data
}
m.Range(func(k, v interface{}) bool {
if filter(k, v) {
data.Set(k, v)
}
return true
})
return data
}
func (m Map) Intersection(k interface{}) (interface{}, bool) {
if !m.Exists(k) {
return nil, false
}
return m[k], true
}
func (m Map) Copy() Map {
copied := Map{}
if m == nil {
return copied
}
m.Range(func(k, v interface{}) bool {
copied.Set(k, v)
return true
})
return copied
}
func (m Map) stringMap() map[string]interface{} {
strMap := map[string]interface{}{}
m.Range(func(k, v interface{}) bool {
if s, ok := k.(string); ok {
strMap[s] = v
return true
}
if s, ok := k.(fmt.Stringer); ok {
strMap[s.String()] = v
return true
}
strMap[fmt.Sprintf("%v", k)] = v
return true
})
return strMap
}
func (m Map) Marshal() ([]byte, error) {
return json.Marshal(m.stringMap())
}