mirror of
https://github.com/charlienet/go-mixed.git
synced 2025-07-18 08:32:40 +08:00
map
This commit is contained in:
131
maps/concurrent_map.go
Normal file
131
maps/concurrent_map.go
Normal file
@ -0,0 +1,131 @@
|
||||
package maps
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"runtime"
|
||||
"sync"
|
||||
|
||||
"github.com/charlienet/go-mixed/bytesconv"
|
||||
"github.com/charlienet/go-mixed/hash"
|
||||
"golang.org/x/exp/constraints"
|
||||
)
|
||||
|
||||
var defaultNumOfBuckets = runtime.GOMAXPROCS(runtime.NumCPU())
|
||||
|
||||
type ConcurrnetMap[K constraints.Ordered, V any] struct {
|
||||
buckets []Map[K, V]
|
||||
numOfBuckets uint64
|
||||
}
|
||||
|
||||
func NewConcurrentMap[K constraints.Ordered, V any]() *ConcurrnetMap[K, V] {
|
||||
num := defaultNumOfBuckets
|
||||
|
||||
buckets := make([]Map[K, V], num)
|
||||
for i := 0; i < num; i++ {
|
||||
buckets[i] = NewRWMap[K, V]()
|
||||
}
|
||||
|
||||
return &ConcurrnetMap[K, V]{
|
||||
numOfBuckets: uint64(num),
|
||||
buckets: buckets,
|
||||
}
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) Set(key K, value V) {
|
||||
m.getBucket(key).Set(key, value)
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) Get(key K) (V, bool) {
|
||||
return m.getBucket(key).Get(key)
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) Delete(key K) {
|
||||
im := m.getBucket(key)
|
||||
im.Delete(key)
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) Exist(key K) bool {
|
||||
mm := m.getBucket(key)
|
||||
return mm.Exist(key)
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) ForEach(f func(K, V)) {
|
||||
var wg sync.WaitGroup
|
||||
|
||||
num := int(m.numOfBuckets)
|
||||
|
||||
wg.Add(int(m.numOfBuckets))
|
||||
for i := 0; i < num; i++ {
|
||||
go func(i int) {
|
||||
m.buckets[i].ForEach(f)
|
||||
wg.Done()
|
||||
}(i)
|
||||
}
|
||||
|
||||
wg.Wait()
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) Clone() Map[K, V] {
|
||||
|
||||
num := int(m.numOfBuckets)
|
||||
|
||||
buckets := make([]Map[K, V], m.numOfBuckets)
|
||||
for i := 0; i < num; i++ {
|
||||
buckets[i] = m.buckets[i].Clone()
|
||||
}
|
||||
|
||||
return &ConcurrnetMap[K, V]{
|
||||
buckets: buckets,
|
||||
numOfBuckets: m.numOfBuckets,
|
||||
}
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) Clear() {
|
||||
for i := 0; i < int(m.numOfBuckets); i++ {
|
||||
m.buckets[i].Clear()
|
||||
}
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) Count() int {
|
||||
var count int
|
||||
for i := 0; i < int(m.numOfBuckets); i++ {
|
||||
count += m.buckets[i].Count()
|
||||
}
|
||||
|
||||
return count
|
||||
}
|
||||
|
||||
func (m *ConcurrnetMap[K, V]) getBucket(k K) Map[K, V] {
|
||||
id := getTag(k) % m.numOfBuckets
|
||||
return m.buckets[id]
|
||||
}
|
||||
|
||||
func getTag[T comparable](v T) uint64 {
|
||||
var vv any = v
|
||||
|
||||
switch vv.(type) {
|
||||
case string:
|
||||
return fnv(vv.(string))
|
||||
case int8:
|
||||
return uint64(vv.(int8))
|
||||
case uint8:
|
||||
return uint64(vv.(uint8))
|
||||
case int:
|
||||
return uint64(vv.(int))
|
||||
case int32:
|
||||
return uint64(vv.(int32))
|
||||
case uint32:
|
||||
return uint64(vv.(uint32))
|
||||
case int64:
|
||||
return uint64(vv.(int64))
|
||||
case uint64:
|
||||
return vv.(uint64)
|
||||
default:
|
||||
return fnv(fmt.Sprintf("%v", v))
|
||||
}
|
||||
}
|
||||
|
||||
func fnv(k string) uint64 {
|
||||
bytes := bytesconv.StringToBytes(k)
|
||||
return uint64(hash.Funv32(bytes))
|
||||
}
|
Reference in New Issue
Block a user