kone.collections/dev.lounres.kone.collections.searchTree/LinkedSearchTree

LinkedSearchTree

interface LinkedSearchTree<Element, Priority> : SearchTree<Element, Priority> (source)

Represents a linked search tree. See SearchTree for general definition of a search tree.

Linked search tree is a search tree 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). Or an order induced by the search tree's inner order (i.e. the first element is the node with minimal priority, then the node with next minimal priority, and so on). See implementations' documentations to get the behaviour you need.

Properties

elementsView

abstract override val elementsView: KoneLinkedSet<Element>

Reversible iterable that is a view on elements of that search tree.

nodesView

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

Linked reified set that is a view on nodes of that search tree.

size

abstract val size: UInt

Number of elements in the collection.

Functions

add

abstract override fun add(element: Element, priority: Priority): LinkedSearchTreeNode<Element, Priority>

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

contains

open operator fun contains(priority: Priority): Boolean

Checks if there is a node with the specified priority.

find

abstract override fun find(priority: Priority): LinkedSearchTreeNode<Element, Priority>?

Finds and returns a node in the search tree with equal priority. If there is no such node, returns null.

findSegmentFor

abstract override fun findSegmentFor(priority: Priority): SearchSegmentResult<LinkedSearchTreeNode<Element, Priority>>

Finds a segment in the search tree where the priority lies. See SearchSegmentResult for description of the segment.