73 lines
1.4 KiB
Go
73 lines
1.4 KiB
Go
package maps
|
|
|
|
import "sync"
|
|
|
|
type Map[K comparable, V any] struct {
|
|
m *sync.Map
|
|
}
|
|
|
|
func (gm *Map[K, V]) Store(key K, value V) {
|
|
gm.m.Store(key, value)
|
|
}
|
|
|
|
func (gm *Map[K, V]) Load(key K) (V, bool) {
|
|
value, ok := gm.m.Load(key)
|
|
if !ok {
|
|
var zero V
|
|
return zero, false
|
|
}
|
|
return value.(V), true
|
|
}
|
|
|
|
func (gm *Map[K, V]) Delete(key K) {
|
|
gm.m.Delete(key)
|
|
}
|
|
|
|
func (gm *Map[K, V]) Range(f func(key K, value V) bool) {
|
|
gm.m.Range(func(key, value any) bool {
|
|
return f(key.(K), value.(V))
|
|
})
|
|
}
|
|
|
|
func (gm *Map[K, V]) Swap(key K, value V) (previous V, loaded bool) {
|
|
actual, swapped := gm.m.Swap(key, value)
|
|
return actual.(V), swapped
|
|
}
|
|
|
|
func (gm *Map[K, V]) Len() int {
|
|
var n int
|
|
gm.m.Range(func(key, value any) bool {
|
|
n++
|
|
return true
|
|
})
|
|
return n
|
|
}
|
|
|
|
func (gm *Map[K, V]) Clear() {
|
|
gm.m.Clear()
|
|
}
|
|
|
|
func (gm *Map[K, V]) LoadOrStore(key K, value V) (V, bool) {
|
|
actual, loaded := gm.m.LoadOrStore(key, value)
|
|
return actual.(V), loaded
|
|
}
|
|
|
|
func (gm *Map[K, V]) LoadAndDelete(key K) (value V, loaded bool) {
|
|
actual, loaded := gm.m.LoadAndDelete(key)
|
|
return actual.(V), loaded
|
|
}
|
|
|
|
func (gm *Map[K, V]) CompareAndSwap(key K, old V, new V) (swapped bool) {
|
|
return gm.m.CompareAndSwap(key, old, new)
|
|
}
|
|
|
|
func (gm *Map[K, V]) CompareAndDelete(key K, old V) (deleted bool) {
|
|
return gm.m.CompareAndDelete(key, old)
|
|
}
|
|
|
|
func New[K comparable, V any]() *Map[K, V] {
|
|
return &Map[K, V]{
|
|
m: new(sync.Map),
|
|
}
|
|
}
|