group__gdsl__hash.html

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

<dl compact><dt><b>Precondition:</b></dt><dd>H must be a valid gdsl_hash_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>H</em>&nbsp;</td><td>The hashtable to use. </td></tr>
  </table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>the number of lists entries of the hashtable H. </dd></dl>
<dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__hash.html#g9f9bd328f3237d333a7d7bab5285aa2d">gdsl_hash_get_size()</a> <p>
gdsl_hash_fill_factor() </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="g5d9b8da0f4ad5e60b7fdb38156ce48f3"></a><!-- doxytag: member="gdsl_hash.h::gdsl_hash_get_lists_max_size" ref="g5d9b8da0f4ad5e60b7fdb38156ce48f3" args="(const gdsl_hash_t H)" --><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">ushort gdsl_hash_get_lists_max_size           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__hash.html#ge145ec3ea3d118dcc593ab7902162cd2">gdsl_hash_t</a>&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>H</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>
Get the max number of elements allowed in each entry of a hashtable. 
<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>H must be a valid gdsl_hash_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>H</em>&nbsp;</td><td>The hashtable to use. </td></tr>
  </table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>0 if no lists max size was set before (ie. no limit for H's entries). <p>
the max number of elements for each entry of the hashtable H, if the function <a class="el" href="group__gdsl__hash.html#g56acbd8af54ef98000d1749afbb28234">gdsl_hash_modify()</a> was used with a NEW_LISTS_MAX_SIZE greather than the actual one. </dd></dl>
<dl compact><dt><b>See also:</b></dt><dd>gdsl_hash_fill_factor() <p>
<a class="el" href="group__gdsl__hash.html#gd87fd81a7853bdcfe2cc7fdd142556f0">gdsl_hash_get_entries_number()</a> <p>
<a class="el" href="group__gdsl__hash.html#gd89e4fe4756aa34a0f47948819e53682">gdsl_hash_get_longest_list_size()</a> <p>
<a class="el" href="group__gdsl__hash.html#g56acbd8af54ef98000d1749afbb28234">gdsl_hash_modify()</a> </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="gd89e4fe4756aa34a0f47948819e53682"></a><!-- doxytag: member="gdsl_hash.h::gdsl_hash_get_longest_list_size" ref="gd89e4fe4756aa34a0f47948819e53682" args="(const gdsl_hash_t H)" --><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">ushort gdsl_hash_get_longest_list_size           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__hash.html#ge145ec3ea3d118dcc593ab7902162cd2">gdsl_hash_t</a>&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>H</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>
Get the number of elements of the longest list entry of a hashtable. 
<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( L ), where L = gdsl_hash_get_entries_number(H) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>H must be a valid gdsl_hash_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>H</em>&nbsp;</td><td>The hashtable to use. </td></tr>
  </table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>the number of elements of the longest list entry of the hashtable H. </dd></dl>
<dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__hash.html#g9f9bd328f3237d333a7d7bab5285aa2d">gdsl_hash_get_size()</a> <p>
gdsl_hash_fill_factor() <p>
<a class="el" href="group__gdsl__hash.html#gd87fd81a7853bdcfe2cc7fdd142556f0">gdsl_hash_get_entries_number()</a> <p>
<a class="el" href="group__gdsl__hash.html#g5d9b8da0f4ad5e60b7fdb38156ce48f3">gdsl_hash_get_lists_max_size()</a> </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="g9f9bd328f3237d333a7d7bab5285aa2d"></a><!-- doxytag: member="gdsl_hash.h::gdsl_hash_get_size" ref="g9f9bd328f3237d333a7d7bab5285aa2d" args="(const gdsl_hash_t H)" --><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#g9c34ac44da309b004570530c8cec8a0e">ulong</a> gdsl_hash_get_size           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__hash.html#ge145ec3ea3d118dcc593ab7902162cd2">gdsl_hash_t</a>&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>H</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>
Get the size of a hashtable. 
<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( L ), where L = gdsl_hash_get_entries_number(H) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>H must be a valid gdsl_hash_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>H</em>&nbsp;</td><td>The hashtable to get the size from </td></tr>
  </table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>the number of elements of H (noted |H|). </dd></dl>
<dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__hash.html#gd87fd81a7853bdcfe2cc7fdd142556f0">gdsl_hash_get_entries_number()</a> <p>
gdsl_hash_fill_factor() <p>
<a class="el" href="group__gdsl__hash.html#gd89e4fe4756aa34a0f47948819e53682">gdsl_hash_get_longest_list_size()</a> </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="g6c858e792ee64ce14bfeb0e7c03d3e42"></a><!-- doxytag: member="gdsl_hash.h::gdsl_hash_get_fill_factor" ref="g6c858e792ee64ce14bfeb0e7c03d3e42" args="(const gdsl_hash_t H)" --><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">double gdsl_hash_get_fill_factor           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top">const <a class="el" href="group__gdsl__hash.html#ge145ec3ea3d118dcc593ab7902162cd2">gdsl_hash_t</a>&nbsp;</td>
          <td class="mdname1" valign="top" nowrap> <em>H</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>
Get the fill factor of a hashtable. 
<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( L ), where L = gdsl_hash_get_entries_number(H) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>H must be a valid gdsl_hash_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>H</em>&nbsp;</td><td>The hashtable to use </td></tr>
  </table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>The fill factor of H, computed as |H| / L </dd></dl>
<dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__hash.html#gd87fd81a7853bdcfe2cc7fdd142556f0">gdsl_hash_get_entries_number()</a> <p>
<a class="el" href="group__gdsl__hash.html#gd89e4fe4756aa34a0f47948819e53682">gdsl_hash_get_longest_list_size()</a> <p>
<a class="el" href="group__gdsl__hash.html#g9f9bd328f3237d333a7d7bab5285aa2d">gdsl_hash_get_size()</a> </dd></dl>
    </td>
  </tr>
</table>
<a class="anchor" name="gc46d87b7312a26b985709a904a2f452e"></a><!-- doxytag: member="gdsl_hash.h::gdsl_hash_set_name" ref="gc46d87b7312a26b985709a904a2f452e" args="(gdsl_hash_t H, const char *NEW_NAME)" --><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__hash.html#ge145ec3ea3d118dcc593ab7902162cd2">gdsl_hash_t</a> gdsl_hash_set_name           </td>
          <td class="md" valign="top">(&nbsp;</td>
          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__hash.html#ge145ec3ea3d118dcc593ab7902162cd2">gdsl_hash_t</a>&nbsp;</td>
          <td class="mdname" nowrap> <em>H</em>, </td>
        </tr>
        <tr>
          <td class="md" nowrap align="right"></td>
          <td class="md"></td>
          <td class="md" nowrap>const char *&nbsp;</td>
          <td class="mdname" nowrap> <em>NEW_NAME</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>
Set the name of a hashtable. 
<p>
Change the previous name of the hashtable H to a copy of NEW_NAME.<p>
<dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl>
<dl compact><dt><b>Precondition:</b></dt><dd>H must be a valid gdsl_hash_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>H</em>&nbsp;</td><td>The hashtable to change the name </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>NEW_NAME</em>&nbsp;</td><td>The new name of H </td></tr>
  </table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>the modified hashtable in case of success. <p>
NULL in case of insufficient memory. </dd></dl>
<dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group__gdsl__hash.html#g199e08c06af60e688d95244a023f406d">gdsl_hash_get_name()</a> </dd></dl>
    </td>