Queue Data Structure with generics in Go (GoLang)

queue-generics.go

package queue

// Queue represents a generic queue data structure.
type Queue[T any] struct {
	items []T
}

// Enqueue adds an item to the end of the queue.
func (q *Queue[T]) Enqueue(item T) {
	q.items = append(q.items, item)
}

// Dequeue removes and returns the item from the front of the queue.
// It also returns a boolean value indicating whether the queue is empty.
func (q *Queue[T]) Dequeue() (T, bool) {
	if len(q.items) == 0 {
		var noop T
		return noop, false
	}
	item := q.items[0]
	q.items = q.items[1:]
	return item, true
}

// IsEmpty checks if the queue is empty.
func (q *Queue[T]) IsEmpty() bool {
	return len(q.items) == 0
}

// Size returns the number of elements in the queue.
func (q *Queue[T]) Size() int {
	return len(q.items)
}

// Front returns the item at the front of the queue without removing it.
func (q *Queue[T]) Front() (T, bool) {
	if len(q.items) == 0 {
		var noop T
		return noop, false
	}
	return q.items[0], true
}