%PDF- %PDF-
Mini Shell

Mini Shell

Direktori : /proc/self/root/proc/self/root/usr/share/nagios/html/docs/
Upload File :
Create Path :
Current File : //proc/self/root/proc/self/root/usr/share/nagios/html/docs/dkhash_8h_source.html

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>Nagios: dkhash.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Nagios
   &#160;<span id="projectnumber">4.4.3</span>
   </div>
   <div id="projectbrief">Dev docs for Nagios core and neb-module hackers</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>Globals</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Data Structures</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Macros</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Pages</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_97aefd0d527b934f1d99a682da8fe6a9.html">lib</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">dkhash.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="dkhash_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#ifndef LIBNAGIOS_DKHASH_H_INCLUDED</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define LIBNAGIOS_DKHASH_H_INCLUDED</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#include &lt;errno.h&gt;</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * @file dkhash.h</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * @brief Dual-key hash functions for Nagios</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * Having a dual-key hash function is pretty unusual, but since so</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * much data in Nagios pertains to services (which are uniquely</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * identified based on both host_name and service_description), it</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * makes sense here.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * @{</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">/** return flags usable from the callback function of dkhash_walk_data() */</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="dkhash_8h.html#a1237519f5f531a5ca1c2230088b8ffd6">   18</a></span>&#160;<span class="preprocessor">#define DKHASH_WALK_REMOVE 1 </span><span class="comment">/**&lt; Remove the most recently visited object */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00019"></a><span class="lineno"><a class="line" href="dkhash_8h.html#ac82fbc44fa4033b6740453b8ee19f24e">   19</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DKHASH_WALK_STOP   2 </span><span class="comment">/**&lt; Cause walking to stop */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor"></span><span class="comment"></span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">/** return values for dkhash_insert() */</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="dkhash_8h.html#a692ac1914579ba43ddfb86fc8dd80e5b">   22</a></span>&#160;<span class="preprocessor">#define DKHASH_OK     0         </span><span class="comment">/**&lt; Success */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00023"></a><span class="lineno"><a class="line" href="dkhash_8h.html#a0017b1cb48394714f36c6afcfd5e9667">   23</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DKHASH_EDUPE  (-EPERM)  </span><span class="comment">/**&lt; duplicate insert attempted */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="dkhash_8h.html#af47f37bf6db64b8968e36bb0153dd2aa">   24</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DKHASH_EPERM  (-EPERM)  </span><span class="comment">/**&lt; duplicate insert attempted */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="dkhash_8h.html#ac16da1d934c8c39e89c8cbe2ef4521de">   25</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DKHASH_EINVAL (-EINVAL) </span><span class="comment">/**&lt; Invalid parameters passed */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="dkhash_8h.html#a2359a936e1570a68373737a552b4c491">   26</a></span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define DKHASH_ENOMEM (-ENOMEM) </span><span class="comment">/**&lt; Memory allocation failed */</span><span class="preprocessor"></span></div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keyword">struct </span><a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a>;<span class="comment"></span></div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">/** opaque type */</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">   30</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> <a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a>;</div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment"> * Create a dual-keyed hash-table of the given size</span></div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="comment"> * Note that it&#39;s generally useful to make the table 25-30% larger</span></div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment"> * than the number of items you intend to store, and also note that</span></div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment"> * the &#39;size&#39; arguments gets rounded up to the nearest power of 2.</span></div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="comment"> * @param size The desired size of the hash-table.</span></div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="keyword">extern</span> <a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *<a class="code" href="dkhash_8h.html#a4089cf55e57c7a9696ce620791cc14ef">dkhash_create</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> size);</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment"> * Destroy a dual-keyed hash table</span></div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="comment"> * @param t The table to destroy</span></div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="comment"> * @return 0 on success, -1 on errors</span></div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">int</span> <a class="code" href="dkhash_8h.html#ac5b485bc59608b0f5de4d7eb374990c0">dkhash_destroy</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t);</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="comment"> * Fetch the data associated with a particular key</span></div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="comment"> * @param t The table to get the data from</span></div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="comment"> * @param k1 The first key</span></div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="comment"> * @param k2 The second key</span></div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="comment"> * @return The data on success, NULL on errors or if data isn&#39;t found</span></div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">void</span> *<a class="code" href="dkhash_8h.html#ab8df5117eee672d6f814a5ed91dda110">dkhash_get</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t, <span class="keyword">const</span> <span class="keywordtype">char</span> *k1, <span class="keyword">const</span> <span class="keywordtype">char</span> *k2);</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="comment"> * Insert a new entry into the hash table</span></div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="comment"> * @param t The hash table</span></div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;<span class="comment"> * @param k1 The first key</span></div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="comment"> * @param k2 The second key (may be null)</span></div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="comment"> * @param data The data to insert</span></div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="comment"> * @return 0 on success, &lt; 0 on errors</span></div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">int</span> <a class="code" href="dkhash_8h.html#a0beac882fb36d5f8f355e82f77167eaa">dkhash_insert</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t, <span class="keyword">const</span> <span class="keywordtype">char</span> *k1, <span class="keyword">const</span> <span class="keywordtype">char</span> *k2, <span class="keywordtype">void</span> *data);</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="comment"> * Remove data from the hash table</span></div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;<span class="comment"> * Note that this does not free() the pointer to the data stored in the</span></div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="comment"> * table. It just destroys containers for that data in the hash table.</span></div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;<span class="comment"> * @param t The hash table</span></div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;<span class="comment"> * @param k1 The first key</span></div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="comment"> * @param k2 The second key</span></div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="comment"> * @return The removed data on success, or NULL on errors</span></div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">void</span> *<a class="code" href="dkhash_8h.html#a49a2175cad5bb6ebbf8db4e9e416e490">dkhash_remove</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t, <span class="keyword">const</span> <span class="keywordtype">char</span> *k1, <span class="keyword">const</span> <span class="keywordtype">char</span> *k2);</div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;<span class="comment"> * Call a function once for each item in the hash-table</span></div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;<span class="comment"> * The callback function can return DKHASH_WALK_{REMOVE,STOP} or any</span></div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;<span class="comment"> * OR&#39;ed combination thereof to control the walking procedure, and</span></div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;<span class="comment"> * should return 0 on the normal case.</span></div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="comment"> * @param t The hash table</span></div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="comment"> * @param walker The callback function to send the data to</span></div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">void</span> <a class="code" href="dkhash_8h.html#a62a80cf9c389ed8025fffc605c4ce25e">dkhash_walk_data</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t, <span class="keywordtype">int</span> (*walker)(<span class="keywordtype">void</span> *data));</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="comment"> * Get number of collisions in hash table</span></div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="comment"> * Many collisions is a sign of a too small hash table or</span></div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="comment"> * poor hash-function.</span></div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="comment"> * @param t The hash table to report on</span></div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="comment"> * @return The total number of collisions (not duplicates) from inserts</span></div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="dkhash_8h.html#a0d4edc652b39c216a15bb1fcf2adbeda">dkhash_collisions</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t);</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;<span class="comment"> * Get number of items in the hash table</span></div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;<span class="comment"> * @param t The hash table</span></div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;<span class="comment"> * @return Number of items currently in the hash-table</span></div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="dkhash_8h.html#a6a9ae6207bc2392cf20d9c1c7ec9d53a">dkhash_num_entries</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t);</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;<span class="comment"> * Get max number of items stored in the hash table</span></div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="comment"> * @param t The hash table</span></div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="comment"> * @return Max number of items stored in hash-table</span></div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="dkhash_8h.html#aa6e060bcedb0f75b241974f5f45bd866">dkhash_num_entries_max</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t);</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;<span class="comment"> * Get number of entries added to hash table</span></div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="comment"> * Note that some of them may have been removed.</span></div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;<span class="comment"> * @param t The hash table</span></div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="comment"> * @return The number of items added to the table</span></div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="dkhash_8h.html#aba4b7dc064103d9dfa79488718a2e566">dkhash_num_entries_added</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t);</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;<span class="comment"> * Get number of removed items from hash table</span></div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;<span class="comment"> * @param t The hash table</span></div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;<span class="comment"> * @return Number of items removed from hash table</span></div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="dkhash_8h.html#a2c8d4dd27e7511cc8ca107a977179631">dkhash_num_entries_removed</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t);</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;<span class="comment">/**</span></div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;<span class="comment"> * Get actual table size (in number of buckets)</span></div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;<span class="comment"> * @param t The hash table</span></div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="comment"> * @return Number of bucket-slots in hash table</span></div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="keyword">extern</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="dkhash_8h.html#af2880db78cafdfc5ab0a60b08f1615ec">dkhash_table_size</a>(<a class="code" href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a> *t);<span class="comment"></span></div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;<span class="comment">/** @} */</span></div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* LIBNAGIOS_DKHASH_H_INCLUDED */</span><span class="preprocessor"></span></div>
<div class="ttc" id="dkhash_8h_html_aba4b7dc064103d9dfa79488718a2e566"><div class="ttname"><a href="dkhash_8h.html#aba4b7dc064103d9dfa79488718a2e566">dkhash_num_entries_added</a></div><div class="ttdeci">unsigned int dkhash_num_entries_added(dkhash_table *t)</div><div class="ttdoc">Get number of entries added to hash table Note that some of them may have been removed. </div></div>
<div class="ttc" id="dkhash_8h_html_a6a9ae6207bc2392cf20d9c1c7ec9d53a"><div class="ttname"><a href="dkhash_8h.html#a6a9ae6207bc2392cf20d9c1c7ec9d53a">dkhash_num_entries</a></div><div class="ttdeci">unsigned int dkhash_num_entries(dkhash_table *t)</div><div class="ttdoc">Get number of items in the hash table. </div></div>
<div class="ttc" id="dkhash_8h_html_ab8df5117eee672d6f814a5ed91dda110"><div class="ttname"><a href="dkhash_8h.html#ab8df5117eee672d6f814a5ed91dda110">dkhash_get</a></div><div class="ttdeci">void * dkhash_get(dkhash_table *t, const char *k1, const char *k2)</div><div class="ttdoc">Fetch the data associated with a particular key. </div></div>
<div class="ttc" id="dkhash_8h_html_ac5b485bc59608b0f5de4d7eb374990c0"><div class="ttname"><a href="dkhash_8h.html#ac5b485bc59608b0f5de4d7eb374990c0">dkhash_destroy</a></div><div class="ttdeci">int dkhash_destroy(dkhash_table *t)</div><div class="ttdoc">Destroy a dual-keyed hash table. </div></div>
<div class="ttc" id="dkhash_8h_html_a62a80cf9c389ed8025fffc605c4ce25e"><div class="ttname"><a href="dkhash_8h.html#a62a80cf9c389ed8025fffc605c4ce25e">dkhash_walk_data</a></div><div class="ttdeci">void dkhash_walk_data(dkhash_table *t, int(*walker)(void *data))</div><div class="ttdoc">Call a function once for each item in the hash-table The callback function can return DKHASH_WALK_{RE...</div></div>
<div class="ttc" id="dkhash_8h_html_af2880db78cafdfc5ab0a60b08f1615ec"><div class="ttname"><a href="dkhash_8h.html#af2880db78cafdfc5ab0a60b08f1615ec">dkhash_table_size</a></div><div class="ttdeci">unsigned int dkhash_table_size(dkhash_table *t)</div><div class="ttdoc">Get actual table size (in number of buckets) </div></div>
<div class="ttc" id="dkhash_8h_html_a0beac882fb36d5f8f355e82f77167eaa"><div class="ttname"><a href="dkhash_8h.html#a0beac882fb36d5f8f355e82f77167eaa">dkhash_insert</a></div><div class="ttdeci">int dkhash_insert(dkhash_table *t, const char *k1, const char *k2, void *data)</div><div class="ttdoc">Insert a new entry into the hash table. </div></div>
<div class="ttc" id="dkhash_8h_html_a0d4edc652b39c216a15bb1fcf2adbeda"><div class="ttname"><a href="dkhash_8h.html#a0d4edc652b39c216a15bb1fcf2adbeda">dkhash_collisions</a></div><div class="ttdeci">unsigned int dkhash_collisions(dkhash_table *t)</div><div class="ttdoc">Get number of collisions in hash table Many collisions is a sign of a too small hash table or poor ha...</div></div>
<div class="ttc" id="dkhash_8h_html_a24ce8d97b87656b597e3a713eff95b84"><div class="ttname"><a href="dkhash_8h.html#a24ce8d97b87656b597e3a713eff95b84">dkhash_table</a></div><div class="ttdeci">struct dkhash_table dkhash_table</div><div class="ttdoc">opaque type </div><div class="ttdef"><b>Definition:</b> dkhash.h:30</div></div>
<div class="ttc" id="dkhash_8h_html_a4089cf55e57c7a9696ce620791cc14ef"><div class="ttname"><a href="dkhash_8h.html#a4089cf55e57c7a9696ce620791cc14ef">dkhash_create</a></div><div class="ttdeci">dkhash_table * dkhash_create(unsigned int size)</div><div class="ttdoc">Create a dual-keyed hash-table of the given size Note that it&amp;#39;s generally useful to make the table 25...</div></div>
<div class="ttc" id="dkhash_8h_html_a2c8d4dd27e7511cc8ca107a977179631"><div class="ttname"><a href="dkhash_8h.html#a2c8d4dd27e7511cc8ca107a977179631">dkhash_num_entries_removed</a></div><div class="ttdeci">unsigned int dkhash_num_entries_removed(dkhash_table *t)</div><div class="ttdoc">Get number of removed items from hash table. </div></div>
<div class="ttc" id="dkhash_8h_html_aa6e060bcedb0f75b241974f5f45bd866"><div class="ttname"><a href="dkhash_8h.html#aa6e060bcedb0f75b241974f5f45bd866">dkhash_num_entries_max</a></div><div class="ttdeci">unsigned int dkhash_num_entries_max(dkhash_table *t)</div><div class="ttdoc">Get max number of items stored in the hash table. </div></div>
<div class="ttc" id="dkhash_8h_html_a49a2175cad5bb6ebbf8db4e9e416e490"><div class="ttname"><a href="dkhash_8h.html#a49a2175cad5bb6ebbf8db4e9e416e490">dkhash_remove</a></div><div class="ttdeci">void * dkhash_remove(dkhash_table *t, const char *k1, const char *k2)</div><div class="ttdoc">Remove data from the hash table Note that this does not free() the pointer to the data stored in the ...</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>

Zerion Mini Shell 1.0