📄 group____gdsl__bstree.html
字号:
<tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>const <a class="el" href="group__gdsl__types.html#g0e2b9d7fb5ca9e6d50100e5d9e4bcae7">gdsl_element_t</a> </td> <td class="mdname" nowrap> <em>VALUE</em></td> </tr> <tr> <td class="md"></td> <td class="md">) </td> <td class="md" colspan="2"></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Search for a particular element into a low-level binary search tree. <p>Search the first element E equal to VALUE in the low-level binary search tree T, by using COMP_F function to find it.<p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( h(T) ), where log2(|T|) <= h(T) <= |T|-1 </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>COMP_F != NULL. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>T</em> </td><td>The low-level binary search tree to use. </td></tr> <tr><td valign="top"></td><td valign="top"><em>COMP_F</em> </td><td>The comparison function to use to compare T's elements with VALUE to find the element E. </td></tr> <tr><td valign="top"></td><td valign="top"><em>VALUE</em> </td><td>The value that must be used by COMP_F to find the element E. </td></tr> </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the root of the tree containing E if it's found. <p>NULL if VALUE is not found in T. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__bstree.html#gb1579e077e48863cf5784661288cb3af">_gdsl_bstree_insert()</a> <p><a class="el" href="group____gdsl__bstree.html#g4cb0fde8726d4e8f2abdc55d2fc9a38d">_gdsl_bstree_remove()</a> </dd></dl> </td> </tr></table><a class="anchor" name="g487bb4275d4b387054abe2828d24cba8"></a><!-- doxytag: member="_gdsl_bstree.h::_gdsl_bstree_search_next" ref="g487bb4275d4b387054abe2828d24cba8" args="(const _gdsl_bstree_t T, const gdsl_compare_func_t COMP_F, const gdsl_element_t VALUE)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__bstree.html#g0b897530b6c7e499f38de973f8e0889d">_gdsl_bstree_t</a> _gdsl_bstree_search_next </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__bstree.html#g0b897530b6c7e499f38de973f8e0889d">_gdsl_bstree_t</a> </td> <td class="mdname" nowrap> <em>T</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>const <a class="el" href="group__gdsl__types.html#g200177a9a1ac3f2363e228b0e5faeda7">gdsl_compare_func_t</a> </td> <td class="mdname" nowrap> <em>COMP_F</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>const <a class="el" href="group__gdsl__types.html#g0e2b9d7fb5ca9e6d50100e5d9e4bcae7">gdsl_element_t</a> </td> <td class="mdname" nowrap> <em>VALUE</em></td> </tr> <tr> <td class="md"></td> <td class="md">) </td> <td class="md" colspan="2"></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Search for the next element of a particular element into a low-level binary search tree, according to the binary search tree order. <p>Search for an element E in the low-level binary search tree T, by using COMP_F function to find the first element E equal to VALUE.<p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( h(T) ), where log2(|T|) <= h(T) <= |T|-1 </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>COMP_F != NULL. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>T</em> </td><td>The low-level binary search tree to use. </td></tr> <tr><td valign="top"></td><td valign="top"><em>COMP_F</em> </td><td>The comparison function to use to compare T's elements with VALUE to find the element E. </td></tr> <tr><td valign="top"></td><td valign="top"><em>VALUE</em> </td><td>The value that must be used by COMP_F to find the element E. </td></tr> </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the root of the tree containing the successor of E if it's found. <p>NULL if VALUE is not found in T or if E has no sucessor. </dd></dl> </td> </tr></table><a class="anchor" name="g0242fbde8ffdcd1dd67d02858a8e136e"></a><!-- doxytag: member="_gdsl_bstree.h::_gdsl_bstree_map_prefix" ref="g0242fbde8ffdcd1dd67d02858a8e136e" args="(const _gdsl_bstree_t T, const _gdsl_bstree_map_func_t MAP_F, void *USER_DATA)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__bstree.html#g0b897530b6c7e499f38de973f8e0889d">_gdsl_bstree_t</a> _gdsl_bstree_map_prefix </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__bstree.html#g0b897530b6c7e499f38de973f8e0889d">_gdsl_bstree_t</a> </td> <td class="mdname" nowrap> <em>T</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>const <a class="el" href="group____gdsl__bstree.html#g2716161e9382a6efb5ea83986ed5a719">_gdsl_bstree_map_func_t</a> </td> <td class="mdname" nowrap> <em>MAP_F</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>void * </td> <td class="mdname" nowrap> <em>USER_DATA</em></td> </tr> <tr> <td class="md"></td> <td class="md">) </td> <td class="md" colspan="2"></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Parse a low-level binary search tree in prefixed order. <p>Parse all nodes of the low-level binary search tree T in prefixed order. The MAP_F function is called on each node with the USER_DATA argument. If MAP_F returns GDSL_MAP_STOP, then <a class="el" href="group____gdsl__bstree.html#g0242fbde8ffdcd1dd67d02858a8e136e">_gdsl_bstree_map_prefix()</a> stops and returns its last examinated node.<p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |T| ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>MAP_F != NULL. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>T</em> </td><td>The low-level binary search tree to map. </td></tr> <tr><td valign="top"></td><td valign="top"><em>MAP_F</em> </td><td>The map function. </td></tr> <tr><td valign="top"></td><td valign="top"><em>USER_DATA</em> </td><td>User's datas passed to MAP_F. </td></tr> </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the first node for which MAP_F returns GDSL_MAP_STOP. <p>NULL when the parsing is done. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__bstree.html#g4218ed4929831254a7c494b8ee2a5720">_gdsl_bstree_map_infix()</a> <p><a class="el" href="group____gdsl__bstree.html#gae4fc832c898618e2f354f67f87ddfdd">_gdsl_bstree_map_postfix()</a> </dd></dl> </td> </tr></table><a class="anchor" name="g4218ed4929831254a7c494b8ee2a5720"></a><!-- doxytag: member="_gdsl_bstree.h::_gdsl_bstree_map_infix" ref="g4218ed4929831254a7c494b8ee2a5720" args="(const _gdsl_bstree_t T, const _gdsl_bstree_map_func_t MAP_F, void *USER_DATA)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__bstree.html#g0b897530b6c7e499f38de973f8e0889d">_gdsl_bstree_t</a> _gdsl_bstree_map_infix </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__bstree.html#g0b897530b6c7e499f38de973f8e0889d">_gdsl_bstree_t</a> </td> <td class="mdname" nowrap> <em>T</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>const <a class="el" href="group____gdsl__bstree.html#g2716161e9382a6efb5ea83986ed5a719">_gdsl_bstree_map_func_t</a> </td> <td class="mdname" nowrap> <em>MAP_F</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>void * </td> <td class="mdname" nowrap> <em>USER_DATA</em></td> </tr> <tr> <td class="md"></td> <td class="md">) </td> <td class="md" colspan="2"></td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Parse a low-level binary search tree in infixed order. <p>Parse all nodes of the low-level binary search tree T in infixed order. The MAP_F function is called on each node with the USER_DATA argument. If MAP_F returns GDSL_MAP_STOP, then <a class="el" href="group____gdsl__bstree.html#g4218ed4929831254a7c494b8ee2a5720">_gdsl_bstree_map_infix()</a> stops and returns its last examinated node.<p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |T| ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>MAP_F != NULL. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd> <table border="0" cellspacing="2" cellpadding="0"> <tr><td valign="top"></td><td valign="top"><em>T</em> </td><td>The low-level b⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -