heap

package

v0.0.0-...-fa3f174 Latest Latest Go to latest Published: Jun 27, 2025 License: MIT Imports: 5 Imported by: 0

Details

This section is empty.

View Source

var ErrEmptyHeap = errors.New("empty heap")

This section is empty.

type Heap[T any, C comparator.Comparator[T]] struct {
	vector.Vector[T]
	// contains filtered or unexported fields
}

func New[T any, C comparator.Comparator[T]]() Heap[T, C]

func NewWithCapacity[T any, C comparator.Comparator[T]](capacity int) Heap[T, C]

func (h *Heap[T, C]) BubbleUp(i int)

BubbleUp bubbles the element at i up to its correct position

func (h Heap[T, C]) Get(i int) T

func (h *Heap[T, C]) Heapify(i int)

Heapify fixes the subtree rooted at i

func (h *Heap[T, C]) Pop() error

func (h *Heap[T, C]) Push(x T)

func (h *Heap[T, C]) Set(i int, x T)

func (h Heap[T, C]) Top() (val T, err error)

type MaxHeap[T cmp.Ordered] struct {
	Heap[T, comparator.Greater[T]]
}

func NewMaxHeap[T cmp.Ordered]() MaxHeap[T]

type MinHeap[T cmp.Ordered] struct {
	Heap[T, comparator.Less[T]]
}

func NewMinHeap[T cmp.Ordered]() MinHeap[T]