queue

README

单独看这个无锁queue比mutex+slice、chan性能都要好，但是当实际使用时并发量上来后，大量的goroutine CAS可能还是会导致整体效率下降，反而不如mutex锁逐步膨胀带来的效率好。

使用后记得做下benchmark，我在做rpc性能统计时需要用到一个sliding window，基于该无锁队列实现的版本，并没有比基于chan实现的版本好到哪里去，反而性能在并发量大时更差。

Documentation

Index

• type ChanQueue
  • func (c *ChanQueue[T]) Dequeue() (value T, ok bool)
  • func (c *ChanQueue[T]) Enqueue(i T)
  • func (c *ChanQueue[T]) Length() uint64
• type IQueue
  • func NewChanQueue[T any](size int) IQueue[T]
  • func NewLockfreeQueue[T any]() IQueue[T]
  • func NewMutexSliceQueue[T any]() IQueue[T]
• type LockFreeQueue
  • func (q *LockFreeQueue[T]) Dequeue() (value T, ok bool)
  • func (q *LockFreeQueue[T]) Enqueue(v T)
  • func (q *LockFreeQueue[T]) Length() uint64
• type MutexSliceQueue
  • func (q *MutexSliceQueue[T]) Dequeue() (value T, ok bool)
  • func (q *MutexSliceQueue[T]) Enqueue(v T)
  • func (q *MutexSliceQueue[T]) Length() uint64

Types

type ChanQueue

type ChanQueue[T any] struct {
	// contains filtered or unexported fields
}

func (*ChanQueue[T]) Dequeue

func (c *ChanQueue[T]) Dequeue() (value T, ok bool)

func (*ChanQueue[T]) Enqueue

func (c *ChanQueue[T]) Enqueue(i T)

func (*ChanQueue[T]) Length

func (c *ChanQueue[T]) Length() uint64

type IQueue

type IQueue[T any] interface {
	Enqueue(T)
	Dequeue() (T, bool)
	Length() uint64
}

func NewChanQueue

func NewChanQueue[T any](size int) IQueue[T]

func NewLockfreeQueue

func NewLockfreeQueue[T any]() IQueue[T]

NewLockfreeQueue creates a new lock-free queue.

func NewMutexSliceQueue

func NewMutexSliceQueue[T any]() IQueue[T]

type LockFreeQueue

type LockFreeQueue[T any] struct {
	// contains filtered or unexported fields
}

LockFreeQueue implements lock-free FIFO freelist based queue. ref: https://dl.acm.org/citation.cfm?doid=248052.248106

func (*LockFreeQueue[T]) Dequeue

func (q *LockFreeQueue[T]) Dequeue() (value T, ok bool)

Dequeue removes and returns the value at the head of the queue. It returns nil if the queue is empty.

func (*LockFreeQueue[T]) Enqueue

func (q *LockFreeQueue[T]) Enqueue(v T)

Enqueue puts the given value v at the tail of the queue.

func (*LockFreeQueue[T]) Length

func (q *LockFreeQueue[T]) Length() uint64

Length returns the length of the queue.

type MutexSliceQueue

type MutexSliceQueue[T any] struct {
	// contains filtered or unexported fields
}

func (*MutexSliceQueue[T]) Dequeue

func (q *MutexSliceQueue[T]) Dequeue() (value T, ok bool)

func (*MutexSliceQueue[T]) Enqueue

func (q *MutexSliceQueue[T]) Enqueue(v T)

func (*MutexSliceQueue[T]) Length

func (q *MutexSliceQueue[T]) Length() uint64