Sophie

Sophie

distrib > Mandriva > 2010.0 > i586 > media > contrib-release > by-pkgid > bad97183153701b09df5fae1052b1c30 > files > 1807

crystalspace-doc-1.2.1-5mdv2010.0.i586.rpm

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>Crystal Space 1.2.1: csutil/hashr.h Source File (Crystal Space 1.2.1 Public API Reference)</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<table border="0" cellpadding="0" cellspacing="0" width="100%" class="head">
 <tr height="59">
  <td class="head" width="202" valign="bottom" style="padding-left:0;"><a href="http://www.crystalspace3d.org/"><img src="csblur.png" width="236" height="59" alt="CrystalSpace" border="0"></a></td>
  <td class="head"><h2>Public API Reference</h2></td>
 </tr>
 <tr height="11">
  <td colspan="2" class="headshadow" valign="top" style="padding-left:0;"><img src="csblurb.png" width="236" height="11" alt="" border="0"></td>
 </tr>
</table>
<div class="content">
<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li><a href="modules.html"><span>Modules</span></a></li>
    <li><a href="namespaces.html"><span>Namespaces</span></a></li>
    <li><a href="classes.html"><span>Classes</span></a></li>
    <li class="current"><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<h1>csutil/hashr.h</h1><a href="hashr_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment">    Copyright (C) 2003 by Jorrit Tyberghein</span>
