📄 ahashp_8h-source.html
字号:
<a name="l00113"></a>00113 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> KEY_TYPE><a name="l00114"></a><a class="code" href="class__HashP.html#8532366c1aef5677f09c6118e059e314">00114</a> <a class="code" href="class__HashP.html#8532366c1aef5677f09c6118e059e314">_HashP<T, KEY_TYPE>::_HashP</a>(<span class="keywordtype">int</span> nBucketSize) : <a class="code" href="class____hash.html">__hash</a><T>(nBucketSize) {<a name="l00115"></a>00115 <span class="preprocessor"> #ifdef HASH_BENCHMARK</span><a name="l00116"></a>00116 <span class="preprocessor"></span> m_nGetCollisionCount = 0;<a name="l00117"></a>00117 m_nGetCallCount = 0;<a name="l00118"></a>00118 <span class="preprocessor"> #endif</span><a name="l00119"></a>00119 <span class="preprocessor"></span>}<a name="l00120"></a>00120 <a name="l00121"></a>00121 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> KEY_TYPE><a name="l00122"></a><a class="code" href="class__HashP.html#7e6755d6859d109e884dca47317742bf">00122</a> T &<a class="code" href="class__HashP.html#7e6755d6859d109e884dca47317742bf">_HashP<T, KEY_TYPE>::Set</a>(<span class="keyword">const</span> T &def) {<a name="l00123"></a>00123 T *p = <a class="code" href="class__HashP.html#7d1fca31b4325a61bd9e524da66674d5">Get</a>(def);<a name="l00124"></a>00124 <span class="keywordflow">if</span> (p == NULL) <span class="keywordflow">return</span> <a class="code" href="class____hash.html#13e7745fa4ebf4cefd9381da205b0978">Add</a>(def);<a name="l00125"></a>00125 *p = def;<a name="l00126"></a>00126 <span class="keywordflow">return</span> *p;<a name="l00127"></a>00127 }<a name="l00128"></a>00128 <a name="l00129"></a>00129 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> KEY_TYPE><a name="l00130"></a><a class="code" href="class__HashP.html#3ee36fa83d4d6370c6713bdc0a43bcf0">00130</a> <span class="keyword">const</span> T *<a class="code" href="class__HashP.html#3ee36fa83d4d6370c6713bdc0a43bcf0">_HashP<T, KEY_TYPE>::Find</a>(KEY_TYPE ref)<span class="keyword"> const </span>{<a name="l00131"></a>00131 <span class="preprocessor"> #ifdef HASH_BENCHMARK</span><a name="l00132"></a>00132 <span class="preprocessor"></span> <span class="keywordtype">int</span> *pCollisionCount = const_cast<int*>(&m_nGetCollisionCount);<a name="l00133"></a>00133 (*pCollisionCount)++;<a name="l00134"></a>00134 <span class="preprocessor"> #endif</span><a name="l00135"></a>00135 <span class="preprocessor"></span> <span class="keyword">const</span> <a class="code" href="class__HashP.html#045d3db5af611c34f7cad1291f8c212d">bucket_array</a> &buckets = <a class="code" href="class____hash.html">__hash<T>::m_buckets</a>;<a name="l00136"></a>00136 assert(!buckets.empty());<a name="l00137"></a>00137 <a class="code" href="class__HashP.html#36bec57ba42a749f9e6576b0b62962e3">bucket_array_unit</a> nIndex = <a class="code" href="class__HashP.html#d5b50e26f6f37022a0fc347880267750">GetHashReference</a>(ref);<a name="l00138"></a>00138 assert(nIndex < buckets.size());<a name="l00139"></a>00139 <span class="keywordflow">for</span>(<span class="keyword">const</span> <a class="code" href="class____hash_1_1listelement.html">listelement</a> *pElement = buckets[nIndex].head(); pElement != NULL; pElement = pElement->next()) {<a name="l00140"></a>00140 <span class="keywordflow">if</span> (<a class="code" href="class__HashP.html#4a91aaccf66b4a916a0f4d27fb6aff29">CompareReferences</a>(pElement->m_element, ref)) <span class="keywordflow">return</span> &pElement->m_element;<a name="l00141"></a>00141 <span class="preprocessor"> #ifdef HASH_BENCHMARK</span><a name="l00142"></a>00142 <span class="preprocessor"></span> <span class="keywordtype">int</span> *pCollisionCount = const_cast<int*>(&m_nGetCollisionCount);<a name="l00143"></a>00143 (*pCollisionCount)++;<a name="l00144"></a>00144 <span class="preprocessor"> #endif</span><a name="l00145"></a>00145 <span class="preprocessor"></span> }<a name="l00146"></a>00146 <span class="keywordflow">return</span> NULL;<a name="l00147"></a>00147 }<a name="l00148"></a>00148 <a name="l00149"></a>00149 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> KEY_TYPE><a name="l00150"></a><a class="code" href="class__HashP.html#f66e108d50b7fda46362f051567beb2d">00150</a> T *<a class="code" href="class__HashP.html#7d1fca31b4325a61bd9e524da66674d5">_HashP<T, KEY_TYPE>::Get</a>(KEY_TYPE ref) {<a name="l00151"></a>00151 <span class="preprocessor"> #ifdef HASH_BENCHMARK</span><a name="l00152"></a>00152 <span class="preprocessor"></span> m_nGetCallCount++;<a name="l00153"></a>00153 <span class="preprocessor"> #endif</span><a name="l00154"></a>00154 <span class="preprocessor"></span> <a class="code" href="class__HashP.html#045d3db5af611c34f7cad1291f8c212d">bucket_array</a> &buckets = <a class="code" href="class____hash.html">__hash<T>::m_buckets</a>;<a name="l00155"></a>00155 assert(!buckets.empty());<a name="l00156"></a>00156 <a class="code" href="class__HashP.html#36bec57ba42a749f9e6576b0b62962e3">bucket_array_unit</a> nIndex = <a class="code" href="class__HashP.html#d5b50e26f6f37022a0fc347880267750">GetHashReference</a>(ref);<a name="l00157"></a>00157 <span class="keywordflow">for</span>(<a class="code" href="class____hash_1_1listelement.html">listelement</a> *pElement = buckets[nIndex].head(); pElement != NULL; pElement = pElement->next()) {<a name="l00158"></a>00158 <span class="keywordflow">if</span> (<a class="code" href="class__HashP.html#4a91aaccf66b4a916a0f4d27fb6aff29">CompareReferences</a>(pElement->m_element, ref)) <span class="keywordflow">return</span> &pElement->m_element;<a name="l00159"></a>00159 <span class="preprocessor"> #ifdef HASH_BENCHMARK</span><a name="l00160"></a>00160 <span class="preprocessor"></span> m_nGetCollisionCount++;<a name="l00161"></a>00161 <span class="preprocessor"> #endif</span><a name="l00162"></a>00162 <span class="preprocessor"></span> }<a name="l00163"></a>00163 <span class="keywordflow">return</span> NULL;<a name="l00164"></a>00164 }<a name="l00165"></a>00165 <a name="l00170"></a>00170 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> KEY_TYPE><a name="l00171"></a><a class="code" href="class__HashP.html#5e4e2a94d9a033bac864588b4abe8488">00171</a> <span class="keywordtype">void</span> <a class="code" href="class__HashP.html#5e4e2a94d9a033bac864588b4abe8488">_HashP<T, KEY_TYPE>::erase</a>(KEY_TYPE r) {<a name="l00172"></a>00172 <a class="code" href="class____hash_1_1elementlist.html">phashelementlist</a> plist;<a name="l00173"></a>00173 <a class="code" href="class____hash_1_1listelement.html">listelement</a> *le = <a class="code" href="class__HashP.html#c02c81c0f04e0e4d5edce2518f5764df">SeekIterator</a>(plist, r);<a name="l00174"></a>00174 assert(le != NULL);<a name="l00175"></a>00175 plist-><a class="code" href="class____hash_1_1elementlist.html#ae463d4f876aab409907a32c196eb617">erase</a>(le);<a name="l00176"></a>00176 <a class="code" href="class____hash.html">__hash<T>::m_nCount</a>--;<a name="l00177"></a>00177 }<a name="l00178"></a>00178 <a name="l00185"></a>00185 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> KEY_TYPE><a name="l00186"></a><a class="code" href="class__HashP.html#c02c81c0f04e0e4d5edce2518f5764df">00186</a> <span class="keyword">typename</span> <a class="code" href="class__HashP.html">_HashP<T, KEY_TYPE>::listelement</a> *<a class="code" href="class__HashP.html#c02c81c0f04e0e4d5edce2518f5764df">_HashP<T, KEY_TYPE>::SeekIterator</a>(<a class="code" href="class____hash_1_1elementlist.html">phashelementlist</a> &plist, KEY_TYPE ref) {<a name="l00187"></a>00187 <a class="code" href="class__HashP.html#045d3db5af611c34f7cad1291f8c212d">bucket_array</a> &table = <a class="code" href="class____hash.html">__hash<T>::m_buckets</a>;<a name="l00188"></a>00188 assert(!table.empty());<a name="l00189"></a>00189 <a class="code" href="class__HashP.html#36bec57ba42a749f9e6576b0b62962e3">bucket_array_unit</a> nIndex = <a class="code" href="class__HashP.html#d5b50e26f6f37022a0fc347880267750">GetHashReference</a>(ref);<a name="l00190"></a>00190 assert(nIndex < table.size());<a name="l00191"></a>00191 plist = &table[nIndex];<a name="l00192"></a>00192 <span class="keywordflow">for</span>(<a class="code" href="class____hash_1_1listelement.html">listelement</a> *p = plist->head(); p != NULL; p = p->next()) {<a name="l00193"></a>00193 #ifdef DEBUG_AHASH<a name="l00194"></a>00194 assert(table[nIndex].BothNULLorNonNULL());<a name="l00195"></a>00195 <span class="preprocessor"> #endif</span><a name="l00196"></a>00196 <span class="preprocessor"></span> <span class="keywordflow">if</span> (<a class="code" href="class__HashP.html#4a91aaccf66b4a916a0f4d27fb6aff29">CompareReferences</a>(p->m_element, ref)) {<a name="l00197"></a>00197 <span class="keywordflow">return</span> p;<a name="l00198"></a>00198 }<a name="l00199"></a>00199 }<a name="l00200"></a>00200 <span class="keywordflow">return</span> NULL;<a name="l00201"></a>00201 }<a name="l00202"></a>00202 <a name="l00203"></a>00203 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Fri Feb 1 13:27:18 2008 for ahash by <a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.0 </small></address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -