InsanusMokrassar/MicroUtils
1
0
Fork 0
mirror of https://github.com/InsanusMokrassar/MicroUtils.git synced 2025-09-08 17:49:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

small update in SortedBinaryTreeNodeTests

Browse Source
This commit is contained in:
InsanusMokrassar
2025-03-03 15:49:46 +06:00
parent 24657b43be
commit 2fbd14956d
7 changed files with 11 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
coroutines/src/androidUnitTest/kotlin/SortedBinaryTreeNodeTests.android.kt
View File

@@ -1,2 +1,2 @@
actual val AllowDeepReInsertOnWorksTest: Boolean actual val AllowDeepInsertOnWorksTest: Boolean
get() = true get() = true

10
coroutines/src/commonTest/kotlin/SortedBinaryTreeNodeTests.kt
View File

@@ -9,9 +9,8 @@ import kotlin.test.Test
import kotlin.test.assertEquals import kotlin.test.assertEquals
import kotlin.test.assertTrue import kotlin.test.assertTrue
import kotlin.time.Duration.Companion.seconds import kotlin.time.Duration.Companion.seconds
import kotlin.time.measureTime
expect val AllowDeepReInsertOnWorksTest: Boolean expect val AllowDeepInsertOnWorksTest: Boolean
class SortedBinaryTreeNodeTests { class SortedBinaryTreeNodeTests {
@Test @Test
@@ -46,8 +45,8 @@ class SortedBinaryTreeNodeTests {
} }
} }
@Test @Test
fun deepReInsertOnWorks() = runTest(timeout = 240.seconds) { fun deepReInsertOnWorks() = runTest(timeout = 300.seconds) {
if (AllowDeepReInsertOnWorksTest == false) return@runTest 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,8 @@ class SortedBinaryTreeNodeTests {
assertTrue(sourceTreeSize == zeroNode.size()) assertTrue(sourceTreeSize == zeroNode.size())
} }
@Test @Test
fun deepInsertOnWorks() = runTest(timeout = 440.seconds) { // 440 due to js targets -.- 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>>()

2
coroutines/src/jsTest/kotlin/SortedBinaryTreeNodeTests.js.kt
View File

@@ -1,2 +1,2 @@
actual val AllowDeepReInsertOnWorksTest: Boolean actual val AllowDeepInsertOnWorksTest: Boolean
get() = false get() = false

2
coroutines/src/jvmTest/kotlin/SortedBinaryTreeNodeTests.jvm.kt
View File

@@ -1,2 +1,2 @@
actual val AllowDeepReInsertOnWorksTest: Boolean actual val AllowDeepInsertOnWorksTest: Boolean
get() = true get() = true

2
coroutines/src/linuxArm64Test/kotlin/SortedBinaryTreeNodeTests.linuxArm64.kt
View File

@@ -1,2 +1,2 @@
actual val AllowDeepReInsertOnWorksTest: Boolean actual val AllowDeepInsertOnWorksTest: Boolean
get() = true get() = true

2
coroutines/src/linuxX64Test/kotlin/SortedBinaryTreeNodeTests.linuxX64.kt
View File

@@ -1,2 +1,2 @@
actual val AllowDeepReInsertOnWorksTest: Boolean actual val AllowDeepInsertOnWorksTest: Boolean
get() = true get() = true

2
coroutines/src/mingwX64Test/kotlin/SortedBinaryTreeNodeTests.mingwX64.kt
View File

@@ -1,2 +1,2 @@
actual val AllowDeepReInsertOnWorksTest: Boolean actual val AllowDeepInsertOnWorksTest: Boolean
get() = true get() = true