mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-22 03:30:35 +00:00
4f6cb3209d
* generic-map * add tx bench * fix keys * rename functions to hopfully make static lint hapy * reduce a line :) * remove generic map --------- Co-authored-by: Raul Jordan <raul@prysmaticlabs.com> Co-authored-by: Radosław Kapka <rkapka@wp.pl>
97 lines
2.0 KiB
Go
97 lines
2.0 KiB
Go
// Package threadsafe contains generic containers that are
|
|
// protected either by Mutexes or atomics underneath the hood.
|
|
package threadsafe
|
|
|
|
import "sync"
|
|
|
|
// Map implements a simple thread-safe map protected by a mutex.
|
|
type Map[K comparable, V any] struct {
|
|
items map[K]V
|
|
lock sync.RWMutex
|
|
}
|
|
|
|
// NewThreadSafeMap returns a thread-safe map instance from a normal map.
|
|
func NewThreadSafeMap[K comparable, V any](m map[K]V) *Map[K, V] {
|
|
return &Map[K, V]{
|
|
items: m,
|
|
}
|
|
}
|
|
|
|
// view an immutable snapshot of the map
|
|
func (m *Map[K, V]) View(fn func(mp map[K]V)) {
|
|
m.read(fn)
|
|
}
|
|
|
|
// Do an action on the thread safe map
|
|
func (m *Map[K, V]) Do(fn func(mp map[K]V)) {
|
|
m.write(fn)
|
|
}
|
|
|
|
// Keys returns the keys of a thread-safe map.
|
|
func (m *Map[K, V]) Keys() (r []K) {
|
|
m.View(func(mp map[K]V) {
|
|
r = make([]K, 0, len(m.items))
|
|
for k := range mp {
|
|
key := k
|
|
r = append(r, key)
|
|
}
|
|
})
|
|
return r
|
|
}
|
|
|
|
// Len of the thread-safe map.
|
|
func (m *Map[K, V]) Len() (l int) {
|
|
m.View(func(mp map[K]V) {
|
|
l = len(m.items)
|
|
})
|
|
return
|
|
}
|
|
|
|
// Get an item from a thread-safe map.
|
|
func (m *Map[K, V]) Get(k K) (v V, ok bool) {
|
|
m.View(func(mp map[K]V) {
|
|
v, ok = mp[k]
|
|
})
|
|
return v, ok
|
|
}
|
|
|
|
// Range runs the function fn(k K, v V) bool for each key value pair
|
|
// The keys are determined by a snapshot taken at the beginning of the range call
|
|
// If fn returns false, then the loop stops
|
|
// Only one invocation of fn will be active at one time, the iteration order is unspecified.
|
|
func (m *Map[K, V]) Range(fn func(k K, v V) bool) {
|
|
m.View(func(mp map[K]V) {
|
|
for k, v := range mp {
|
|
if !fn(k, v) {
|
|
return
|
|
}
|
|
}
|
|
})
|
|
}
|
|
|
|
// Put an item into a thread-safe map.
|
|
func (m *Map[K, V]) Put(k K, v V) {
|
|
m.Do(func(mp map[K]V) {
|
|
mp[k] = v
|
|
})
|
|
}
|
|
|
|
// Delete an item from a thread-safe map.
|
|
func (m *Map[K, V]) Delete(k K) {
|
|
m.Do(func(mp map[K]V) {
|
|
delete(m.items, k)
|
|
})
|
|
}
|
|
|
|
func (m *Map[K, V]) read(fn func(mp map[K]V)) {
|
|
m.lock.RLock()
|
|
fn(m.items)
|
|
m.lock.RUnlock()
|
|
}
|
|
|
|
func (m *Map[K, V]) write(fn func(mp map[K]V)) {
|
|
m.lock.Lock()
|
|
fn(m.items)
|
|
m.lock.Unlock()
|
|
}
|