<a name="l00003"></a>00003 <span class="comment">              (C) 2003 by Frank Richter</span>
<a name="l00004"></a>00004 <span class="comment"></span>
<a name="l00005"></a>00005 <span class="comment">    This library is free software; you can redistribute it and/or</span>
<a name="l00006"></a>00006 <span class="comment">    modify it under the terms of the GNU Library General Public</span>
<a name="l00007"></a>00007 <span class="comment">    License as published by the Free Software Foundation; either</span>
<a name="l00008"></a>00008 <span class="comment">    version 2 of the License, or (at your option) any later version.</span>
<a name="l00009"></a>00009 <span class="comment"></span>
<a name="l00010"></a>00010 <span class="comment">    This library is distributed in the hope that it will be useful,</span>
<a name="l00011"></a>00011 <span class="comment">    but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00012"></a>00012 <span class="comment">    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU</span>
<a name="l00013"></a>00013 <span class="comment">    Library General Public License for more details.</span>
<a name="l00014"></a>00014 <span class="comment"></span>
<a name="l00015"></a>00015 <span class="comment">    You should have received a copy of the GNU Library General Public</span>
<a name="l00016"></a>00016 <span class="comment">    License along with this library; if not, write to the Free</span>
<a name="l00017"></a>00017 <span class="comment">    Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.</span>
<a name="l00018"></a>00018 <span class="comment">*/</span>
<a name="l00019"></a>00019 
<a name="l00024"></a>00024 <span class="preprocessor">#ifndef __CS_UTIL_HASHR_H__</span>
<a name="l00025"></a>00025 <span class="preprocessor"></span><span class="preprocessor">#define __CS_UTIL_HASHR_H__</span>
<a name="l00026"></a>00026 <span class="preprocessor"></span>
<a name="l00027"></a>00027 <span class="preprocessor">#include "<a class="code" href="hash_8h.html" title="A generic hash table.">csutil/hash.h</a>"</span>
<a name="l00028"></a>00028  
<a name="l00032"></a>00032 
<a name="l00033"></a>00033 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T, <span class="keyword">class</span> K = <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>&gt; 
<a name="l00034"></a><a class="code" href="classcsHashReversible.html">00034</a> <span class="keyword">class </span><a class="code" href="classcsHashReversible.html" title="A csHash&amp;lt;&amp;gt; that maintains a reverse hash for indexing keys by values.">csHashReversible</a> : <span class="keyword">public</span> <a class="code" href="classcsHash.html" title="A generic hash table class, which grows dynamically and whose buckets are unsorted...">csHash</a>&lt;T, K&gt;
<a name="l00035"></a>00035 {
<a name="l00036"></a>00036   <a class="code" href="classcsHash.html" title="A generic hash table class, which grows dynamically and whose buckets are unsorted...">csHash&lt;K, T&gt;</a> reverse;
<a name="l00037"></a>00037 <span class="keyword">public</span>:
<a name="l00051"></a><a class="code" href="classcsHashReversible.html#515d7120e465c7cdb1514a7209453070">00051</a>   <a class="code" href="classcsHashReversible.html#515d7120e465c7cdb1514a7209453070" title="Construct a hash table with an array of the given size, which for optimisation reasons...">csHashReversible</a> (<span class="keywordtype">int</span> size = 23, <span class="keywordtype">int</span> grow_rate = 5, <span class="keywordtype">int</span> max_size = 20000) :
<a name="l00052"></a>00052     <a class="code" href="classcsHash.html" title="A generic hash table class, which grows dynamically and whose buckets are unsorted...">csHash</a>&lt;T, K&gt; (size, grow_rate, max_size), 
<a name="l00053"></a>00053     reverse (size, grow_rate, max_size)
<a name="l00054"></a>00054   {
<a name="l00055"></a>00055   }
<a name="l00059"></a><a class="code" href="classcsHashReversible.html#9c25406a6642d4e8f2d8a7d4da52b089">00059</a>   <span class="keywordtype">void</span> <a class="code" href="classcsHashReversible.html#9c25406a6642d4e8f2d8a7d4da52b089" title="Add an element to the hash and reverse table.">Put</a> (<span class="keyword">const</span> K&amp; key, <span class="keyword">const</span> T &amp;value)
<a name="l00060"></a>00060   {
<a name="l00061"></a>00061     <a class="code" href="classcsHash.html#25d78ac60667a3f6950ef9212db6a12c" title="Add an element to the hash table.">csHash&lt;T, K&gt;::Put</a> (key, value);
<a name="l00062"></a>00062     reverse.<a class="code" href="classcsHash.html#25d78ac60667a3f6950ef9212db6a12c" title="Add an element to the hash table.">Put</a> (value, key);
<a name="l00063"></a>00063   }
<a name="l00064"></a>00064 
<a name="l00069"></a><a class="code" href="classcsHashReversible.html#9942c91231ae37ef9bfe08966348e24e">00069</a>   <span class="keywordtype">void</span> <a class="code" href="classcsHashReversible.html#9942c91231ae37ef9bfe08966348e24e" title="Add an element to the hash and to the reverse table.">PutUnique</a> (<span class="keyword">const</span> K&amp; key, <span class="keyword">const</span> T &amp;value)
<a name="l00070"></a>00070   {
<a name="l00071"></a>00071     <a class="code" href="classcsHash.html#26669d4e89f8a5615cbb974442cf92ab" title="Add an element to the hash table, overwriting if the key already exists.">csHash&lt;T, K&gt;::PutUnique</a> (key, value);
<a name="l00072"></a>00072     reverse.<a class="code" href="classcsHash.html#26669d4e89f8a5615cbb974442cf92ab" title="Add an element to the hash table, overwriting if the key already exists.">PutUnique</a> (value, key);
<a name="l00073"></a>00073   }
<a name="l00074"></a>00074 
<a name="l00079"></a><a class="code" href="classcsHashReversible.html#7af49a66a38bfa2ca2dccd64935df959">00079</a>   <span class="keyword">const</span> K* <a class="code" href="classcsHashReversible.html#7af49a66a38bfa2ca2dccd64935df959" title="Get a pointer to the first key matching the given value, or 0 if there is none.">GetKeyPointer</a> (<span class="keyword">const</span> T&amp; key)<span class="keyword"> const</span>
<a name="l00080"></a>00080 <span class="keyword">  </span>{
<a name="l00081"></a>00081     <span class="keywordflow">return</span> reverse.<a class="code" href="classcsHash.html#be068c7c222f4e78640e990a1810b6c5" title="Get a pointer to the first element matching the given key, or 0 if there is none...">GetElementPointer</a> (key);
<a name="l00082"></a>00082   }
<a name="l00083"></a>00083  
<a name="l00088"></a><a class="code" href="classcsHashReversible.html#df9e60784822033fd979ea74be9edf7d">00088</a>   <span class="keyword">const</span> K&amp; <a class="code" href="classcsHashReversible.html#df9e60784822033fd979ea74be9edf7d" title="Get the first key matching the given value, or fallback if there is none.">GetKey</a> (<span class="keyword">const</span> T&amp; key, <span class="keyword">const</span> K&amp; fallback)<span class="keyword"> const</span>
<a name="l00089"></a>00089 <span class="keyword">  </span>{
<a name="l00090"></a>00090     <span class="keywordflow">return</span> reverse.<a class="code" href="classcsHash.html#2241e61d25ae5030e3e3174bfccc079f" title="Get the first element matching the given key, or fallback if there is none.">Get</a> (key, fallback);
<a name="l00091"></a>00091   }
<a name="l00092"></a>00092 };
<a name="l00093"></a>00093 
<a name="l00096"></a>00096 <span class="preprocessor">#endif // __CS_UTIL_HASHR_H__</span>
</pre></div><hr size="1"><address><small>Generated for Crystal Space 1.2.1 by 
<a href="http://www.doxygen.org/index.html">doxygen</a> 1.5.3 
</small></address> </div></body> </html>

Perl :: Catalyst :: PostgreSQL :: RPM Valid HTML 4.01 Transitional