findNodesInRange
suspend fun <T> SortedBinaryTreeNode<T>.findNodesInRange( from: T, to: T, fromInclusiveMode: Boolean, toInclusiveMode: Boolean): Set<SortedBinaryTreeNode<T>>(source)
suspend fun <T> SortedBinaryTreeNode<T>.findNodesInRange(from: T, to: T): Set<SortedBinaryTreeNode<T>>(source)
suspend fun <T : Comparable<T>> SortedBinaryTreeNode<T>.findNodesInRange( range: ClosedRange<T>): Set<SortedBinaryTreeNode<T>>(source)
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange( from: K, to: K, fromInclusiveMode: Boolean, toInclusiveMode: Boolean): Set<SortedMapLikeBinaryTreeNode<K, V>>(source)
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange(from: K, to: K): Set<SortedMapLikeBinaryTreeNode<K, V>>(source)
suspend fun <K : Comparable<K>, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange( range: ClosedRange<K>): Set<SortedMapLikeBinaryTreeNode<K, V>>(source)