|
|
@@ -1,3 +1,5 @@
|
|
|
|
|
|
|
|
package dev.inmo.micro_utils.coroutines
|
|
|
|
|
|
|
|
|
|
|
|
import dev.inmo.micro_utils.coroutines.collections.SortedBinaryTreeNode
|
|
|
|
import dev.inmo.micro_utils.coroutines.collections.SortedBinaryTreeNode
|
|
|
|
import dev.inmo.micro_utils.coroutines.collections.addSubNode
|
|
|
|
import dev.inmo.micro_utils.coroutines.collections.addSubNode
|
|
|
|
import dev.inmo.micro_utils.coroutines.collections.findNode
|
|
|
|
import dev.inmo.micro_utils.coroutines.collections.findNode
|
|
|
@@ -10,8 +12,6 @@ import kotlin.test.assertEquals
|
|
|
|
import kotlin.test.assertTrue
|
|
|
|
import kotlin.test.assertTrue
|
|
|
|
import kotlin.time.Duration.Companion.seconds
|
|
|
|
import kotlin.time.Duration.Companion.seconds
|
|
|
|
|
|
|
|
|
|
|
|
expect val AllowDeepInsertOnWorksTest: Boolean
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class SortedBinaryTreeNodeTests {
|
|
|
|
class SortedBinaryTreeNodeTests {
|
|
|
|
@Test
|
|
|
|
@Test
|
|
|
|
fun insertOnZeroLevelWorks() = runTest {
|
|
|
|
fun insertOnZeroLevelWorks() = runTest {
|
|
|
@@ -46,7 +46,6 @@ class SortedBinaryTreeNodeTests {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
@Test
|
|
|
|
@Test
|
|
|
|
fun deepReInsertOnWorks() = runTest(timeout = 300.seconds) {
|
|
|
|
fun deepReInsertOnWorks() = runTest(timeout = 300.seconds) {
|
|
|
|
if (AllowDeepInsertOnWorksTest == false) return@runTest
|
|
|
|
|
|
|
|
val zeroNode = SortedBinaryTreeNode(0)
|
|
|
|
val zeroNode = SortedBinaryTreeNode(0)
|
|
|
|
val rangeRadius = 500
|
|
|
|
val rangeRadius = 500
|
|
|
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
|
|
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
|
|
@@ -124,7 +123,6 @@ class SortedBinaryTreeNodeTests {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
@Test
|
|
|
|
@Test
|
|
|
|
fun deepInsertOnWorks() = runTest(timeout = 240.seconds) {
|
|
|
|
fun deepInsertOnWorks() = runTest(timeout = 240.seconds) {
|
|
|
|
if (AllowDeepInsertOnWorksTest == false) return@runTest
|
|
|
|
|
|
|
|
val zeroNode = SortedBinaryTreeNode(0)
|
|
|
|
val zeroNode = SortedBinaryTreeNode(0)
|
|
|
|
val rangeRadius = 500
|
|
|
|
val rangeRadius = 500
|
|
|
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
|
|
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|