priorityqueue

package

v4.2.3 Latest Latest Go to latest Published: May 11, 2023 License: MIT Imports: 2 Imported by: 1

Details

This section is empty.

This section is empty.

This section is empty.

type BinHeap[T Item] struct {
	// contains filtered or unexported fields
}

func NewBinHeap[T Item](maxLen uint64) *BinHeap[T]

func (bh *BinHeap[T]) ExtractMin() T

func (bh *BinHeap[T]) Insert(item T)

func (bh *BinHeap[T]) Len() uint64

func (bh *BinHeap[T]) PeekPriority() int64

PeekPriority returns the highest priority

func (bh *BinHeap[T]) Remove(id string) []T

Remove removes all elements with the provided ID and returns the slice with them

type Item interface {
	// Priority returns the Item's priority to sort
	Priority() int64
	// ID of the item
	ID() string
}

Item represents binary heap item