queue

Documentation

Overview

TODO: This is duplicated from ./pkg/scheduler/util/queue because that package is not allowed to be imported here.

Index

• type FIFO
  • func (q *FIFO[T]) Len() int
  • func (q *FIFO[T]) Pop() (element T, ok bool)
  • func (q *FIFO[T]) Push(element T)

Types

type FIFO

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

FIFO implements a first-in-first-out queue with unbounded size. The null FIFO is a valid empty queue.

Access must be protected by the caller when used concurrently by different goroutines, the queue itself implements no locking.

func (*FIFO[T]) Len

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

func (*FIFO[T]) Pop

func (q *FIFO[T]) Pop() (element T, ok bool)

func (*FIFO[T]) Push

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