queue

package

v0.11.1 Latest Latest Go to latest Published: Mar 13, 2026 License: MIT Imports: 2 Imported by: 0

Documentation ¶

This section is empty.

This section is empty.

This section is empty.

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

FiFo implements a first-in-first-out queue backed by the shared queue base.

func (q *FiFo) GetLength() uint64

GetLength returns the current length guarded by the mutex.

func (q *FiFo) GetLength2() uint64

GetLength2 exposes the raw length value without locking.

func (q *FiFo[T]) Insert(items ...*T)

Insert appends the provided items to the tail of the queue.

func (q *FiFo) Pop() (*T, error)

Pop removes and returns the item at the head of the queue.

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

LiFo implements a last-in-first-out stack behaviour.

func (q *LiFo) GetLength() uint64

GetLength returns the current length guarded by the mutex.

func (q *LiFo) GetLength2() uint64

GetLength2 exposes the raw length value without locking.

func (q *LiFo[T]) Insert(items ...*T)

Insert pushes the provided items onto the stack in order.

func (q *LiFo) Pop() (*T, error)

Pop removes and returns the item at the head of the queue.