-
Notifications
You must be signed in to change notification settings - Fork 32
/
synclock_map.go
163 lines (127 loc) · 3.16 KB
/
synclock_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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
package mapsutil
import (
"sync"
"sync/atomic"
errorutil "github.com/projectdiscovery/utils/errors"
)
var (
ErrReadOnly = errorutil.New("map is currently in read-only mode").WithTag("syncLockMap")
)
// SyncLock adds sync and lock capabilities to generic map
type SyncLockMap[K, V comparable] struct {
ReadOnly atomic.Bool
mu sync.RWMutex
Map Map[K, V]
}
type SyncLockMapOption[K, V comparable] func(slm *SyncLockMap[K, V])
func WithMap[K, V comparable](m Map[K, V]) SyncLockMapOption[K, V] {
return func(slm *SyncLockMap[K, V]) {
slm.Map = m
}
}
// NewSyncLockMap creates a new SyncLockMap.
// If an existing map is provided, it is used; otherwise, a new map is created.
func NewSyncLockMap[K, V comparable](options ...SyncLockMapOption[K, V]) *SyncLockMap[K, V] {
slm := &SyncLockMap[K, V]{}
for _, option := range options {
option(slm)
}
if slm.Map == nil {
slm.Map = make(Map[K, V])
}
return slm
}
// Lock the current map to read-only mode
func (s *SyncLockMap[K, V]) Lock() {
s.ReadOnly.Store(true)
}
// Unlock the current map
func (s *SyncLockMap[K, V]) Unlock() {
s.ReadOnly.Store(false)
}
// Set an item with syncronous access
func (s *SyncLockMap[K, V]) Set(k K, v V) error {
if s.ReadOnly.Load() {
return ErrReadOnly
}
s.mu.Lock()
defer s.mu.Unlock()
s.Map[k] = v
return nil
}
// Get an item with syncronous access
func (s *SyncLockMap[K, V]) Get(k K) (V, bool) {
s.mu.RLock()
defer s.mu.RUnlock()
v, ok := s.Map[k]
return v, ok
}
// Get an item with syncronous access
func (s *SyncLockMap[K, V]) Delete(k K) {
s.mu.Lock()
defer s.mu.Unlock()
delete(s.Map, k)
}
// Iterate with a callback function synchronously
func (s *SyncLockMap[K, V]) Iterate(f func(k K, v V) error) error {
s.mu.RLock()
defer s.mu.RUnlock()
for k, v := range s.Map {
if err := f(k, v); err != nil {
return err
}
}
return nil
}
// Clone creates a new SyncLockMap with the same values
func (s *SyncLockMap[K, V]) Clone() *SyncLockMap[K, V] {
s.mu.Lock()
defer s.mu.Unlock()
smap := &SyncLockMap[K, V]{
ReadOnly: atomic.Bool{},
mu: sync.RWMutex{},
Map: s.Map.Clone(),
}
smap.ReadOnly.Store(s.ReadOnly.Load())
return smap
}
// Has checks if the current map has the provided key
func (s *SyncLockMap[K, V]) Has(key K) bool {
s.mu.RLock()
defer s.mu.RUnlock()
return s.Map.Has(key)
}
// IsEmpty checks if the current map is empty
func (s *SyncLockMap[K, V]) IsEmpty() bool {
s.mu.RLock()
defer s.mu.RUnlock()
return s.Map.IsEmpty()
}
// IsEmpty checks if the current map is empty
func (s *SyncLockMap[K, V]) Clear() bool {
s.mu.Lock()
defer s.mu.Unlock()
return s.Map.Clear()
}
// GetKeywithValue returns the first key having value
func (s *SyncLockMap[K, V]) GetKeyWithValue(value V) (K, bool) {
s.mu.RLock()
defer s.mu.RUnlock()
return s.Map.GetKeyWithValue(value)
}
// Merge the current map with the provided one
func (s *SyncLockMap[K, V]) Merge(n map[K]V) error {
if s.ReadOnly.Load() {
return ErrReadOnly
}
s.mu.Lock()
defer s.mu.Unlock()
s.Map.Merge(n)
return nil
}
// GetAll returns Copy of the current map
func (s *SyncLockMap[K, V]) GetAll() Map[K, V] {
s.mu.RLock()
defer s.mu.RUnlock()
return s.Map.Clone()
}