queue

Documentation

Index

• type Queue
  • func (q *Queue[T]) Back() T
  • func (q *Queue[T]) Empty() bool
  • func (q *Queue[T]) Front() T
  • func (q *Queue[T]) Pop() T
  • func (q *Queue[T]) Push(element T)
  • func (q *Queue[T]) Size() int

Types

type Queue

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

Queue is a container adapter that gives the programmer the functionality of a queue - specifically, a FIFO (first-in, first-out) data structure.

func (*Queue[T]) Back

func (q *Queue[T]) Back() T

Back returns value of the last element in Queue Complexity O(1)

func (*Queue[T]) Empty

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

Empty checks if Queue has no element Complexity O(1)

func (*Queue[T]) Front

func (q *Queue[T]) Front() T

Front returns value of the first element in Queue Complexity O(1)

func (*Queue[T]) Pop

func (q *Queue[T]) Pop() T

Pop removes and returns first element of Queue Complexity O(1)

func (*Queue[T]) Push

func (q *Queue[T]) Push(element T)

Push inserts element at the end of Queue Complexity O(1)

func (*Queue[T]) Size

func (q *Queue[T]) Size() int

Size returns number of elements in queue Complexity O(1)