queues

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

type Queue[T any] interface {
	// Adds an element to the back of the queue.
	Enqueue(T)

	// Removes and returns an element from the front of the queue.
	// Returns None if the queue is empty.
	Dequeue() optionals.Optional[T]

	// Returns (but does not remove) an element from the front of the
	//  queue. Returns None if the queue is empty.
	Peek() optionals.Optional[T]

	// Returns true if the queue is empty.
	IsEmpty() bool

	// Returns the length of the queue.
	Size() int

	// Calls the given function with each element in the queue, from
	// front to back.
	ForEach(func(T))
}