queue

Documentation

Index

• type LockFreeQueue
  • func NewLockFreeQueue[T any]() *LockFreeQueue[T]
  • func (q *LockFreeQueue[T]) Dequeue() (T, bool)
  • func (q *LockFreeQueue[T]) Enqueue(v T)
  • func (q *LockFreeQueue[T]) Length() uint64

Types

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 NewLockFreeQueue

func NewLockFreeQueue[T any]() *LockFreeQueue[T]

NewLockFreeQueue creates a new lock-free queue.

func (*LockFreeQueue[T]) Dequeue

func (q *LockFreeQueue[T]) Dequeue() (T, 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.