basic queue in go (untested)

queue.go

package queue

import "sync"

type Queue[T any] struct {
	items []T
	mu    sync.RWMutex
}

func New[T any]() *Queue[T] {
	return &Queue[T]{
		items: make([]T, 0),
		mu:    sync.RWMutex{},
	}
}

func (q *Queue[T]) Enqueue(item T) {
	q.mu.Lock()
	defer q.mu.Unlock()
	q.items = append(q.items, item)
}

func (q *Queue[T]) Dequeue() T {
	q.mu.Lock()
	defer q.mu.Unlock()
	item := q.items[0]
	q.items = q.items[1:]
	return item
}

func (q *Queue[T]) Peek() T {
	q.mu.RLock()
	defer q.mu.RUnlock()
	return q.items[0]
}

func (q *Queue[T]) Size() int {
	q.mu.RLock()
	defer q.mu.RUnlock()
	return len(q.items)
}

func (q *Queue[T]) Clear() {
	q.mu.Lock()
	defer q.mu.Unlock()
	q.items = make([]T, 0)
}

func (q *Queue[T]) Iterator() <-chan T {
	ch := make(chan T)
	go func() {
		q.mu.RLock()
		c := q.items[:]
		q.mu.RUnlock()
		for _, i := range c {
			ch <- i
		}
		close(ch)
	}()
	return ch
}