Method Add

internal/queue/queue.go:36–43

Add appends elem, growing the buffer if it is full.

(elem T)

// Add appends elem, growing the buffer if it is full.
func (q *Queue[T]) Add(elem T) {
	if q.count == len(q.buf) {
		q.resize()
	}
	q.buf[q.tail] = elem
	q.tail = (q.tail + 1) & (len(q.buf) - 1)
	q.count++
}

// Peek returns the head element. It panics if the queue is empty.
func (q *Queue[T]) Peek() T {