0.0.0-experiment

kone.collections/dev.lounres.kone.collections.heap/LinkedMinimumHeap

LinkedMinimumHeap

interface LinkedMinimumHeap<Element, Priority> : MinimumHeap<Element, Priority> (source)

Represents a linked minimum heap. See MinimumHeap for general definition of minimum heap.

Linked heap is a heap with structure of a linked list. However, the order of elements in linked structure may be defined in different ways. For example, it may be a chronological order (i.e. new elements are added to the end of the order and reconstruction of the heap won't change the order). Or a list representation order (i.e. the first element is the root node, then its children go next, then their children go next, and so on and reconstruction of the heap will change the order). See implementations' documentations to get the behaviour you need.

Inheritors

KoneBinaryGCMinimumHeap

KoneBinaryListBackedMinimumHeap

Properties

abstract override val elementsView: KoneReversibleIterable<Element>

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

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

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

abstract val size: UInt

Number of elements in the collection.

Functions

abstract 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.

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

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

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

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