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

deploy: ef287bc331

Browse Source
This commit is contained in:
InsanusMokrassar
2025-03-08 06:43:02 +00:00
parent 9678846e12
commit 74bef76d93
6578 changed files with 9789 additions and 6646 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
micro_utils.dokka/dev.inmo.micro_utils.coroutines.collections/add-sub-node.html
View File

@@ -46,7 +46,7 @@
</button>
<div class="navigation-controls--break ui-kit_mobile-only"></div>
<div class="library-version" id="library-version">
0.25.0 </div>
0.25.1 </div>
<div class="navigation-controls">
<div class="filter-section filter-section_loading" id="filter-section">
<button class="platform-tag platform-selector common-like" data-active=""
@@ -109,7 +109,7 @@
<div class="cover ">
<h1 class="cover"><span>add</span><wbr></wbr><span>Sub</span><wbr></wbr><span><span>Node</span></span></h1>
</div>
<div class="platform-hinted " data-platform-hinted="data-platform-hinted"><div class="content sourceset-dependent-content" data-active="" data-togglable=":micro_utils.dokka:dokkaHtml/commonMain"><div class="symbol monospace"><span class="token keyword">suspend </span><span class="token keyword">fun </span><span class="token operator">&lt;</span><a href="add-sub-node.html">T</a><span class="token operator">&gt; </span><a href="-sorted-binary-tree-node/index.html">SortedBinaryTreeNode</a><span class="token operator">&lt;</span><a href="add-sub-node.html">T</a><span class="token operator">&gt;</span><span class="token punctuation">.</span><a href="add-sub-node.html"><span class="token function">addSubNode</span></a><span class="token punctuation">(</span><span class="parameters "><span class="parameter ">newData<span class="token operator">: </span><a href="add-sub-node.html">T</a></span></span><span class="token punctuation">)</span><span class="token operator">: </span><a href="-sorted-binary-tree-node/index.html">SortedBinaryTreeNode</a><span class="token operator">&lt;</span><a href="add-sub-node.html">T</a><span class="token operator">&gt;</span><span class="clearfix"><span class="floating-right">(<a href="https://github.com/InsanusMokrassar/MicroUtils/blob/master//coroutines/src/commonMain/kotlin/dev/inmo/micro_utils/coroutines/collections/SortedBinaryTreeNode.kt#L151">source</a>)</span></span></div><p class="paragraph">Will add subnode in tree if there are no any node with <a href="add-sub-node.html">newData</a></p><ul><li><p class="paragraph">If <a href="add-sub-node.html">newData</a> is greater than <a href="-sorted-binary-tree-node/data.html">SortedBinaryTreeNode.data</a> of currently checking node, will be used <span data-unresolved-link="dev.inmo.micro_utils.coroutines.collections/SortedBinaryTreeNode/rightNode/#/PointingToDeclaration/">SortedBinaryTreeNode.rightNode</span></p></li><li><p class="paragraph">If <a href="add-sub-node.html">newData</a> is equal to <a href="-sorted-binary-tree-node/data.html">SortedBinaryTreeNode.data</a> of currently checking node - will be returned currently checking node</p></li><li><p class="paragraph">If <a href="add-sub-node.html">newData</a> is less than <a href="-sorted-binary-tree-node/data.html">SortedBinaryTreeNode.data</a> of currently checking node - will be used <span data-unresolved-link="dev.inmo.micro_utils.coroutines.collections/SortedBinaryTreeNode/leftNode/#/PointingToDeclaration/">SortedBinaryTreeNode.leftNode</span></p></li></ul><p class="paragraph">This process will continue until function will not find place to put <a href="-sorted-binary-tree-node/index.html">SortedBinaryTreeNode</a> with data or <a href="-sorted-binary-tree-node/index.html">SortedBinaryTreeNode</a> with <a href="-sorted-binary-tree-node/data.html">SortedBinaryTreeNode.data</a> same as <a href="add-sub-node.html">newData</a> will be found</p></div></div>
<div class="platform-hinted " data-platform-hinted="data-platform-hinted"><div class="content sourceset-dependent-content" data-active="" data-togglable=":micro_utils.dokka:dokkaHtml/commonMain"><div class="symbol monospace"><span class="token keyword">suspend </span><span class="token keyword">fun </span><span class="token operator">&lt;</span><a href="add-sub-node.html">T</a><span class="token operator">&gt; </span><a href="-sorted-binary-tree-node/index.html">SortedBinaryTreeNode</a><span class="token operator">&lt;</span><a href="add-sub-node.html">T</a><span class="token operator">&gt;</span><span class="token punctuation">.</span><a href="add-sub-node.html"><span class="token function">addSubNode</span></a><span class="token punctuation">(</span><span class="parameters "><span class="parameter ">newData<span class="token operator">: </span><a href="add-sub-node.html">T</a></span></span><span class="token punctuation">)</span><span class="token operator">: </span><a href="-sorted-binary-tree-node/index.html">SortedBinaryTreeNode</a><span class="token operator">&lt;</span><a href="add-sub-node.html">T</a><span class="token operator">&gt;</span><span class="clearfix"><span class="floating-right">(<a href="https://github.com/InsanusMokrassar/MicroUtils/blob/master//coroutines/src/commonMain/kotlin/dev/inmo/micro_utils/coroutines/collections/SortedBinaryTreeNode.kt#L150">source</a>)</span></span></div><p class="paragraph">Will add subnode in tree if there are no any node with <a href="add-sub-node.html">newData</a></p><ul><li><p class="paragraph">If <a href="add-sub-node.html">newData</a> is greater than <a href="-sorted-binary-tree-node/data.html">SortedBinaryTreeNode.data</a> of currently checking node, will be used <span data-unresolved-link="dev.inmo.micro_utils.coroutines.collections/SortedBinaryTreeNode/rightNode/#/PointingToDeclaration/">SortedBinaryTreeNode.rightNode</span></p></li><li><p class="paragraph">If <a href="add-sub-node.html">newData</a> is equal to <a href="-sorted-binary-tree-node/data.html">SortedBinaryTreeNode.data</a> of currently checking node - will be returned currently checking node</p></li><li><p class="paragraph">If <a href="add-sub-node.html">newData</a> is less than <a href="-sorted-binary-tree-node/data.html">SortedBinaryTreeNode.data</a> of currently checking node - will be used <span data-unresolved-link="dev.inmo.micro_utils.coroutines.collections/SortedBinaryTreeNode/leftNode/#/PointingToDeclaration/">SortedBinaryTreeNode.leftNode</span></p></li></ul><p class="paragraph">This process will continue until function will not find place to put <a href="-sorted-binary-tree-node/index.html">SortedBinaryTreeNode</a> with data or <a href="-sorted-binary-tree-node/index.html">SortedBinaryTreeNode</a> with <a href="-sorted-binary-tree-node/data.html">SortedBinaryTreeNode.data</a> same as <a href="add-sub-node.html">newData</a> will be found</p></div></div>
</div>
<div class="footer">
<a href="#content" id="go-to-top-link" class="footer--button footer--button_go-to-top"></a>