Documentation
¶
Index ¶
Examples ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type LockFreeQueue ¶ added in v0.3.0
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
Example ¶
q := NewLockFreeQueue[string]()
q.Enqueue("1st item")
q.Enqueue("2nd item")
q.Enqueue("3rd item")
fmt.Println(q.Dequeue())
fmt.Println(q.Dequeue())
fmt.Println(q.Dequeue())
Output: 1st item true 2nd item true 3rd item true
func NewLockFreeQueue ¶ added in v0.3.0
func NewLockFreeQueue[T any]() *LockFreeQueue[T]
NewLockFreeQueue creates a new lock-free queue.
func (*LockFreeQueue[T]) Dequeue ¶ added in v0.3.0
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 ¶ added in v0.3.0
func (q *LockFreeQueue[T]) Enqueue(v T)
Enqueue puts the given value v at the tail of the queue.
func (*LockFreeQueue[T]) Len ¶ added in v0.10.8
func (q *LockFreeQueue[T]) Len() uint64
Len returns the length of the queue.
type MutexQueue ¶ added in v0.10.8
type MutexQueue[T any] struct { // contains filtered or unexported fields }
func NewMutexQueue ¶ added in v0.10.8
func NewMutexQueue[T any]() *MutexQueue[T]
func (*MutexQueue[T]) Dequeue ¶ added in v0.10.8
func (q *MutexQueue[T]) Dequeue() (T, bool)
func (*MutexQueue[T]) Enqueue ¶ added in v0.10.8
func (q *MutexQueue[T]) Enqueue(v T)
Source Files
Directories
Click to show internal directories.
Click to hide internal directories.