fix: 修复多处并发安全问题及锁实现重构

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 空指针

collections/linked_list.go

@@ -95,20 +95,22 @@ func (l *LinkedList[T]) PushTail() {
 }
 
 func (l *LinkedList[T]) Exist(v T) bool {
-	ret := false
-	l.ForEach(func(t T) bool {
-		// if t == v {
-		// 	ret = true
-		// 	return true
-		// }
+	l.mu.RLock()
+	defer l.mu.RUnlock()
 
-		return false
-	})
+	for current := l.head; current != nil; current = current.next {
+		if any(current.item) == any(v) {
+			return true
+		}
+	}
 
-	return ret
+	return false
 }
 
 func (l *LinkedList[T]) RemoveAt(index int) {
+	l.mu.Lock()
+	defer l.mu.Unlock()
+
 	var i int
 	var prev *linkedNode[T]
 
@@ -130,15 +132,22 @@ func (l *LinkedList[T]) RemoveAt(index int) {
 }
 
 func (l *LinkedList[T]) IsEmpty() bool {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
 	return l.size == 0
 }
 
 func (l *LinkedList[T]) Size() int {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
 	return l.size
 }
 
 func (l *LinkedList[T]) GetAt(i int) T {
-	if i <= l.Size() {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
+	if i < l.size {
 		var n int
 		for current := l.head; current != nil; current = current.next {
 			if n == i {
@@ -152,6 +161,9 @@ func (l *LinkedList[T]) GetAt(i int) T {
 }
 
 func (l *LinkedList[T]) ForEach(fn func(T) bool) {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
 	for current := l.head; current != nil; current = current.next {
 		if fn(current.item) {
 			break
@@ -160,26 +172,42 @@ func (l *LinkedList[T]) ForEach(fn func(T) bool) {
 }
 
 func (l *LinkedList[T]) Clear() {
+	l.mu.Lock()
+	defer l.mu.Unlock()
+
 	l.head = nil
 	l.tail = nil
 	l.size = 0
 }
 
 func (l *LinkedList[T]) ToList() []T {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
 	ret := make([]T, 0, l.size)
-	l.ForEach(func(t T) bool {
-		ret = append(ret, t)
-		return false
-	})
+	for current := l.head; current != nil; current = current.next {
+		ret = append(ret, current.item)
+	}
 
 	return ret
 }
 
 func (l *LinkedList[T]) String() string {
-	return fmt.Sprint(l.ToList())
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
+	ret := make([]T, 0, l.size)
+	for current := l.head; current != nil; current = current.next {
+		ret = append(ret, current.item)
+	}
+
+	return fmt.Sprint(ret)
 }
 
 func (l *LinkedList[T]) remove(n *linkedNode[T]) {
+	l.mu.Lock()
+	defer l.mu.Unlock()
+
 	n.next = nil
 	l.size--
 }

collections/list/linked_list.go

@@ -40,21 +40,38 @@ func (l *LinkedList[T]) PushFront(v T) *LinkedList[T] {
 }
 
 func (l *LinkedList[T]) FrontNode() *LinkedNode[T] {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
 	return l.front
 }
 
 func (l *LinkedList[T]) Front() T {
-	return l.FrontNode().Value
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
+	if l.size == 0 {
+		panic(ErrorOutOffRange)
+	}
+
+	return l.front.Value
 }
 
 func (l *LinkedList[T]) BackNode() *LinkedNode[T] {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
 	return l.tail
 }
 
 func (l *LinkedList[T]) Back() T {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
 	if l.size == 0 {
 		panic(ErrorOutOffRange)
 	}
+
 	return l.tail.Value
 }
 
@@ -70,7 +87,10 @@ func (l *LinkedList[T]) ForEach(fn func(T) bool) {
 }
 
 func (l *LinkedList[T]) GetAt(i int) T {
-	if i <= l.Size() {
+	l.mu.RLock()
+	defer l.mu.RUnlock()
+
+	if i < l.size {
 		for n, current := 0, l.front; current != nil; current, n = current.Next, n+1 {
 			if n == i {
 				return current.Value

collections/queue.go

@@ -56,15 +56,28 @@ func (q *ArrayQueue[T]) Poll() T {
 }
 
 func (q *ArrayQueue[T]) Peek() T {
+	q.lock.Lock()
+	defer q.lock.Unlock()
+
+	if q.size == 0 {
+		panic("empty")
+	}
+
 	return q.array[0]
 }
 
 // 栈大小
 func (q *ArrayQueue[T]) Size() int {
+	q.lock.Lock()
+	defer q.lock.Unlock()
+
 	return q.size
 }
 
 // 栈是否为空
 func (q *ArrayQueue[T]) IsEmpty() bool {
+	q.lock.Lock()
+	defer q.lock.Unlock()
+
 	return q.size == 0
 }

collections/stack/stack.go

@@ -60,22 +60,29 @@ func (s *ArrayStack[T]) Pop() T {
 
 // 获取栈顶元素
 func (s *ArrayStack[T]) Peek() T {
-	// 栈中元素已空
+	s.lock.Lock()
+	defer s.lock.Unlock()
+
 	if s.size == 0 {
 		panic("empty")
 	}
 
-	// 栈顶元素值
 	v := s.array[s.size-1]
 	return v
 }
 
 // 栈大小
 func (s *ArrayStack[T]) Size() int {
+	s.lock.Lock()
+	defer s.lock.Unlock()
+
 	return s.size
 }
 
 // 栈是否为空
 func (s *ArrayStack[T]) IsEmpty() bool {
+	s.lock.Lock()
+	defer s.lock.Unlock()
+
 	return s.size == 0
 }