group____gdsl__list.html

一个通用的C语言实现的数据结构

          <td class="md"></td>
          <td class="md" nowrap><a class="el" href="group____gdsl__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>L2</em></td>
        </tr>
        <tr>
          <td class="md"></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"></td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Link two low-level lists together. 
<p>
Link the low-level list L2 after the end of the low-level list L1. So L1 is before L2.<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |L1| ) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>L1 &amp; L2 must be non-empty _gdsl_list_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>L1</em>&nbsp;</td><td>The low-level list to link before L2. </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>L2</em>&nbsp;</td><td>The low-level list to link after L1. </td></tr>
  </table>
</dl>
    </td>
  </tr>
</table>
<a class="anchor" name="g5d52d9c65f0f33ccdbbe50bbb0b94f30"></a><!-- doxytag: member="_gdsl_list.h::_gdsl_list_insert_after" ref="g5d52d9c65f0f33ccdbbe50bbb0b94f30" args="(_gdsl_list_t L, _gdsl_list_t PREV)" --><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_list_insert_after           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>L</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__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>PREV</em></td>
        </tr>
        <tr>
          <td class="md"></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"></td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Insert a low-level list after another one. 
<p>
Insert the low-level list L after the low-level list PREV.<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |L| ) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>L &amp; PREV must be non-empty _gdsl_list_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>L</em>&nbsp;</td><td>The low-level list to link after PREV. </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>PREV</em>&nbsp;</td><td>The low-level list that will be linked before L. </td></tr>
  </table>
</dl>
<dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__list.html#g429e78d2df26cc234e95d63af0a6af71">_gdsl_list_insert_before()</a> <p>
<a class="el" href="group____gdsl__list.html#g1d63ca580e0a81b65cf82cb1745b8f2c">_gdsl_list_remove()</a> </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="g429e78d2df26cc234e95d63af0a6af71"></a><!-- doxytag: member="_gdsl_list.h::_gdsl_list_insert_before" ref="g429e78d2df26cc234e95d63af0a6af71" args="(_gdsl_list_t L, _gdsl_list_t SUCC)" --><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_list_insert_before           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>L</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__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>SUCC</em></td>
        </tr>
        <tr>
          <td class="md"></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"></td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Insert a low-level list before another one. 
<p>
Insert the low-level list L before the low-level list SUCC.<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( |L| ) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>L &amp; SUCC must be non-empty _gdsl_list_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>L</em>&nbsp;</td><td>The low-level list to link before SUCC. </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>SUCC</em>&nbsp;</td><td>The low-level list that will be linked after L. </td></tr>
  </table>
</dl>
<dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__list.html#g5d52d9c65f0f33ccdbbe50bbb0b94f30">_gdsl_list_insert_after()</a> <p>
<a class="el" href="group____gdsl__list.html#g1d63ca580e0a81b65cf82cb1745b8f2c">_gdsl_list_remove()</a> </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="g1d63ca580e0a81b65cf82cb1745b8f2c"></a><!-- doxytag: member="_gdsl_list.h::_gdsl_list_remove" ref="g1d63ca580e0a81b65cf82cb1745b8f2c" args="(_gdsl_node_t NODE)" --><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_list_remove           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__node.html#g05a586e2272f3b89acaa43e1efc73e1b">_gdsl_node_t</a>&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>NODE</em>          </td>
          <td class="md" valign="top">&nbsp;)&nbsp;</td>
          <td class="md" nowrap></td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Remove a node from a low-level list. 
<p>
Unlink the node NODE from the low-level list in which it is inserted.<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>NODE must be a non-empty _gdsl_node_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>NODE</em>&nbsp;</td><td>The low-level node to unlink from the low-level list in which it's linked. </td></tr>
  </table>
</dl>
<dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__list.html#g5d52d9c65f0f33ccdbbe50bbb0b94f30">_gdsl_list_insert_after()</a> <p>
<a class="el" href="group____gdsl__list.html#g429e78d2df26cc234e95d63af0a6af71">_gdsl_list_insert_before()</a> </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="gbf2044c1f1b5a93cb4b41bedf73263d9"></a><!-- doxytag: member="_gdsl_list.h::_gdsl_list_search" ref="gbf2044c1f1b5a93cb4b41bedf73263d9" args="(_gdsl_list_t L, const 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__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a> _gdsl_list_search           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>L</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>&nbsp;</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 *&nbsp;</td>
          <td class="mdname" nowrap> <em>VALUE</em></td>
        </tr>
        <tr>
          <td class="md"></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"></td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Search for a particular node in a low-level list. 
<p>
Research an element e in the low-level list L, 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( |L| ) </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>L</em>&nbsp;</td><td>The low-level list to use </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>COMP_F</em>&nbsp;</td><td>The comparison function to use to compare L's elements with VALUE to find the element e </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>VALUE</em>&nbsp;</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 sub-list starting by e if it's found. <p>
NULL if VALUE is not found in L. </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="gc1c5040a9d4148395bc565fc49fd0d56"></a><!-- doxytag: member="_gdsl_list.h::_gdsl_list_map_forward" ref="gc1c5040a9d4148395bc565fc49fd0d56" args="(const _gdsl_list_t L, const _gdsl_node_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__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a> _gdsl_list_map_forward           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__list.html#g14ec3b9bcad935bbefd3ed0a7d16ec60">_gdsl_list_t</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>L</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__node.html#g0b641a2e9711f86cfaa79db3b5756be9">_gdsl_node_map_func_t</a>&nbsp;</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 *&nbsp;</td>
          <td class="mdname" nowrap> <em>USER_DATA</em></td>
        </tr>
        <tr>
          <td class="md"></td>
          <td class="md">)&nbsp;</td>
          <td class="md" colspan="2"></td>
        </tr>
      </table>
    </td>
  </tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
  <tr>
    <td>
      &nbsp;
    </td>
    <td>

<p>
Parse a low-level list in forward order. 
<p>