-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsync_map.go
More file actions
122 lines (102 loc) · 1.87 KB
/
sync_map.go
File metadata and controls
122 lines (102 loc) · 1.87 KB
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
package hmap
import (
"sync"
"sync/atomic"
)
type SyncMap[K comparable, V any] struct {
d *sync.Map
len atomic.Int64
}
func NewSyncMap[K comparable, V any]() HMap[K, V] {
return &SyncMap[K, V]{
d: new(sync.Map),
len: atomic.Int64{},
}
}
func (m *SyncMap[K, V]) Len() int {
return int(m.len.Load())
}
func (m *SyncMap[K, V]) Load(key K) (V, bool) {
var ret V
if v, ok := m.d.Load(key); ok {
if v != nil {
ret = v.(V)
}
return ret, true
}
// not found
return ret, false
}
func (m *SyncMap[K, V]) Swap(k K, v V) (V, bool) {
var ret = v
previous, loaded := m.d.Swap(k, v)
if !loaded {
// not exist, len +1
m.len.Add(1)
} else {
if previous != nil {
ret = previous.(V)
}
}
return ret, loaded
}
func (m *SyncMap[K, V]) Store(k K, v V) {
_, loaded := m.d.Swap(k, v)
if !loaded {
// not exist, len +1
m.len.Add(1)
}
}
func (m *SyncMap[K, V]) LoadOrStore(k K, v V) (V, bool) {
d, ok := m.d.LoadOrStore(k, v)
if ok {
return d.(V), ok
}
// not exist, len +1
m.len.Add(1)
return v, ok
}
func (m *SyncMap[K, V]) Delete(k K) {
_, ok := m.d.LoadAndDelete(k)
if ok {
// exist, len -1
m.len.Add(-1)
}
}
func (m *SyncMap[K, V]) LoadAndDelete(k K) (V, bool) {
var ret V
v, ok := m.d.LoadAndDelete(k)
if ok {
// exist, len -1
m.len.Add(-1)
if v != nil {
ret = v.(V)
}
}
return ret, ok
}
func (m *SyncMap[K, V]) Range(fn func(k K, v V) bool) {
m.d.Range(func(key, value any) bool {
k := key.(K)
v := value.(V)
if !fn(k, v) {
return false
}
return true
})
}
func (m *SyncMap[K, V]) Clean() {
m.d = new(sync.Map)
m.len = atomic.Int64{}
}
func (m *SyncMap[K, V]) CompareAndSwap(key K, old, new V) bool {
return m.d.CompareAndSwap(key, old, new)
}
func (m *SyncMap[K, V]) CompareAndDelete(key K, old V) bool {
del := m.d.CompareAndDelete(key, old)
if del {
// deleted, len -1
m.len.Add(-1)
}
return del
}