mirror of
https://github.com/charlienet/go-mixed.git
synced 2026-07-14 08:17:26 +08:00
c44a325384
locker: 导出 RWLocker/EmptyLocker 接口, 新增 WithRWLocker, 重构 SourceLocker 竞态、Synchronize 数据竞态 collections/linked_list: 补齐 ForEach/Size/GetAt/RemoveAt/ToList 等方法的锁保护 collections/queue,stack: Peek/Size/IsEmpty 加锁 collections/list/linked_list: Front/Back/GetAt 加锁 maps: rwlock_map.Exist/Count, hash_map.Count 加锁 delay_queue/mem_store: Pop 原子化、Len/IsEmpty 加锁 cleanup_guard: Run() 检查 enable 标志 sets/ketama: 修复接口变更导致的 nil 空指针
181 lines
2.8 KiB
Go
181 lines
2.8 KiB
Go
package sets
|
|
|
|
import (
|
|
"bytes"
|
|
"encoding/json"
|
|
"fmt"
|
|
"strings"
|
|
|
|
"github.com/charlienet/go-mixed/locker"
|
|
"golang.org/x/exp/constraints"
|
|
)
|
|
|
|
var _ Set[string] = &hash_set[string]{}
|
|
|
|
type hash_set[T constraints.Ordered] struct {
|
|
m map[T]struct{}
|
|
locker locker.RWLocker
|
|
}
|
|
|
|
func NewHashSet[T constraints.Ordered](values ...T) *hash_set[T] {
|
|
set := hash_set[T]{
|
|
m: make(map[T]struct{}, len(values)),
|
|
locker: locker.EmptyLocker,
|
|
}
|
|
|
|
set.Add(values...)
|
|
return &set
|
|
}
|
|
|
|
func (s *hash_set[T]) Sync() *hash_set[T] {
|
|
s.locker = locker.NewRWLocker()
|
|
return s
|
|
}
|
|
|
|
func (s *hash_set[T]) Add(values ...T) Set[T] {
|
|
s.locker.Lock()
|
|
defer s.locker.Unlock()
|
|
|
|
for _, v := range values {
|
|
s.m[v] = struct{}{}
|
|
}
|
|
|
|
return s
|
|
}
|
|
|
|
func (s *hash_set[T]) Remove(v T) Set[T] {
|
|
s.locker.Lock()
|
|
defer s.locker.Unlock()
|
|
|
|
delete(s.m, v)
|
|
|
|
return s
|
|
}
|
|
|
|
func (s *hash_set[T]) Contains(value T) bool {
|
|
s.locker.RLock()
|
|
defer s.locker.RUnlock()
|
|
|
|
_, ok := s.m[value]
|
|
return ok
|
|
}
|
|
|
|
func (s *hash_set[T]) ContainsAny(values ...T) bool {
|
|
s.locker.RLock()
|
|
defer s.locker.RUnlock()
|
|
|
|
for _, v := range values {
|
|
if _, ok := s.m[v]; ok {
|
|
return true
|
|
}
|
|
}
|
|
|
|
return false
|
|
}
|
|
|
|
func (s *hash_set[T]) ContainsAll(values ...T) bool {
|
|
s.locker.RLock()
|
|
defer s.locker.RUnlock()
|
|
|
|
for _, v := range values {
|
|
if _, ok := s.m[v]; !ok {
|
|
return false
|
|
}
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
func (s *hash_set[T]) Asc() Set[T] {
|
|
return s.copyToSorted().Asc()
|
|
}
|
|
|
|
func (s *hash_set[T]) Desc() Set[T] {
|
|
return s.copyToSorted().Desc()
|
|
}
|
|
|
|
func (s *hash_set[T]) copyToSorted() Set[T] {
|
|
orderd := NewSortedSet[T]()
|
|
for k := range s.m {
|
|
orderd.Add(k)
|
|
}
|
|
|
|
return orderd
|
|
}
|
|
|
|
func (s *hash_set[T]) Shrink() *hash_set[T] {
|
|
return s
|
|
}
|
|
|
|
func (s *hash_set[T]) Clone() *hash_set[T] {
|
|
set := NewHashSet[T]()
|
|
set.Add(s.ToSlice()...)
|
|
return set
|
|
}
|
|
|
|
func (s *hash_set[T]) Iterate(fn func(value T)) {
|
|
for v := range s.m {
|
|
fn(v)
|
|
}
|
|
}
|
|
|
|
func (s *hash_set[T]) ToSlice() []T {
|
|
values := make([]T, 0, s.Size())
|
|
s.Iterate(func(value T) {
|
|
values = append(values, value)
|
|
})
|
|
|
|
return values
|
|
}
|
|
|
|
func (s *hash_set[T]) IsEmpty() bool {
|
|
return len(s.m) == 0
|
|
}
|
|
|
|
func (s *hash_set[T]) Size() int {
|
|
return len(s.m)
|
|
}
|
|
|
|
func (s *hash_set[T]) MarshalJSON() ([]byte, error) {
|
|
items := make([]string, 0, s.Size())
|
|
|
|
for ele := range s.m {
|
|
b, err := json.Marshal(ele)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
items = append(items, string(b))
|
|
}
|
|
|
|
return []byte(fmt.Sprintf("[%s]", strings.Join(items, ", "))), nil
|
|
}
|
|
|
|
func (s *hash_set[T]) UnmarshalJSON(b []byte) error {
|
|
var i []any
|
|
|
|
d := json.NewDecoder(bytes.NewReader(b))
|
|
d.UseNumber()
|
|
err := d.Decode(&i)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
for _, v := range i {
|
|
if t, ok := v.(T); ok {
|
|
s.Add(t)
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func (s *hash_set[T]) String() string {
|
|
l := make([]string, 0, len(s.m))
|
|
for k := range s.m {
|
|
l = append(l, fmt.Sprint(k))
|
|
}
|
|
|
|
return fmt.Sprintf("{%s}", strings.Join(l, ", "))
|
|
}
|