1
0
mirror of https://github.com/charlienet/go-mixed.git synced 2025-07-18 08:32:40 +08:00
This commit is contained in:
2022-11-18 16:53:59 +08:00
parent 6e24cf5bdc
commit b76be4ce6b
17 changed files with 103 additions and 180 deletions

View File

@ -1 +0,0 @@
package collections

View File

@ -1,11 +0,0 @@
package collections
import "github.com/charlienet/go-mixed/locker"
type options struct {
mu locker.RWLocker
}
func emptyLocker() locker.RWLocker {
return locker.EmptyLocker
}

View File

@ -1,42 +0,0 @@
package collections
import "sync"
type rw_queue[T any] struct {
q Queue[T]
mu sync.Mutex
}
func (q *rw_queue[T]) Push(v T) {
q.mu.Lock()
q.q.Put(v)
q.mu.Unlock()
}
func (q *rw_queue[T]) Pop() T {
q.mu.Lock()
defer q.mu.Unlock()
return q.q.Poll()
}
func (q *rw_queue[T]) Peek() T {
q.mu.Lock()
defer q.mu.Unlock()
return q.q.Peek()
}
func (q *rw_queue[T]) Size() int {
q.mu.Lock()
defer q.mu.Unlock()
return q.q.Size()
}
func (q *rw_queue[T]) IsEmpty() bool {
q.mu.Lock()
defer q.mu.Unlock()
return q.q.IsEmpty()
}

View File

@ -1,81 +0,0 @@
package collections
import "sync"
var _ Stack[string] = &ArrayStack[string]{}
type Stack[T any] interface {
Push(T)
Pop() T
}
type ArrayStack[T any] struct {
array []T // 底层切片
size int // 栈的元素数量
lock sync.Mutex // 为了并发安全使用的锁
}
// 初始化堆栈
func NewArrayStack[T any]() *ArrayStack[T] {
return &ArrayStack[T]{}
}
// 入栈
func (s *ArrayStack[T]) Push(v T) {
s.lock.Lock()
defer s.lock.Unlock()
// 放入切片中,后进的元素放在数组最后面
s.array = append(s.array, v)
// 栈中元素数量+1
s.size = s.size + 1
}
func (s *ArrayStack[T]) Pop() T {
s.lock.Lock()
defer s.lock.Unlock()
if s.size == 0 {
panic("empty")
}
// 栈顶元素
v := s.array[s.size-1]
// 切片收缩,但可能占用空间越来越大
//stack.array = stack.array[0 : stack.size-1]
// 创建新的数组,空间占用不会越来越大,但可能移动元素次数过多
newArray := make([]T, s.size-1, s.size-1)
for i := 0; i < s.size-1; i++ {
newArray[i] = s.array[i]
}
s.array = newArray
// 栈中元素数量-1
s.size = s.size - 1
return v
}
// 获取栈顶元素
func (s *ArrayStack[T]) Peek() T {
// 栈中元素已空
if s.size == 0 {
panic("empty")
}
// 栈顶元素值
v := s.array[s.size-1]
return v
}
// 栈大小
func (s *ArrayStack[T]) Size() int {
return s.size
}
// 栈是否为空
func (s *ArrayStack[T]) IsEmpty() bool {
return s.size == 0
}

View File

@ -1,24 +0,0 @@
package collections_test
import (
"testing"
"github.com/charlienet/go-mixed/collections"
)
func TestStack(t *testing.T) {
arrayStack := collections.NewArrayStack[string]()
arrayStack.Push("cat")
arrayStack.Push("dog")
arrayStack.Push("hen")
t.Log("size:", arrayStack.Size())
t.Log("pop:", arrayStack.Pop())
t.Log("pop:", arrayStack.Pop())
t.Log("size:", arrayStack.Size())
arrayStack.Push("drag")
t.Log("pop:", arrayStack.Pop())
arrayStack.Push("test")
s := arrayStack.Pop()
t.Log(s)
}