|
| 1 | +// apache 2.0 antlabs |
| 2 | + |
| 3 | +package rwmap |
| 4 | + |
| 5 | +import "sync" |
| 6 | + |
| 7 | +type RWMap[K comparable, V any] struct { |
| 8 | + rw sync.RWMutex |
| 9 | + m map[K]V |
| 10 | +} |
| 11 | + |
| 12 | +type Pair[K comparable, V any] struct { |
| 13 | + Key K |
| 14 | + Val V |
| 15 | +} |
| 16 | + |
| 17 | +// 通过new函数分配可以指定map的长度 |
| 18 | +func New[K comparable, V any](l int) *RWMap[K, V] { |
| 19 | + return &RWMap[K, V]{ |
| 20 | + m: make(map[K]V, l), |
| 21 | + } |
| 22 | +} |
| 23 | + |
| 24 | +// 删除 |
| 25 | +func (r *RWMap[K, V]) Delete(key K) { |
| 26 | + r.rw.Lock() |
| 27 | + delete(r.m, key) |
| 28 | + r.rw.Unlock() |
| 29 | +} |
| 30 | + |
| 31 | +// 加载 |
| 32 | +func (r *RWMap[K, V]) Load(key K) (value V, ok bool) { |
| 33 | + r.rw.RLock() |
| 34 | + value, ok = r.m[key] |
| 35 | + r.rw.RUnlock() |
| 36 | + return |
| 37 | + |
| 38 | +} |
| 39 | + |
| 40 | +// 获取值,然后并删除 |
| 41 | +func (r *RWMap[K, V]) LoadAndDelete(key K) (value V, loaded bool) { |
| 42 | + r.rw.Lock() |
| 43 | + if r.m == nil { |
| 44 | + r.rw.Unlock() |
| 45 | + return |
| 46 | + } |
| 47 | + value, loaded = r.m[key] |
| 48 | + delete(r.m, key) |
| 49 | + r.rw.Unlock() |
| 50 | + return |
| 51 | +} |
| 52 | + |
| 53 | +// 存在返回现有的值,loaded 为true |
| 54 | +// 不存在就保存现在的值,loaded为false |
| 55 | +func (r *RWMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool) { |
| 56 | + r.rw.Lock() |
| 57 | + if r.m == nil { |
| 58 | + r.m = make(map[K]V) |
| 59 | + } |
| 60 | + actual, loaded = r.m[key] |
| 61 | + if !loaded { |
| 62 | + actual = value |
| 63 | + r.m[key] = actual |
| 64 | + } |
| 65 | + r.rw.Unlock() |
| 66 | + return |
| 67 | +} |
| 68 | + |
| 69 | +func (r *RWMap[K, V]) Range(f func(key K, value V) bool) { |
| 70 | + r.rw.RLock() |
| 71 | + for k, v := range r.m { |
| 72 | + if !f(k, v) { |
| 73 | + break |
| 74 | + } |
| 75 | + } |
| 76 | + r.rw.RUnlock() |
| 77 | +} |
| 78 | + |
| 79 | +func (r *RWMap[K, V]) Iter() <-chan Pair[K, V] { |
| 80 | + p := make(chan Pair[K, V]) |
| 81 | + go func() { |
| 82 | + r.rw.RLock() |
| 83 | + for k, v := range r.m { |
| 84 | + p <- Pair[K, V]{Key: k, Val: v} |
| 85 | + } |
| 86 | + close(p) |
| 87 | + r.rw.RUnlock() |
| 88 | + |
| 89 | + }() |
| 90 | + return p |
| 91 | +} |
| 92 | + |
| 93 | +// 保存值 |
| 94 | +func (r *RWMap[K, V]) Store(key K, value V) { |
| 95 | + r.rw.Lock() |
| 96 | + if r.m == nil { |
| 97 | + r.m = make(map[K]V) |
| 98 | + } |
| 99 | + r.m[key] = value |
| 100 | + r.rw.Unlock() |
| 101 | +} |
| 102 | + |
| 103 | +// 返回长度 |
| 104 | +func (r *RWMap[K, V]) Len() (l int) { |
| 105 | + r.rw.RLock() |
| 106 | + l = len(r.m) |
| 107 | + r.rw.RUnlock() |
| 108 | + return |
| 109 | +} |
0 commit comments