You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

linkhash_8h.html 37 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767
  1. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  2. <html xmlns="http://www.w3.org/1999/xhtml">
  3. <head>
  4. <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
  5. <title>json-c: linkhash.h File Reference</title>
  6. <link href="tabs.css" rel="stylesheet" type="text/css"/>
  7. <link href="doxygen.css" rel="stylesheet" type="text/css"/>
  8. </head>
  9. <body>
  10. <!-- Generated by Doxygen 1.6.3 -->
  11. <div class="navigation" id="top">
  12. <div class="tabs">
  13. <ul>
  14. <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
  15. <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  16. <li><a href="annotated.html"><span>Data&nbsp;Structures</span></a></li>
  17. <li class="current"><a href="files.html"><span>Files</span></a></li>
  18. </ul>
  19. </div>
  20. <div class="tabs">
  21. <ul>
  22. <li><a href="files.html"><span>File&nbsp;List</span></a></li>
  23. <li><a href="globals.html"><span>Globals</span></a></li>
  24. </ul>
  25. </div>
  26. </div>
  27. <div class="contents">
  28. <h1>linkhash.h File Reference</h1><table border="0" cellpadding="0" cellspacing="0">
  29. <tr><td colspan="2"><h2>Data Structures</h2></td></tr>
  30. <tr><td class="memItemLeft" align="right" valign="top">struct &nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structlh__entry.html">lh_entry</a></td></tr>
  31. <tr><td class="memItemLeft" align="right" valign="top">struct &nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="structlh__table.html">lh_table</a></td></tr>
  32. <tr><td colspan="2"><h2>Defines</h2></td></tr>
  33. <tr><td class="memItemLeft" align="right" valign="top">#define&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a032f1bd115df254dda325437203ce5fb">LH_PRIME</a>&nbsp;&nbsp;&nbsp;0x9e370001UL</td></tr>
  34. <tr><td class="memItemLeft" align="right" valign="top">#define&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a66b61772c29d85eb52b697e0b0dc0aaf">LH_LOAD_FACTOR</a>&nbsp;&nbsp;&nbsp;0.66</td></tr>
  35. <tr><td class="memItemLeft" align="right" valign="top">#define&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a93fad7f8ae44575dc89c9567859972d2">LH_EMPTY</a>&nbsp;&nbsp;&nbsp;(void*)-1</td></tr>
  36. <tr><td class="memItemLeft" align="right" valign="top">#define&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#ac69428f2de0a6fb080b6fb373d506aa7">LH_FREED</a>&nbsp;&nbsp;&nbsp;(void*)-2</td></tr>
  37. <tr><td class="memItemLeft" align="right" valign="top">#define&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#ad7dd67da915065dce2c6f44cb03e2d82">lh_foreach</a>(table, entry)&nbsp;&nbsp;&nbsp;for(entry = table-&gt;head; entry; entry = entry-&gt;next)</td></tr>
  38. <tr><td class="memItemLeft" align="right" valign="top">#define&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#abcbb0df08b4976d0649b826b6bacfca1">lh_foreach_safe</a>(table, entry, tmp)&nbsp;&nbsp;&nbsp;for(entry = table-&gt;head; entry &amp;&amp; ((tmp = entry-&gt;next) || 1); entry = tmp)</td></tr>
  39. <tr><td colspan="2"><h2>Typedefs</h2></td></tr>
  40. <tr><td class="memItemLeft" align="right" valign="top">typedef void(&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a671553d0ee3c2a123190ba0f8ed2b635">lh_entry_free_fn</a> )(struct <a class="el" href="structlh__entry.html">lh_entry</a> *e)</td></tr>
  41. <tr><td class="memItemLeft" align="right" valign="top">typedef unsigned long(&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a38bae27995dcfb6ee3fb109a9be229b2">lh_hash_fn</a> )(const void *k)</td></tr>
  42. <tr><td class="memItemLeft" align="right" valign="top">typedef int(&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a91fd85fc81b0c7c83c62f00e84729091">lh_equal_fn</a> )(const void *k1, const void *k2)</td></tr>
  43. <tr><td colspan="2"><h2>Functions</h2></td></tr>
  44. <tr><td class="memItemLeft" align="right" valign="top">unsigned long&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a2e560f0d3e5a20f6b0bfa4049737db23">lh_ptr_hash</a> (const void *k)</td></tr>
  45. <tr><td class="memItemLeft" align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a6ce3cb97560072c40f5caeaba85f756a">lh_ptr_equal</a> (const void *k1, const void *k2)</td></tr>
  46. <tr><td class="memItemLeft" align="right" valign="top">unsigned long&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a1fcf495b9c4ce169630cb31f638b8435">lh_char_hash</a> (const void *k)</td></tr>
  47. <tr><td class="memItemLeft" align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#ae4e9f21fb1a556c7a50c6b7ea61f2079">lh_char_equal</a> (const void *k1, const void *k2)</td></tr>
  48. <tr><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#ac3ba464ac43c083397b1f1d34f2ddf55">lh_table_new</a> (int size, const char *name, <a class="el" href="linkhash_8h.html#a671553d0ee3c2a123190ba0f8ed2b635">lh_entry_free_fn</a> *free_fn, <a class="el" href="linkhash_8h.html#a38bae27995dcfb6ee3fb109a9be229b2">lh_hash_fn</a> *hash_fn, <a class="el" href="linkhash_8h.html#a91fd85fc81b0c7c83c62f00e84729091">lh_equal_fn</a> *equal_fn)</td></tr>
  49. <tr><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a0aaf11e11ee5b0925279a52eab04bc38">lh_kchar_table_new</a> (int size, const char *name, <a class="el" href="linkhash_8h.html#a671553d0ee3c2a123190ba0f8ed2b635">lh_entry_free_fn</a> *free_fn)</td></tr>
  50. <tr><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a705513954267a16cc1d40a284a7c441e">lh_kptr_table_new</a> (int size, const char *name, <a class="el" href="linkhash_8h.html#a671553d0ee3c2a123190ba0f8ed2b635">lh_entry_free_fn</a> *free_fn)</td></tr>
  51. <tr><td class="memItemLeft" align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a81653acf740cf8c9fe672e6cd16df0cf">lh_table_free</a> (struct <a class="el" href="structlh__table.html">lh_table</a> *t)</td></tr>
  52. <tr><td class="memItemLeft" align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a22b897763cc34a98c21c7fe82d151004">lh_table_insert</a> (struct <a class="el" href="structlh__table.html">lh_table</a> *t, void *k, const void *v)</td></tr>
  53. <tr><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="structlh__entry.html">lh_entry</a> *&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#ad3b6ca2d967a6c3021ee6c39e014a918">lh_table_lookup_entry</a> (struct <a class="el" href="structlh__table.html">lh_table</a> *t, const void *k)</td></tr>
  54. <tr><td class="memItemLeft" align="right" valign="top">const void *&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a49c27f18a174eaf126d1b7953df13cb1">lh_table_lookup</a> (struct <a class="el" href="structlh__table.html">lh_table</a> *t, const void *k)</td></tr>
  55. <tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="json__object_8h.html#a81f02022906fafc71eb9197049f07f73">json_bool</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a81c270bb0dd9d5c8a3e7ae20bc4d67f3">lh_table_lookup_ex</a> (struct <a class="el" href="structlh__table.html">lh_table</a> *t, const void *k, void **v)</td></tr>
  56. <tr><td class="memItemLeft" align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#ae5885a71c3457190fb1dc2d6e20dde3b">lh_table_delete_entry</a> (struct <a class="el" href="structlh__table.html">lh_table</a> *t, struct <a class="el" href="structlh__entry.html">lh_entry</a> *e)</td></tr>
  57. <tr><td class="memItemLeft" align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a2fed2c78f70d229edb2d00775ffe593c">lh_table_delete</a> (struct <a class="el" href="structlh__table.html">lh_table</a> *t, const void *k)</td></tr>
  58. <tr><td class="memItemLeft" align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a1294160fa0e80cee04cd745a401f43a4">lh_abort</a> (const char *msg,...)</td></tr>
  59. <tr><td class="memItemLeft" align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="linkhash_8h.html#a5322eccf3394af7dc1ebb22af8f8c562">lh_table_resize</a> (struct <a class="el" href="structlh__table.html">lh_table</a> *t, int new_size)</td></tr>
  60. </table>
  61. <hr/><h2>Define Documentation</h2>
  62. <a class="anchor" id="a93fad7f8ae44575dc89c9567859972d2"></a><!-- doxytag: member="linkhash.h::LH_EMPTY" ref="a93fad7f8ae44575dc89c9567859972d2" args="" -->
  63. <div class="memitem">
  64. <div class="memproto">
  65. <table class="memname">
  66. <tr>
  67. <td class="memname">#define LH_EMPTY&nbsp;&nbsp;&nbsp;(void*)-1</td>
  68. </tr>
  69. </table>
  70. </div>
  71. <div class="memdoc">
  72. <p>sentinel pointer value for empty slots </p>
  73. </div>
  74. </div>
  75. <a class="anchor" id="ad7dd67da915065dce2c6f44cb03e2d82"></a><!-- doxytag: member="linkhash.h::lh_foreach" ref="ad7dd67da915065dce2c6f44cb03e2d82" args="(table, entry)" -->
  76. <div class="memitem">
  77. <div class="memproto">
  78. <table class="memname">
  79. <tr>
  80. <td class="memname">#define lh_foreach</td>
  81. <td>(</td>
  82. <td class="paramtype">table, </td>
  83. </tr>
  84. <tr>
  85. <td class="paramkey"></td>
  86. <td></td>
  87. <td class="paramtype">entry&nbsp;</td>
  88. <td class="paramname"></td>
  89. <td>&nbsp;)&nbsp;</td>
  90. <td>&nbsp;&nbsp;&nbsp;for(entry = table-&gt;head; entry; entry = entry-&gt;next)</td>
  91. </tr>
  92. </table>
  93. </div>
  94. <div class="memdoc">
  95. <p>Convenience list iterator. </p>
  96. </div>
  97. </div>
  98. <a class="anchor" id="abcbb0df08b4976d0649b826b6bacfca1"></a><!-- doxytag: member="linkhash.h::lh_foreach_safe" ref="abcbb0df08b4976d0649b826b6bacfca1" args="(table, entry, tmp)" -->
  99. <div class="memitem">
  100. <div class="memproto">
  101. <table class="memname">
  102. <tr>
  103. <td class="memname">#define lh_foreach_safe</td>
  104. <td>(</td>
  105. <td class="paramtype">table, </td>
  106. </tr>
  107. <tr>
  108. <td class="paramkey"></td>
  109. <td></td>
  110. <td class="paramtype">entry, </td>
  111. </tr>
  112. <tr>
  113. <td class="paramkey"></td>
  114. <td></td>
  115. <td class="paramtype">tmp&nbsp;</td>
  116. <td class="paramname"></td>
  117. <td>&nbsp;)&nbsp;</td>
  118. <td>&nbsp;&nbsp;&nbsp;for(entry = table-&gt;head; entry &amp;&amp; ((tmp = entry-&gt;next) || 1); entry = tmp)</td>
  119. </tr>
  120. </table>
  121. </div>
  122. <div class="memdoc">
  123. <p>lh_foreach_safe allows calling of deletion routine while iterating. </p>
  124. </div>
  125. </div>
  126. <a class="anchor" id="ac69428f2de0a6fb080b6fb373d506aa7"></a><!-- doxytag: member="linkhash.h::LH_FREED" ref="ac69428f2de0a6fb080b6fb373d506aa7" args="" -->
  127. <div class="memitem">
  128. <div class="memproto">
  129. <table class="memname">
  130. <tr>
  131. <td class="memname">#define LH_FREED&nbsp;&nbsp;&nbsp;(void*)-2</td>
  132. </tr>
  133. </table>
  134. </div>
  135. <div class="memdoc">
  136. <p>sentinel pointer value for freed slots </p>
  137. </div>
  138. </div>
  139. <a class="anchor" id="a66b61772c29d85eb52b697e0b0dc0aaf"></a><!-- doxytag: member="linkhash.h::LH_LOAD_FACTOR" ref="a66b61772c29d85eb52b697e0b0dc0aaf" args="" -->
  140. <div class="memitem">
  141. <div class="memproto">
  142. <table class="memname">
  143. <tr>
  144. <td class="memname">#define LH_LOAD_FACTOR&nbsp;&nbsp;&nbsp;0.66</td>
  145. </tr>
  146. </table>
  147. </div>
  148. <div class="memdoc">
  149. <p>The fraction of filled hash buckets until an insert will cause the table to be resized. This can range from just above 0 up to 1.0. </p>
  150. </div>
  151. </div>
  152. <a class="anchor" id="a032f1bd115df254dda325437203ce5fb"></a><!-- doxytag: member="linkhash.h::LH_PRIME" ref="a032f1bd115df254dda325437203ce5fb" args="" -->
  153. <div class="memitem">
  154. <div class="memproto">
  155. <table class="memname">
  156. <tr>
  157. <td class="memname">#define LH_PRIME&nbsp;&nbsp;&nbsp;0x9e370001UL</td>
  158. </tr>
  159. </table>
  160. </div>
  161. <div class="memdoc">
  162. <p>golden prime used in hash functions </p>
  163. </div>
  164. </div>
  165. <hr/><h2>Typedef Documentation</h2>
  166. <a class="anchor" id="a671553d0ee3c2a123190ba0f8ed2b635"></a><!-- doxytag: member="linkhash.h::lh_entry_free_fn" ref="a671553d0ee3c2a123190ba0f8ed2b635" args=")(struct lh_entry *e)" -->
  167. <div class="memitem">
  168. <div class="memproto">
  169. <table class="memname">
  170. <tr>
  171. <td class="memname">typedef void( <a class="el" href="linkhash_8h.html#a671553d0ee3c2a123190ba0f8ed2b635">lh_entry_free_fn</a>)(struct <a class="el" href="structlh__entry.html">lh_entry</a> *e)</td>
  172. </tr>
  173. </table>
  174. </div>
  175. <div class="memdoc">
  176. <p>callback function prototypes </p>
  177. </div>
  178. </div>
  179. <a class="anchor" id="a91fd85fc81b0c7c83c62f00e84729091"></a><!-- doxytag: member="linkhash.h::lh_equal_fn" ref="a91fd85fc81b0c7c83c62f00e84729091" args=")(const void *k1, const void *k2)" -->
  180. <div class="memitem">
  181. <div class="memproto">
  182. <table class="memname">
  183. <tr>
  184. <td class="memname">typedef int( <a class="el" href="linkhash_8h.html#a91fd85fc81b0c7c83c62f00e84729091">lh_equal_fn</a>)(const void *k1, const void *k2)</td>
  185. </tr>
  186. </table>
  187. </div>
  188. <div class="memdoc">
  189. <p>callback function prototypes </p>
  190. </div>
  191. </div>
  192. <a class="anchor" id="a38bae27995dcfb6ee3fb109a9be229b2"></a><!-- doxytag: member="linkhash.h::lh_hash_fn" ref="a38bae27995dcfb6ee3fb109a9be229b2" args=")(const void *k)" -->
  193. <div class="memitem">
  194. <div class="memproto">
  195. <table class="memname">
  196. <tr>
  197. <td class="memname">typedef unsigned long( <a class="el" href="linkhash_8h.html#a38bae27995dcfb6ee3fb109a9be229b2">lh_hash_fn</a>)(const void *k)</td>
  198. </tr>
  199. </table>
  200. </div>
  201. <div class="memdoc">
  202. <p>callback function prototypes </p>
  203. </div>
  204. </div>
  205. <hr/><h2>Function Documentation</h2>
  206. <a class="anchor" id="a1294160fa0e80cee04cd745a401f43a4"></a><!-- doxytag: member="linkhash.h::lh_abort" ref="a1294160fa0e80cee04cd745a401f43a4" args="(const char *msg,...)" -->
  207. <div class="memitem">
  208. <div class="memproto">
  209. <table class="memname">
  210. <tr>
  211. <td class="memname">void lh_abort </td>
  212. <td>(</td>
  213. <td class="paramtype">const char *&nbsp;</td>
  214. <td class="paramname"> <em>msg</em>, </td>
  215. </tr>
  216. <tr>
  217. <td class="paramkey"></td>
  218. <td></td>
  219. <td class="paramtype">&nbsp;</td>
  220. <td class="paramname"> <em>...</em></td><td>&nbsp;</td>
  221. </tr>
  222. <tr>
  223. <td></td>
  224. <td>)</td>
  225. <td></td><td></td><td></td>
  226. </tr>
  227. </table>
  228. </div>
  229. <div class="memdoc">
  230. </div>
  231. </div>
  232. <a class="anchor" id="ae4e9f21fb1a556c7a50c6b7ea61f2079"></a><!-- doxytag: member="linkhash.h::lh_char_equal" ref="ae4e9f21fb1a556c7a50c6b7ea61f2079" args="(const void *k1, const void *k2)" -->
  233. <div class="memitem">
  234. <div class="memproto">
  235. <table class="memname">
  236. <tr>
  237. <td class="memname">int lh_char_equal </td>
  238. <td>(</td>
  239. <td class="paramtype">const void *&nbsp;</td>
  240. <td class="paramname"> <em>k1</em>, </td>
  241. </tr>
  242. <tr>
  243. <td class="paramkey"></td>
  244. <td></td>
  245. <td class="paramtype">const void *&nbsp;</td>
  246. <td class="paramname"> <em>k2</em></td><td>&nbsp;</td>
  247. </tr>
  248. <tr>
  249. <td></td>
  250. <td>)</td>
  251. <td></td><td></td><td></td>
  252. </tr>
  253. </table>
  254. </div>
  255. <div class="memdoc">
  256. </div>
  257. </div>
  258. <a class="anchor" id="a1fcf495b9c4ce169630cb31f638b8435"></a><!-- doxytag: member="linkhash.h::lh_char_hash" ref="a1fcf495b9c4ce169630cb31f638b8435" args="(const void *k)" -->
  259. <div class="memitem">
  260. <div class="memproto">
  261. <table class="memname">
  262. <tr>
  263. <td class="memname">unsigned long lh_char_hash </td>
  264. <td>(</td>
  265. <td class="paramtype">const void *&nbsp;</td>
  266. <td class="paramname"> <em>k</em></td>
  267. <td>&nbsp;)&nbsp;</td>
  268. <td></td>
  269. </tr>
  270. </table>
  271. </div>
  272. <div class="memdoc">
  273. </div>
  274. </div>
  275. <a class="anchor" id="a0aaf11e11ee5b0925279a52eab04bc38"></a><!-- doxytag: member="linkhash.h::lh_kchar_table_new" ref="a0aaf11e11ee5b0925279a52eab04bc38" args="(int size, const char *name, lh_entry_free_fn *free_fn)" -->
  276. <div class="memitem">
  277. <div class="memproto">
  278. <table class="memname">
  279. <tr>
  280. <td class="memname">struct <a class="el" href="structlh__table.html">lh_table</a>* lh_kchar_table_new </td>
  281. <td>(</td>
  282. <td class="paramtype">int&nbsp;</td>
  283. <td class="paramname"> <em>size</em>, </td>
  284. </tr>
  285. <tr>
  286. <td class="paramkey"></td>
  287. <td></td>
  288. <td class="paramtype">const char *&nbsp;</td>
  289. <td class="paramname"> <em>name</em>, </td>
  290. </tr>
  291. <tr>
  292. <td class="paramkey"></td>
  293. <td></td>
  294. <td class="paramtype"><a class="el" href="linkhash_8h.html#a671553d0ee3c2a123190ba0f8ed2b635">lh_entry_free_fn</a> *&nbsp;</td>
  295. <td class="paramname"> <em>free_fn</em></td><td>&nbsp;</td>
  296. </tr>
  297. <tr>
  298. <td></td>
  299. <td>)</td>
  300. <td></td><td></td><td><code> [read]</code></td>
  301. </tr>
  302. </table>
  303. </div>
  304. <div class="memdoc">
  305. <p>Convenience function to create a new linkhash table with char keys. </p>
  306. <dl><dt><b>Parameters:</b></dt><dd>
  307. <table border="0" cellspacing="2" cellpadding="0">
  308. <tr><td valign="top"></td><td valign="top"><em>size</em>&nbsp;</td><td>initial table size. </td></tr>
  309. <tr><td valign="top"></td><td valign="top"><em>name</em>&nbsp;</td><td>table name. </td></tr>
  310. <tr><td valign="top"></td><td valign="top"><em>free_fn</em>&nbsp;</td><td>callback function used to free memory for entries. </td></tr>
  311. </table>
  312. </dd>
  313. </dl>
  314. <dl class="return"><dt><b>Returns:</b></dt><dd>a pointer onto the linkhash table. </dd></dl>
  315. </div>
  316. </div>
  317. <a class="anchor" id="a705513954267a16cc1d40a284a7c441e"></a><!-- doxytag: member="linkhash.h::lh_kptr_table_new" ref="a705513954267a16cc1d40a284a7c441e" args="(int size, const char *name, lh_entry_free_fn *free_fn)" -->
  318. <div class="memitem">
  319. <div class="memproto">
  320. <table class="memname">
  321. <tr>
  322. <td class="memname">struct <a class="el" href="structlh__table.html">lh_table</a>* lh_kptr_table_new </td>
  323. <td>(</td>
  324. <td class="paramtype">int&nbsp;</td>
  325. <td class="paramname"> <em>size</em>, </td>
  326. </tr>
  327. <tr>
  328. <td class="paramkey"></td>
  329. <td></td>
  330. <td class="paramtype">const char *&nbsp;</td>
  331. <td class="paramname"> <em>name</em>, </td>
  332. </tr>
  333. <tr>
  334. <td class="paramkey"></td>
  335. <td></td>
  336. <td class="paramtype"><a class="el" href="linkhash_8h.html#a671553d0ee3c2a123190ba0f8ed2b635">lh_entry_free_fn</a> *&nbsp;</td>
  337. <td class="paramname"> <em>free_fn</em></td><td>&nbsp;</td>
  338. </tr>
  339. <tr>
  340. <td></td>
  341. <td>)</td>
  342. <td></td><td></td><td><code> [read]</code></td>
  343. </tr>
  344. </table>
  345. </div>
  346. <div class="memdoc">
  347. <p>Convenience function to create a new linkhash table with ptr keys. </p>
  348. <dl><dt><b>Parameters:</b></dt><dd>
  349. <table border="0" cellspacing="2" cellpadding="0">
  350. <tr><td valign="top"></td><td valign="top"><em>size</em>&nbsp;</td><td>initial table size. </td></tr>
  351. <tr><td valign="top"></td><td valign="top"><em>name</em>&nbsp;</td><td>table name. </td></tr>
  352. <tr><td valign="top"></td><td valign="top"><em>free_fn</em>&nbsp;</td><td>callback function used to free memory for entries. </td></tr>
  353. </table>
  354. </dd>
  355. </dl>
  356. <dl class="return"><dt><b>Returns:</b></dt><dd>a pointer onto the linkhash table. </dd></dl>
  357. </div>
  358. </div>
  359. <a class="anchor" id="a6ce3cb97560072c40f5caeaba85f756a"></a><!-- doxytag: member="linkhash.h::lh_ptr_equal" ref="a6ce3cb97560072c40f5caeaba85f756a" args="(const void *k1, const void *k2)" -->
  360. <div class="memitem">
  361. <div class="memproto">
  362. <table class="memname">
  363. <tr>
  364. <td class="memname">int lh_ptr_equal </td>
  365. <td>(</td>
  366. <td class="paramtype">const void *&nbsp;</td>
  367. <td class="paramname"> <em>k1</em>, </td>
  368. </tr>
  369. <tr>
  370. <td class="paramkey"></td>
  371. <td></td>
  372. <td class="paramtype">const void *&nbsp;</td>
  373. <td class="paramname"> <em>k2</em></td><td>&nbsp;</td>
  374. </tr>
  375. <tr>
  376. <td></td>
  377. <td>)</td>
  378. <td></td><td></td><td></td>
  379. </tr>
  380. </table>
  381. </div>
  382. <div class="memdoc">
  383. </div>
  384. </div>
  385. <a class="anchor" id="a2e560f0d3e5a20f6b0bfa4049737db23"></a><!-- doxytag: member="linkhash.h::lh_ptr_hash" ref="a2e560f0d3e5a20f6b0bfa4049737db23" args="(const void *k)" -->
  386. <div class="memitem">
  387. <div class="memproto">
  388. <table class="memname">
  389. <tr>
  390. <td class="memname">unsigned long lh_ptr_hash </td>
  391. <td>(</td>
  392. <td class="paramtype">const void *&nbsp;</td>
  393. <td class="paramname"> <em>k</em></td>
  394. <td>&nbsp;)&nbsp;</td>
  395. <td></td>
  396. </tr>
  397. </table>
  398. </div>
  399. <div class="memdoc">
  400. <p>Pre-defined hash and equality functions </p>
  401. </div>
  402. </div>
  403. <a class="anchor" id="a2fed2c78f70d229edb2d00775ffe593c"></a><!-- doxytag: member="linkhash.h::lh_table_delete" ref="a2fed2c78f70d229edb2d00775ffe593c" args="(struct lh_table *t, const void *k)" -->
  404. <div class="memitem">
  405. <div class="memproto">
  406. <table class="memname">
  407. <tr>
  408. <td class="memname">int lh_table_delete </td>
  409. <td>(</td>
  410. <td class="paramtype">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td>
  411. <td class="paramname"> <em>t</em>, </td>
  412. </tr>
  413. <tr>
  414. <td class="paramkey"></td>
  415. <td></td>
  416. <td class="paramtype">const void *&nbsp;</td>
  417. <td class="paramname"> <em>k</em></td><td>&nbsp;</td>
  418. </tr>
  419. <tr>
  420. <td></td>
  421. <td>)</td>
  422. <td></td><td></td><td></td>
  423. </tr>
  424. </table>
  425. </div>
  426. <div class="memdoc">
  427. <p>Delete a record from the table. If a callback free function is provided then it is called for the for the item being deleted. </p>
  428. <dl><dt><b>Parameters:</b></dt><dd>
  429. <table border="0" cellspacing="2" cellpadding="0">
  430. <tr><td valign="top"></td><td valign="top"><em>t</em>&nbsp;</td><td>the table to delete from. </td></tr>
  431. <tr><td valign="top"></td><td valign="top"><em>k</em>&nbsp;</td><td>a pointer to the key to delete. </td></tr>
  432. </table>
  433. </dd>
  434. </dl>
  435. <dl class="return"><dt><b>Returns:</b></dt><dd>0 if the item was deleted. </dd>
  436. <dd>
  437. -1 if it was not found. </dd></dl>
  438. </div>
  439. </div>
  440. <a class="anchor" id="ae5885a71c3457190fb1dc2d6e20dde3b"></a><!-- doxytag: member="linkhash.h::lh_table_delete_entry" ref="ae5885a71c3457190fb1dc2d6e20dde3b" args="(struct lh_table *t, struct lh_entry *e)" -->
  441. <div class="memitem">
  442. <div class="memproto">
  443. <table class="memname">
  444. <tr>
  445. <td class="memname">int lh_table_delete_entry </td>
  446. <td>(</td>
  447. <td class="paramtype">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td>
  448. <td class="paramname"> <em>t</em>, </td>
  449. </tr>
  450. <tr>
  451. <td class="paramkey"></td>
  452. <td></td>
  453. <td class="paramtype">struct <a class="el" href="structlh__entry.html">lh_entry</a> *&nbsp;</td>
  454. <td class="paramname"> <em>e</em></td><td>&nbsp;</td>
  455. </tr>
  456. <tr>
  457. <td></td>
  458. <td>)</td>
  459. <td></td><td></td><td></td>
  460. </tr>
  461. </table>
  462. </div>
  463. <div class="memdoc">
  464. <p>Delete a record from the table. If a callback free function is provided then it is called for the for the item being deleted. </p>
  465. <dl><dt><b>Parameters:</b></dt><dd>
  466. <table border="0" cellspacing="2" cellpadding="0">
  467. <tr><td valign="top"></td><td valign="top"><em>t</em>&nbsp;</td><td>the table to delete from. </td></tr>
  468. <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td>a pointer to the entry to delete. </td></tr>
  469. </table>
  470. </dd>
  471. </dl>
  472. <dl class="return"><dt><b>Returns:</b></dt><dd>0 if the item was deleted. </dd>
  473. <dd>
  474. -1 if it was not found. </dd></dl>
  475. </div>
  476. </div>
  477. <a class="anchor" id="a81653acf740cf8c9fe672e6cd16df0cf"></a><!-- doxytag: member="linkhash.h::lh_table_free" ref="a81653acf740cf8c9fe672e6cd16df0cf" args="(struct lh_table *t)" -->
  478. <div class="memitem">
  479. <div class="memproto">
  480. <table class="memname">
  481. <tr>
  482. <td class="memname">void lh_table_free </td>
  483. <td>(</td>
  484. <td class="paramtype">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td>
  485. <td class="paramname"> <em>t</em></td>
  486. <td>&nbsp;)&nbsp;</td>
  487. <td></td>
  488. </tr>
  489. </table>
  490. </div>
  491. <div class="memdoc">
  492. <p>Free a linkhash table. If a callback free function is provided then it is called for all entries in the table. </p>
  493. <dl><dt><b>Parameters:</b></dt><dd>
  494. <table border="0" cellspacing="2" cellpadding="0">
  495. <tr><td valign="top"></td><td valign="top"><em>t</em>&nbsp;</td><td>table to free. </td></tr>
  496. </table>
  497. </dd>
  498. </dl>
  499. </div>
  500. </div>
  501. <a class="anchor" id="a22b897763cc34a98c21c7fe82d151004"></a><!-- doxytag: member="linkhash.h::lh_table_insert" ref="a22b897763cc34a98c21c7fe82d151004" args="(struct lh_table *t, void *k, const void *v)" -->
  502. <div class="memitem">
  503. <div class="memproto">
  504. <table class="memname">
  505. <tr>
  506. <td class="memname">int lh_table_insert </td>
  507. <td>(</td>
  508. <td class="paramtype">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td>
  509. <td class="paramname"> <em>t</em>, </td>
  510. </tr>
  511. <tr>
  512. <td class="paramkey"></td>
  513. <td></td>
  514. <td class="paramtype">void *&nbsp;</td>
  515. <td class="paramname"> <em>k</em>, </td>
  516. </tr>
  517. <tr>
  518. <td class="paramkey"></td>
  519. <td></td>
  520. <td class="paramtype">const void *&nbsp;</td>
  521. <td class="paramname"> <em>v</em></td><td>&nbsp;</td>
  522. </tr>
  523. <tr>
  524. <td></td>
  525. <td>)</td>
  526. <td></td><td></td><td></td>
  527. </tr>
  528. </table>
  529. </div>
  530. <div class="memdoc">
  531. <p>Insert a record into the table. </p>
  532. <dl><dt><b>Parameters:</b></dt><dd>
  533. <table border="0" cellspacing="2" cellpadding="0">
  534. <tr><td valign="top"></td><td valign="top"><em>t</em>&nbsp;</td><td>the table to insert into. </td></tr>
  535. <tr><td valign="top"></td><td valign="top"><em>k</em>&nbsp;</td><td>a pointer to the key to insert. </td></tr>
  536. <tr><td valign="top"></td><td valign="top"><em>v</em>&nbsp;</td><td>a pointer to the value to insert. </td></tr>
  537. </table>
  538. </dd>
  539. </dl>
  540. </div>
  541. </div>
  542. <a class="anchor" id="a49c27f18a174eaf126d1b7953df13cb1"></a><!-- doxytag: member="linkhash.h::lh_table_lookup" ref="a49c27f18a174eaf126d1b7953df13cb1" args="(struct lh_table *t, const void *k)" -->
  543. <div class="memitem">
  544. <div class="memproto">
  545. <table class="memname">
  546. <tr>
  547. <td class="memname">const void* lh_table_lookup </td>
  548. <td>(</td>
  549. <td class="paramtype">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td>
  550. <td class="paramname"> <em>t</em>, </td>
  551. </tr>
  552. <tr>
  553. <td class="paramkey"></td>
  554. <td></td>
  555. <td class="paramtype">const void *&nbsp;</td>
  556. <td class="paramname"> <em>k</em></td><td>&nbsp;</td>
  557. </tr>
  558. <tr>
  559. <td></td>
  560. <td>)</td>
  561. <td></td><td></td><td></td>
  562. </tr>
  563. </table>
  564. </div>
  565. <div class="memdoc">
  566. <p>Lookup a record into the table </p>
  567. <dl><dt><b>Parameters:</b></dt><dd>
  568. <table border="0" cellspacing="2" cellpadding="0">
  569. <tr><td valign="top"></td><td valign="top"><em>t</em>&nbsp;</td><td>the table to lookup </td></tr>
  570. <tr><td valign="top"></td><td valign="top"><em>k</em>&nbsp;</td><td>a pointer to the key to lookup </td></tr>
  571. </table>
  572. </dd>
  573. </dl>
  574. <dl class="return"><dt><b>Returns:</b></dt><dd>a pointer to the found value or NULL if it does not exist. </dd></dl>
  575. <dl class="deprecated"><dt><b><a class="el" href="deprecated.html#_deprecated000002">Deprecated:</a></b></dt><dd>Use lh_table_lookup_ex instead. </dd></dl>
  576. </div>
  577. </div>
  578. <a class="anchor" id="ad3b6ca2d967a6c3021ee6c39e014a918"></a><!-- doxytag: member="linkhash.h::lh_table_lookup_entry" ref="ad3b6ca2d967a6c3021ee6c39e014a918" args="(struct lh_table *t, const void *k)" -->
  579. <div class="memitem">
  580. <div class="memproto">
  581. <table class="memname">
  582. <tr>
  583. <td class="memname">struct <a class="el" href="structlh__entry.html">lh_entry</a>* lh_table_lookup_entry </td>
  584. <td>(</td>
  585. <td class="paramtype">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td>
  586. <td class="paramname"> <em>t</em>, </td>
  587. </tr>
  588. <tr>
  589. <td class="paramkey"></td>
  590. <td></td>
  591. <td class="paramtype">const void *&nbsp;</td>
  592. <td class="paramname"> <em>k</em></td><td>&nbsp;</td>
  593. </tr>
  594. <tr>
  595. <td></td>
  596. <td>)</td>
  597. <td></td><td></td><td><code> [read]</code></td>
  598. </tr>
  599. </table>
  600. </div>
  601. <div class="memdoc">
  602. <p>Lookup a record into the table. </p>
  603. <dl><dt><b>Parameters:</b></dt><dd>
  604. <table border="0" cellspacing="2" cellpadding="0">
  605. <tr><td valign="top"></td><td valign="top"><em>t</em>&nbsp;</td><td>the table to lookup </td></tr>
  606. <tr><td valign="top"></td><td valign="top"><em>k</em>&nbsp;</td><td>a pointer to the key to lookup </td></tr>
  607. </table>
  608. </dd>
  609. </dl>
  610. <dl class="return"><dt><b>Returns:</b></dt><dd>a pointer to the record structure of the value or NULL if it does not exist. </dd></dl>
  611. </div>
  612. </div>
  613. <a class="anchor" id="a81c270bb0dd9d5c8a3e7ae20bc4d67f3"></a><!-- doxytag: member="linkhash.h::lh_table_lookup_ex" ref="a81c270bb0dd9d5c8a3e7ae20bc4d67f3" args="(struct lh_table *t, const void *k, void **v)" -->
  614. <div class="memitem">
  615. <div class="memproto">
  616. <table class="memname">
  617. <tr>
  618. <td class="memname"><a class="el" href="json__object_8h.html#a81f02022906fafc71eb9197049f07f73">json_bool</a> lh_table_lookup_ex </td>
  619. <td>(</td>
  620. <td class="paramtype">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td>
  621. <td class="paramname"> <em>t</em>, </td>
  622. </tr>
  623. <tr>
  624. <td class="paramkey"></td>
  625. <td></td>
  626. <td class="paramtype">const void *&nbsp;</td>
  627. <td class="paramname"> <em>k</em>, </td>
  628. </tr>
  629. <tr>
  630. <td class="paramkey"></td>
  631. <td></td>
  632. <td class="paramtype">void **&nbsp;</td>
  633. <td class="paramname"> <em>v</em></td><td>&nbsp;</td>
  634. </tr>
  635. <tr>
  636. <td></td>
  637. <td>)</td>
  638. <td></td><td></td><td></td>
  639. </tr>
  640. </table>
  641. </div>
  642. <div class="memdoc">
  643. <p>Lookup a record in the table </p>
  644. <dl><dt><b>Parameters:</b></dt><dd>
  645. <table border="0" cellspacing="2" cellpadding="0">
  646. <tr><td valign="top"></td><td valign="top"><em>t</em>&nbsp;</td><td>the table to lookup </td></tr>
  647. <tr><td valign="top"></td><td valign="top"><em>k</em>&nbsp;</td><td>a pointer to the key to lookup </td></tr>
  648. <tr><td valign="top"></td><td valign="top"><em>v</em>&nbsp;</td><td>a pointer to a where to store the found value (set to NULL if it doesn't exist). </td></tr>
  649. </table>
  650. </dd>
  651. </dl>
  652. <dl class="return"><dt><b>Returns:</b></dt><dd>whether or not the key was found </dd></dl>
  653. </div>
  654. </div>
  655. <a class="anchor" id="ac3ba464ac43c083397b1f1d34f2ddf55"></a><!-- doxytag: member="linkhash.h::lh_table_new" ref="ac3ba464ac43c083397b1f1d34f2ddf55" args="(int size, const char *name, lh_entry_free_fn *free_fn, lh_hash_fn *hash_fn, lh_equal_fn *equal_fn)" -->
  656. <div class="memitem">
  657. <div class="memproto">
  658. <table class="memname">
  659. <tr>
  660. <td class="memname">struct <a class="el" href="structlh__table.html">lh_table</a>* lh_table_new </td>
  661. <td>(</td>
  662. <td class="paramtype">int&nbsp;</td>
  663. <td class="paramname"> <em>size</em>, </td>
  664. </tr>
  665. <tr>
  666. <td class="paramkey"></td>
  667. <td></td>
  668. <td class="paramtype">const char *&nbsp;</td>
  669. <td class="paramname"> <em>name</em>, </td>
  670. </tr>
  671. <tr>
  672. <td class="paramkey"></td>
  673. <td></td>
  674. <td class="paramtype"><a class="el" href="linkhash_8h.html#a671553d0ee3c2a123190ba0f8ed2b635">lh_entry_free_fn</a> *&nbsp;</td>
  675. <td class="paramname"> <em>free_fn</em>, </td>
  676. </tr>
  677. <tr>
  678. <td class="paramkey"></td>
  679. <td></td>
  680. <td class="paramtype"><a class="el" href="linkhash_8h.html#a38bae27995dcfb6ee3fb109a9be229b2">lh_hash_fn</a> *&nbsp;</td>
  681. <td class="paramname"> <em>hash_fn</em>, </td>
  682. </tr>
  683. <tr>
  684. <td class="paramkey"></td>
  685. <td></td>
  686. <td class="paramtype"><a class="el" href="linkhash_8h.html#a91fd85fc81b0c7c83c62f00e84729091">lh_equal_fn</a> *&nbsp;</td>
  687. <td class="paramname"> <em>equal_fn</em></td><td>&nbsp;</td>
  688. </tr>
  689. <tr>
  690. <td></td>
  691. <td>)</td>
  692. <td></td><td></td><td><code> [read]</code></td>
  693. </tr>
  694. </table>
  695. </div>
  696. <div class="memdoc">
  697. <p>Create a new linkhash table. </p>
  698. <dl><dt><b>Parameters:</b></dt><dd>
  699. <table border="0" cellspacing="2" cellpadding="0">
  700. <tr><td valign="top"></td><td valign="top"><em>size</em>&nbsp;</td><td>initial table size. The table is automatically resized although this incurs a performance penalty. </td></tr>
  701. <tr><td valign="top"></td><td valign="top"><em>name</em>&nbsp;</td><td>the table name. </td></tr>
  702. <tr><td valign="top"></td><td valign="top"><em>free_fn</em>&nbsp;</td><td>callback function used to free memory for entries when lh_table_free or lh_table_delete is called. If NULL is provided, then memory for keys and values must be freed by the caller. </td></tr>
  703. <tr><td valign="top"></td><td valign="top"><em>hash_fn</em>&nbsp;</td><td>function used to hash keys. 2 standard ones are defined: lh_ptr_hash and lh_char_hash for hashing pointer values and C strings respectively. </td></tr>
  704. <tr><td valign="top"></td><td valign="top"><em>equal_fn</em>&nbsp;</td><td>comparison function to compare keys. 2 standard ones defined: lh_ptr_hash and lh_char_hash for comparing pointer values and C strings respectively. </td></tr>
  705. </table>
  706. </dd>
  707. </dl>
  708. <dl class="return"><dt><b>Returns:</b></dt><dd>a pointer onto the linkhash table. </dd></dl>
  709. </div>
  710. </div>
  711. <a class="anchor" id="a5322eccf3394af7dc1ebb22af8f8c562"></a><!-- doxytag: member="linkhash.h::lh_table_resize" ref="a5322eccf3394af7dc1ebb22af8f8c562" args="(struct lh_table *t, int new_size)" -->
  712. <div class="memitem">
  713. <div class="memproto">
  714. <table class="memname">
  715. <tr>
  716. <td class="memname">void lh_table_resize </td>
  717. <td>(</td>
  718. <td class="paramtype">struct <a class="el" href="structlh__table.html">lh_table</a> *&nbsp;</td>
  719. <td class="paramname"> <em>t</em>, </td>
  720. </tr>
  721. <tr>
  722. <td class="paramkey"></td>
  723. <td></td>
  724. <td class="paramtype">int&nbsp;</td>
  725. <td class="paramname"> <em>new_size</em></td><td>&nbsp;</td>
  726. </tr>
  727. <tr>
  728. <td></td>
  729. <td>)</td>
  730. <td></td><td></td><td></td>
  731. </tr>
  732. </table>
  733. </div>
  734. <div class="memdoc">
  735. </div>
  736. </div>
  737. </div>
  738. <hr class="footer"/><address style="text-align: right;"><small>Generated on Sat Apr 28 15:52:47 2012 for json-c by&nbsp;
  739. <a href="http://www.doxygen.org/index.html">
  740. <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address>
  741. </body>
  742. </html>

No Description

Contributors (1)