queue

package

v0.0.0-...-ec87a65 Latest Latest Go to latest Published: Oct 5, 2025 License: MIT Imports: 2 Imported by: 0

Details

Paackage queue implements a growable queue implemented using a circlar buffer

The naive way to implement a queue is very wastful and lets the underlying buffer grow without bound.

This section is empty.

This section is empty.

This section is empty.

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

func NewQueue[T any](initialCapacity uint) Queue[T]

func (self *Queue[T]) Empty() bool

func (self *Queue[T]) Len() uint

func (self *Queue[T]) Pop() (T, bool)

Pops an element from the front of the queue and returns it

If the queue is empty, the second value will be `false`

func (self *Queue[T]) Push(elem T)

Pushes an element to the back of the queue.

If the queue is full, we grow the underlying buffer first