1
0
mirror of https://github.com/charlienet/go-mixed.git synced 2025-07-17 16:12:42 +08:00
Files
go-mixed/maps/rwlock_map.go
2022-09-01 12:37:57 +08:00

102 lines
1.6 KiB
Go

package maps
import (
"sync"
"golang.org/x/exp/constraints"
)
var _ Map[string, any] = &rw_map[string, any]{}
type rw_map[K constraints.Ordered, V any] struct {
m Map[K, V]
mu sync.RWMutex
}
func NewRWMap[K constraints.Ordered, V any](maps ...map[K]V) *rw_map[K, V] {
merged := Merge(maps...)
return &rw_map[K, V]{m: NewHashMap(merged)}
}
func newRWMap[K constraints.Ordered, V any](m Map[K, V]) *rw_map[K, V] {
return &rw_map[K, V]{m: m}
}
func (m *rw_map[K, V]) Set(key K, value V) {
m.mu.Lock()
m.m.Set(key, value)
m.mu.Unlock()
}
func (m *rw_map[K, V]) Get(key K) (V, bool) {
m.mu.RLock()
defer m.mu.RUnlock()
return m.m.Get(key)
}
func (m *rw_map[K, V]) Delete(key K) {
m.mu.Lock()
defer m.mu.Unlock()
m.m.Delete(key)
}
func (m *rw_map[K, V]) Keys() []K {
m.mu.RLock()
defer m.mu.RUnlock()
return m.m.Keys()
}
func (m *rw_map[K, V]) Values() []V {
m.mu.RLock()
defer m.mu.RUnlock()
return m.m.Values()
}
func (m *rw_map[K, V]) ToMap() map[K]V {
m.mu.RLock()
defer m.mu.RUnlock()
return m.m.ToMap()
}
func (m *rw_map[K, V]) Shrink() map[K]V {
return m.m.ToMap()
}
func (m *rw_map[K, V]) Exist(key K) bool {
return m.m.Exist(key)
}
func (m *rw_map[K, V]) Count() int {
return m.m.Count()
}
func (m *rw_map[K, V]) Iter() <-chan *Entry[K, V] {
m.mu.RLock()
defer m.mu.RUnlock()
return m.m.Iter()
}
func (m *rw_map[K, V]) ForEach(f func(K, V) bool) {
m.mu.RLock()
cloned := m.m.Clone()
m.mu.RUnlock()
cloned.ForEach(f)
}
func (m *rw_map[K, V]) Clone() Map[K, V] {
return newRWMap(m.m.Clone())
}
func (m *rw_map[K, V]) Clear() {
m.mu.Lock()
m.m.Clear()
m.mu.Unlock()
}