This repository has been archived by the owner on Mar 14, 2022. It is now read-only.
/
syncmap.go
59 lines (49 loc) · 1.49 KB
/
syncmap.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
package ddbmap
import "sync"
// KeyFromValue is a function that can generate a hashable key from a value.
type KeyFromValue func(interface{}) (interface{}, error)
type syncMap struct {
m sync.Map
keyFromValue KeyFromValue
}
// NewSyncMap creates a new Map that uses sync.Map as storage. This is intended for use in tests.
func NewSyncMap(keyFromValue KeyFromValue) Map {
return &syncMap{keyFromValue: keyFromValue}
}
func (sm *syncMap) Delete(toDelete interface{}) (err error) {
if key, err := sm.keyFromValue(toDelete); err == nil {
sm.m.Delete(key)
return nil
}
return err
}
func (sm *syncMap) Load(toLoad interface{}) (result interface{}, ok bool, err error) {
if key, err := sm.keyFromValue(toLoad); err == nil {
result, ok = sm.m.Load(key)
return result, ok, err
}
return nil, false, err
}
func (sm *syncMap) LoadOrStore(value interface{}) (actual interface{}, loaded bool, err error) {
if key, err := sm.keyFromValue(value); err == nil {
actual, loaded = sm.m.LoadOrStore(key, value)
return actual, loaded, err
}
return nil, false, err
}
func (sm *syncMap) Range(consumer func(value interface{}) bool) error {
sm.m.Range(func(_, v interface{}) bool {
return consumer(v)
})
return nil
}
func (sm *syncMap) Store(value interface{}) (err error) {
if k, err := sm.keyFromValue(value); err == nil {
sm.m.Store(k, value)
}
return err
}
func (sm *syncMap) StoreIfAbsent(value interface{}) (bool, error) {
_, loaded, err := sm.LoadOrStore(value)
return loaded, err
}