| 1 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> |
| 2 |
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"> |
| 3 |
<title>DatabasePrimitivesLibrary: dbprim.h File Reference</title> |
| 4 |
<link href="doxygen.css" rel="stylesheet" type="text/css"> |
| 5 |
</head><body> |
| 6 |
<!-- Generated by Doxygen 1.4.4 --> |
| 7 |
<div class="qindex"><a class="qindex" href="index.html">Main Page</a> | <a class="qindex" href="modules.html">Modules</a> | <a class="qindex" href="classes.html">Alphabetical List</a> | <a class="qindex" href="annotated.html">Data Structures</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="functions.html">Data Fields</a> | <a class="qindex" href="globals.html">Globals</a></div> |
| 8 |
<h1>dbprim.h File Reference</h1><hr><a name="_details"></a><h2>Detailed Description</h2> |
| 9 |
This header file contains the necessary structures, #define's, and function declarations to make use of the Database Primitives library. |
| 10 |
<p> |
| 11 |
Definition in file <a class="el" href="dbprim_8h-source.html">dbprim.h</a>. |
| 12 |
<p> |
| 13 |
<code>#include <dbprim/dbprim_err.h></code><br> |
| 14 |
<code>#include <dbprim/dbprim_version.h></code><br> |
| 15 |
|
| 16 |
<p> |
| 17 |
Include dependency graph for dbprim.h:<p><center><img src="dbprim_8h__incl.png" border="0" usemap="#dbprim.h_map" alt=""></center> |
| 18 |
|
| 19 |
<p> |
| 20 |
This graph shows which files directly or indirectly include this file:<p><center><img src="dbprim_8h__dep__incl.png" border="0" usemap="#dbprim.hdep_map" alt=""></center> |
| 21 |
<map name="dbprim.hdep_map"> |
| 22 |
<area href="__hash__prime_8c.html" shape="rect" coords="131,6,240,30" alt=""> |
| 23 |
<area href="__rb__locate_8c.html" shape="rect" coords="137,54,233,78" alt=""> |
| 24 |
<area href="__rb__rotate_8c.html" shape="rect" coords="139,102,232,126" alt=""> |
| 25 |
<area href="__smat__resize_8c.html" shape="rect" coords="129,150,241,174" alt=""> |
| 26 |
<area href="hash__comp_8c.html" shape="rect" coords="135,198,236,222" alt=""> |
| 27 |
<area href="hash__fnv1_8c.html" shape="rect" coords="139,246,232,270" alt=""> |
| 28 |
<area href="hash__fnv1a_8c.html" shape="rect" coords="135,294,236,318" alt=""> |
| 29 |
<area href="he__init_8c.html" shape="rect" coords="149,342,221,366" alt=""> |
| 30 |
<area href="ht__add_8c.html" shape="rect" coords="149,390,221,414" alt=""> |
| 31 |
<area href="ht__find_8c.html" shape="rect" coords="149,438,221,462" alt=""> |
| 32 |
<area href="ht__flush_8c.html" shape="rect" coords="145,486,225,510" alt=""> |
| 33 |
<area href="ht__free_8c.html" shape="rect" coords="148,534,223,558" alt=""> |
| 34 |
<area href="ht__init_8c.html" shape="rect" coords="152,582,219,606" alt=""> |
| 35 |
<area href="ht__iter_8c.html" shape="rect" coords="152,630,219,654" alt=""> |
| 36 |
<area href="ht__move_8c.html" shape="rect" coords="144,678,227,702" alt=""> |
| 37 |
<area href="ht__remove_8c.html" shape="rect" coords="139,726,232,750" alt=""> |
| 38 |
<area href="ht__resize_8c.html" shape="rect" coords="143,774,228,798" alt=""> |
| 39 |
<area href="le__init_8c.html" shape="rect" coords="152,822,219,846" alt=""> |
| 40 |
<area href="ll__add_8c.html" shape="rect" coords="152,870,219,894" alt=""> |
| 41 |
<area href="ll__find_8c.html" shape="rect" coords="152,918,219,942" alt=""> |
| 42 |
<area href="ll__flush_8c.html" shape="rect" coords="148,966,223,990" alt=""> |
| 43 |
<area href="ll__init_8c.html" shape="rect" coords="155,1014,216,1038" alt=""> |
| 44 |
<area href="ll__iter_8c.html" shape="rect" coords="155,1062,216,1086" alt=""> |
| 45 |
<area href="ll__move_8c.html" shape="rect" coords="147,1110,224,1134" alt=""> |
| 46 |
<area href="ll__remove_8c.html" shape="rect" coords="141,1158,229,1182" alt=""> |
| 47 |
<area href="rbtree__comp_8c.html" shape="rect" coords="132,1206,239,1230" alt=""> |
| 48 |
<area href="rn__init_8c.html" shape="rect" coords="151,1254,220,1278" alt=""> |
| 49 |
<area href="rt__add_8c.html" shape="rect" coords="151,1302,220,1326" alt=""> |
| 50 |
<area href="rt__find_8c.html" shape="rect" coords="151,1350,220,1374" alt=""> |
| 51 |
<area href="rt__flush_8c.html" shape="rect" coords="147,1398,224,1422" alt=""> |
| 52 |
<area href="rt__init_8c.html" shape="rect" coords="153,1446,217,1470" alt=""> |
| 53 |
<area href="rt__iter_8c.html" shape="rect" coords="152,1494,219,1518" alt=""> |
| 54 |
<area href="rt__move_8c.html" shape="rect" coords="145,1542,225,1566" alt=""> |
| 55 |
<area href="rt__next_8c.html" shape="rect" coords="149,1590,221,1614" alt=""> |
| 56 |
<area href="rt__remove_8c.html" shape="rect" coords="140,1638,231,1662" alt=""> |
| 57 |
<area href="sh__find_8c.html" shape="rect" coords="148,1686,223,1710" alt=""> |
| 58 |
<area href="sh__flush_8c.html" shape="rect" coords="144,1734,227,1758" alt=""> |
| 59 |
<area href="sh__init_8c.html" shape="rect" coords="151,1782,220,1806" alt=""> |
| 60 |
<area href="sh__iter_8c.html" shape="rect" coords="149,1830,221,1854" alt=""> |
| 61 |
<area href="sh__move_8c.html" shape="rect" coords="143,1878,228,1902" alt=""> |
| 62 |
<area href="smat__freelist_8c.html" shape="rect" coords="132,1926,239,1950" alt=""> |
| 63 |
<area href="st__add_8c.html" shape="rect" coords="149,1974,221,1998" alt=""> |
| 64 |
<area href="st__find_8c.html" shape="rect" coords="149,2022,221,2046" alt=""> |
| 65 |
<area href="st__flush_8c.html" shape="rect" coords="147,2070,224,2094" alt=""> |
| 66 |
<area href="st__free_8c.html" shape="rect" coords="149,2118,221,2142" alt=""> |
| 67 |
<area href="st__init_8c.html" shape="rect" coords="152,2166,219,2190" alt=""> |
| 68 |
<area href="st__iter_8c.html" shape="rect" coords="152,2214,219,2238" alt=""> |
| 69 |
<area href="st__remove_8c.html" shape="rect" coords="139,2262,232,2286" alt=""> |
| 70 |
<area href="st__resize_8c.html" shape="rect" coords="143,2310,228,2334" alt=""> |
| 71 |
</map> |
| 72 |
|
| 73 |
<p> |
| 74 |
<a href="dbprim_8h-source.html">Go to the source code of this file.</a><table border="0" cellpadding="0" cellspacing="0"> |
| 75 |
<tr><td></td></tr> |
| 76 |
<tr><td colspan="2"><br><h2>Data Structures</h2></td></tr> |
| 77 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__db__key__s.html">_db_key_s</a></td></tr> |
| 78 |
|
| 79 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Database key structure. <a href="struct__db__key__s.html#_details">More...</a><br></td></tr> |
| 80 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__link__head__s.html">_link_head_s</a></td></tr> |
| 81 |
|
| 82 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list head structure. <a href="struct__link__head__s.html#_details">More...</a><br></td></tr> |
| 83 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__link__elem__s.html">_link_elem_s</a></td></tr> |
| 84 |
|
| 85 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element structure. <a href="struct__link__elem__s.html#_details">More...</a><br></td></tr> |
| 86 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__hash__table__s.html">_hash_table_s</a></td></tr> |
| 87 |
|
| 88 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table structure. <a href="struct__hash__table__s.html#_details">More...</a><br></td></tr> |
| 89 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__hash__entry__s.html">_hash_entry_s</a></td></tr> |
| 90 |
|
| 91 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry structure. <a href="struct__hash__entry__s.html#_details">More...</a><br></td></tr> |
| 92 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__smat__table__s.html">_smat_table_s</a></td></tr> |
| 93 |
|
| 94 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table structure. <a href="struct__smat__table__s.html#_details">More...</a><br></td></tr> |
| 95 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__smat__head__s.html">_smat_head_s</a></td></tr> |
| 96 |
|
| 97 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list head structure. <a href="struct__smat__head__s.html#_details">More...</a><br></td></tr> |
| 98 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__smat__entry__s.html">_smat_entry_s</a></td></tr> |
| 99 |
|
| 100 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix entry structure. <a href="struct__smat__entry__s.html#_details">More...</a><br></td></tr> |
| 101 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__rb__tree__s.html">_rb_tree_s</a></td></tr> |
| 102 |
|
| 103 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree structure. <a href="struct__rb__tree__s.html#_details">More...</a><br></td></tr> |
| 104 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="struct__rb__node__s.html">_rb_node_s</a></td></tr> |
| 105 |
|
| 106 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node structure. <a href="struct__rb__node__s.html#_details">More...</a><br></td></tr> |
| 107 |
<tr><td colspan="2"><br><h2>Defines</h2></td></tr> |
| 108 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="dbprim_8h.html#a0">DBPRIM_BEGIN_C_DECLS</a></td></tr> |
| 109 |
|
| 110 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Begin declaration in C namespace. <a href="#a0"></a><br></td></tr> |
| 111 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="dbprim_8h.html#a1">DBPRIM_END_C_DECLS</a></td></tr> |
| 112 |
|
| 113 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">End declaration in C namespace. <a href="#a1"></a><br></td></tr> |
| 114 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim.html#ga1">DB_KEY_INIT</a>(key, size)</td></tr> |
| 115 |
|
| 116 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Database key static initializer. <a href="group__dbprim.html#ga1"></a><br></td></tr> |
| 117 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim.html#ga2">dk_key</a>(key)</td></tr> |
| 118 |
|
| 119 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Database key accessor macro. <a href="group__dbprim.html#ga2"></a><br></td></tr> |
| 120 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim.html#ga3">dk_len</a>(key)</td></tr> |
| 121 |
|
| 122 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Database key length accessor macro. <a href="group__dbprim.html#ga3"></a><br></td></tr> |
| 123 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim.html#ga4">DB_FLAG_REVERSE</a></td></tr> |
| 124 |
|
| 125 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Reverse flag. <a href="group__dbprim.html#ga4"></a><br></td></tr> |
| 126 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga13">LINK_HEAD_MAGIC</a></td></tr> |
| 127 |
|
| 128 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list head magic number. <a href="group__dbprim__link.html#ga13"></a><br></td></tr> |
| 129 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga14">LINK_HEAD_INIT</a>(extra)</td></tr> |
| 130 |
|
| 131 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list head static initializer. <a href="group__dbprim__link.html#ga14"></a><br></td></tr> |
| 132 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga15">ll_verify</a>(list)</td></tr> |
| 133 |
|
| 134 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list head verification macro. <a href="group__dbprim__link.html#ga15"></a><br></td></tr> |
| 135 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga16">ll_count</a>(list)</td></tr> |
| 136 |
|
| 137 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list count. <a href="group__dbprim__link.html#ga16"></a><br></td></tr> |
| 138 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga17">ll_first</a>(list)</td></tr> |
| 139 |
|
| 140 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">First element in linked list. <a href="group__dbprim__link.html#ga17"></a><br></td></tr> |
| 141 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga18">ll_last</a>(list)</td></tr> |
| 142 |
|
| 143 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Last element in a linked list. <a href="group__dbprim__link.html#ga18"></a><br></td></tr> |
| 144 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga19">ll_extra</a>(list)</td></tr> |
| 145 |
|
| 146 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Extra pointer data in a linked list. <a href="group__dbprim__link.html#ga19"></a><br></td></tr> |
| 147 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga20">LINK_ELEM_MAGIC</a></td></tr> |
| 148 |
|
| 149 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element magic number. <a href="group__dbprim__link.html#ga20"></a><br></td></tr> |
| 150 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga21">LINK_ELEM_INIT</a>(obj)</td></tr> |
| 151 |
|
| 152 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element static initializer. <a href="group__dbprim__link.html#ga21"></a><br></td></tr> |
| 153 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga22">le_verify</a>(element)</td></tr> |
| 154 |
|
| 155 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element verification macro. <a href="group__dbprim__link.html#ga22"></a><br></td></tr> |
| 156 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga23">le_next</a>(elem)</td></tr> |
| 157 |
|
| 158 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element next pointer. <a href="group__dbprim__link.html#ga23"></a><br></td></tr> |
| 159 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga24">le_prev</a>(elem)</td></tr> |
| 160 |
|
| 161 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element previous pointer. <a href="group__dbprim__link.html#ga24"></a><br></td></tr> |
| 162 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga25">le_object</a>(elem)</td></tr> |
| 163 |
|
| 164 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element object pointer. <a href="group__dbprim__link.html#ga25"></a><br></td></tr> |
| 165 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga26">le_head</a>(elem)</td></tr> |
| 166 |
|
| 167 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element head pointer. <a href="group__dbprim__link.html#ga26"></a><br></td></tr> |
| 168 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga27">le_flags</a>(elem)</td></tr> |
| 169 |
|
| 170 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element flags. <a href="group__dbprim__link.html#ga27"></a><br></td></tr> |
| 171 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga22">HASH_TABLE_MAGIC</a></td></tr> |
| 172 |
|
| 173 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table magic number. <a href="group__dbprim__hash.html#ga22"></a><br></td></tr> |
| 174 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga23">HASH_FLAG_AUTOGROW</a></td></tr> |
| 175 |
|
| 176 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flag permitting a hash table to automatically grow. <a href="group__dbprim__hash.html#ga23"></a><br></td></tr> |
| 177 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga24">HASH_FLAG_AUTOSHRINK</a></td></tr> |
| 178 |
|
| 179 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flag permitting a hash table to automatically shrink. <a href="group__dbprim__hash.html#ga24"></a><br></td></tr> |
| 180 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga25">HASH_FLAG_MASK</a></td></tr> |
| 181 |
|
| 182 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table flags that may be set by the user. <a href="group__dbprim__hash.html#ga25"></a><br></td></tr> |
| 183 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="dbprim_8h.html#a25">HASH_FLAG_FREEZE</a></td></tr> |
| 184 |
|
| 185 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flag indicating hash table is frozen. <a href="#a25"></a><br></td></tr> |
| 186 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga26">HASH_TABLE_INIT</a>(flags, func, comp, resize, extra)</td></tr> |
| 187 |
|
| 188 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table static initializer. <a href="group__dbprim__hash.html#ga26"></a><br></td></tr> |
| 189 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga27">ht_verify</a>(table)</td></tr> |
| 190 |
|
| 191 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table verification macro. <a href="group__dbprim__hash.html#ga27"></a><br></td></tr> |
| 192 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga28">ht_flags</a>(table)</td></tr> |
| 193 |
|
| 194 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table flags. <a href="group__dbprim__hash.html#ga28"></a><br></td></tr> |
| 195 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga29">ht_frozen</a>(table)</td></tr> |
| 196 |
|
| 197 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine if a hash table is frozen. <a href="group__dbprim__hash.html#ga29"></a><br></td></tr> |
| 198 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga30">ht_modulus</a>(table)</td></tr> |
| 199 |
|
| 200 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table modulus. <a href="group__dbprim__hash.html#ga30"></a><br></td></tr> |
| 201 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga31">ht_count</a>(table)</td></tr> |
| 202 |
|
| 203 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table count. <a href="group__dbprim__hash.html#ga31"></a><br></td></tr> |
| 204 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga32">ht_func</a>(table)</td></tr> |
| 205 |
|
| 206 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table hash function. <a href="group__dbprim__hash.html#ga32"></a><br></td></tr> |
| 207 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga33">ht_comp</a>(table)</td></tr> |
| 208 |
|
| 209 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table comparison function. <a href="group__dbprim__hash.html#ga33"></a><br></td></tr> |
| 210 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga34">ht_rsize</a>(table)</td></tr> |
| 211 |
|
| 212 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table resize callback function. <a href="group__dbprim__hash.html#ga34"></a><br></td></tr> |
| 213 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga35">ht_extra</a>(table)</td></tr> |
| 214 |
|
| 215 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Extra pointer data in a hash table. <a href="group__dbprim__hash.html#ga35"></a><br></td></tr> |
| 216 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga36">ht_size</a>(table)</td></tr> |
| 217 |
|
| 218 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table memory size. <a href="group__dbprim__hash.html#ga36"></a><br></td></tr> |
| 219 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga37">HASH_ENTRY_MAGIC</a></td></tr> |
| 220 |
|
| 221 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry magic number. <a href="group__dbprim__hash.html#ga37"></a><br></td></tr> |
| 222 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga38">HASH_ENTRY_INIT</a>(value)</td></tr> |
| 223 |
|
| 224 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry static initializer. <a href="group__dbprim__hash.html#ga38"></a><br></td></tr> |
| 225 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga39">he_verify</a>(entry)</td></tr> |
| 226 |
|
| 227 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry verification macro. <a href="group__dbprim__hash.html#ga39"></a><br></td></tr> |
| 228 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga40">he_link</a>(entry)</td></tr> |
| 229 |
|
| 230 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry linked list element. <a href="group__dbprim__hash.html#ga40"></a><br></td></tr> |
| 231 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga41">he_flags</a>(entry)</td></tr> |
| 232 |
|
| 233 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry flags. <a href="group__dbprim__hash.html#ga41"></a><br></td></tr> |
| 234 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga42">he_table</a>(entry)</td></tr> |
| 235 |
|
| 236 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry table pointer. <a href="group__dbprim__hash.html#ga42"></a><br></td></tr> |
| 237 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga43">he_hash</a>(entry)</td></tr> |
| 238 |
|
| 239 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry hash value. <a href="group__dbprim__hash.html#ga43"></a><br></td></tr> |
| 240 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga44">he_key</a>(entry)</td></tr> |
| 241 |
|
| 242 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry key pointer. <a href="group__dbprim__hash.html#ga44"></a><br></td></tr> |
| 243 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga45">he_value</a>(entry)</td></tr> |
| 244 |
|
| 245 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry value pointer. <a href="group__dbprim__hash.html#ga45"></a><br></td></tr> |
| 246 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga32">_smat_ent</a>(ent)</td></tr> |
| 247 |
|
| 248 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Retrieve pointer to sparse matrix entry. <a href="group__dbprim__smat.html#ga32"></a><br></td></tr> |
| 249 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga33">SMAT_TABLE_MAGIC</a></td></tr> |
| 250 |
|
| 251 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table magic number. <a href="group__dbprim__smat.html#ga33"></a><br></td></tr> |
| 252 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga34">st_verify</a>(table)</td></tr> |
| 253 |
|
| 254 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table verification macro. <a href="group__dbprim__smat.html#ga34"></a><br></td></tr> |
| 255 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga35">st_flags</a>(table)</td></tr> |
| 256 |
|
| 257 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table flags. <a href="group__dbprim__smat.html#ga35"></a><br></td></tr> |
| 258 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga36">st_frozen</a>(table)</td></tr> |
| 259 |
|
| 260 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine if a sparse matrix is frozen. <a href="group__dbprim__smat.html#ga36"></a><br></td></tr> |
| 261 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga37">st_modulus</a>(table)</td></tr> |
| 262 |
|
| 263 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table modulus. <a href="group__dbprim__smat.html#ga37"></a><br></td></tr> |
| 264 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga38">st_count</a>(table)</td></tr> |
| 265 |
|
| 266 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table count. <a href="group__dbprim__smat.html#ga38"></a><br></td></tr> |
| 267 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga46">st_rsize</a>(table)</td></tr> |
| 268 |
|
| 269 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table resize callback function. <a href="group__dbprim__hash.html#ga46"></a><br></td></tr> |
| 270 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga39">st_extra</a>(table)</td></tr> |
| 271 |
|
| 272 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Extra pointer data in a sparse matrix table. <a href="group__dbprim__smat.html#ga39"></a><br></td></tr> |
| 273 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga40">st_size</a>(table)</td></tr> |
| 274 |
|
| 275 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table memory size. <a href="group__dbprim__smat.html#ga40"></a><br></td></tr> |
| 276 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga41">SMAT_HEAD_MAGIC</a></td></tr> |
| 277 |
|
| 278 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list head magic number. <a href="group__dbprim__smat.html#ga41"></a><br></td></tr> |
| 279 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga42">SMAT_HEAD_INIT</a>(elem, object)</td></tr> |
| 280 |
|
| 281 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list head static initializer. <a href="group__dbprim__smat.html#ga42"></a><br></td></tr> |
| 282 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga43">sh_verify</a>(head)</td></tr> |
| 283 |
|
| 284 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list head verification macro. <a href="group__dbprim__smat.html#ga43"></a><br></td></tr> |
| 285 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga44">sh_elem</a>(head)</td></tr> |
| 286 |
|
| 287 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list head element macro. <a href="group__dbprim__smat.html#ga44"></a><br></td></tr> |
| 288 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga45">sh_table</a>(head)</td></tr> |
| 289 |
|
| 290 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list head table pointer. <a href="group__dbprim__smat.html#ga45"></a><br></td></tr> |
| 291 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga46">sh_frozen</a>(head)</td></tr> |
| 292 |
|
| 293 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine if a sparse matrix is frozen. <a href="group__dbprim__smat.html#ga46"></a><br></td></tr> |
| 294 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga47">sh_count</a>(head)</td></tr> |
| 295 |
|
| 296 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list count. <a href="group__dbprim__smat.html#ga47"></a><br></td></tr> |
| 297 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga48">_sh_first</a>(head)</td></tr> |
| 298 |
|
| 299 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Access the first element pointer in a <a class="el" href="group__dbprim__smat.html#ga1">smat_head_t</a>. <a href="group__dbprim__smat.html#ga48"></a><br></td></tr> |
| 300 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga49">sh_first</a>(head)</td></tr> |
| 301 |
|
| 302 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">First element in sparse matrix list. <a href="group__dbprim__smat.html#ga49"></a><br></td></tr> |
| 303 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga50">_sh_last</a>(head)</td></tr> |
| 304 |
|
| 305 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Access the last element pointer in a <a class="el" href="group__dbprim__smat.html#ga1">smat_head_t</a>. <a href="group__dbprim__smat.html#ga50"></a><br></td></tr> |
| 306 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga51">sh_last</a>(head)</td></tr> |
| 307 |
|
| 308 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Last element in sparse matrix list. <a href="group__dbprim__smat.html#ga51"></a><br></td></tr> |
| 309 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga52">sh_object</a>(head)</td></tr> |
| 310 |
|
| 311 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Object represented by a sparse matrix list head. <a href="group__dbprim__smat.html#ga52"></a><br></td></tr> |
| 312 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga53">sh_size</a>(head)</td></tr> |
| 313 |
|
| 314 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list memory size. <a href="group__dbprim__smat.html#ga53"></a><br></td></tr> |
| 315 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga54">SMAT_ENTRY_MAGIC</a></td></tr> |
| 316 |
|
| 317 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix entry magic number. <a href="group__dbprim__smat.html#ga54"></a><br></td></tr> |
| 318 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga55">se_verify</a>(entry)</td></tr> |
| 319 |
|
| 320 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix entry verification macro. <a href="group__dbprim__smat.html#ga55"></a><br></td></tr> |
| 321 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga56">se_table</a>(entry)</td></tr> |
| 322 |
|
| 323 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix entry table. <a href="group__dbprim__smat.html#ga56"></a><br></td></tr> |
| 324 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga57">_se_link</a>(entry)</td></tr> |
| 325 |
|
| 326 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix entry linked list element. <a href="group__dbprim__smat.html#ga57"></a><br></td></tr> |
| 327 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga58">se_flags</a>(entry)</td></tr> |
| 328 |
|
| 329 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix entry flags. <a href="group__dbprim__smat.html#ga58"></a><br></td></tr> |
| 330 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga59">se_hash</a>(entry)</td></tr> |
| 331 |
|
| 332 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table entry hash value. <a href="group__dbprim__smat.html#ga59"></a><br></td></tr> |
| 333 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga60">_se_next</a>(entry, n)</td></tr> |
| 334 |
|
| 335 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Access the next element pointer in a <a class="el" href="group__dbprim__smat.html#ga2">smat_entry_t</a>. <a href="group__dbprim__smat.html#ga60"></a><br></td></tr> |
| 336 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga61">se_next</a>(entry, n)</td></tr> |
| 337 |
|
| 338 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Next element in sparse matrix list. <a href="group__dbprim__smat.html#ga61"></a><br></td></tr> |
| 339 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga62">_se_prev</a>(entry, n)</td></tr> |
| 340 |
|
| 341 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Access the previous element pointer in a <a class="el" href="group__dbprim__smat.html#ga2">smat_entry_t</a>. <a href="group__dbprim__smat.html#ga62"></a><br></td></tr> |
| 342 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga63">se_prev</a>(entry, n)</td></tr> |
| 343 |
|
| 344 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Previous element in sparse matrix list. <a href="group__dbprim__smat.html#ga63"></a><br></td></tr> |
| 345 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga64">se_lflags</a>(entry, n)</td></tr> |
| 346 |
|
| 347 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flags associated with an entry in a sparse matrix list. <a href="group__dbprim__smat.html#ga64"></a><br></td></tr> |
| 348 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga65">se_object</a>(entry, n)</td></tr> |
| 349 |
|
| 350 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Object associated with an entry in a sparse matrix list. <a href="group__dbprim__smat.html#ga65"></a><br></td></tr> |
| 351 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga17">RB_TREE_MAGIC</a></td></tr> |
| 352 |
|
| 353 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree magic number. <a href="group__dbprim__rbtree.html#ga17"></a><br></td></tr> |
| 354 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="dbprim_8h.html#a82">RBT_FLAG_FREEZE</a></td></tr> |
| 355 |
|
| 356 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flag indicating red-black tree is frozen. <a href="#a82"></a><br></td></tr> |
| 357 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga18">RB_TREE_INIT</a>(comp, extra)</td></tr> |
| 358 |
|
| 359 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree static initializer. <a href="group__dbprim__rbtree.html#ga18"></a><br></td></tr> |
| 360 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga19">rt_verify</a>(tree)</td></tr> |
| 361 |
|
| 362 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree verification macro. <a href="group__dbprim__rbtree.html#ga19"></a><br></td></tr> |
| 363 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga20">rt_frozen</a>(tree)</td></tr> |
| 364 |
|
| 365 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine if a red-black tree is frozen. <a href="group__dbprim__rbtree.html#ga20"></a><br></td></tr> |
| 366 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga21">rt_count</a>(tree)</td></tr> |
| 367 |
|
| 368 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree count. <a href="group__dbprim__rbtree.html#ga21"></a><br></td></tr> |
| 369 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga22">rt_root</a>(tree)</td></tr> |
| 370 |
|
| 371 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree root node. <a href="group__dbprim__rbtree.html#ga22"></a><br></td></tr> |
| 372 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga23">rt_comp</a>(tree)</td></tr> |
| 373 |
|
| 374 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree comparison function. <a href="group__dbprim__rbtree.html#ga23"></a><br></td></tr> |
| 375 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga24">rt_extra</a>(tree)</td></tr> |
| 376 |
|
| 377 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Extra pointer data in a red-black tree. <a href="group__dbprim__rbtree.html#ga24"></a><br></td></tr> |
| 378 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga25">RBT_ORDER_PRE</a></td></tr> |
| 379 |
|
| 380 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Preorder tree traversal method. <a href="group__dbprim__rbtree.html#ga25"></a><br></td></tr> |
| 381 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga26">RBT_ORDER_IN</a></td></tr> |
| 382 |
|
| 383 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inorder tree traversal method. <a href="group__dbprim__rbtree.html#ga26"></a><br></td></tr> |
| 384 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga27">RBT_ORDER_POST</a></td></tr> |
| 385 |
|
| 386 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Postorder tree traversal method. <a href="group__dbprim__rbtree.html#ga27"></a><br></td></tr> |
| 387 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga28">RBT_ORDER_MASK</a></td></tr> |
| 388 |
|
| 389 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Tree traversal method mask. <a href="group__dbprim__rbtree.html#ga28"></a><br></td></tr> |
| 390 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga29">rt_prev</a>(tree, node_io, flags)</td></tr> |
| 391 |
|
| 392 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Get the previous node. <a href="group__dbprim__rbtree.html#ga29"></a><br></td></tr> |
| 393 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga30">RB_NODE_MAGIC</a></td></tr> |
| 394 |
|
| 395 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node magic number. <a href="group__dbprim__rbtree.html#ga30"></a><br></td></tr> |
| 396 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga31">RB_NODE_INIT</a>(value)</td></tr> |
| 397 |
|
| 398 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node static initializer. <a href="group__dbprim__rbtree.html#ga31"></a><br></td></tr> |
| 399 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga32">rn_verify</a>(node)</td></tr> |
| 400 |
|
| 401 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node verification macro. <a href="group__dbprim__rbtree.html#ga32"></a><br></td></tr> |
| 402 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga33">rn_color</a>(node)</td></tr> |
| 403 |
|
| 404 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node color. <a href="group__dbprim__rbtree.html#ga33"></a><br></td></tr> |
| 405 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga34">rn_tree</a>(node)</td></tr> |
| 406 |
|
| 407 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node's tree pointer. <a href="group__dbprim__rbtree.html#ga34"></a><br></td></tr> |
| 408 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga35">rn_parent</a>(node)</td></tr> |
| 409 |
|
| 410 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node's parent pointer. <a href="group__dbprim__rbtree.html#ga35"></a><br></td></tr> |
| 411 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga36">rn_left</a>(node)</td></tr> |
| 412 |
|
| 413 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node's left pointer. <a href="group__dbprim__rbtree.html#ga36"></a><br></td></tr> |
| 414 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga37">rn_right</a>(node)</td></tr> |
| 415 |
|
| 416 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node's right pointer. <a href="group__dbprim__rbtree.html#ga37"></a><br></td></tr> |
| 417 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga38">rn_key</a>(node)</td></tr> |
| 418 |
|
| 419 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node's key pointer. <a href="group__dbprim__rbtree.html#ga38"></a><br></td></tr> |
| 420 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga39">rn_value</a>(node)</td></tr> |
| 421 |
|
| 422 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node's value pointer. <a href="group__dbprim__rbtree.html#ga39"></a><br></td></tr> |
| 423 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga40">rn_isblack</a>(node)</td></tr> |
| 424 |
|
| 425 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Test if a given node is black. <a href="group__dbprim__rbtree.html#ga40"></a><br></td></tr> |
| 426 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga41">rn_isred</a>(node)</td></tr> |
| 427 |
|
| 428 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Test if a given node is red. <a href="group__dbprim__rbtree.html#ga41"></a><br></td></tr> |
| 429 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga42">rn_isleft</a>(node)</td></tr> |
| 430 |
|
| 431 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Test if a given node is the left node of its parent. <a href="group__dbprim__rbtree.html#ga42"></a><br></td></tr> |
| 432 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga43">rn_isright</a>(node)</td></tr> |
| 433 |
|
| 434 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Test if a given node is the right node of its parent. <a href="group__dbprim__rbtree.html#ga43"></a><br></td></tr> |
| 435 |
<tr><td colspan="2"><br><h2>Typedefs</h2></td></tr> |
| 436 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__db__key__s.html">_db_key_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim.html#ga0">db_key_t</a></td></tr> |
| 437 |
|
| 438 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Database key. <a href="group__dbprim.html#ga0"></a><br></td></tr> |
| 439 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__link__head__s.html">_link_head_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga0">link_head_t</a></td></tr> |
| 440 |
|
| 441 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list head. <a href="group__dbprim__link.html#ga0"></a><br></td></tr> |
| 442 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__link__elem__s.html">_link_elem_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga1">link_elem_t</a></td></tr> |
| 443 |
|
| 444 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list element. <a href="group__dbprim__link.html#ga1"></a><br></td></tr> |
| 445 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__hash__table__s.html">_hash_table_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga1">hash_table_t</a></td></tr> |
| 446 |
|
| 447 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table. <a href="group__dbprim__hash.html#ga1"></a><br></td></tr> |
| 448 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__hash__entry__s.html">_hash_entry_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga2">hash_entry_t</a></td></tr> |
| 449 |
|
| 450 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table entry. <a href="group__dbprim__hash.html#ga2"></a><br></td></tr> |
| 451 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__smat__table__s.html">_smat_table_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga0">smat_table_t</a></td></tr> |
| 452 |
|
| 453 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table. <a href="group__dbprim__smat.html#ga0"></a><br></td></tr> |
| 454 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__smat__head__s.html">_smat_head_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga1">smat_head_t</a></td></tr> |
| 455 |
|
| 456 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix list head. <a href="group__dbprim__smat.html#ga1"></a><br></td></tr> |
| 457 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__smat__entry__s.html">_smat_entry_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga2">smat_entry_t</a></td></tr> |
| 458 |
|
| 459 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix entry. <a href="group__dbprim__smat.html#ga2"></a><br></td></tr> |
| 460 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__rb__tree__s.html">_rb_tree_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga0">rb_tree_t</a></td></tr> |
| 461 |
|
| 462 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree. <a href="group__dbprim__rbtree.html#ga0"></a><br></td></tr> |
| 463 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="struct__rb__node__s.html">_rb_node_s</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga1">rb_node_t</a></td></tr> |
| 464 |
|
| 465 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node. <a href="group__dbprim__rbtree.html#ga1"></a><br></td></tr> |
| 466 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga2">link_iter_t</a> )(<a class="el" href="struct__link__head__s.html">link_head_t</a> *list, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> *elem, void *extra)</td></tr> |
| 467 |
|
| 468 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list iteration callback. <a href="group__dbprim__link.html#ga2"></a><br></td></tr> |
| 469 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga3">link_comp_t</a> )(<a class="el" href="struct__db__key__s.html">db_key_t</a> *key, void *obj)</td></tr> |
| 470 |
|
| 471 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list comparison callback. <a href="group__dbprim__link.html#ga3"></a><br></td></tr> |
| 472 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga3">hash_iter_t</a> )(<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__hash__entry__s.html">hash_entry_t</a> *ent, void *extra)</td></tr> |
| 473 |
|
| 474 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table iteration callback. <a href="group__dbprim__hash.html#ga3"></a><br></td></tr> |
| 475 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga4">hash_func_t</a> )(<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 476 |
|
| 477 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash function callback. <a href="group__dbprim__hash.html#ga4"></a><br></td></tr> |
| 478 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga5">hash_comp_t</a> )(<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key1, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key2)</td></tr> |
| 479 |
|
| 480 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table comparison callback. <a href="group__dbprim__hash.html#ga5"></a><br></td></tr> |
| 481 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga6">hash_resize_t</a> )(<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, unsigned long new_mod)</td></tr> |
| 482 |
|
| 483 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash table resize callback. <a href="group__dbprim__hash.html#ga6"></a><br></td></tr> |
| 484 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga3">smat_resize_t</a> )(<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, unsigned long new_mod)</td></tr> |
| 485 |
|
| 486 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix table resize callback. <a href="group__dbprim__smat.html#ga3"></a><br></td></tr> |
| 487 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga4">smat_iter_t</a> )(<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *ent, void *extra)</td></tr> |
| 488 |
|
| 489 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix iteration callback. <a href="group__dbprim__smat.html#ga4"></a><br></td></tr> |
| 490 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga5">smat_comp_t</a> )(<a class="el" href="struct__db__key__s.html">db_key_t</a> *key, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *ent)</td></tr> |
| 491 |
|
| 492 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix comparison callback. <a href="group__dbprim__smat.html#ga5"></a><br></td></tr> |
| 493 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga2">rb_iter_t</a> )(<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__rb__node__s.html">rb_node_t</a> *node, void *extra)</td></tr> |
| 494 |
|
| 495 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree iteration callback. <a href="group__dbprim__rbtree.html#ga2"></a><br></td></tr> |
| 496 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga3">rb_comp_t</a> )(<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key1, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key2)</td></tr> |
| 497 |
|
| 498 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree comparison callback. <a href="group__dbprim__rbtree.html#ga3"></a><br></td></tr> |
| 499 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef enum <a class="el" href="group__dbprim__link.html#ga28">_link_loc_e</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga4">link_loc_t</a></td></tr> |
| 500 |
|
| 501 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list location. <a href="group__dbprim__link.html#ga4"></a><br></td></tr> |
| 502 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef enum <a class="el" href="group__dbprim__smat.html#ga70">_smat_loc_e</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga6">smat_loc_t</a></td></tr> |
| 503 |
|
| 504 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix location. <a href="group__dbprim__smat.html#ga6"></a><br></td></tr> |
| 505 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef enum <a class="el" href="group__dbprim__rbtree.html#ga53">_rb_color_e</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga4">rb_color_t</a></td></tr> |
| 506 |
|
| 507 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node color. <a href="group__dbprim__rbtree.html#ga4"></a><br></td></tr> |
| 508 |
<tr><td colspan="2"><br><h2>Enumerations</h2></td></tr> |
| 509 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">enum </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga28">_link_loc_e</a> { <a class="el" href="group__dbprim__link.html#gga28a133">LINK_LOC_HEAD</a>, |
| 510 |
<a class="el" href="group__dbprim__link.html#gga28a134">LINK_LOC_TAIL</a>, |
| 511 |
<a class="el" href="group__dbprim__link.html#gga28a135">LINK_LOC_BEFORE</a>, |
| 512 |
<a class="el" href="group__dbprim__link.html#gga28a136">LINK_LOC_AFTER</a> |
| 513 |
}</td></tr> |
| 514 |
|
| 515 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Linked list location. <a href="group__dbprim__link.html#ga28">More...</a><br></td></tr> |
| 516 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">enum </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga70">_smat_loc_e</a> { <a class="el" href="group__dbprim__smat.html#gga70a137">SMAT_LOC_FIRST</a>, |
| 517 |
<a class="el" href="group__dbprim__smat.html#gga70a138">SMAT_LOC_SECOND</a> |
| 518 |
}</td></tr> |
| 519 |
|
| 520 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sparse matrix location. <a href="group__dbprim__smat.html#ga70">More...</a><br></td></tr> |
| 521 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">enum </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga53">_rb_color_e</a> { <a class="el" href="group__dbprim__rbtree.html#gga53a139">RB_COLOR_NONE</a>, |
| 522 |
<a class="el" href="group__dbprim__rbtree.html#gga53a140">RB_COLOR_RED</a>, |
| 523 |
<a class="el" href="group__dbprim__rbtree.html#gga53a141">RB_COLOR_BLACK</a> |
| 524 |
}</td></tr> |
| 525 |
|
| 526 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree node color. <a href="group__dbprim__rbtree.html#ga53">More...</a><br></td></tr> |
| 527 |
<tr><td colspan="2"><br><h2>Functions</h2></td></tr> |
| 528 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga5">ll_init</a> (<a class="el" href="struct__link__head__s.html">link_head_t</a> *list, void *extra)</td></tr> |
| 529 |
|
| 530 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dynamically initialize a linked list head. <a href="group__dbprim__link.html#ga5"></a><br></td></tr> |
| 531 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga6">ll_add</a> (<a class="el" href="struct__link__head__s.html">link_head_t</a> *list, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> *new, <a class="el" href="group__dbprim__link.html#ga4">link_loc_t</a> loc, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> *elem)</td></tr> |
| 532 |
|
| 533 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Add an element to a linked list. <a href="group__dbprim__link.html#ga6"></a><br></td></tr> |
| 534 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga7">ll_move</a> (<a class="el" href="struct__link__head__s.html">link_head_t</a> *list, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> *elem, <a class="el" href="group__dbprim__link.html#ga4">link_loc_t</a> loc, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> *elem2)</td></tr> |
| 535 |
|
| 536 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move an element within a linked list. <a href="group__dbprim__link.html#ga7"></a><br></td></tr> |
| 537 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga8">ll_remove</a> (<a class="el" href="struct__link__head__s.html">link_head_t</a> *list, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> *elem)</td></tr> |
| 538 |
|
| 539 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Remove an element from a linked list. <a href="group__dbprim__link.html#ga8"></a><br></td></tr> |
| 540 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga9">ll_find</a> (<a class="el" href="struct__link__head__s.html">link_head_t</a> *list, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> **elem_p, <a class="el" href="group__dbprim__link.html#ga3">link_comp_t</a> comp_func, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> *start, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 541 |
|
| 542 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find an element in a linked list. <a href="group__dbprim__link.html#ga9"></a><br></td></tr> |
| 543 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga10">ll_iter</a> (<a class="el" href="struct__link__head__s.html">link_head_t</a> *list, <a class="el" href="struct__link__elem__s.html">link_elem_t</a> *start, <a class="el" href="group__dbprim__link.html#ga2">link_iter_t</a> iter_func, void *extra, unsigned long flags)</td></tr> |
| 544 |
|
| 545 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Iterate over each entry in a linked list. <a href="group__dbprim__link.html#ga10"></a><br></td></tr> |
| 546 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga11">ll_flush</a> (<a class="el" href="struct__link__head__s.html">link_head_t</a> *list, <a class="el" href="group__dbprim__link.html#ga2">link_iter_t</a> flush_func, void *extra)</td></tr> |
| 547 |
|
| 548 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flush a linked list. <a href="group__dbprim__link.html#ga11"></a><br></td></tr> |
| 549 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__link.html#ga12">le_init</a> (<a class="el" href="struct__link__elem__s.html">link_elem_t</a> *elem, void *object)</td></tr> |
| 550 |
|
| 551 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dynamically initialize a linked list element. <a href="group__dbprim__link.html#ga12"></a><br></td></tr> |
| 552 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga7">hash_fnv1</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 553 |
|
| 554 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">FNV-1 hash function. <a href="group__dbprim__hash.html#ga7"></a><br></td></tr> |
| 555 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga8">hash_fnv1a</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 556 |
|
| 557 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">FNV-1a hash function. <a href="group__dbprim__hash.html#ga8"></a><br></td></tr> |
| 558 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga9">hash_comp</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key1, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key2)</td></tr> |
| 559 |
|
| 560 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Hash comparison function. <a href="group__dbprim__hash.html#ga9"></a><br></td></tr> |
| 561 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga10">ht_init</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, unsigned long flags, <a class="el" href="group__dbprim__hash.html#ga4">hash_func_t</a> func, <a class="el" href="group__dbprim__hash.html#ga5">hash_comp_t</a> comp, <a class="el" href="group__dbprim__hash.html#ga6">hash_resize_t</a> resize, void *extra, unsigned long init_mod)</td></tr> |
| 562 |
|
| 563 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dynamically initialize a hash table. <a href="group__dbprim__hash.html#ga10"></a><br></td></tr> |
| 564 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga11">ht_add</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__hash__entry__s.html">hash_entry_t</a> *entry, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 565 |
|
| 566 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Add an entry to a hash table. <a href="group__dbprim__hash.html#ga11"></a><br></td></tr> |
| 567 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga12">ht_move</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__hash__entry__s.html">hash_entry_t</a> *entry, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 568 |
|
| 569 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move an entry in the hash table. <a href="group__dbprim__hash.html#ga12"></a><br></td></tr> |
| 570 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga13">ht_remove</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__hash__entry__s.html">hash_entry_t</a> *entry)</td></tr> |
| 571 |
|
| 572 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Remove an element from a hash table. <a href="group__dbprim__hash.html#ga13"></a><br></td></tr> |
| 573 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga14">ht_find</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="struct__hash__entry__s.html">hash_entry_t</a> **entry_p, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 574 |
|
| 575 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find an entry in a hash table. <a href="group__dbprim__hash.html#ga14"></a><br></td></tr> |
| 576 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga15">ht_iter</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="group__dbprim__hash.html#ga3">hash_iter_t</a> iter_func, void *extra)</td></tr> |
| 577 |
|
| 578 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Iterate over each entry in a hash table. <a href="group__dbprim__hash.html#ga15"></a><br></td></tr> |
| 579 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga16">ht_flush</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, <a class="el" href="group__dbprim__hash.html#ga3">hash_iter_t</a> flush_func, void *extra)</td></tr> |
| 580 |
|
| 581 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flush a hash table. <a href="group__dbprim__hash.html#ga16"></a><br></td></tr> |
| 582 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga17">ht_resize</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table, unsigned long new_size)</td></tr> |
| 583 |
|
| 584 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Resize a hash table. <a href="group__dbprim__hash.html#ga17"></a><br></td></tr> |
| 585 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga18">ht_free</a> (<a class="el" href="struct__hash__table__s.html">hash_table_t</a> *table)</td></tr> |
| 586 |
|
| 587 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Free memory used by an empty hash table. <a href="group__dbprim__hash.html#ga18"></a><br></td></tr> |
| 588 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__hash.html#ga19">he_init</a> (<a class="el" href="struct__hash__entry__s.html">hash_entry_t</a> *entry, void *value)</td></tr> |
| 589 |
|
| 590 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dynamically initialize a hash table entry. <a href="group__dbprim__hash.html#ga19"></a><br></td></tr> |
| 591 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga8">smat_cleanup</a> (void)</td></tr> |
| 592 |
|
| 593 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Clean up the smat free list. <a href="group__dbprim__smat.html#ga8"></a><br></td></tr> |
| 594 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga9">smat_freemem</a> (void)</td></tr> |
| 595 |
|
| 596 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Report how much memory is used by the free list. <a href="group__dbprim__smat.html#ga9"></a><br></td></tr> |
| 597 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga10">st_init</a> (<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, unsigned long flags, <a class="el" href="group__dbprim__smat.html#ga3">smat_resize_t</a> resize, void *extra, unsigned long init_mod)</td></tr> |
| 598 |
|
| 599 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dynamically initialize a sparse matrix table. <a href="group__dbprim__smat.html#ga10"></a><br></td></tr> |
| 600 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga11">st_add</a> (<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> **entry_p, <a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head1, <a class="el" href="group__dbprim__link.html#ga4">link_loc_t</a> loc1, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *ent1, <a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head2, <a class="el" href="group__dbprim__link.html#ga4">link_loc_t</a> loc2, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *ent2)</td></tr> |
| 601 |
|
| 602 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Add an entry to a sparse matrix. <a href="group__dbprim__smat.html#ga11"></a><br></td></tr> |
| 603 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga12">st_remove</a> (<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *entry)</td></tr> |
| 604 |
|
| 605 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Remove an entry from a sparse matrix. <a href="group__dbprim__smat.html#ga12"></a><br></td></tr> |
| 606 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga13">st_find</a> (<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> **entry_p, <a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head1, <a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head2)</td></tr> |
| 607 |
|
| 608 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find an entry in a sparse matrix. <a href="group__dbprim__smat.html#ga13"></a><br></td></tr> |
| 609 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga14">st_iter</a> (<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, <a class="el" href="group__dbprim__smat.html#ga4">smat_iter_t</a> iter_func, void *extra)</td></tr> |
| 610 |
|
| 611 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Iterate over each entry in a sparse matrix. <a href="group__dbprim__smat.html#ga14"></a><br></td></tr> |
| 612 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga15">st_flush</a> (<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, <a class="el" href="group__dbprim__smat.html#ga4">smat_iter_t</a> flush_func, void *extra)</td></tr> |
| 613 |
|
| 614 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flush a sparse matrix. <a href="group__dbprim__smat.html#ga15"></a><br></td></tr> |
| 615 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga16">st_resize</a> (<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table, unsigned long new_size)</td></tr> |
| 616 |
|
| 617 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Resize a sparse matrix table. <a href="group__dbprim__smat.html#ga16"></a><br></td></tr> |
| 618 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga17">st_free</a> (<a class="el" href="struct__smat__table__s.html">smat_table_t</a> *table)</td></tr> |
| 619 |
|
| 620 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Free memory used by an empty sparse matrix table. <a href="group__dbprim__smat.html#ga17"></a><br></td></tr> |
| 621 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga18">sh_init</a> (<a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head, <a class="el" href="group__dbprim__smat.html#ga6">smat_loc_t</a> elem, void *object)</td></tr> |
| 622 |
|
| 623 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dynamically initialize a sparse matrix row or column head. <a href="group__dbprim__smat.html#ga18"></a><br></td></tr> |
| 624 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga19">sh_move</a> (<a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *elem, <a class="el" href="group__dbprim__link.html#ga4">link_loc_t</a> loc, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *elem2)</td></tr> |
| 625 |
|
| 626 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move an entry within a row or column list. <a href="group__dbprim__smat.html#ga19"></a><br></td></tr> |
| 627 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga20">sh_find</a> (<a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> **elem_p, <a class="el" href="group__dbprim__smat.html#ga5">smat_comp_t</a> comp_func, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *start, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 628 |
|
| 629 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find an entry in a row or column of a sparse matrix. <a href="group__dbprim__smat.html#ga20"></a><br></td></tr> |
| 630 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga21">sh_iter</a> (<a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head, <a class="el" href="struct__smat__entry__s.html">smat_entry_t</a> *start, <a class="el" href="group__dbprim__smat.html#ga4">smat_iter_t</a> iter_func, void *extra, unsigned long flags)</td></tr> |
| 631 |
|
| 632 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Iterate over each entry in a row or column of a sparse matrix. <a href="group__dbprim__smat.html#ga21"></a><br></td></tr> |
| 633 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__smat.html#ga22">sh_flush</a> (<a class="el" href="struct__smat__head__s.html">smat_head_t</a> *head, <a class="el" href="group__dbprim__smat.html#ga4">smat_iter_t</a> flush_func, void *extra)</td></tr> |
| 634 |
|
| 635 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flush a row or column of a sparse matrix. <a href="group__dbprim__smat.html#ga22"></a><br></td></tr> |
| 636 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga5">rbtree_comp</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key1, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key2)</td></tr> |
| 637 |
|
| 638 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Red-black tree comparison function. <a href="group__dbprim__rbtree.html#ga5"></a><br></td></tr> |
| 639 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga6">rt_init</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="group__dbprim__rbtree.html#ga3">rb_comp_t</a> comp, void *extra)</td></tr> |
| 640 |
|
| 641 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dynamically initialize a red-black tree. <a href="group__dbprim__rbtree.html#ga6"></a><br></td></tr> |
| 642 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga7">rt_add</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__rb__node__s.html">rb_node_t</a> *node, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 643 |
|
| 644 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Add a node to a red-black tree. <a href="group__dbprim__rbtree.html#ga7"></a><br></td></tr> |
| 645 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga8">rt_move</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__rb__node__s.html">rb_node_t</a> *node, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 646 |
|
| 647 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move a node in a red-black tree. <a href="group__dbprim__rbtree.html#ga8"></a><br></td></tr> |
| 648 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga9">rt_remove</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__rb__node__s.html">rb_node_t</a> *node)</td></tr> |
| 649 |
|
| 650 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Remove a node from a red-black tree. <a href="group__dbprim__rbtree.html#ga9"></a><br></td></tr> |
| 651 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga10">rt_find</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__rb__node__s.html">rb_node_t</a> **node_p, <a class="el" href="struct__db__key__s.html">db_key_t</a> *key)</td></tr> |
| 652 |
|
| 653 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find an entry in a red-black table. <a href="group__dbprim__rbtree.html#ga10"></a><br></td></tr> |
| 654 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga11">rt_next</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__rb__node__s.html">rb_node_t</a> **node_io, unsigned long flags)</td></tr> |
| 655 |
|
| 656 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Get the next node. <a href="group__dbprim__rbtree.html#ga11"></a><br></td></tr> |
| 657 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga12">rt_iter</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="struct__rb__node__s.html">rb_node_t</a> *start, <a class="el" href="group__dbprim__rbtree.html#ga2">rb_iter_t</a> iter_func, void *extra, unsigned long flags)</td></tr> |
| 658 |
|
| 659 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Iterate over each entry in a red-black tree. <a href="group__dbprim__rbtree.html#ga12"></a><br></td></tr> |
| 660 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga13">rt_flush</a> (<a class="el" href="struct__rb__tree__s.html">rb_tree_t</a> *tree, <a class="el" href="group__dbprim__rbtree.html#ga2">rb_iter_t</a> flush_func, void *extra)</td></tr> |
| 661 |
|
| 662 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Flush a red-black tree. <a href="group__dbprim__rbtree.html#ga13"></a><br></td></tr> |
| 663 |
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="group__dbprim__rbtree.html#ga14">rn_init</a> (<a class="el" href="struct__rb__node__s.html">rb_node_t</a> *node, void *value)</td></tr> |
| 664 |
|
| 665 |
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dynamically initialize a red-black tree node. <a href="group__dbprim__rbtree.html#ga14"></a><br></td></tr> |
| 666 |
</table> |
| 667 |
<hr><h2>Define Documentation</h2> |
| 668 |
<a class="anchor" name="a0"></a><!-- doxytag: member="dbprim.h::DBPRIM_BEGIN_C_DECLS" ref="a0" args="" --><p> |
| 669 |
<table class="mdTable" cellpadding="2" cellspacing="0"> |
| 670 |
<tr> |
| 671 |
<td class="mdRow"> |
| 672 |
<table cellpadding="0" cellspacing="0" border="0"> |
| 673 |
<tr> |
| 674 |
<td class="md" nowrap valign="top">#define DBPRIM_BEGIN_C_DECLS </td> |
| 675 |
</tr> |
| 676 |
</table> |
| 677 |
</td> |
| 678 |
</tr> |
| 679 |
</table> |
| 680 |
<table cellspacing="5" cellpadding="0" border="0"> |
| 681 |
<tr> |
| 682 |
<td> |
| 683 |
|
| 684 |
</td> |
| 685 |
<td> |
| 686 |
|
| 687 |
<p> |
| 688 |
<p><b>For internal use only.</b></p> |
| 689 |
<p> |
| 690 |
This macro is defined to <code>extern "C" {</code> when compiling with a C++ compiler. See <a class="el" href="dbprim_8h.html#a1">DBPRIM_END_C_DECLS</a>.</p> |
| 691 |
|
| 692 |
<p> |
| 693 |
Definition at line <a class="el" href="dbprim_8h-source.html#l00236">236</a> of file <a class="el" href="dbprim_8h-source.html">dbprim.h</a>. </td> |
| 694 |
</tr> |
| 695 |
</table> |
| 696 |
<a class="anchor" name="a1"></a><!-- doxytag: member="dbprim.h::DBPRIM_END_C_DECLS" ref="a1" args="" --><p> |
| 697 |
<table class="mdTable" cellpadding="2" cellspacing="0"> |
| 698 |
<tr> |
| 699 |
<td class="mdRow"> |
| 700 |
<table cellpadding="0" cellspacing="0" border="0"> |
| 701 |
<tr> |
| 702 |
<td class="md" nowrap valign="top">#define DBPRIM_END_C_DECLS </td> |
| 703 |
</tr> |
| 704 |
</table> |
| 705 |
</td> |
| 706 |
</tr> |
| 707 |
</table> |
| 708 |
<table cellspacing="5" cellpadding="0" border="0"> |
| 709 |
<tr> |
| 710 |
<td> |
| 711 |
|
| 712 |
</td> |
| 713 |
<td> |
| 714 |
|
| 715 |
<p> |
| 716 |
<p><b>For internal use only.</b></p> |
| 717 |
<p> |
| 718 |
This macro is defined to <code>}</code> when compiling with a C++ compiler. See <a class="el" href="dbprim_8h.html#a0">DBPRIM_BEGIN_C_DECLS</a>.</p> |
| 719 |
|
| 720 |
<p> |
| 721 |
Definition at line <a class="el" href="dbprim_8h-source.html#l00237">237</a> of file <a class="el" href="dbprim_8h-source.html">dbprim.h</a>. </td> |
| 722 |
</tr> |
| 723 |
</table> |
| 724 |
<a class="anchor" name="a25"></a><!-- doxytag: member="dbprim.h::HASH_FLAG_FREEZE" ref="a25" args="" --><p> |
| 725 |
<table class="mdTable" cellpadding="2" cellspacing="0"> |
| 726 |
<tr> |
| 727 |
<td class="mdRow"> |
| 728 |
<table cellpadding="0" cellspacing="0" border="0"> |
| 729 |
<tr> |
| 730 |
<td class="md" nowrap valign="top">#define HASH_FLAG_FREEZE </td> |
| 731 |
</tr> |
| 732 |
</table> |
| 733 |
</td> |
| 734 |
</tr> |
| 735 |
</table> |
| 736 |
<table cellspacing="5" cellpadding="0" border="0"> |
| 737 |
<tr> |
| 738 |
<td> |
| 739 |
|
| 740 |
</td> |
| 741 |
<td> |
| 742 |
|
| 743 |
<p> |
| 744 |
<p><b>For internal use only.</b></p> |
| 745 |
<p> |
| 746 |
This flag, if set on a hash table, indicates that the table is frozen and may not be modified.</p> |
| 747 |
|
| 748 |
<p> |
| 749 |
Definition at line <a class="el" href="dbprim_8h-source.html#l01124">1124</a> of file <a class="el" href="dbprim_8h-source.html">dbprim.h</a>. |
| 750 |
<p> |
| 751 |
Referenced by <a class="el" href="ht__add_8c-source.html#l00034">ht_add()</a>, <a class="el" href="ht__flush_8c-source.html#l00036">ht_flush()</a>, <a class="el" href="ht__free_8c-source.html#l00036">ht_free()</a>, <a class="el" href="ht__iter_8c-source.html#l00034">ht_iter()</a>, <a class="el" href="ht__move_8c-source.html#l00034">ht_move()</a>, <a class="el" href="ht__remove_8c-source.html#l00034">ht_remove()</a>, and <a class="el" href="ht__resize_8c-source.html#l00038">ht_resize()</a>. </td> |
| 752 |
</tr> |
| 753 |
</table> |
| 754 |
<a class="anchor" name="a82"></a><!-- doxytag: member="dbprim.h::RBT_FLAG_FREEZE" ref="a82" args="" --><p> |
| 755 |
<table class="mdTable" cellpadding="2" cellspacing="0"> |
| 756 |
<tr> |
| 757 |
<td class="mdRow"> |
| 758 |
<table cellpadding="0" cellspacing="0" border="0"> |
| 759 |
<tr> |
| 760 |
<td class="md" nowrap valign="top">#define RBT_FLAG_FREEZE </td> |
| 761 |
</tr> |
| 762 |
</table> |
| 763 |
</td> |
| 764 |
</tr> |
| 765 |
</table> |
| 766 |
<table cellspacing="5" cellpadding="0" border="0"> |
| 767 |
<tr> |
| 768 |
<td> |
| 769 |
|
| 770 |
</td> |
| 771 |
<td> |
| 772 |
|
| 773 |
<p> |
| 774 |
<p><b>For internal use only.</b></p> |
| 775 |
<p> |
| 776 |
This flag, if set on a red-black tree, indicates that the tree is frozen and may not be modified.</p> |
| 777 |
|
| 778 |
<p> |
| 779 |
Definition at line <a class="el" href="dbprim_8h-source.html#l02562">2562</a> of file <a class="el" href="dbprim_8h-source.html">dbprim.h</a>. |
| 780 |
<p> |
| 781 |
Referenced by <a class="el" href="rt__add_8c-source.html#l00062">rt_add()</a>, <a class="el" href="rt__flush_8c-source.html#l00034">rt_flush()</a>, <a class="el" href="rt__iter_8c-source.html#l00034">rt_iter()</a>, <a class="el" href="rt__move_8c-source.html#l00035">rt_move()</a>, and <a class="el" href="rt__remove_8c-source.html#l00154">rt_remove()</a>. </td> |
| 782 |
</tr> |
| 783 |
</table> |
| 784 |
<hr size="1"><address style="align: right;"><small>Generated on Sat Jul 15 14:10:35 2006 for DatabasePrimitivesLibrary by |
| 785 |
<a href="http://www.doxygen.org/index.html"> |
| 786 |
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.4 </small></address> |
| 787 |
</body> |
| 788 |
</html> |
