heap

Documentation

Index

• type Queue
  • func NewQueue[T any](less func(a, b T) bool) Queue[T]
  • func QueueOf[T any](less func(a, b T) bool, entries ...T) Queue[T]
  • func (q *Queue[T]) Fix(i int)
  • func (q *Queue[T]) Len() int
  • func (q *Queue[T]) Peek() (T, bool)
  • func (q *Queue[T]) Pop() (T, bool)
  • func (q *Queue[T]) Push(t T)

Types

type Queue

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

func NewQueue

func NewQueue[T any](less func(a, b T) bool) Queue[T]

NewQueue returns an empty heap. See QueueOf for more.

func QueueOf

func QueueOf[T any](less func(a, b T) bool, entries ...T) Queue[T]

QueueOf returns a heap containing entries ordered by less.

func (*Queue[T]) Fix

func (q *Queue[T]) Fix(i int)

func (*Queue[T]) Len

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

func (*Queue[T]) Peek

func (q *Queue[T]) Peek() (T, bool)

func (*Queue[T]) Pop

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

func (*Queue[T]) Push

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