heap

Documentation

Index

• func Peek[E any, S ~[]E](h S) E
• func Pop[E any, S ~[]E](h S, lt func(a, b E) bool) (E, S)
• func Push[E any, S ~[]E](h S, x E, lt func(a, b E) bool) S
• type Heap
  • func New[T any](lt func(a, b T) bool) Heap[T]
  • func (h *Heap[T]) Len() int
  • func (h *Heap[T]) Peek() (ret T, exists bool)
  • func (h *Heap[T]) Pop() (ret T, exists bool)
  • func (h *Heap[T]) Push(x T)

Functions

func Peek

func Peek[E any, S ~[]E](h S) E

Peek returns the lowest element of h. h is not modified

func Pop

func Pop[E any, S ~[]E](h S, lt func(a, b E) bool) (E, S)

Pop removes the minimum element from h and returns it and an updated S.

func Push

func Push[E any, S ~[]E](h S, x E, lt func(a, b E) bool) S

Push adds x to the heap h

Types

type Heap

type Heap[T any] struct {
	// contains filtered or unexported fields
}

Heap is a min-heap, implemented using a slice

func New

func New[T any](lt func(a, b T) bool) Heap[T]

New creates a new Heap and returns it. The heap will use lt for comparisons. lt must return true if a < b and false otherwise. lt should be a pure function of a and b, and should not retain either after it returns.

func (*Heap[T]) Len

func (h *Heap[T]) Len() int

func (*Heap[T]) Peek

func (h *Heap[T]) Peek() (ret T, exists bool)

func (*Heap[T]) Pop

func (h *Heap[T]) Pop() (ret T, exists bool)

func (*Heap[T]) Push

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