PriorityQueue

Documentation

Index

• type PriorityQueue
  • func New[T utils.Ordered](storage heap.Heap[T]) *PriorityQueue[T]
  • func (Q *PriorityQueue[T]) Clear()
  • func (Q *PriorityQueue[T]) Contains(element T) bool
  • func (Q *PriorityQueue[T]) Dequeue() (T, error)
  • func (Q *PriorityQueue[T]) Enqueue(elements ...T) error
  • func (Q *PriorityQueue[T]) Front() (T, error)
  • func (Q *PriorityQueue[T]) IsEmpty() bool
  • func (Q *PriorityQueue[T]) Length() int
  • func (Q *PriorityQueue[T]) Update(element, newElement T) error

Types

type PriorityQueue

type PriorityQueue[T utils.Ordered] struct {
	// contains filtered or unexported fields
}

func New

func New[T utils.Ordered](storage heap.Heap[T]) *PriorityQueue[T]

func (*PriorityQueue[T]) Clear

func (Q *PriorityQueue[T]) Clear()

func (*PriorityQueue[T]) Contains

func (Q *PriorityQueue[T]) Contains(element T) bool

func (*PriorityQueue[T]) Dequeue

func (Q *PriorityQueue[T]) Dequeue() (T, error)

func (*PriorityQueue[T]) Enqueue

func (Q *PriorityQueue[T]) Enqueue(elements ...T) error

func (*PriorityQueue[T]) Front

func (Q *PriorityQueue[T]) Front() (T, error)

func (*PriorityQueue[T]) IsEmpty

func (Q *PriorityQueue[T]) IsEmpty() bool

func (*PriorityQueue[T]) Length

func (Q *PriorityQueue[T]) Length() int

func (*PriorityQueue[T]) Update

func (Q *PriorityQueue[T]) Update(element, newElement T) error