queue

README

queue

A simple Go (golang) library for queues

Documentation

Index

• type FIFO
  • func (q *FIFO[T]) Add(t T)
  • func (q *FIFO[T]) All() []T
  • func (q *FIFO[T]) Clear()
  • func (q *FIFO[T]) More() bool
  • func (q *FIFO[T]) Next() T
  • func (q *FIFO[T]) Size() int

Types

type FIFO

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

FIFO is a naive implementation of a FIFO genric queue

func (*FIFO[T]) Add

func (q *FIFO[T]) Add(t T)

Add an element to the Queue

func (*FIFO[T]) All

func (q *FIFO[T]) All() []T

All elements in the queue as a copy of the current queue

func (*FIFO[T]) Clear

func (q *FIFO[T]) Clear()

Clear Queue back to initial state

func (*FIFO[T]) More

func (q *FIFO[T]) More() bool

More returns if Queue has more data to give

func (*FIFO[T]) Next

func (q *FIFO[T]) Next() T

Next gets the next element in the queue and removes it from the Queue

func (*FIFO[T]) Size

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

Size of the Queue