-
Notifications
You must be signed in to change notification settings - Fork 0
/
cache_map.go
145 lines (118 loc) · 2.35 KB
/
cache_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
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
package cache
import (
"sync"
"sync/atomic"
cmap "github.com/orcaman/concurrent-map"
)
type CacheMap interface {
Get(k string) (interface{}, bool)
Set(k string, x interface{})
Delete(k string)
Range(f func(k string, v any))
Count() int
Flush()
}
type RwmMap struct {
items map[string]interface{}
mu sync.RWMutex
}
func NewRwmMap() CacheMap {
return &RwmMap{items: map[string]interface{}{}}
}
func (m *RwmMap) Get(k string) (interface{}, bool) {
m.mu.RLock()
item, found := m.items[k]
m.mu.RUnlock()
if !found {
return nil, false
}
return item, true
}
func (m *RwmMap) Set(k string, x interface{}) {
m.mu.Lock()
m.items[k] = x
m.mu.Unlock()
}
func (m *RwmMap) Delete(k string) {
m.mu.Lock()
delete(m.items, k)
m.mu.Unlock()
}
func (m *RwmMap) Range(f func(k string, v any)) {
for k, v := range m.items {
f(k, v)
}
}
func (m *RwmMap) Count() int {
return len(m.items)
}
func (m *RwmMap) Flush() {
m.mu.Lock()
m.items = map[string]interface{}{}
m.mu.Unlock()
}
type SyncMap struct {
items sync.Map
count atomic.Int32
}
func NewSyncMap() CacheMap {
return &SyncMap{items: sync.Map{}}
}
func (m *SyncMap) Get(k string) (interface{}, bool) {
item, found := m.items.Load(k)
if !found {
return nil, false
}
return item, true
}
func (m *SyncMap) Set(k string, x interface{}) {
m.items.Store(k, x)
m.count.Add(1)
}
func (m *SyncMap) Delete(k string) {
m.items.Delete(k)
m.count.Add(-1)
}
func (m *SyncMap) Range(f func(k string, v any)) {
m.items.Range(func(key, value any) bool {
f(key.(string), value)
return true
})
}
func (m *SyncMap) Count() int {
return int(m.count.Load())
}
func (m *SyncMap) Flush() {
m.items = sync.Map{}
m.count = atomic.Int32{}
}
type ConcurrentMap struct {
items cmap.ConcurrentMap
}
func NewConcurrentMap() CacheMap {
return &ConcurrentMap{items: cmap.New()}
}
func (m *ConcurrentMap) Get(k string) (interface{}, bool) {
item, found := m.items.Get(k)
if !found {
return nil, false
}
return item, true
}
func (m *ConcurrentMap) Set(k string, x interface{}) {
m.items.Set(k, x)
}
func (m *ConcurrentMap) Delete(k string) {
m.items.Remove(k)
}
func (m *ConcurrentMap) Range(f func(k string, v any)) {
for tuple := range m.items.IterBuffered() {
f(tuple.Key, tuple.Val)
}
}
func (m *ConcurrentMap) Count() int {
return m.items.Count()
}
func (m *ConcurrentMap) Flush() {
m.items.Clear()
}