Trying to Deferred.await on all thiss. The first Deferred completed its work will interrupt all others awaits and, if cancelOthers passed as true (by default), will also cancel all the others Deferreds

suspend fun <T> Iterable<Deferred<T>>.awaitFirst(scope: CoroutineScope, cancelOnResult: Boolean = true): T

Trying to Deferred.await on all thiss. The first Deferred completed its work will interrupt all others awaits and, if cancelOnResult passed as true (by default), will also cancel all the others Deferreds

awaitFirstWithDeferred

suspend fun <T> Iterable<Deferred<T>>.awaitFirstWithDeferred(scope: CoroutineScope, cancelOnResult: Boolean = true): Pair<Deferred<T>, T>

calculateDiff

fun <T> Iterable<T>.calculateDiff(other: Iterable<T>, strictComparison: Boolean = false): Diff<T>

fun <T> Iterable<T>.calculateDiff(other: Iterable<T>, comparisonFun: (T?, T?) -> Boolean): Diff<T>

Calculating Diff object

calculateStrictDiff

inline fun <T> Iterable<T>.calculateStrictDiff(other: Iterable<T>): Diff<T>

This method call calculateDiff with strict mode enabled

contains

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

diff

inline fun <T> Iterable<T>.diff(other: Iterable<T>, strictComparison: Boolean = false): Diff<T>

inline fun <T> Iterable<T>.diff(other: Iterable<T>, noinline comparisonFun: (T?, T?) -> Boolean): Diff<T>

equals

open operator override fun equals(other: Any?): Boolean

findNode

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

findNodesInRange

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

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

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

findNodesInRangeExcluding

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

findParentNode

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

firstNotNull

fun <T> Iterable<T?>.firstNotNull(): <Error class: unknown class>

getLeft

suspend fun getLeft(): T?

getLeftNode

suspend fun getLeftNode(): SortedBinaryTreeNode<T>?

getRight

suspend fun getRight(): T?

getRightNode

suspend fun getRightNode(): SortedBinaryTreeNode<T>?

hashCode

open override fun hashCode(): Int

invokeFirstOf

suspend fun <O> Iterable<DeferredAction<*, O>>.invokeFirstOf(scope: CoroutineScope, cancelOnResult: Boolean = true): O

invokeOnFirst

suspend fun <T, O> Iterable<Deferred<T>>.invokeOnFirst(scope: CoroutineScope, cancelOnResult: Boolean = true, callback: suspend (T) -> O): O

iterator

open operator override fun iterator(): Iterator<SortedBinaryTreeNode<T>>

This Iterator will run from less to greater values of nodes starting the dev.inmo.micro_utils.coroutines.collections.SortedBinaryTreeNode-receiver. Due to non-suspending nature of iterator builder, this Iterator DO NOT guarantee consistent content due to iterations. It means, that tree can be changed during to iteration process

joinFirst

suspend fun Iterable<Job>.joinFirst(cancelOthers: Boolean = true): Job

suspend fun Iterable<Job>.joinFirst(scope: CoroutineScope, cancelOthers: Boolean = true): Job

Trying to Job.join on all thiss. The first Job completed its work will interrupt all others joins and, if cancelOthers passed as true (by default), will also cancel all the others Jobs

joinTo

inline fun Iterable.joinTo(separator: I? = null, prefix: I? = null, postfix: I? = null): List

inline fun Iterable.joinTo(separatorFun: (I) -> I?, prefix: I? = null, postfix: I? = null): List

inline fun <I, R> Iterable.joinTo(separator: R? = null, prefix: R? = null, postfix: R? = null, transform: (I) -> R?): List<R>

inline fun <I, R> Iterable.joinTo(separatorFun: (I) -> R?, prefix: R? = null, postfix: R? = null, transform: (I) -> R?): List<R>

mapNotNullA

inline fun <T, R> Iterable<T>.mapNotNullA(transform: (T) -> R?): List<R>

optionallyReverse

fun <T> Iterable<T>.optionallyReverse(reverse: Boolean): Iterable<T>

paginate

fun <T> Iterable<T>.paginate(with: Pagination): PaginationResult<T>

removeSubNode

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

Will remove (detach) node from tree starting with this

size

suspend fun size(): Int

toString

open override fun toString(): String

withReplaced

fun <T> Iterable<T>.withReplaced(t: T, block: (T) -> T): List<T>

withReplacedAt

fun <T> Iterable<T>.withReplacedAt(i: Int, block: (T) -> T): List<T>