📄 group__gdsl__bstree.html
字号:
<p>Parse a binary search tree in postfixed order. <p>Parse all nodes of the binary search tree T in postfixed 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#g27d351ef715f630339e43a89dcb7451b">gdsl_bstree_map_postfix()</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#g3e670ad1b829d0a130955f23fc02d181">gdsl_bstree_map_infix()</a> </dd></dl> </td> </tr></table><a class="anchor" name="ga80cab0737a5c0b05806a6842b750153"></a><!-- doxytag: member="gdsl_bstree.h::gdsl_bstree_write" ref="ga80cab0737a5c0b05806a6842b750153" args="(const gdsl_bstree_t T, gdsl_write_func_t WRITE_F, FILE *OUTPUT_FILE, 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">void gdsl_bstree_write </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#gfc7394b6c8e0a5bd92df75e24512dfd6">gdsl_write_func_t</a> </td> <td class="mdname" nowrap> <em>WRITE_F</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>FILE * </td> <td class="mdname" nowrap> <em>OUTPUT_FILE</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>Write the element of each node of a binary search tree to a file. <p>Write the nodes elements of the binary search tree T to OUTPUT_FILE, using WRITE_F function. Additionnal USER_DATA argument could be passed to WRITE_F.<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 & WRITE_F != NULL & OUTPUT_FILE != 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 write. </td></tr> <tr><td valign="top"></td><td valign="top"><em>WRITE_F</em> </td><td>The write function. </td></tr> <tr><td valign="top"></td><td valign="top"><em>OUTPUT_FILE</em> </td><td>The file where to write T's elements. </td></tr> <tr><td valign="top"></td><td valign="top"><em>USER_DATA</em> </td><td>User's datas passed to WRITE_F. </td></tr> </table></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__bstree.html#g5793f90350fe13ccf07401302598a150">gdsl_bstree_write_xml()</a> <p><a class="el" href="group__gdsl__bstree.html#g247de535753525e033f563d68699b630">gdsl_bstree_dump()</a> </dd></dl> </td> </tr></table><a class="anchor" name="g5793f90350fe13ccf07401302598a150"></a><!-- doxytag: member="gdsl_bstree.h::gdsl_bstree_write_xml" ref="g5793f90350fe13ccf07401302598a150" args="(const gdsl_bstree_t T, gdsl_write_func_t WRITE_F, FILE *OUTPUT_FILE, 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">void gdsl_bstree_write_xml </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#gfc7394b6c8e0a5bd92df75e24512dfd6">gdsl_write_func_t</a> </td> <td class="mdname" nowrap> <em>WRITE_F</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>FILE * </td> <td class="mdname" nowrap> <em>OUTPUT_FILE</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>Write the content of a binary search tree to a file into XML. <p>Write the nodes elements of the binary search tree T to OUTPUT_FILE, into XML language. If WRITE_F != NULL, then use WRITE_F to write T's nodes elements to OUTPUT_FILE. Additionnal USER_DATA argument could be passed to WRITE_F.<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 & OUTPUT_FILE != 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 write. </td></tr> <tr><td valign="top"></td><td valign="top"><em>WRITE_F</em> </td><td>The write function. </td></tr> <tr><td valign="top"></td><td valign="top"><em>OUTPUT_FILE</em> </td><td>The file where to write T's elements. </td></tr> <tr><td valign="top"></td><td valign="top"><em>USER_DATA</em> </td><td>User's datas passed to WRITE_F. </td></tr> </table></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__bstree.html#ga80cab0737a5c0b05806a6842b750153">gdsl_bstree_write()</a> <p><a class="el" href="group__gdsl__bstree.html#g247de535753525e033f563d68699b630">gdsl_bstree_dump()</a> </dd></dl> </td> </tr></table><a class="anchor" name="g247de535753525e033f563d68699b630"></a><!-- doxytag: member="gdsl_bstree.h::gdsl_bstree_dump" ref="g247de535753525e033f563d68699b630" args="(const gdsl_bstree_t T, gdsl_write_func_t WRITE_F, FILE *OUTPUT_FILE, 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">void gdsl_bstree_dump </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#gfc7394b6c8e0a5bd92df75e24512dfd6">gdsl_write_func_t</a> </td> <td class="mdname" nowrap> <em>WRITE_F</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap>FILE * </td> <td class="mdname" nowrap> <em>OUTPUT_FILE</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>Dump the internal structure of a binary search tree to a file. <p>Dump the structure of the binary search tree T to OUTPUT_FILE. If WRITE_F != NULL, then use WRITE_F to write T's nodes elements to OUTPUT_FILE. Additionnal USER_DATA argument could be passed to WRITE_F.<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 & OUTPUT_FILE != 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 write. </td></tr> <tr><td valign="top"></td><td valign="top"><em>WRITE_F</em> </td><td>The write function. </td></tr> <tr><td valign="top"></td><td valign="top"><em>OUTPUT_FILE</em> </td><td>The file where to write T's elements. </td></tr> <tr><td valign="top"></td><td valign="top"><em>USER_DATA</em> </td><td>User's datas passed to WRITE_F. </td></tr> </table></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__bstree.html#ga80cab0737a5c0b05806a6842b750153">gdsl_bstree_write()</a> <p><a class="el" href="group__gdsl__bstree.html#g5793f90350fe13ccf07401302598a150">gdsl_bstree_write_xml()</a> </dd></dl> </td> </tr></table><hr size="1"><address style="align: right;"><small>Generated on Thu Jun 22 11:15:30 2006 for gdsl by <a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.6 </small></address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -