heap

Documentation

Index

• func Empty[Elem cmp.Ordered](tree *PairingTree[Elem]) bool
• type PairingHeap
  • func New[Elem cmp.Ordered]() *PairingHeap[Elem]
  • func (heap *PairingHeap[Elem]) Empty() bool
  • func (heap *PairingHeap[Elem]) Peek() Elem
  • func (heap *PairingHeap[Elem]) Pop() Elem
  • func (heap *PairingHeap[Elem]) Push(e Elem)
• type PairingTree
  • func Meld[Elem cmp.Ordered](tree1 *PairingTree[Elem], tree2 *PairingTree[Elem]) *PairingTree[Elem]

Functions

func Empty

func Empty[Elem cmp.Ordered](tree *PairingTree[Elem]) bool

Types

type PairingHeap

type PairingHeap[Elem cmp.Ordered] struct {
	// contains filtered or unexported fields
}

func New

func New[Elem cmp.Ordered]() *PairingHeap[Elem]

func (*PairingHeap[Elem]) Empty

func (heap *PairingHeap[Elem]) Empty() bool

func (*PairingHeap[Elem]) Peek

func (heap *PairingHeap[Elem]) Peek() Elem

func (*PairingHeap[Elem]) Pop

func (heap *PairingHeap[Elem]) Pop() Elem

func (*PairingHeap[Elem]) Push

func (heap *PairingHeap[Elem]) Push(e Elem)

type PairingTree

type PairingTree[Elem cmp.Ordered] struct {
	// contains filtered or unexported fields
}

func Meld

func Meld[Elem cmp.Ordered](tree1 *PairingTree[Elem], tree2 *PairingTree[Elem]) *PairingTree[Elem]