priorityqueue

Documentation

Index

• type BinHeap
  • func NewBinHeap[T Item](maxLen uint64) *BinHeap[T]
  • func (bh *BinHeap[T]) Exists(id string) bool
  • 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
  • func (bh *BinHeap[T]) Remove(groupID string) []T
• type Item

Types

type BinHeap

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

func NewBinHeap

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

func (*BinHeap[T]) Exists

func (bh *BinHeap[T]) Exists(id string) bool

func (*BinHeap[T]) ExtractMin

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

func (*BinHeap[T]) Insert

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

func (*BinHeap[T]) Len

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

func (*BinHeap[T]) PeekPriority

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

PeekPriority returns the highest priority

func (*BinHeap[T]) Remove

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

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

type Item

type Item interface {
	// Unique ID of the item
	ID() string
	// Priority returns the Item's priority to sort
	Priority() int64
	// GroupID represents the Item's group, used to delete all Items with the same GroupID
	GroupID() string
}

Item represents binary heap item