Merge branch 'master' into 0.25.0

This commit is contained in:
InsanusMokrassar committed 2025-03-03 17:38:01 +06:00
commit 42909c3b7a
7 files changed
+2 -16

No files matched your search

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