0.0.0-experiment

kone.collections/dev.lounres.kone.collections.heap.implementations/KoneBinaryGCMinimumHeap

KoneBinaryGCMinimumHeap

class KoneBinaryGCMinimumHeap<Element, Priority> : LinkedMinimumHeap<Element, Priority> (source)

Properties

open override val elementsView: KoneReversibleIterable<Element>

Reversible iterable that is a view on elements of that heap.

open override val nodesView: KoneLinkedReifiedSet<LinkedHeapNode<Element, Priority>>

Linked reified set that is a view on nodes of that heap.

priorityContext

val priorityContext: Order<Priority>

open override var size: UInt

Number of elements in the collection.

Functions

open override fun add(element: Element, priority: Priority): LinkedHeapNode<Element, Priority>

Adds the element with corresponding priority to the heap and returns constructed node that corresponds to the element and the priority.

open override fun popMinimum(): LinkedHeapNode<Element, Priority>

Retrieves the root node and removes it from the heap. It is a node with the minimum priority.

open override fun takeMinimum(): LinkedHeapNode<Element, Priority>

Retrieves the root node. It is a node with the minimum priority.