/usr/share/doc/libucommon-dev/a00065.html is in libucommon-doc 3.2.0-0ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>UCommon: ucc::keypager< T, M > Class Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.3 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Data Structures</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li><a href="examples.html"><span>Examples</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li><a href="classes.html"><span>Data Structure Index</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Data Fields</span></a></li>
</ul>
</div>
<div class="navpath"><a class="el" href="a00214.html">ucc</a>::<a class="el" href="a00065.html">keypager</a>
</div>
</div>
<div class="contents">
<h1>ucc::keypager< T, M > Class Template Reference</h1><!-- doxytag: class="ucc::keypager" --><!-- doxytag: inherits="ucc::mempager" -->
<p>A templated class for a hash pager.
<a href="#_details">More...</a></p>
<p><code>#include <<a class="el" href="a00197_source.html">memory.h</a>></code></p>
<div class="dynheader">
Inheritance diagram for ucc::keypager< T, M >:</div>
<div class="dynsection">
<div class="center"><img src="a00411.png" border="0" usemap="#ucc_1_1keypager_3_01_t_00_01_m_01_4_inherit__map" alt="Inheritance graph"/></div>
<map name="ucc_1_1keypager_3_01_t_00_01_m_01_4_inherit__map" id="ucc_1_1keypager_3_01_t_00_01_m_01_4_inherit__map">
<area shape="rect" id="node2" href="a00081.html" title="A managed private heap for small allocations." alt="" coords="27,83,149,112"/><area shape="rect" id="node4" href="a00080.html" title="An alternate memory pager private heap manager." alt="" coords="31,5,145,35"/></map>
<center><span class="legend">[<a target="top" href="graph_legend.html">legend</a>]</span></center></div>
<div class="dynheader">
Collaboration diagram for ucc::keypager< T, M >:</div>
<div class="dynsection">
<div class="center"><img src="a00412.png" border="0" usemap="#ucc_1_1keypager_3_01_t_00_01_m_01_4_coll__map" alt="Collaboration graph"/></div>
<map name="ucc_1_1keypager_3_01_t_00_01_m_01_4_coll__map" id="ucc_1_1keypager_3_01_t_00_01_m_01_4_coll__map">
<area shape="rect" id="node2" href="a00081.html" title="A managed private heap for small allocations." alt="" coords="5,267,128,296"/><area shape="rect" id="node4" href="a00080.html" title="An alternate memory pager private heap manager." alt="" coords="9,187,124,216"/><area shape="rect" id="node6" href="a00090.html" title="A linked object base class with members found by name." alt="" coords="152,267,291,296"/><area shape="rect" id="node8" href="a00100.html" title="A linked object base class for ordered objects." alt="" coords="149,187,293,216"/><area shape="rect" id="node10" href="a00069.html" title="Common base class for all objects that can be formed into a linked list." alt="" coords="155,96,288,125"/><area shape="rect" id="node12" href="a00093.html" title="A common base class for all managed objects." alt="" coords="175,5,268,35"/></map>
<center><span class="legend">[<a target="top" href="graph_legend.html">legend</a>]</span></center></div>
<table border="0" cellpadding="0" cellspacing="0">
<tr><td colspan="2"><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">T * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#a2b92f3385490cfadefaa9c75ab22b5df">begin</a> (void) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find first typed object in hash map to iterate. <a href="#a2b92f3385490cfadefaa9c75ab22b5df"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#a3b13989bbee7355812beb9c3635a5e63">count</a> (void) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Count the number of typed objects in our hash map. <a href="#a3b13989bbee7355812beb9c3635a5e63"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">T * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#a9a8f0d7ca544eec61464223242875ede">get</a> (const char *name) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find a typed object derived from <a class="el" href="a00090.html" title="A linked object base class with members found by name.">NamedObject</a> in the hash map by name. <a href="#a9a8f0d7ca544eec61464223242875ede"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">T ** </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#ad67a7f9405abfc070f44e3897402d34a">index</a> (void) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Convert our hash map into a linear object pointer array. <a href="#ad67a7f9405abfc070f44e3897402d34a"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#a90900b5ece13ac922ced71c341c448bb">keypager</a> (size_t size)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Create the object cache. <a href="#a90900b5ece13ac922ced71c341c448bb"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">T * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#aaee5108e64a2effdaae8cbdcbf9053e4">next</a> (T *current) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find next typed object in hash map for iteration. <a href="#aaee5108e64a2effdaae8cbdcbf9053e4"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">T * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#ab91217ef3d0656b92f99bb2a52c0397a">operator[]</a> (const char *name) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Find a typed object derived from <a class="el" href="a00090.html" title="A linked object base class with members found by name.">NamedObject</a> in the hash map by name. <a href="#ab91217ef3d0656b92f99bb2a52c0397a"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">T ** </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#adc1b8acf4ad06260904694da93c150a8">sort</a> (void) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Convert our hash map into an alphabetically sorted linear object pointer array. <a href="#adc1b8acf4ad06260904694da93c150a8"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#a8189b359cdb29f143164b6a252912400">test</a> (const char *name) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Test if a name exists in the pool. <a href="#a8189b359cdb29f143164b6a252912400"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="a25ef65a30aad0283668cfb8da0929272"></a><!-- doxytag: member="ucc::keypager::~keypager" ref="a25ef65a30aad0283668cfb8da0929272" args="()" -->
</td><td class="memItemRight" valign="bottom"><a class="el" href="a00065.html#a25ef65a30aad0283668cfb8da0929272">~keypager</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Destroy the hash pager by purging the index chains and memory pools. <br/></td></tr>
</table>
<hr/><a name="_details"></a><h2>Detailed Description</h2>
<h3>template<class T, unsigned M = 177><br/>
class ucc::keypager< T, M ></h3>
<p>A templated class for a hash pager. </p>
<p>This creates objects from a pager pool when they do not already exist in the hash map. </p>
<dl class="author"><dt><b>Author:</b></dt><dd>David Sugar <<a href="mailto:dyfet@gnutelephony.org">dyfet@gnutelephony.org</a>> </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00608">608</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
<hr/><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" id="a90900b5ece13ac922ced71c341c448bb"></a><!-- doxytag: member="ucc::keypager::keypager" ref="a90900b5ece13ac922ced71c341c448bb" args="(size_t size)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00065.html">ucc::keypager</a>< T, M >::<a class="el" href="a00065.html">keypager</a> </td>
<td>(</td>
<td class="paramtype">size_t </td>
<td class="paramname"> <em>size</em></td>
<td> ) </td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Create the object cache. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>size</em> </td><td>of allocation units. </td></tr>
</table>
</dd>
</dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00618">618</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="a2b92f3385490cfadefaa9c75ab22b5df"></a><!-- doxytag: member="ucc::keypager::begin" ref="a2b92f3385490cfadefaa9c75ab22b5df" args="(void) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname">T* <a class="el" href="a00065.html">ucc::keypager</a>< T, M >::begin </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Find first typed object in hash map to iterate. </p>
<dl class="return"><dt><b>Returns:</b></dt><dd>first typed object or NULL if nothing in list. </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00662">662</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<a class="anchor" id="a3b13989bbee7355812beb9c3635a5e63"></a><!-- doxytag: member="ucc::keypager::count" ref="a3b13989bbee7355812beb9c3635a5e63" args="(void) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname">unsigned <a class="el" href="a00065.html">ucc::keypager</a>< T, M >::count </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Count the number of typed objects in our hash map. </p>
<dl class="return"><dt><b>Returns:</b></dt><dd>count of typed objects. </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00677">677</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<a class="anchor" id="a9a8f0d7ca544eec61464223242875ede"></a><!-- doxytag: member="ucc::keypager::get" ref="a9a8f0d7ca544eec61464223242875ede" args="(const char *name) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname">T* <a class="el" href="a00065.html">ucc::keypager</a>< T, M >::get </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Find a typed object derived from <a class="el" href="a00090.html" title="A linked object base class with members found by name.">NamedObject</a> in the hash map by name. </p>
<p>If the object is not found, it is created from the memory pool. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>name</em> </td><td>to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>typed object if found through map or NULL. </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00632">632</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<a class="anchor" id="ad67a7f9405abfc070f44e3897402d34a"></a><!-- doxytag: member="ucc::keypager::index" ref="ad67a7f9405abfc070f44e3897402d34a" args="(void) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname">T** <a class="el" href="a00065.html">ucc::keypager</a>< T, M >::index </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Convert our hash map into a linear object pointer array. </p>
<p>The object pointer array is created from the heap and must be deleted when no longer used. </p>
<dl class="return"><dt><b>Returns:</b></dt><dd>array of typed named object pointers. </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00686">686</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<a class="anchor" id="aaee5108e64a2effdaae8cbdcbf9053e4"></a><!-- doxytag: member="ucc::keypager::next" ref="aaee5108e64a2effdaae8cbdcbf9053e4" args="(T *current) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname">T* <a class="el" href="a00065.html">ucc::keypager</a>< T, M >::next </td>
<td>(</td>
<td class="paramtype">T * </td>
<td class="paramname"> <em>current</em></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Find next typed object in hash map for iteration. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>current</em> </td><td>typed object we are referencing. </td></tr>
</table>
</dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>next iterative object or NULL if past end of map. </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00670">670</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<a class="anchor" id="ab91217ef3d0656b92f99bb2a52c0397a"></a><!-- doxytag: member="ucc::keypager::operator[]" ref="ab91217ef3d0656b92f99bb2a52c0397a" args="(const char *name) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname">T* <a class="el" href="a00065.html">ucc::keypager</a>< T, M >::operator[] </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Find a typed object derived from <a class="el" href="a00090.html" title="A linked object base class with members found by name.">NamedObject</a> in the hash map by name. </p>
<p>If the object is not found, it is created from the pager pool. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>name</em> </td><td>to search for. </td></tr>
</table>
</dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>typed object if found through map or NULL. </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00655">655</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<a class="anchor" id="adc1b8acf4ad06260904694da93c150a8"></a><!-- doxytag: member="ucc::keypager::sort" ref="adc1b8acf4ad06260904694da93c150a8" args="(void) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname">T** <a class="el" href="a00065.html">ucc::keypager</a>< T, M >::sort </td>
<td>(</td>
<td class="paramtype">void </td>
<td class="paramname"></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Convert our hash map into an alphabetically sorted linear object pointer array. </p>
<p>The object pointer array is created from the heap and must be deleted when no longer used. </p>
<dl class="return"><dt><b>Returns:</b></dt><dd>sorted array of typed named object pointers. </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00695">695</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<a class="anchor" id="a8189b359cdb29f143164b6a252912400"></a><!-- doxytag: member="ucc::keypager::test" ref="a8189b359cdb29f143164b6a252912400" args="(const char *name) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class T , unsigned M = 177> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="a00065.html">ucc::keypager</a>< T, M >::test </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em></td>
<td> ) </td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Test if a name exists in the pool. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>name</em> </td><td>to test. </td></tr>
</table>
</dd>
</dl>
<dl class="return"><dt><b>Returns:</b></dt><dd>true if found. </dd></dl>
<p>Definition at line <a class="el" href="a00197_source.html#l00646">646</a> of file <a class="el" href="a00197_source.html">memory.h</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>ucommon/<a class="el" href="a00197_source.html">memory.h</a></li>
</ul>
</div>
<hr class="footer"/><address style="text-align: right;"><small>Generated on Tue Jul 6 08:22:31 2010 for UCommon by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address>
</body>
</html>
|