heapq

Documentation

Index

• type HeapQueue
  • func New[T comparable]() *HeapQueue[T]
  • func (h HeapQueue[T]) Len() int
  • func (h HeapQueue[T]) Less(i, j int) bool
  • func (h *HeapQueue[T]) Pop() interface{}
  • func (h *HeapQueue[T]) PopSafe() T
  • func (h *HeapQueue[T]) Push(x interface{})
  • func (h *HeapQueue[T]) Swap(i, j int)
  • func (h *HeapQueue[T]) Upsert(n T, score int)

Types

type HeapQueue

type HeapQueue[T comparable] struct {
	// contains filtered or unexported fields
}

Like the heap construct, but with generic types and an upsert operation.

func New

func New[T comparable]() *HeapQueue[T]

func (HeapQueue[T]) Len

func (h HeapQueue[T]) Len() int

func (HeapQueue[T]) Less

func (h HeapQueue[T]) Less(i, j int) bool

func (*HeapQueue[T]) Pop

func (h *HeapQueue[T]) Pop() interface{}

func (*HeapQueue[T]) PopSafe

func (h *HeapQueue[T]) PopSafe() T

func (*HeapQueue[T]) Push

func (h *HeapQueue[T]) Push(x interface{})

func (*HeapQueue[T]) Swap

func (h *HeapQueue[T]) Swap(i, j int)

func (*HeapQueue[T]) Upsert

func (h *HeapQueue[T]) Upsert(n T, score int)