Versions in this module Expand all Collapse all v0 v0.1.3 Jun 22, 2024 Changes in this version + type Binomial struct + func NewBinomial[O cmp.Ordered]() *Binomial[O] + func (b *Binomial[O]) Merge(b2 *Binomial[O]) + func (b *Binomial[O]) Pop() O + func (b *Binomial[O]) Push(p O) + func (b *Binomial[O]) Size() int + func (b *Binomial[O]) Top() O + type Elem struct + type Fixable struct + func NewFixable[P cmp.Ordered, V comparable](cap uint) *Fixable[P, V] + func (h *Fixable[P, V]) Del(v V) + func (h *Fixable[P, V]) Fix(p P, v V) + type Heap struct + func NewHeap[P cmp.Ordered](cap uint) *Heap[P] + func (h *Heap[P]) Pop() P + func (h *Heap[P]) Push(v P) + func (h *Heap[P]) Top() P + type Leftist struct + func NewLeftist[O cmp.Ordered]() *Leftist[O] + func (lh *Leftist[O]) Merge(other *Leftist[O]) + func (lh *Leftist[O]) Peek() O + func (lh *Leftist[O]) Pop() O + func (lh *Leftist[O]) Push(o O) + func (lh *Leftist[O]) Size() int + func (lh *Leftist[O]) Top() O + type Paired struct + func NewPaired[P cmp.Ordered, V any](cap uint) *Paired[P, V] + func (h *Paired[P, V]) Cap() int + func (h *Paired[P, V]) FixTop(p P) + func (h *Paired[P, V]) Pop() V + func (h *Paired[P, V]) PopPair() (P, V) + func (h *Paired[P, V]) PushPair(p P, v V) + func (h *Paired[P, V]) Size() int + func (h *Paired[P, V]) Top() V + func (h *Paired[P, V]) TopPair() (P, V) + type PriorQueue interface + Pop func() P + Push func(P) + Size func() int + Top func() P
Go to main page