-
Notifications
You must be signed in to change notification settings - Fork 0
/
count_map.go
90 lines (78 loc) · 1.63 KB
/
count_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
package structure
import "sync"
type CountMap[K comparable] interface {
Set(K, int64)
Add(K, int64)
Subtract(K, int64)
Get(K) int64
GetAll() map[K]int64
Contain(K) bool
Remove(K)
Clear()
}
func NewCountMap[K comparable]() CountMap[K] {
return &basicCountMap[K]{
internal: map[K]int64{},
}
}
type basicCountMap[K comparable] struct {
internal map[K]int64
sync sync.Mutex
}
func (mm *basicCountMap[K]) Set(k K, vs int64) {
mm.sync.Lock()
defer mm.sync.Unlock()
mm.internal[k] = vs
}
func (mm *basicCountMap[K]) Add(k K, vs int64) {
mm.sync.Lock()
defer mm.sync.Unlock()
if currVals, kExist := mm.internal[k]; kExist {
mm.internal[k] = currVals + vs
} else {
mm.internal[k] = vs
}
}
func (mm *basicCountMap[K]) Subtract(k K, vs int64) {
mm.sync.Lock()
defer mm.sync.Unlock()
if currVals, kExist := mm.internal[k]; kExist {
mm.internal[k] = currVals - vs
} else {
mm.internal[k] = -vs
}
}
func (mm *basicCountMap[K]) Get(k K) int64 {
mm.sync.Lock()
defer mm.sync.Unlock()
if currVals, kExist := mm.internal[k]; kExist {
return currVals
} else {
return 0
}
}
func (mm *basicCountMap[K]) GetAll() map[K]int64 {
mm.sync.Lock()
defer mm.sync.Unlock()
duplicatedMap := map[K]int64{}
for k, v := range mm.internal {
duplicatedMap[k] = v
}
return duplicatedMap
}
func (mm *basicCountMap[K]) Contain(k K) bool {
mm.sync.Lock()
defer mm.sync.Unlock()
_, kExist := mm.internal[k]
return kExist
}
func (mm *basicCountMap[K]) Remove(k K) {
mm.sync.Lock()
defer mm.sync.Unlock()
delete(mm.internal, k)
}
func (mm *basicCountMap[K]) Clear() {
mm.sync.Lock()
defer mm.sync.Unlock()
mm.internal = map[K]int64{}
}