generalheap

Documentation

Index

• type Comparable
• type Heap
  • func (h Heap[K, V]) Len() int
  • func (h Heap[K, V]) Less(i, j int) bool
  • func (h *Heap[K, V]) Pop() interface{}
  • func (h *Heap[K, V]) Push(x interface{})
  • func (h Heap[K, V]) Swap(i, j int)
• type HeapElement
  • func (h HeapElement[K, V]) Index() int

Types

type Comparable

type Comparable[T any] interface {
	CompareTo(other T) int
}

type Heap

type Heap[Key Comparable[Key], Value any] []*HeapElement[Key, Value]

Heap defines a heap based on times.

func (Heap[K, V]) Len

func (h Heap[K, V]) Len() int

Len is the number of elements in the collection.

func (Heap[K, V]) Less

func (h Heap[K, V]) Less(i, j int) bool

Less reports whether the element with index i should sort before the element with index j.

func (*Heap[K, V]) Pop

func (h *Heap[K, V]) Pop() interface{}

Pop removes and returns the last element of the heap.

func (*Heap[K, V]) Push

func (h *Heap[K, V]) Push(x interface{})

Push adds x as the last element to the heap.

func (Heap[K, V]) Swap

func (h Heap[K, V]) Swap(i, j int)

Swap swaps the elements with indexes i and j.

type HeapElement

type HeapElement[K Comparable[K], V any] struct {
	// Value represents the value of the queued element.
	Value V
	// Key represents the time of the element to be used as a key.
	Key K
	// contains filtered or unexported fields
}

func (HeapElement[K, V]) Index

func (h HeapElement[K, V]) Index() int