prelude

Documentation

Index

• type PriorityQueue
  • func Empty[T cmp.Ordered]() PriorityQueue[T]
  • func FromSlice[T cmp.Ordered](xs []T) PriorityQueue[T]
  • func Room[T cmp.Ordered](size uint) PriorityQueue[T]
  • func (PriorityQueue[T]) ElemType(T)
  • func (q PriorityQueue[T]) Heapify(i uint) PriorityQueue[T]
  • func (PriorityQueue[T]) KindType()
  • func (q PriorityQueue[T]) Len() uint
  • func (q PriorityQueue[T]) Lift(i uint) PriorityQueue[T]
  • func (q PriorityQueue[T]) Peek() maybe.Maybe[T]
  • func (q PriorityQueue[T]) Pop() (maybe.Maybe[T], PriorityQueue[T])
  • func (q PriorityQueue[T]) Push(x T) PriorityQueue[T]
• type PriorityQueueKind

Types

type PriorityQueue

type PriorityQueue[T cmp.Ordered] struct {
	// contains filtered or unexported fields
}

This will be a max-heap

func Empty

func Empty[T cmp.Ordered]() PriorityQueue[T]

func FromSlice

func FromSlice[T cmp.Ordered](xs []T) PriorityQueue[T]

func Room

func Room[T cmp.Ordered](size uint) PriorityQueue[T]

func (PriorityQueue[T]) ElemType

func (PriorityQueue[T]) ElemType(T)

func (PriorityQueue[T]) Heapify

func (q PriorityQueue[T]) Heapify(i uint) PriorityQueue[T]

func (PriorityQueue[T]) KindType

func (PriorityQueue[T]) KindType()

func (PriorityQueue[T]) Len

func (q PriorityQueue[T]) Len() uint

func (PriorityQueue[T]) Lift

func (q PriorityQueue[T]) Lift(i uint) PriorityQueue[T]

func (PriorityQueue[T]) Peek

func (q PriorityQueue[T]) Peek() maybe.Maybe[T]

func (PriorityQueue[T]) Pop

func (q PriorityQueue[T]) Pop() (maybe.Maybe[T], PriorityQueue[T])

func (PriorityQueue[T]) Push

func (q PriorityQueue[T]) Push(x T) PriorityQueue[T]

This is just like slice, changes result to a new queue

type PriorityQueueKind

type PriorityQueueKind types.Kind