micro_utils.dokka

0.25.3

micro_utils.dokka/dev.inmo.micro_utils.coroutines.collections

Package-level declarations

Types

SortedBinaryTreeNode

@Serializable

class SortedBinaryTreeNode<T>(val data: T, comparator: Comparator<T>) : Iterable<SortedBinaryTreeNode<T>>

SortedMapLikeBinaryTreeNode

@Serializable

class SortedMapLikeBinaryTreeNode<K, V>(val key: K, val value: V, comparator: Comparator<K>) : Iterable<SortedMapLikeBinaryTreeNode<K, V>>

Functions

suspend fun <T> SortedBinaryTreeNode<T>.addSubNode(newData: T): SortedBinaryTreeNode<T>

Will add subnode in tree if there are no any node with newData

suspend fun <T> SortedBinaryTreeNode<T>.contains(data: T): Boolean

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.contains(data: K): Boolean

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.deepEquals(other: SortedMapLikeBinaryTreeNode<K, V>): Boolean

suspend fun <T> SortedBinaryTreeNode<T>.findNode(data: T): SortedBinaryTreeNode<T>?

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNode(key: K): SortedMapLikeBinaryTreeNode<K, V>?

findNodesInRange

suspend fun <T : Comparable<T>> SortedBinaryTreeNode<T>.findNodesInRange(range: ClosedRange<T>): Set<SortedBinaryTreeNode<T>>

suspend fun <K : Comparable<K>, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange(range: ClosedRange<K>): Set<SortedMapLikeBinaryTreeNode<K, V>>

suspend fun <T> SortedBinaryTreeNode<T>.findNodesInRange(from: T, to: T): Set<SortedBinaryTreeNode<T>>

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange(from: K, to: K): Set<SortedMapLikeBinaryTreeNode<K, V>>

suspend fun <T> SortedBinaryTreeNode<T>.findNodesInRange(from: T, to: T, fromInclusiveMode: Boolean, toInclusiveMode: Boolean): Set<SortedBinaryTreeNode<T>>

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange(from: K, to: K, fromInclusiveMode: Boolean, toInclusiveMode: Boolean): Set<SortedMapLikeBinaryTreeNode<K, V>>

findNodesInRangeExcluding

suspend fun <T> SortedBinaryTreeNode<T>.findNodesInRangeExcluding(from: T, to: T): Set<SortedBinaryTreeNode<T>>

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRangeExcluding(from: K, to: K): Set<SortedMapLikeBinaryTreeNode<K, V>>

suspend fun <T> SortedBinaryTreeNode<T>.findParentNode(data: T): SortedBinaryTreeNode<T>?

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findParentNode(data: K): SortedMapLikeBinaryTreeNode<K, V>?

suspend fun <T> SortedBinaryTreeNode<T>.removeSubNode(data: T): Pair<SortedBinaryTreeNode<T>, SortedBinaryTreeNode<T>>?

Will remove (detach) node from tree starting with this

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.removeSubNode(data: K): Pair<SortedMapLikeBinaryTreeNode<K, V>, SortedMapLikeBinaryTreeNode<K, V>>?

Will remove (detach) node from tree starting with this

suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.upsertSubNode(key: K, value: V): SortedMapLikeBinaryTreeNode<K, V>

Will add subnode in tree if there are no any node with key