-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmap.go
106 lines (81 loc) · 1.7 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
106
package safe
import (
"iter"
"sync"
)
// TODO: test
type Map[Key comparable, Value any] struct {
lock sync.RWMutex
data map[Key]Value
initialized bool
}
func NewMap[Key comparable, Value any](size int) *Map[Key, Value] {
return &Map[Key, Value]{
initialized: true,
data: make(map[Key]Value, size),
}
}
func (m *Map[Key, Value]) Clear(key Key) {
if !m.initialized {
return
}
m.lock.Lock()
defer m.lock.Unlock()
m.data = make(map[Key]Value, len(m.data))
}
func (m *Map[Key, Value]) Delete(key Key) {
if !m.initialized {
return
}
m.lock.Lock()
defer m.lock.Unlock()
delete(m.data, key)
}
func (m *Map[Key, Value]) Len() int {
if !m.initialized {
return 0
}
return len(m.data)
}
func (m *Map[Key, Value]) Load(key Key) (value Value, ok bool) {
if !m.initialized {
return *new(Value), false
}
m.lock.RLock()
defer m.lock.RUnlock()
value, ok = m.data[key]
return value, ok
}
// TODO: test
func (m *Map[Key, Value]) Range() iter.Seq2[Key, Value] {
if !m.initialized {
return func(func(Key, Value) bool) {}
}
return func(yield func(Key, Value) bool) {
m.lock.RLock()
defer m.lock.RUnlock()
for k, v := range m.data {
if !yield(k, v) {
return
}
}
}
}
func (m *Map[Key, Value]) Swap(key Key, value Value) (previous Value, loaded bool) {
if !m.initialized {
return
}
m.lock.Lock()
defer m.lock.Unlock()
previous, loaded = m.data[key]
m.data[key] = value
return previous, loaded
}
func (m *Map[Key, Value]) Store(key Key, value Value) {
if !m.initialized {
return
}
m.lock.Lock()
defer m.lock.Unlock()
m.data[key] = value
}