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

fixes

Browse Source
This commit is contained in:
InsanusMokrassar
2025-03-05 19:40:46 +06:00
parent daa3d9c0dd
commit 0db88bac25
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
coroutines/src/jvmTest/kotlin/dev/inmo/micro_utils/coroutines/SortedMapLikeBinaryTreeNodeTests.kt
View File

@@ -68,13 +68,13 @@ class SortedMapLikeBinaryTreeNodeTests {
parentNode ?.getLeftNode() === expectedNode || parentNode ?.getRightNode() === expectedNode, parentNode ?.getLeftNode() === expectedNode || parentNode ?.getRightNode() === expectedNode,
"It is expected, that parent node with data ${parentNode ?.key} will be parent of ${expectedNode.key}, but its left subnode is ${parentNode ?.getLeftNode() ?.key} and right one is ${parentNode ?.getRightNode() ?.key}" "It is expected, that parent node with data ${parentNode ?.key} will be parent of ${expectedNode.key}, but its left subnode is ${parentNode ?.getLeftNode() ?.key} and right one is ${parentNode ?.getRightNode() ?.key}"
) )
assertTrue(
foundNode != null && expectedNode.deepEquals(foundNode)
)
zeroNode.upsertSubNode(i, -i) zeroNode.upsertSubNode(i, -i)
val foundModifiedNode = zeroNode.findNode(i) val foundModifiedNode = zeroNode.findNode(i)
assertEquals(foundNode ?.value, foundModifiedNode ?.value ?.times(-1)) assertEquals(foundNode ?.value, foundModifiedNode ?.value ?.times(-1))
assertTrue(
foundNode != null && foundModifiedNode != null && foundNode.deepEquals(foundModifiedNode)
)
} }
} }
// @Test // @Test