<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>jrtplib: src/rtpkeyhashtable.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="jrtplib.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="dirs.html"><span>Directories</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<div class="navpath"><a class="el" href="dir_e5298977290e638844c8018a73ab0caf.html">src</a>
</div>
</div>
<div class="contents">
<h1>rtpkeyhashtable.h</h1><a href="rtpkeyhashtable_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"></span>
<a name="l00003"></a>00003 <span class="comment"> This file is a part of JRTPLIB</span>
<a name="l00004"></a>00004 <span class="comment"> Copyright (c) 1999-2007 Jori Liesenborgs</span>
<a name="l00005"></a>00005 <span class="comment"></span>
<a name="l00006"></a>00006 <span class="comment"> Contact: jori.liesenborgs@gmail.com</span>
<a name="l00007"></a>00007 <span class="comment"></span>
<a name="l00008"></a>00008 <span class="comment"> This library was developed at the "Expertisecentrum Digitale Media"</span>
<a name="l00009"></a>00009 <span class="comment"> (http://www.edm.uhasselt.be), a research center of the Hasselt University</span>
<a name="l00010"></a>00010 <span class="comment"> (http://www.uhasselt.be). The library is based upon work done for </span>
<a name="l00011"></a>00011 <span class="comment"> my thesis at the School for Knowledge Technology (Belgium/The Netherlands).</span>
<a name="l00012"></a>00012 <span class="comment"></span>
<a name="l00013"></a>00013 <span class="comment"> Permission is hereby granted, free of charge, to any person obtaining a</span>
<a name="l00014"></a>00014 <span class="comment"> copy of this software and associated documentation files (the "Software"),</span>
<a name="l00015"></a>00015 <span class="comment"> to deal in the Software without restriction, including without limitation</span>
<a name="l00016"></a>00016 <span class="comment"> the rights to use, copy, modify, merge, publish, distribute, sublicense,</span>
<a name="l00017"></a>00017 <span class="comment"> and/or sell copies of the Software, and to permit persons to whom the</span>
<a name="l00018"></a>00018 <span class="comment"> Software is furnished to do so, subject to the following conditions:</span>
<a name="l00019"></a>00019 <span class="comment"></span>
<a name="l00020"></a>00020 <span class="comment"> The above copyright notice and this permission notice shall be included</span>
<a name="l00021"></a>00021 <span class="comment"> in all copies or substantial portions of the Software.</span>
<a name="l00022"></a>00022 <span class="comment"></span>
<a name="l00023"></a>00023 <span class="comment"> THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS</span>
<a name="l00024"></a>00024 <span class="comment"> OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,</span>
<a name="l00025"></a>00025 <span class="comment"> FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL</span>
<a name="l00026"></a>00026 <span class="comment"> THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER</span>
<a name="l00027"></a>00027 <span class="comment"> LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING</span>
<a name="l00028"></a>00028 <span class="comment"> FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS</span>
<a name="l00029"></a>00029 <span class="comment"> IN THE SOFTWARE.</span>
<a name="l00030"></a>00030 <span class="comment"></span>
<a name="l00031"></a>00031 <span class="comment">*/</span>
<a name="l00032"></a>00032
<a name="l00037"></a>00037 <span class="preprocessor">#ifndef RTPKEYHASHTABLE_H</span>
<a name="l00038"></a>00038 <span class="preprocessor"></span>
<a name="l00039"></a>00039 <span class="preprocessor">#define RTPKEYHASHTABLE_H</span>
<a name="l00040"></a>00040 <span class="preprocessor"></span>
<a name="l00041"></a>00041 <span class="preprocessor">#include "rtpconfig.h"</span>
<a name="l00042"></a>00042 <span class="preprocessor">#include "<a class="code" href="rtperrors_8h.html">rtperrors.h</a>"</span>
<a name="l00043"></a>00043 <span class="preprocessor">#include "<a class="code" href="rtpmemoryobject_8h.html">rtpmemoryobject.h</a>"</span>
<a name="l00044"></a>00044
<a name="l00045"></a>00045 <span class="preprocessor">#ifdef RTPDEBUG</span>
<a name="l00046"></a>00046 <span class="preprocessor"></span><span class="preprocessor">#include <iostream></span>
<a name="l00047"></a>00047 <span class="preprocessor">#endif // RTPDEBUG</span>
<a name="l00048"></a>00048 <span class="preprocessor"></span>
<a name="l00049"></a>00049 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00050"></a>00050 <span class="keyword">class </span>RTPKeyHashTable : <span class="keyword">public</span> RTPMemoryObject
<a name="l00051"></a>00051 {
<a name="l00052"></a>00052 <span class="keyword">public</span>:
<a name="l00053"></a>00053 RTPKeyHashTable(<a class="code" href="classRTPMemoryManager.html" title="A memory manager.">RTPMemoryManager</a> *mgr = 0,<span class="keywordtype">int</span> memtype = <a class="code" href="rtpmemorymanager_8h.html#16fbfc927790ee814e3f28c20347143c" title="Used to indicate a general kind of memory block.">RTPMEM_TYPE_OTHER</a>);
<a name="l00054"></a>00054 ~RTPKeyHashTable() { Clear(); }
<a name="l00055"></a>00055
<a name="l00056"></a>00056 <span class="keywordtype">void</span> GotoFirstElement() { curhashelem = firsthashelem; }
<a name="l00057"></a>00057 <span class="keywordtype">void</span> GotoLastElement() { curhashelem = lasthashelem; }
<a name="l00058"></a>00058 <span class="keywordtype">bool</span> HasCurrentElement() { <span class="keywordflow">return</span> (curhashelem == 0)?<span class="keyword">false</span>:<span class="keyword">true</span>; }
<a name="l00059"></a>00059 <span class="keywordtype">int</span> DeleteCurrentElement();
<a name="l00060"></a>00060 Element &GetCurrentElement() { <span class="keywordflow">return</span> curhashelem->GetElement(); }
<a name="l00061"></a>00061 Key &GetCurrentKey() { <span class="keywordflow">return</span> curhashelem->GetKey(); }
<a name="l00062"></a>00062 <span class="keywordtype">int</span> GotoElement(<span class="keyword">const</span> Key &k);
<a name="l00063"></a>00063 <span class="keywordtype">bool</span> HasElement(<span class="keyword">const</span> Key &k);
<a name="l00064"></a>00064 <span class="keywordtype">void</span> GotoNextElement();
<a name="l00065"></a>00065 <span class="keywordtype">void</span> GotoPreviousElement();
<a name="l00066"></a>00066 <span class="keywordtype">void</span> Clear();
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="keywordtype">int</span> AddElement(<span class="keyword">const</span> Key &k,<span class="keyword">const</span> Element &elem);
<a name="l00069"></a>00069 <span class="keywordtype">int</span> DeleteElement(<span class="keyword">const</span> Key &k);
<a name="l00070"></a>00070
<a name="l00071"></a>00071 <span class="preprocessor">#ifdef RTPDEBUG</span>
<a name="l00072"></a>00072 <span class="preprocessor"></span> <span class="keywordtype">void</span> Dump();
<a name="l00073"></a>00073 <span class="preprocessor">#endif // RTPDEBUG</span>
<a name="l00074"></a>00074 <span class="preprocessor"></span><span class="keyword">private</span>:
<a name="l00075"></a>00075 <span class="keyword">class </span>HashElement
<a name="l00076"></a>00076 {
<a name="l00077"></a>00077 <span class="keyword">public</span>:
<a name="l00078"></a>00078 HashElement(<span class="keyword">const</span> Key &k,<span class="keyword">const</span> Element &e,<span class="keywordtype">int</span> index):key(k),element(e) { hashprev = 0; hashnext = 0; listnext = 0; listprev = 0; hashindex = index; }
<a name="l00079"></a>00079 <span class="keywordtype">int</span> GetHashIndex() { <span class="keywordflow">return</span> hashindex; }
<a name="l00080"></a>00080 Key &GetKey() { <span class="keywordflow">return</span> key; }
<a name="l00081"></a>00081 Element &GetElement() { <span class="keywordflow">return</span> element; }
<a name="l00082"></a>00082 <span class="preprocessor">#ifdef RTPDEBUG</span>
<a name="l00083"></a>00083 <span class="preprocessor"></span> <span class="keywordtype">void</span> Dump() { std::cout << <span class="stringliteral">"\tHash index "</span> << hashindex << <span class="stringliteral">" | Key "</span> << key << <span class="stringliteral">" | Element "</span> << element << std::endl; }
<a name="l00084"></a>00084 <span class="preprocessor">#endif // RTPDEBUG</span>
<a name="l00085"></a>00085 <span class="preprocessor"></span> <span class="keyword">private</span>:
<a name="l00086"></a>00086 <span class="keywordtype">int</span> hashindex;
<a name="l00087"></a>00087 Key key;
<a name="l00088"></a>00088 Element element;
<a name="l00089"></a>00089 <span class="keyword">public</span>:
<a name="l00090"></a>00090 HashElement *hashprev,*hashnext;
<a name="l00091"></a>00091 HashElement *listprev,*listnext;
<a name="l00092"></a>00092 };
<a name="l00093"></a>00093
<a name="l00094"></a>00094 HashElement *table[hashsize];
<a name="l00095"></a>00095 HashElement *firsthashelem,*lasthashelem;
<a name="l00096"></a>00096 HashElement *curhashelem;
<a name="l00097"></a>00097 <span class="preprocessor">#ifdef RTP_SUPPORT_MEMORYMANAGEMENT</span>
<a name="l00098"></a>00098 <span class="preprocessor"></span> <span class="keywordtype">int</span> memorytype;
<a name="l00099"></a>00099 <span class="preprocessor">#endif // RTP_SUPPORT_MEMORYMANAGEMENT</span>
<a name="l00100"></a>00100 <span class="preprocessor"></span>};
<a name="l00101"></a>00101
<a name="l00102"></a>00102 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00103"></a>00103 <span class="keyword">inline</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::RTPKeyHashTable(<a class="code" href="classRTPMemoryManager.html" title="A memory manager.">RTPMemoryManager</a> *mgr,<span class="keywordtype">int</span> memtype) : RTPMemoryObject(mgr)
<a name="l00104"></a>00104 {
<a name="l00105"></a>00105 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0 ; i < hashsize ; i++)
<a name="l00106"></a>00106 table[i] = 0;
<a name="l00107"></a>00107 firsthashelem = 0;
<a name="l00108"></a>00108 lasthashelem = 0;
<a name="l00109"></a>00109 <span class="preprocessor">#ifdef RTP_SUPPORT_MEMORYMANAGEMENT</span>
<a name="l00110"></a>00110 <span class="preprocessor"></span> memorytype = memtype;
<a name="l00111"></a>00111 <span class="preprocessor">#endif // RTP_SUPPORT_MEMORYMANAGEMENT</span>
<a name="l00112"></a>00112 <span class="preprocessor"></span>}
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00115"></a>00115 <span class="keyword">inline</span> <span class="keywordtype">int</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::DeleteCurrentElement()
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 <span class="keywordflow">if</span> (curhashelem)
<a name="l00118"></a>00118 {
<a name="l00119"></a>00119 HashElement *tmp1,*tmp2;
<a name="l00120"></a>00120 <span class="keywordtype">int</span> index;
<a name="l00121"></a>00121
<a name="l00122"></a>00122 <span class="comment">// First, relink elements in current hash bucket</span>
<a name="l00123"></a>00123
<a name="l00124"></a>00124 index = curhashelem->GetHashIndex();
<a name="l00125"></a>00125 tmp1 = curhashelem->hashprev;
<a name="l00126"></a>00126 tmp2 = curhashelem->hashnext;
<a name="l00127"></a>00127 <span class="keywordflow">if</span> (tmp1 == 0) <span class="comment">// no previous element in hash bucket</span>
<a name="l00128"></a>00128 {
<a name="l00129"></a>00129 table[index] = tmp2;
<a name="l00130"></a>00130 <span class="keywordflow">if</span> (tmp2 != 0)
<a name="l00131"></a>00131 tmp2->hashprev = 0;
<a name="l00132"></a>00132 }
<a name="l00133"></a>00133 <span class="keywordflow">else</span> <span class="comment">// there is a previous element in the hash bucket</span>
<a name="l00134"></a>00134 {
<a name="l00135"></a>00135 tmp1->hashnext = tmp2;
<a name="l00136"></a>00136 <span class="keywordflow">if</span> (tmp2 != 0)
<a name="l00137"></a>00137 tmp2->hashprev = tmp1;
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="comment">// Relink elements in list</span>
<a name="l00141"></a>00141
<a name="l00142"></a>00142 tmp1 = curhashelem->listprev;
<a name="l00143"></a>00143 tmp2 = curhashelem->listnext;
<a name="l00144"></a>00144 <span class="keywordflow">if</span> (tmp1 == 0) <span class="comment">// curhashelem is first in list</span>
<a name="l00145"></a>00145 {
<a name="l00146"></a>00146 firsthashelem = tmp2;
<a name="l00147"></a>00147 <span class="keywordflow">if</span> (tmp2 != 0)
<a name="l00148"></a>00148 tmp2->listprev = 0;
<a name="l00149"></a>00149 <span class="keywordflow">else</span> <span class="comment">// curhashelem is also last in list</span>
<a name="l00150"></a>00150 lasthashelem = 0;
<a name="l00151"></a>00151 }
<a name="l00152"></a>00152 <span class="keywordflow">else</span>
<a name="l00153"></a>00153 {
<a name="l00154"></a>00154 tmp1->listnext = tmp2;
<a name="l00155"></a>00155 <span class="keywordflow">if</span> (tmp2 != 0)
<a name="l00156"></a>00156 tmp2->listprev = tmp1;
<a name="l00157"></a>00157 <span class="keywordflow">else</span> <span class="comment">// curhashelem is last in list</span>
<a name="l00158"></a>00158 lasthashelem = tmp1;
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160
<a name="l00161"></a>00161 <span class="comment">// finally, with everything being relinked, we can delete curhashelem</span>
<a name="l00162"></a>00162 RTPDelete(curhashelem,GetMemoryManager());
<a name="l00163"></a>00163 curhashelem = tmp2; <span class="comment">// Set to next element in list</span>
<a name="l00164"></a>00164 }
<a name="l00165"></a>00165 <span class="keywordflow">else</span>
<a name="l00166"></a>00166 <span class="keywordflow">return</span> ERR_RTP_KEYHASHTABLE_NOCURRENTELEMENT;
<a name="l00167"></a>00167 <span class="keywordflow">return</span> 0;
<a name="l00168"></a>00168 }
<a name="l00169"></a>00169
<a name="l00170"></a>00170 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00171"></a>00171 <span class="keyword">inline</span> <span class="keywordtype">int</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::GotoElement(<span class="keyword">const</span> Key &k)
<a name="l00172"></a>00172 {
<a name="l00173"></a>00173 <span class="keywordtype">int</span> index;
<a name="l00174"></a>00174 <span class="keywordtype">bool</span> found;
<a name="l00175"></a>00175
<a name="l00176"></a>00176 index = GetIndex::GetIndex(k);
<a name="l00177"></a>00177 <span class="keywordflow">if</span> (index >= hashsize)
<a name="l00178"></a>00178 <span class="keywordflow">return</span> ERR_RTP_KEYHASHTABLE_FUNCTIONRETURNEDINVALIDHASHINDEX;
<a name="l00179"></a>00179
<a name="l00180"></a>00180 curhashelem = table[index];
<a name="l00181"></a>00181 found = <span class="keyword">false</span>;
<a name="l00182"></a>00182 <span class="keywordflow">while</span>(!found && curhashelem != 0)
<a name="l00183"></a>00183 {
<a name="l00184"></a>00184 <span class="keywordflow">if</span> (curhashelem->GetKey() == k)
<a name="l00185"></a>00185 found = <span class="keyword">true</span>;
<a name="l00186"></a>00186 <span class="keywordflow">else</span>
<a name="l00187"></a>00187 curhashelem = curhashelem->hashnext;
<a name="l00188"></a>00188 }
<a name="l00189"></a>00189 <span class="keywordflow">if</span> (!found)
<a name="l00190"></a>00190 <span class="keywordflow">return</span> ERR_RTP_KEYHASHTABLE_KEYNOTFOUND;
<a name="l00191"></a>00191 <span class="keywordflow">return</span> 0;
<a name="l00192"></a>00192 }
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00195"></a>00195 <span class="keyword">inline</span> <span class="keywordtype">bool</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::HasElement(<span class="keyword">const</span> Key &k)
<a name="l00196"></a>00196 {
<a name="l00197"></a>00197 <span class="keywordtype">int</span> index;
<a name="l00198"></a>00198 <span class="keywordtype">bool</span> found;
<a name="l00199"></a>00199 HashElement *tmp;
<a name="l00200"></a>00200
<a name="l00201"></a>00201 index = GetIndex::GetIndex(k);
<a name="l00202"></a>00202 <span class="keywordflow">if</span> (index >= hashsize)
<a name="l00203"></a>00203 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00204"></a>00204
<a name="l00205"></a>00205 tmp = table[index];
<a name="l00206"></a>00206 found = <span class="keyword">false</span>;
<a name="l00207"></a>00207 <span class="keywordflow">while</span>(!found && tmp != 0)
<a name="l00208"></a>00208 {
<a name="l00209"></a>00209 <span class="keywordflow">if</span> (tmp->GetKey() == k)
<a name="l00210"></a>00210 found = <span class="keyword">true</span>;
<a name="l00211"></a>00211 <span class="keywordflow">else</span>
<a name="l00212"></a>00212 tmp = tmp->hashnext;
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214 <span class="keywordflow">return</span> found;
<a name="l00215"></a>00215 }
<a name="l00216"></a>00216
<a name="l00217"></a>00217 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00218"></a>00218 <span class="keyword">inline</span> <span class="keywordtype">void</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::GotoNextElement()
<a name="l00219"></a>00219 {
<a name="l00220"></a>00220 <span class="keywordflow">if</span> (curhashelem)
<a name="l00221"></a>00221 curhashelem = curhashelem->listnext;
<a name="l00222"></a>00222 }
<a name="l00223"></a>00223
<a name="l00224"></a>00224 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00225"></a>00225 <span class="keyword">inline</span> <span class="keywordtype">void</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::GotoPreviousElement()
<a name="l00226"></a>00226 {
<a name="l00227"></a>00227 <span class="keywordflow">if</span> (curhashelem)
<a name="l00228"></a>00228 curhashelem = curhashelem->listprev;
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230
<a name="l00231"></a>00231 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00232"></a>00232 <span class="keyword">inline</span> <span class="keywordtype">void</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::Clear()
<a name="l00233"></a>00233 {
<a name="l00234"></a>00234 HashElement *tmp1,*tmp2;
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0 ; i < hashsize ; i++)
<a name="l00237"></a>00237 table[i] = 0;
<a name="l00238"></a>00238
<a name="l00239"></a>00239 tmp1 = firsthashelem;
<a name="l00240"></a>00240 <span class="keywordflow">while</span> (tmp1 != 0)
<a name="l00241"></a>00241 {
<a name="l00242"></a>00242 tmp2 = tmp1->listnext;
<a name="l00243"></a>00243 RTPDelete(tmp1,GetMemoryManager());
<a name="l00244"></a>00244 tmp1 = tmp2;
<a name="l00245"></a>00245 }
<a name="l00246"></a>00246 firsthashelem = 0;
<a name="l00247"></a>00247 lasthashelem = 0;
<a name="l00248"></a>00248 }
<a name="l00249"></a>00249
<a name="l00250"></a>00250 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00251"></a>00251 <span class="keyword">inline</span> <span class="keywordtype">int</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::AddElement(<span class="keyword">const</span> Key &k,<span class="keyword">const</span> Element &elem)
<a name="l00252"></a>00252 {
<a name="l00253"></a>00253 <span class="keywordtype">int</span> index;
<a name="l00254"></a>00254 <span class="keywordtype">bool</span> found;
<a name="l00255"></a>00255 HashElement *e,*newelem;
<a name="l00256"></a>00256
<a name="l00257"></a>00257 index = GetIndex::GetIndex(k);
<a name="l00258"></a>00258 <span class="keywordflow">if</span> (index >= hashsize)
<a name="l00259"></a>00259 <span class="keywordflow">return</span> ERR_RTP_KEYHASHTABLE_FUNCTIONRETURNEDINVALIDHASHINDEX;
<a name="l00260"></a>00260
<a name="l00261"></a>00261 e = table[index];
<a name="l00262"></a>00262 found = <span class="keyword">false</span>;
<a name="l00263"></a>00263 <span class="keywordflow">while</span>(!found && e != 0)
<a name="l00264"></a>00264 {
<a name="l00265"></a>00265 <span class="keywordflow">if</span> (e->GetKey() == k)
<a name="l00266"></a>00266 found = <span class="keyword">true</span>;
<a name="l00267"></a>00267 <span class="keywordflow">else</span>
<a name="l00268"></a>00268 e = e->hashnext;
<a name="l00269"></a>00269 }
<a name="l00270"></a>00270 <span class="keywordflow">if</span> (found)
<a name="l00271"></a>00271 <span class="keywordflow">return</span> ERR_RTP_KEYHASHTABLE_KEYALREADYEXISTS;
<a name="l00272"></a>00272
<a name="l00273"></a>00273 <span class="comment">// Okay, the key doesn't exist, so we can add the new element in the hash table</span>
<a name="l00274"></a>00274
<a name="l00275"></a>00275 newelem = RTPNew(GetMemoryManager(),memorytype) HashElement(k,elem,index);
<a name="l00276"></a>00276 if (newelem == 0)
<a name="l00277"></a>00277 return ERR_RTP_OUTOFMEM;
<a name="l00278"></a>00278
<a name="l00279"></a>00279 e = table[index];
<a name="l00280"></a>00280 table[index] = newelem;
<a name="l00281"></a>00281 newelem->hashnext = e;
<a name="l00282"></a>00282 if (e != 0)
<a name="l00283"></a>00283 e->hashprev = newelem;
<a name="l00284"></a>00284
<a name="l00285"></a>00285 <span class="comment">// Now, we still got to add it to the linked list</span>
<a name="l00286"></a>00286
<a name="l00287"></a>00287 if (firsthashelem == 0)
<a name="l00288"></a>00288 {
<a name="l00289"></a>00289 firsthashelem = newelem;
<a name="l00290"></a>00290 lasthashelem = newelem;
<a name="l00291"></a>00291 }
<a name="l00292"></a>00292 <span class="keywordflow">else</span> <span class="comment">// there already are some elements in the list</span>
<a name="l00293"></a>00293 {
<a name="l00294"></a>00294 lasthashelem->listnext = newelem;
<a name="l00295"></a>00295 newelem->listprev = lasthashelem;
<a name="l00296"></a>00296 lasthashelem = newelem;
<a name="l00297"></a>00297 }
<a name="l00298"></a>00298 <span class="keywordflow">return</span> 0;
<a name="l00299"></a>00299 }
<a name="l00300"></a>00300
<a name="l00301"></a>00301 <span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00302"></a>00302 <span class="keyword">inline</span> <span class="keywordtype">int</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::DeleteElement(<span class="keyword">const</span> Key &k)
<a name="l00303"></a>00303 {
<a name="l00304"></a>00304 <span class="keywordtype">int</span> status;
<a name="l00305"></a>00305
<a name="l00306"></a>00306 status = GotoElement(k);
<a name="l00307"></a>00307 <span class="keywordflow">if</span> (status < 0)
<a name="l00308"></a>00308 <span class="keywordflow">return</span> status;
<a name="l00309"></a>00309 <span class="keywordflow">return</span> DeleteCurrentElement();
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="preprocessor">#ifdef RTPDEBUG</span>
<a name="l00313"></a>00313 <span class="preprocessor"></span><span class="keyword">template</span><<span class="keyword">class</span> Key,<span class="keyword">class</span> Element,<span class="keyword">class</span> GetIndex,<span class="keywordtype">int</span> hashsize>
<a name="l00314"></a>00314 <span class="keyword">inline</span> <span class="keywordtype">void</span> RTPKeyHashTable<Key,Element,GetIndex,hashsize>::Dump()
<a name="l00315"></a>00315 {
<a name="l00316"></a>00316 HashElement *e;
<a name="l00317"></a>00317
<a name="l00318"></a>00318 std::cout << <span class="stringliteral">"DUMPING TABLE CONTENTS:"</span> << std::endl;
<a name="l00319"></a>00319 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0 ; i < hashsize ; i++)
<a name="l00320"></a>00320 {
<a name="l00321"></a>00321 e = table[i];
<a name="l00322"></a>00322 <span class="keywordflow">while</span> (e != 0)
<a name="l00323"></a>00323 {
<a name="l00324"></a>00324 e->Dump();
<a name="l00325"></a>00325 e = e->hashnext;
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327 }
<a name="l00328"></a>00328
<a name="l00329"></a>00329 std::cout << <span class="stringliteral">"DUMPING LIST CONTENTS:"</span> << std::endl;
<a name="l00330"></a>00330 e = firsthashelem;
<a name="l00331"></a>00331 <span class="keywordflow">while</span> (e != 0)
<a name="l00332"></a>00332 {
<a name="l00333"></a>00333 e->Dump();
<a name="l00334"></a>00334 e = e->listnext;
<a name="l00335"></a>00335 }
<a name="l00336"></a>00336 }
<a name="l00337"></a>00337 <span class="preprocessor">#endif // RTPDEBUG</span>
<a name="l00338"></a>00338 <span class="preprocessor"></span>
<a name="l00339"></a>00339 <span class="preprocessor">#endif // RTPKEYHASHTABLE_H</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Sun Jul 26 09:42:07 2009 for jrtplib by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.9 </small></address>
</body>
</html>
