📄 group__gdsl__bstree.html
字号:
NULL if no element equal to VALUE was found. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__bstree.html#gafeefcedb22ace91320aca9d765f1ed5">gdsl_bstree_insert()</a> <p><a class="el" href="group__gdsl__bstree.html#g65cd9f86967ce6bab2c84f3624d27b9b">gdsl_bstree_remove()</a> </dd></dl> </td> </tr></table><a class="anchor" name="ged9a60ec2f4b0e3aa92217b7ede2d78e"></a><!-- doxytag: member="gdsl_bstree.h::gdsl_bstree_search" ref="ged9a60ec2f4b0e3aa92217b7ede2d78e" args="(const gdsl_bstree_t T, gdsl_compare_func_t COMP_F, void *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__types.html#g0e2b9d7fb5ca9e6d50100e5d9e4bcae7">gdsl_element_t</a> gdsl_bstree_search </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__bstree.html#ge61c7d19b77e729ef8f79d4709b08aaf">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><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>void * </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 binary search tree. <p>Search the first element E equal to VALUE in the binary seach tree T, by using COMP_F function to find it. If COMP_F == NULL, then the COMP_F function passed to <a class="el" href="group__gdsl__bstree.html#g827933a8d53368e7941811dbcd9d30c6">gdsl_bstree_alloc()</a> is used.<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>T must be a valid gdsl_bstree_t </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 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 element with VALUE to find the element E (or NULL to use the default T's COMP_F) </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 first founded element E equal to VALUE. <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#gafeefcedb22ace91320aca9d765f1ed5">gdsl_bstree_insert()</a> <p><a class="el" href="group__gdsl__bstree.html#g65cd9f86967ce6bab2c84f3624d27b9b">gdsl_bstree_remove()</a> <p><a class="el" href="group__gdsl__bstree.html#g222155ce5b98ac50724ea0c3dad779f1">gdsl_bstree_delete()</a> </dd></dl> </td> </tr></table><a class="anchor" name="g435d291d54bee68d6a60b27d985a419c"></a><!-- doxytag: member="gdsl_bstree.h::gdsl_bstree_map_prefix" ref="g435d291d54bee68d6a60b27d985a419c" args="(const gdsl_bstree_t T, gdsl_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__types.html#g0e2b9d7fb5ca9e6d50100e5d9e4bcae7">gdsl_element_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#ge61c7d19b77e729ef8f79d4709b08aaf">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><a class="el" href="group__gdsl__types.html#g2500bfaaec5df890e72b43f448f13ee8">gdsl_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 binary search tree in prefixed order. <p>Parse all nodes of the binary search tree T in prefixed order. The MAP_F function is called on the element contained in each node with the USER_DATA argument. If MAP_F returns GDSL_MAP_STOP, then <a class="el" href="group__gdsl__bstree.html#g435d291d54bee68d6a60b27d985a419c">gdsl_bstree_map_prefix()</a> stops and returns its last examinated element.<p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |T| ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>T must be a valid gdsl_bstree_t & 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 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 element 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#g3e670ad1b829d0a130955f23fc02d181">gdsl_bstree_map_infix()</a> <p><a class="el" href="group__gdsl__bstree.html#g27d351ef715f630339e43a89dcb7451b">gdsl_bstree_map_postfix()</a> </dd></dl> </td> </tr></table><a class="anchor" name="g3e670ad1b829d0a130955f23fc02d181"></a><!-- doxytag: member="gdsl_bstree.h::gdsl_bstree_map_infix" ref="g3e670ad1b829d0a130955f23fc02d181" args="(const gdsl_bstree_t T, gdsl_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__types.html#g0e2b9d7fb5ca9e6d50100e5d9e4bcae7">gdsl_element_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#ge61c7d19b77e729ef8f79d4709b08aaf">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><a class="el" href="group__gdsl__types.html#g2500bfaaec5df890e72b43f448f13ee8">gdsl_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 binary search tree in infixed order. <p>Parse all nodes of the binary search tree T in infixed order. The MAP_F function is called on the element contained in each node with the USER_DATA argument. If MAP_F returns GDSL_MAP_STOP, then <a class="el" href="group__gdsl__bstree.html#g3e670ad1b829d0a130955f23fc02d181">gdsl_bstree_map_infix()</a> stops and returns its last examinated element.<p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |T| ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>T must be a valid gdsl_bstree_t & 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 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 element 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#g435d291d54bee68d6a60b27d985a419c">gdsl_bstree_map_prefix()</a> <p><a class="el" href="group__gdsl__bstree.html#g27d351ef715f630339e43a89dcb7451b">gdsl_bstree_map_postfix()</a> </dd></dl> </td> </tr></table><a class="anchor" name="g27d351ef715f630339e43a89dcb7451b"></a><!-- doxytag: member="gdsl_bstree.h::gdsl_bstree_map_postfix" ref="g27d351ef715f630339e43a89dcb7451b" args="(const gdsl_bstree_t T, gdsl_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__types.html#g0e2b9d7fb5ca9e6d50100e5d9e4bcae7">gdsl_element_t</a> gdsl_bstree_map_postfix </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__bstree.html#ge61c7d19b77e729ef8f79d4709b08aaf">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><a class="el" href="group__gdsl__types.html#g2500bfaaec5df890e72b43f448f13ee8">gdsl_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>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -