| author | Graeme Price <GRAEME.PRICE@NOKIA.COM> |
| Fri, 15 Oct 2010 14:32:18 +0100 | |
| changeset 15 | 307f4279f433 |
| parent 6 | 43e37759235e |
| permissions | -rw-r--r-- |
<!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>TB9.2 Example Applications: examples/Base/HashTableExample/hashtableexample.cpp Source File</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.2 --> <h1>examples/Base/HashTableExample/hashtableexample.cpp</h1><a href="hashtableexample_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).</span> <a name="l00002"></a>00002 <span class="comment">// All rights reserved.</span> <a name="l00003"></a>00003 <span class="comment">// This component and the accompanying materials are made available</span> <a name="l00004"></a>00004 <span class="comment">// under the terms of "Eclipse Public License v1.0"</span> <a name="l00005"></a>00005 <span class="comment">// which accompanies this distribution, and is available</span> <a name="l00006"></a>00006 <span class="comment">// at the URL "http://www.eclipse.org/legal/epl-v10.html".</span> <a name="l00007"></a>00007 <span class="comment">//</span> <a name="l00008"></a>00008 <span class="comment">// Initial Contributors:</span> <a name="l00009"></a>00009 <span class="comment">// Nokia Corporation - initial contribution.</span> <a name="l00010"></a>00010 <span class="comment">//</span> <a name="l00011"></a>00011 <span class="comment">// Contributors:</span> <a name="l00012"></a>00012 <span class="comment">//</span> <a name="l00013"></a>00013 <span class="comment">// Description:</span> <a name="l00014"></a>00014 <span class="comment">// This example program demonstrates the use of hash table classes.</span> <a name="l00015"></a>00015 <span class="comment">//</span> <a name="l00016"></a>00016 <a name="l00017"></a>00017 <a name="l00018"></a>00018 <a name="l00022"></a>00022 <span class="preprocessor">#include "<a class="code" href="hashtableexample_8h.html">hashtableexample.h</a>"</span> <a name="l00023"></a>00023 <span class="preprocessor">#include <e32hashtab.h></span> <a name="l00024"></a>00024 <span class="preprocessor">#include <e32math.h></span> <a name="l00025"></a>00025 <a name="l00029"></a>00029 CHashTableExample::CHashTableExample() <a name="l00030"></a>00030 { <a name="l00031"></a>00031 } <a name="l00032"></a>00032 <a name="l00033"></a>00033 <span class="keywordtype">void</span> CHashTableExample::ConstructL() <a name="l00034"></a>00034 { <a name="l00035"></a>00035 iConsole = <a class="code" href="class_c_hash_table_example.html#acf16d511ffe0f92724a2938659902ce8">Console::NewL</a>(KTitle, TSize(KConsFullScreen, KConsFullScreen)); <a name="l00036"></a>00036 iConsole->Printf(KWelcome); <a name="l00037"></a>00037 iConsole->Printf(KPressAKeyMsg ); <a name="l00038"></a>00038 iConsole->Getch(); <a name="l00039"></a>00039 } <a name="l00040"></a>00040 <a name="l00044"></a><a class="code" href="class_c_hash_table_example.html#a6bd4064e26fb1b4d23555aaf95445a87">00044</a> <a class="code" href="class_c_hash_table_example.html#a6bd4064e26fb1b4d23555aaf95445a87">CHashTableExample::~CHashTableExample</a>() <a name="l00045"></a>00045 { <a name="l00046"></a>00046 <span class="keyword">delete</span> iConsole; <a name="l00047"></a>00047 iPointerArray.ResetAndDestroy(); <a name="l00048"></a>00048 } <a name="l00049"></a>00049 <a name="l00055"></a><a class="code" href="class_c_hash_table_example.html#acf16d511ffe0f92724a2938659902ce8">00055</a> <a class="code" href="class_c_hash_table_example.html">CHashTableExample</a>* <a class="code" href="class_c_hash_table_example.html#acf16d511ffe0f92724a2938659902ce8">CHashTableExample::NewL</a>() <a name="l00056"></a>00056 { <a name="l00057"></a>00057 <a class="code" href="class_c_hash_table_example.html">CHashTableExample</a>* <span class="keyword">self</span>=<span class="keyword">new</span>(ELeave)<a class="code" href="class_c_hash_table_example.html">CHashTableExample</a>(); <a name="l00058"></a>00058 CleanupStack::PushL(<span class="keyword">self</span>); <a name="l00059"></a>00059 <span class="keyword">self</span>->ConstructL(); <a name="l00060"></a>00060 CleanupStack::Pop(<span class="keyword">self</span>); <a name="l00061"></a>00061 <span class="keywordflow">return</span> <span class="keyword">self</span>; <a name="l00062"></a>00062 } <a name="l00063"></a>00063 <a name="l00068"></a><a class="code" href="class_c_hash_table_example.html#a9f45f193bd3d5827ec302510e210a4ab">00068</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#a9f45f193bd3d5827ec302510e210a4ab">CHashTableExample::ConstructDefaultHashSet</a>() <a name="l00069"></a>00069 { <a name="l00070"></a>00070 <span class="comment">// Construct hash set using default hash and identity functions for integer</span> <a name="l00071"></a>00071 RHashSet<TInt> hashSetInt(); <a name="l00072"></a>00072 <a name="l00073"></a>00073 <span class="comment">// Construct hash set using default hash and identity functions for 8bit descriptor</span> <a name="l00074"></a>00074 RHashSet<TDesC8> hashSetDes8(); <a name="l00075"></a>00075 <a name="l00076"></a>00076 <span class="comment">// Construct hash set using default hash and identity functions for 16bit descriptor</span> <a name="l00077"></a>00077 RHashSet<TDesC16> hashSetDes16(); <a name="l00078"></a>00078 <a name="l00079"></a>00079 iConsole->Printf(KHashSet); <a name="l00080"></a>00080 iConsole->Printf(KConstruct); <a name="l00081"></a>00081 iConsole->Printf(KConstructDefaultHashSet); <a name="l00082"></a>00082 } <a name="l00083"></a>00083 <a name="l00087"></a>00087 <span class="keyword">struct </span>TMyOwnObject <a name="l00088"></a>00088 { <a name="l00089"></a>00089 TInt iVar1; <a name="l00090"></a>00090 TInt iVar2; <a name="l00091"></a>00091 }; <a name="l00092"></a>00092 <a name="l00099"></a><a class="code" href="hashtableexample_8cpp.html#af116fb9d6e7d2da4bc1190cc359bacb7">00099</a> TUint32 <a class="code" href="hashtableexample_8cpp.html#af116fb9d6e7d2da4bc1190cc359bacb7">MyHashFunction</a>(<span class="keyword">const</span> TMyOwnObject& aObject) <a name="l00100"></a>00100 { <a name="l00101"></a>00101 <span class="keywordflow">return</span> DefaultHash::Integer(aObject.iVar1) + DefaultHash::Integer(aObject.iVar2 ); <a name="l00102"></a>00102 } <a name="l00103"></a>00103 <a name="l00111"></a><a class="code" href="hashtableexample_8cpp.html#acbe0e70da9a3bb5c887d39c02af66258">00111</a> TBool <a class="code" href="hashtableexample_8cpp.html#acbe0e70da9a3bb5c887d39c02af66258">MyIdentityFunction</a>(<span class="keyword">const</span> TMyOwnObject& aObject1, <span class="keyword">const</span> TMyOwnObject& aObject2) <a name="l00112"></a>00112 { <a name="l00113"></a>00113 <span class="keywordflow">return</span> aObject1.iVar1 == aObject2.iVar1 && aObject1.iVar2 != aObject2.iVar2; <a name="l00114"></a>00114 } <a name="l00115"></a>00115 <a name="l00120"></a><a class="code" href="class_c_hash_table_example.html#af0c455879cdb6f865a22fbf22bbff1d8">00120</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#af0c455879cdb6f865a22fbf22bbff1d8">CHashTableExample::ConstructOwnHashSet</a>() <a name="l00121"></a>00121 { <a name="l00122"></a>00122 <span class="comment">// Creates an object of custom hash function by using our created structure</span> <a name="l00123"></a>00123 THashFunction32<TMyOwnObject> ownHashFunction(<a class="code" href="hashtableexample_8cpp.html#af116fb9d6e7d2da4bc1190cc359bacb7">MyHashFunction</a>); <a name="l00124"></a>00124 <a name="l00125"></a>00125 <span class="comment">// Creates an object of identity function by using our created structure</span> <a name="l00126"></a>00126 TIdentityRelation<TMyOwnObject> ownIdentityFunction(<a class="code" href="hashtableexample_8cpp.html#acbe0e70da9a3bb5c887d39c02af66258">MyIdentityFunction</a>); <a name="l00127"></a>00127 <a name="l00128"></a>00128 <span class="comment">// Construct hash set by providing custom hash and identity function</span> <a name="l00129"></a>00129 RHashSet<TMyOwnObject> ownHashSet(ownHashFunction, ownIdentityFunction); <a name="l00130"></a>00130 iConsole->Printf(KConstructOwnHashSet); <a name="l00131"></a>00131 } <a name="l00132"></a>00132 <a name="l00143"></a><a class="code" href="class_c_hash_table_example.html#aa0fb5a532b9e4fcc8e67da7acf7ac339">00143</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#aa0fb5a532b9e4fcc8e67da7acf7ac339">CHashTableExample::OperationsToHashSetL</a>() <a name="l00144"></a>00144 { <a name="l00145"></a>00145 <span class="comment">// Declare a const integer value for the initial item to be stored</span> <a name="l00146"></a>00146 <span class="keyword">const</span> TInt startItem=1; <a name="l00147"></a>00147 <a name="l00148"></a>00148 <span class="comment">// Declare a const integer value for the last item to be stored </span> <a name="l00149"></a>00149 <span class="keyword">const</span> TInt endItem=100; <a name="l00150"></a>00150 TInt itemToBeFound=120; <a name="l00151"></a>00151 TInt itemToBeRemoved=200; <a name="l00152"></a>00152 TInt64 items=1; <a name="l00153"></a>00153 <a name="l00154"></a>00154 iConsole->Printf(KOperation); <a name="l00155"></a>00155 <a name="l00156"></a>00156 <span class="comment">// Creates an object of hash set using the template class RHashSet </span> <a name="l00157"></a>00157 RHashSet<TInt> hashSet; <a name="l00158"></a>00158 <a name="l00159"></a>00159 <span class="comment">// Push hash set on to the cleanup stack</span> <a name="l00160"></a>00160 CleanupClosePushL(hashSet); <a name="l00161"></a>00161 <a name="l00162"></a>00162 <span class="comment">// Insert random items to hash set</span> <a name="l00163"></a>00163 <span class="keywordflow">for</span> (TInt i=startItem; i<=endItem; ++i) <a name="l00164"></a>00164 { <a name="l00165"></a>00165 TInt res = Math::Rand(items); <a name="l00166"></a>00166 hashSet.InsertL(res); <a name="l00167"></a>00167 } <a name="l00168"></a>00168 <a name="l00169"></a>00169 iConsole->Printf(KInsertItemsToHashSet); <a name="l00170"></a>00170 <a name="l00171"></a>00171 <span class="comment">// Search the set for a specified item </span> <a name="l00172"></a>00172 TInt* result= hashSet.Find(itemToBeFound); <a name="l00173"></a>00173 <a name="l00174"></a>00174 <span class="comment">// result is NULL if specified item is not found in the set</span> <a name="l00175"></a>00175 <span class="keywordflow">if</span>(result) <a name="l00176"></a>00176 { <a name="l00177"></a>00177 iConsole->Printf(KItemPresentInHashSet); <a name="l00178"></a>00178 } <a name="l00179"></a>00179 <span class="keywordflow">else</span> <a name="l00180"></a>00180 { <a name="l00181"></a>00181 iConsole->Printf(KItemNotPresentInHashSet); <a name="l00182"></a>00182 } <a name="l00183"></a>00183 <a name="l00184"></a>00184 <span class="comment">// Creates an object of TIter to iterate over the elements of hash set</span> <a name="l00185"></a>00185 RHashSet<TInt>::TIter hashSetIter(hashSet); <a name="l00186"></a>00186 <a name="l00187"></a>00187 <span class="comment">// Iterate over the items in the set</span> <a name="l00188"></a>00188 <span class="comment">// Creates an iterator object of type TIter</span> <a name="l00189"></a>00189 <span class="keywordflow">for</span> ( ; ;) <a name="l00190"></a>00190 { <a name="l00191"></a>00191 <span class="keyword">const</span> TInt* res = hashSetIter.Next(); <a name="l00192"></a>00192 <a name="l00193"></a>00193 <span class="comment">// Next() moves the iterator to the next item and returns it</span> <a name="l00194"></a>00194 <span class="comment">// Returns NULL if there are no more items </span> <a name="l00195"></a>00195 <span class="keywordflow">if</span> (!res) <a name="l00196"></a>00196 { <a name="l00197"></a>00197 <span class="keywordflow">break</span>; <a name="l00198"></a>00198 } <a name="l00199"></a>00199 } <a name="l00200"></a>00200 <a name="l00201"></a>00201 iConsole->Printf(KIterateItemsFromHashSet); <a name="l00202"></a>00202 <a name="l00203"></a>00203 <span class="comment">// Remove an item from hash set</span> <a name="l00204"></a>00204 TInt res = hashSet.Remove(itemToBeRemoved); <a name="l00205"></a>00205 <span class="comment">// Check if the item was successfully removed</span> <a name="l00206"></a>00206 <span class="keywordflow">if</span>(res) <a name="l00207"></a>00207 { <a name="l00208"></a>00208 iConsole->Printf(KItemPresentInHashSet); <a name="l00209"></a>00209 } <a name="l00210"></a>00210 <span class="keywordflow">else</span> <a name="l00211"></a>00211 { <a name="l00212"></a>00212 iConsole->Printf(KItemNotPresentInHashSet); <a name="l00213"></a>00213 } <a name="l00214"></a>00214 <a name="l00215"></a>00215 iConsole->Printf(KRemoveItemsFromHashSet); <a name="l00216"></a>00216 <a name="l00217"></a>00217 <span class="comment">// Close and cleanup hash set</span> <a name="l00218"></a>00218 CleanupStack::PopAndDestroy(&hashSet); <a name="l00219"></a>00219 <a name="l00220"></a>00220 iConsole->Printf(KPressAKey); <a name="l00221"></a>00221 iConsole->Getch(); <a name="l00222"></a>00222 } <a name="l00223"></a>00223 <a name="l00228"></a><a class="code" href="class_c_hash_table_example.html#a5d812199c1ec12e9f4fb087881c7486e">00228</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#a5d812199c1ec12e9f4fb087881c7486e">CHashTableExample::ConstructDefaultPtrHashSet</a>() <a name="l00229"></a>00229 { <a name="l00230"></a>00230 <span class="comment">// Construct hash set of pointers using default hash and identity functions for integer</span> <a name="l00231"></a>00231 RPtrHashSet<TInt> ptrHashSetInt(); <a name="l00232"></a>00232 <a name="l00233"></a>00233 <span class="comment">// Construct hash set of pointers using default hash and identity functions for 8bit descriptor</span> <a name="l00234"></a>00234 RPtrHashSet<TDesC8> ptrHashSetDes8(); <a name="l00235"></a>00235 <a name="l00236"></a>00236 <span class="comment">// Construct hash set of pointers using default hash and identity functions for 16bit descriptor</span> <a name="l00237"></a>00237 RPtrHashSet<TDesC16> ptrHashSetDes16(); <a name="l00238"></a>00238 <a name="l00239"></a>00239 iConsole->Printf(KPtrHashSet); <a name="l00240"></a>00240 iConsole->Printf(KConstruct); <a name="l00241"></a>00241 iConsole->Printf(KConstructDefaultPtrHashSet); <a name="l00242"></a>00242 } <a name="l00243"></a>00243 <a name="l00248"></a><a class="code" href="class_c_hash_table_example.html#aa5ee720dec65ddad2526ec9f4ef9d83a">00248</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#aa5ee720dec65ddad2526ec9f4ef9d83a">CHashTableExample::ConstructOwnPtrHashSet</a>() <a name="l00249"></a>00249 { <a name="l00250"></a>00250 <span class="comment">// Creates an object of custom hash function by using our created structure</span> <a name="l00251"></a>00251 THashFunction32<TMyOwnObject> ownHashFunction(<a class="code" href="hashtableexample_8cpp.html#af116fb9d6e7d2da4bc1190cc359bacb7">MyHashFunction</a>); <a name="l00252"></a>00252 <a name="l00253"></a>00253 <span class="comment">// Creates an object of identity relation by using our created structure</span> <a name="l00254"></a>00254 TIdentityRelation<TMyOwnObject> ownIdentityFunction(<a class="code" href="hashtableexample_8cpp.html#acbe0e70da9a3bb5c887d39c02af66258">MyIdentityFunction</a>); <a name="l00255"></a>00255 <a name="l00256"></a>00256 <span class="comment">// Construct hash set of pointers by providing custom hash and identity functions</span> <a name="l00257"></a>00257 RPtrHashSet<TMyOwnObject> ownPtrHashSet(ownHashFunction, ownIdentityFunction); <a name="l00258"></a>00258 iConsole->Printf(KConstructOwnPtrHashSet); <a name="l00259"></a>00259 } <a name="l00260"></a>00260 <a name="l00266"></a><a class="code" href="hashtableexample_8cpp.html#a842a2320b517c541434909df8fe2dbc2">00266</a> <span class="keywordtype">void</span> <a class="code" href="hashtableexample_8cpp.html#a842a2320b517c541434909df8fe2dbc2">FindNumberInWords</a>(<span class="keyword">const</span> TInt& aNum, TDes& aDes) <a name="l00267"></a>00267 { <a name="l00268"></a>00268 TInt number = aNum; <a name="l00269"></a>00269 <span class="keyword">const</span> TInt bufferSize=256; <a name="l00270"></a>00270 <span class="keyword">const</span> TText* numbers[] = {_S(<span class="stringliteral">"zero"</span>), _S(<span class="stringliteral">"one"</span>), _S(<span class="stringliteral">"two"</span>),_S(<span class="stringliteral">"three"</span>),_S(<span class="stringliteral">"four"</span>),_S(<span class="stringliteral">"five"</span>),_S(<span class="stringliteral">"six"</span>),_S(<span class="stringliteral">"seven"</span>), <a name="l00271"></a>00271 _S(<span class="stringliteral">"eight"</span>),_S(<span class="stringliteral">"nine"</span>),_S(<span class="stringliteral">"ten"</span>),_S(<span class="stringliteral">"eleven"</span>),_S(<span class="stringliteral">"twelve"</span>),_S(<span class="stringliteral">"thirteen"</span>), <a name="l00272"></a>00272 _S(<span class="stringliteral">"fourteen"</span>),_S(<span class="stringliteral">"fifteen"</span>), _S(<span class="stringliteral">"sixteen"</span>),_S( <span class="stringliteral">"seventeen"</span>),_S( <span class="stringliteral">"eighteen"</span>), <a name="l00273"></a>00273 _S(<span class="stringliteral">"nineteen"</span>),_S( <span class="stringliteral">"twenty"</span>),_S( <span class="stringliteral">"thirty"</span>),_S( <span class="stringliteral">"forty"</span>),_S( <span class="stringliteral">"fifty"</span>),_S(<span class="stringliteral">"sixty"</span>), <a name="l00274"></a>00274 _S(<span class="stringliteral">"seventy"</span>),_S( <span class="stringliteral">"eighty"</span>), _S(<span class="stringliteral">"ninety"</span>), _S(<span class="stringliteral">"hundred"</span>), _S(<span class="stringliteral">"thousand"</span>) }; <a name="l00275"></a>00275 <a name="l00276"></a>00276 <span class="comment">// Converts the words if the number is less than 20</span> <a name="l00277"></a>00277 <span class="keywordflow">if</span> (number<20) <a name="l00278"></a>00278 { <a name="l00279"></a>00279 aDes.Copy(reinterpret_cast<const TUint16*> (numbers[number])); <a name="l00280"></a>00280 } <a name="l00281"></a>00281 <a name="l00282"></a>00282 <span class="comment">// Converts the words if the number between 20 and 100 </span> <a name="l00283"></a>00283 <span class="keywordflow">if</span> (number<100 && number>=20) <a name="l00284"></a>00284 { <a name="l00285"></a>00285 TInt tens = number/10; <a name="l00286"></a>00286 TInt units = number%10; <a name="l00287"></a>00287 aDes.Copy(reinterpret_cast<const TUint16*> (numbers[tens-2+20])); <a name="l00288"></a>00288 <span class="keywordflow">if</span> (units) <a name="l00289"></a>00289 { <a name="l00290"></a>00290 aDes.Append(<span class="charliteral">' '</span>); <a name="l00291"></a>00291 aDes.Append(TPtrC16(reinterpret_cast<const TUint16*> (numbers[units]))); <a name="l00292"></a>00292 } <a name="l00293"></a>00293 } <a name="l00294"></a>00294 <a name="l00295"></a>00295 <span class="comment">// Converts the words if the number is between 100 and 1000 </span> <a name="l00296"></a>00296 <span class="keywordflow">if</span> (number<1000 && number>=100) <a name="l00297"></a>00297 { <a name="l00298"></a>00298 TInt hundreds = number/100; <a name="l00299"></a>00299 aDes.Copy(reinterpret_cast<const TUint16*> (numbers[hundreds])); <a name="l00300"></a>00300 aDes.Append(<span class="charliteral">' '</span>); <a name="l00301"></a>00301 aDes.Append(TPtrC16(reinterpret_cast<const TUint16*> (numbers[28]))); <a name="l00302"></a>00302 number%=100; <a name="l00303"></a>00303 <span class="keywordflow">if</span> (number) <a name="l00304"></a>00304 { <a name="l00305"></a>00305 TBuf<bufferSize> buf; <a name="l00306"></a>00306 TDes& des1= buf; <a name="l00307"></a>00307 <a class="code" href="hashtableexample_8cpp.html#a842a2320b517c541434909df8fe2dbc2">FindNumberInWords</a>(number, des1); <a name="l00308"></a>00308 aDes.Append(KAnd); <a name="l00309"></a>00309 aDes+=des1; <a name="l00310"></a>00310 } <a name="l00311"></a>00311 } <a name="l00312"></a>00312 <a name="l00313"></a>00313 <span class="comment">// Converts the words if the number is greater than or equal to 1000</span> <a name="l00314"></a>00314 <span class="keywordflow">if</span>(number>=1000) <a name="l00315"></a>00315 { <a name="l00316"></a>00316 TInt hundreds = number/1000; <a name="l00317"></a>00317 aDes.Copy(reinterpret_cast<const TUint16*> (numbers[hundreds])); <a name="l00318"></a>00318 aDes.Append(<span class="charliteral">' '</span>); <a name="l00319"></a>00319 aDes.Append(TPtrC16(reinterpret_cast<const TUint16*> (numbers[29]))); <a name="l00320"></a>00320 number%=1000; <a name="l00321"></a>00321 <span class="keywordflow">if</span> (number) <a name="l00322"></a>00322 { <a name="l00323"></a>00323 TBuf<bufferSize> buf; <a name="l00324"></a>00324 TDes& des1= buf; <a name="l00325"></a>00325 <a class="code" href="hashtableexample_8cpp.html#a842a2320b517c541434909df8fe2dbc2">FindNumberInWords</a>(number, des1); <a name="l00326"></a>00326 aDes.Append(KAnd); <a name="l00327"></a>00327 aDes+=des1; <a name="l00328"></a>00328 } <a name="l00329"></a>00329 } <a name="l00330"></a>00330 } <a name="l00331"></a>00331 <a name="l00342"></a><a class="code" href="class_c_hash_table_example.html#ae386e8c189e8574d2e58e84b3e72d88a">00342</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#ae386e8c189e8574d2e58e84b3e72d88a">CHashTableExample::OperationsToPtrHashSetL</a>() <a name="l00343"></a>00343 { <a name="l00344"></a>00344 <span class="comment">// </span> <a name="l00345"></a>00345 iConsole->Printf(KOperation); <a name="l00346"></a>00346 <a name="l00347"></a>00347 <span class="comment">// First, set up some sample data to store in the hash</span> <a name="l00348"></a>00348 <span class="comment">// We're going to use strings for the numbers 0 to 1999 </span> <a name="l00349"></a>00349 <a name="l00350"></a>00350 <span class="comment">// Populate a string array temporarily with the sample data</span> <a name="l00351"></a>00351 <span class="comment">// We'll use the array to populate the set, and later on use it also</span> <a name="l00352"></a>00352 <span class="comment">// to populate a map</span> <a name="l00353"></a>00353 <span class="keyword">const</span> TInt KMaxItem=1200; <a name="l00354"></a>00354 <span class="keyword">const</span> TInt KMaxBufferSize=256; <a name="l00355"></a>00355 TInt i=0; <a name="l00356"></a>00356 <span class="keywordflow">for</span> (i=0; i<KMaxItem; ++i) <a name="l00357"></a>00357 { <a name="l00358"></a>00358 HBufC* hbuf = HBufC::NewLC(KMaxBufferSize); <a name="l00359"></a>00359 TPtr buf = hbuf->Des(); <a name="l00360"></a>00360 <span class="comment">// FindNumberInWords gets a string representation of the specified integer</span> <a name="l00361"></a>00361 <a class="code" href="hashtableexample_8cpp.html#a842a2320b517c541434909df8fe2dbc2">FindNumberInWords</a>(i, buf); <a name="l00362"></a>00362 iPointerArray.AppendL(hbuf); <a name="l00363"></a>00363 CleanupStack::Pop(hbuf); <a name="l00364"></a>00364 } <a name="l00365"></a>00365 <a name="l00366"></a>00366 <span class="comment">// Now create a set and populate it with the data from the array</span> <a name="l00367"></a>00367 <a name="l00368"></a>00368 <span class="comment">// Creates an object of hash set of pointers for 16 bit data using the template class RPtrHashSet</span> <a name="l00369"></a>00369 RPtrHashSet<TDesC16> ptrHashSet; <a name="l00370"></a>00370 <span class="comment">// Push hash set of pointers on to the cleanup stack</span> <a name="l00371"></a>00371 CleanupClosePushL(ptrHashSet); <a name="l00372"></a>00372 <span class="comment">// Insert items to hash set of pointers from 16 bit descriptor array</span> <a name="l00373"></a>00373 <span class="keywordflow">for</span> (i=0; i<KMaxItem; ++i) <a name="l00374"></a>00374 { <a name="l00375"></a>00375 ptrHashSet.InsertL(iPointerArray[i]); <a name="l00376"></a>00376 } <a name="l00377"></a>00377 iConsole->Printf(KInsertItemsToPtrHashSet); <a name="l00378"></a>00378 <a name="l00379"></a>00379 <span class="comment">// Search the set for a specified item </span> <a name="l00380"></a>00380 TDesC16* item1 = ptrHashSet.Find(KFindItem); <a name="l00381"></a>00381 <span class="comment">// item1 is NULL if KFindItem is not found in the set</span> <a name="l00382"></a>00382 <span class="keywordflow">if</span> (item1) <a name="l00383"></a>00383 { <a name="l00384"></a>00384 iConsole->Printf(KItemPresentInPtrHashSet); <a name="l00385"></a>00385 } <a name="l00386"></a>00386 <span class="keywordflow">else</span> <a name="l00387"></a>00387 { <a name="l00388"></a>00388 iConsole->Printf(KItemNotPresentInPtrHashSet); <a name="l00389"></a>00389 } <a name="l00390"></a>00390 <a name="l00391"></a>00391 <span class="comment">// Iterate over the items in the set</span> <a name="l00392"></a>00392 <span class="comment">// Creates an iterator object of type TIter</span> <a name="l00393"></a>00393 RPtrHashSet<TDesC16>::TIter ptrHashSetIter(ptrHashSet); <a name="l00394"></a>00394 <span class="comment">// Loop through the items </span> <a name="l00395"></a>00395 <span class="keywordflow">for</span> ( ; ; ) <a name="l00396"></a>00396 { <a name="l00397"></a>00397 <span class="keyword">const</span> TDesC16* resNext = ptrHashSetIter.Next(); <a name="l00398"></a>00398 <span class="comment">// Next() moves the iterator to the next item and returns it</span> <a name="l00399"></a>00399 <span class="comment">// Returns NULL if there are no more items </span> <a name="l00400"></a>00400 <span class="keywordflow">if</span> (!resNext) <a name="l00401"></a>00401 { <a name="l00402"></a>00402 <span class="keywordflow">break</span>; <a name="l00403"></a>00403 } <a name="l00404"></a>00404 } <a name="l00405"></a>00405 iConsole->Printf(KIterateItemsFromPtrHashSet); <a name="l00406"></a>00406 <a name="l00407"></a>00407 <span class="comment">// Remove an item from hash set</span> <a name="l00408"></a>00408 TInt err = ptrHashSet.Remove(&KRemoveItem); <a name="l00409"></a>00409 <span class="comment">// Check if the item was successfully removed</span> <a name="l00410"></a>00410 <span class="keywordflow">if</span> (err == KErrNone) <a name="l00411"></a>00411 { <a name="l00412"></a>00412 iConsole->Printf(KItemPresentInPtrHashSet); <a name="l00413"></a>00413 } <a name="l00414"></a>00414 <span class="keywordflow">else</span> <a name="l00415"></a>00415 { <a name="l00416"></a>00416 iConsole->Printf(KItemNotPresentInPtrHashSet); <a name="l00417"></a>00417 } <a name="l00418"></a>00418 iConsole->Printf(KRemoveItemsFromPtrHashSet); <a name="l00419"></a>00419 <a name="l00420"></a>00420 <span class="comment">// Close and cleanup hash set of pointers</span> <a name="l00421"></a>00421 CleanupStack::PopAndDestroy(&ptrHashSet); <a name="l00422"></a>00422 <a name="l00423"></a>00423 iConsole->Printf(KPressAKey); <a name="l00424"></a>00424 iConsole->Getch(); <a name="l00425"></a>00425 } <a name="l00426"></a>00426 <a name="l00431"></a><a class="code" href="class_c_hash_table_example.html#aa5cab6d3367986e74c7751ad7ffbff56">00431</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#aa5cab6d3367986e74c7751ad7ffbff56">CHashTableExample::ConstructDefaultHashMap</a>() <a name="l00432"></a>00432 { <a name="l00433"></a>00433 <span class="comment">// Construct hash map using default hash and identity functions for integer</span> <a name="l00434"></a>00434 RHashMap<TInt, TInt> hashMapInt(); <a name="l00435"></a>00435 <a name="l00436"></a>00436 <span class="comment">// Construct hash map using default hash and identity functions for 8 bit descriptor</span> <a name="l00437"></a>00437 RHashMap<TDesC8, TDesC8> hashMapDes8(); <a name="l00438"></a>00438 <a name="l00439"></a>00439 <span class="comment">// Construct hash map using default hash and identity functions for 16bit descriptor</span> <a name="l00440"></a>00440 RHashMap<TDesC16, TDesC16> hashMapDes16(); <a name="l00441"></a>00441 <a name="l00442"></a>00442 iConsole->Printf(KHashMap); <a name="l00443"></a>00443 iConsole->Printf(KConstruct); <a name="l00444"></a>00444 iConsole->Printf(KConstructDeafultHashMap); <a name="l00445"></a>00445 } <a name="l00446"></a>00446 <a name="l00451"></a><a class="code" href="class_c_hash_table_example.html#a3eb16d70e743b00df2392d58ce36d906">00451</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#a3eb16d70e743b00df2392d58ce36d906">CHashTableExample::ConstructOwnHashMap</a>() <a name="l00452"></a>00452 { <a name="l00453"></a>00453 <span class="comment">// Creates an object of custom hash function by using our created structure</span> <a name="l00454"></a>00454 THashFunction32<TMyOwnObject> ownHashFunction(<a class="code" href="hashtableexample_8cpp.html#af116fb9d6e7d2da4bc1190cc359bacb7">MyHashFunction</a>); <a name="l00455"></a>00455 <a name="l00456"></a>00456 <span class="comment">// Creates an object of identity function by using our created structure</span> <a name="l00457"></a>00457 TIdentityRelation<TMyOwnObject> ownIdentityFunction(<a class="code" href="hashtableexample_8cpp.html#acbe0e70da9a3bb5c887d39c02af66258">MyIdentityFunction</a>); <a name="l00458"></a>00458 <a name="l00459"></a>00459 <span class="comment">// Construct hash map by providing custom hash and identity function </span> <a name="l00460"></a>00460 RHashMap<TMyOwnObject, TMyOwnObject> ownHashMap(ownHashFunction, ownIdentityFunction); <a name="l00461"></a>00461 iConsole->Printf(KConstructOwnHashMap); <a name="l00462"></a>00462 } <a name="l00463"></a>00463 <a name="l00474"></a><a class="code" href="class_c_hash_table_example.html#a44a2596c976b9bf32231603e74453f38">00474</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#a44a2596c976b9bf32231603e74453f38">CHashTableExample::OperationsToHashMapL</a>() <a name="l00475"></a>00475 { <a name="l00476"></a>00476 TInt maxItem=300; <a name="l00477"></a>00477 TInt itemToBeFound=150; <a name="l00478"></a>00478 TInt itemToBeRemoved=200; <a name="l00479"></a>00479 TInt64 items; <a name="l00480"></a>00480 <a name="l00481"></a>00481 iConsole->Printf(KOperation); <a name="l00482"></a>00482 <a name="l00483"></a>00483 <span class="comment">// Creates an object of hash map using the template class RHashMap</span> <a name="l00484"></a>00484 RHashMap<TInt, TInt> hashMap; <a name="l00485"></a>00485 <a name="l00486"></a>00486 <span class="comment">// Push hash map on to the cleanup stack</span> <a name="l00487"></a>00487 CleanupClosePushL(hashMap); <a name="l00488"></a>00488 <a name="l00489"></a>00489 <span class="comment">// Insert items to hash map</span> <a name="l00490"></a>00490 <span class="keywordflow">for</span> (TInt i=0; i<maxItem; i++) <a name="l00491"></a>00491 { <a name="l00492"></a>00492 TInt res = Math::Rand(items); <a name="l00493"></a>00493 hashMap.InsertL(res*res, res); <a name="l00494"></a>00494 } <a name="l00495"></a>00495 <a name="l00496"></a>00496 iConsole->Printf(KInsertItemsToHashMap); <a name="l00497"></a>00497 <a name="l00498"></a>00498 <span class="comment">// Search the map for a specified item</span> <a name="l00499"></a>00499 TInt* result= hashMap.Find(itemToBeFound); <a name="l00500"></a>00500 <a name="l00501"></a>00501 <span class="comment">// result is NULL if specified item is not found in the map</span> <a name="l00502"></a>00502 <span class="keywordflow">if</span>(result) <a name="l00503"></a>00503 { <a name="l00504"></a>00504 iConsole->Printf(KItemPresentInHashMap); <a name="l00505"></a>00505 } <a name="l00506"></a>00506 <span class="keywordflow">else</span> <a name="l00507"></a>00507 { <a name="l00508"></a>00508 iConsole->Printf(KItemNotPresentInHashMap); <a name="l00509"></a>00509 } <a name="l00510"></a>00510 <a name="l00511"></a>00511 <span class="comment">// Iterate over the items in the map</span> <a name="l00512"></a>00512 <span class="comment">// Creates an iterator object of type TIter</span> <a name="l00513"></a>00513 RHashMap<TInt, TInt>::TIter hashMapIter(hashMap); <a name="l00514"></a>00514 <a name="l00515"></a>00515 <span class="keywordflow">for</span> ( ; ; ) <a name="l00516"></a>00516 { <a name="l00517"></a>00517 <span class="keyword">const</span> TInt* resNext = hashMapIter.NextKey(); <a name="l00518"></a>00518 <span class="keywordflow">if</span> (!resNext) <a name="l00519"></a>00519 { <a name="l00520"></a>00520 <span class="keywordflow">break</span>; <a name="l00521"></a>00521 } <a name="l00522"></a>00522 } <a name="l00523"></a>00523 <a name="l00524"></a>00524 iConsole->Printf(KIterateItemsFromHashMap); <a name="l00525"></a>00525 <a name="l00526"></a>00526 <span class="comment">// Remove an item from hash map</span> <a name="l00527"></a>00527 TInt res = hashMap.Remove(itemToBeRemoved); <a name="l00528"></a>00528 <a name="l00529"></a>00529 <span class="comment">// Check if the item was successfully removed</span> <a name="l00530"></a>00530 <span class="keywordflow">if</span>(res) <a name="l00531"></a>00531 { <a name="l00532"></a>00532 iConsole->Printf(KItemPresentInHashMap); <a name="l00533"></a>00533 } <a name="l00534"></a>00534 <span class="keywordflow">else</span> <a name="l00535"></a>00535 { <a name="l00536"></a>00536 iConsole->Printf(KItemNotPresentInHashMap); <a name="l00537"></a>00537 } <a name="l00538"></a>00538 <a name="l00539"></a>00539 iConsole->Printf(KRemoveItemsFromHashMap); <a name="l00540"></a>00540 <a name="l00541"></a>00541 <span class="comment">// Close and cleanup hash map</span> <a name="l00542"></a>00542 CleanupStack::PopAndDestroy(&hashMap); <a name="l00543"></a>00543 <a name="l00544"></a>00544 iConsole->Printf(KPressAKey); <a name="l00545"></a>00545 iConsole->Getch(); <a name="l00546"></a>00546 } <a name="l00547"></a>00547 <a name="l00552"></a><a class="code" href="class_c_hash_table_example.html#a002b4a538fbbfcb250b5b6b0553559a4">00552</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#a002b4a538fbbfcb250b5b6b0553559a4">CHashTableExample::ConstructDefaultPtrHashMap</a>() <a name="l00553"></a>00553 { <a name="l00554"></a>00554 <span class="comment">// Construct hash map of pointers using default hash and identity functions for integer</span> <a name="l00555"></a>00555 RPtrHashMap<TInt, TInt> ptrHashMapInt(); <a name="l00556"></a>00556 <a name="l00557"></a>00557 <span class="comment">// Construct hash map of pointers using default hash and identity functions for 8bit descriptor</span> <a name="l00558"></a>00558 RPtrHashMap<TDesC8, TDesC8> ptrHashMapDes8(); <a name="l00559"></a>00559 <a name="l00560"></a>00560 <span class="comment">// Construct hash map of pointers using default hash and identity functions for 16bit descriptor</span> <a name="l00561"></a>00561 RPtrHashMap<TDesC16, TDesC16> ptrHashMapDes16(); <a name="l00562"></a>00562 <a name="l00563"></a>00563 iConsole->Printf(KPtrHashMap); <a name="l00564"></a>00564 iConsole->Printf(KConstruct); <a name="l00565"></a>00565 iConsole->Printf(KConstructDeafultPtrHashMap); <a name="l00566"></a>00566 } <a name="l00567"></a>00567 <a name="l00572"></a><a class="code" href="class_c_hash_table_example.html#a88d7ae0091bd0fa4682736db79c88975">00572</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#a88d7ae0091bd0fa4682736db79c88975">CHashTableExample::ConstructOwnPtrHashMap</a>() <a name="l00573"></a>00573 { <a name="l00574"></a>00574 <span class="comment">// Creates an object of custom hash function by using our created structure</span> <a name="l00575"></a>00575 THashFunction32<TMyOwnObject> ownHashFunction(<a class="code" href="hashtableexample_8cpp.html#af116fb9d6e7d2da4bc1190cc359bacb7">MyHashFunction</a>); <a name="l00576"></a>00576 <a name="l00577"></a>00577 <span class="comment">// Creates an object of identity function by using our created structure</span> <a name="l00578"></a>00578 TIdentityRelation<TMyOwnObject> ownIdentityFunction(<a class="code" href="hashtableexample_8cpp.html#acbe0e70da9a3bb5c887d39c02af66258">MyIdentityFunction</a>); <a name="l00579"></a>00579 <a name="l00580"></a>00580 <span class="comment">// Construct hash map of pointers by providing custom hash and identity function</span> <a name="l00581"></a>00581 RPtrHashMap<TMyOwnObject, TMyOwnObject> ownPtrHashMap(ownHashFunction, ownIdentityFunction); <a name="l00582"></a>00582 iConsole->Printf(KConstructOwnPtrHashMap); <a name="l00583"></a>00583 } <a name="l00584"></a>00584 <a name="l00595"></a><a class="code" href="class_c_hash_table_example.html#a3c2f6d5cdfd1b1f2ac2074fab48ca98a">00595</a> <span class="keywordtype">void</span> <a class="code" href="class_c_hash_table_example.html#a3c2f6d5cdfd1b1f2ac2074fab48ca98a">CHashTableExample::OperationsToPtrHashMapL</a>() <a name="l00596"></a>00596 { <a name="l00597"></a>00597 TInt i; <a name="l00598"></a>00598 TInt maxItem=200; <a name="l00599"></a>00599 <a name="l00600"></a>00600 iConsole->Printf(KOperation); <a name="l00601"></a>00601 <a name="l00602"></a>00602 <span class="comment">// Creates an object of hash map of pointers using the template class RPtrHashMap</span> <a name="l00603"></a>00603 RPtrHashMap<TDesC16, TDesC16> ptrHashMap; <a name="l00604"></a>00604 <a name="l00605"></a>00605 <span class="comment">// Push hash map of pointers on to the cleanup stack</span> <a name="l00606"></a>00606 CleanupClosePushL(ptrHashMap); <a name="l00607"></a>00607 <a name="l00608"></a>00608 <span class="comment">// Insert items to hash map of pointers </span> <a name="l00609"></a>00609 <span class="keywordflow">for</span> (i=0; i<maxItem; ++i) <a name="l00610"></a>00610 { <a name="l00611"></a>00611 ptrHashMap.InsertL(iPointerArray[i], iPointerArray[i+1]); <a name="l00612"></a>00612 } <a name="l00613"></a>00613 <a name="l00614"></a>00614 iConsole->Printf(KInsertItemsToPtrHashMap); <a name="l00615"></a>00615 <a name="l00616"></a>00616 <span class="comment">// Search the set for a specified item </span> <a name="l00617"></a>00617 TDesC16* item1= ptrHashMap.Find(KFindItem); <a name="l00618"></a>00618 <a name="l00619"></a>00619 <span class="comment">// item1 is NULL if KFindItem is not found in the map</span> <a name="l00620"></a>00620 <span class="keywordflow">if</span>(item1) <a name="l00621"></a>00621 { <a name="l00622"></a>00622 iConsole->Printf(KItemPresentInPtrHashMap); <a name="l00623"></a>00623 } <a name="l00624"></a>00624 <span class="keywordflow">else</span> <a name="l00625"></a>00625 { <a name="l00626"></a>00626 iConsole->Printf(KItemNotPresentInPtrHashMap); <a name="l00627"></a>00627 } <a name="l00628"></a>00628 <a name="l00629"></a>00629 <span class="comment">// Iterate over the items in the map</span> <a name="l00630"></a>00630 <span class="comment">// Creates an iterator object of type TIter</span> <a name="l00631"></a>00631 RPtrHashMap<TDesC16, TDesC16>::TIter ptrHashMapIter(ptrHashMap); <a name="l00632"></a>00632 <a name="l00633"></a>00633 <span class="keywordflow">for</span> ( ; ; ) <a name="l00634"></a>00634 { <a name="l00635"></a>00635 <span class="keyword">const</span> TDesC16* resNext = ptrHashMapIter.NextKey(); <a name="l00636"></a>00636 <span class="comment">// Next() moves the iterator to the next item and returns it</span> <a name="l00637"></a>00637 <span class="comment">// Returns NULL if there are no more items </span> <a name="l00638"></a>00638 <span class="keywordflow">if</span> (!resNext) <a name="l00639"></a>00639 { <a name="l00640"></a>00640 <span class="keywordflow">break</span>; <a name="l00641"></a>00641 } <a name="l00642"></a>00642 } <a name="l00643"></a>00643 <a name="l00644"></a>00644 iConsole->Printf(KIterateItemsFromPtrHashMap); <a name="l00645"></a>00645 <a name="l00646"></a>00646 <span class="comment">// Remove an item from hash map of pointers </span> <a name="l00647"></a>00647 TInt res = ptrHashMap.Remove(&KRemoveItem); <a name="l00648"></a>00648 <a name="l00649"></a>00649 <span class="comment">// Check if the item was successfully removed</span> <a name="l00650"></a>00650 <span class="keywordflow">if</span>(res) <a name="l00651"></a>00651 { <a name="l00652"></a>00652 iConsole->Printf(KItemPresentInPtrHashMap); <a name="l00653"></a>00653 } <a name="l00654"></a>00654 <span class="keywordflow">else</span> <a name="l00655"></a>00655 { <a name="l00656"></a>00656 iConsole->Printf(KItemNotPresentInPtrHashMap); <a name="l00657"></a>00657 } <a name="l00658"></a>00658 <a name="l00659"></a>00659 iConsole->Printf(KRemoveItemsFromPtrHashMap); <a name="l00660"></a>00660 iConsole->Printf(KExitMsg); <a name="l00661"></a>00661 iConsole->Getch(); <a name="l00662"></a>00662 <a name="l00663"></a>00663 <span class="comment">// Close and Cleanup hash map of pointers</span> <a name="l00664"></a>00664 CleanupStack::PopAndDestroy(&ptrHashMap); <a name="l00665"></a>00665 } <a name="l00666"></a>00666 <a name="l00667"></a>00667 <span class="keywordtype">void</span> MainL() <a name="l00668"></a>00668 { <a name="l00669"></a>00669 <a class="code" href="class_c_hash_table_example.html">CHashTableExample</a>* app= <a class="code" href="class_c_hash_table_example.html#acf16d511ffe0f92724a2938659902ce8">CHashTableExample::NewL</a>(); <a name="l00670"></a>00670 CleanupStack::PushL(app); <a name="l00671"></a>00671 <a name="l00672"></a>00672 <span class="comment">// Hash set </span> <a name="l00673"></a>00673 app-><a class="code" href="class_c_hash_table_example.html#a9f45f193bd3d5827ec302510e210a4ab">ConstructDefaultHashSet</a>(); <a name="l00674"></a>00674 app-><a class="code" href="class_c_hash_table_example.html#af0c455879cdb6f865a22fbf22bbff1d8">ConstructOwnHashSet</a>(); <a name="l00675"></a>00675 app-><a class="code" href="class_c_hash_table_example.html#aa0fb5a532b9e4fcc8e67da7acf7ac339">OperationsToHashSetL</a>(); <a name="l00676"></a>00676 <a name="l00677"></a>00677 <span class="comment">// Hash set of pointers</span> <a name="l00678"></a>00678 app-><a class="code" href="class_c_hash_table_example.html#a5d812199c1ec12e9f4fb087881c7486e">ConstructDefaultPtrHashSet</a>(); <a name="l00679"></a>00679 app-><a class="code" href="class_c_hash_table_example.html#aa5ee720dec65ddad2526ec9f4ef9d83a">ConstructOwnPtrHashSet</a>(); <a name="l00680"></a>00680 app-><a class="code" href="class_c_hash_table_example.html#ae386e8c189e8574d2e58e84b3e72d88a">OperationsToPtrHashSetL</a>(); <a name="l00681"></a>00681 <a name="l00682"></a>00682 <span class="comment">// Hash map</span> <a name="l00683"></a>00683 app-><a class="code" href="class_c_hash_table_example.html#aa5cab6d3367986e74c7751ad7ffbff56">ConstructDefaultHashMap</a>(); <a name="l00684"></a>00684 app-><a class="code" href="class_c_hash_table_example.html#a3eb16d70e743b00df2392d58ce36d906">ConstructOwnHashMap</a>(); <a name="l00685"></a>00685 app-><a class="code" href="class_c_hash_table_example.html#a44a2596c976b9bf32231603e74453f38">OperationsToHashMapL</a>(); <a name="l00686"></a>00686 <a name="l00687"></a>00687 <span class="comment">// Hash map of pointers</span> <a name="l00688"></a>00688 app-><a class="code" href="class_c_hash_table_example.html#a002b4a538fbbfcb250b5b6b0553559a4">ConstructDefaultPtrHashMap</a>(); <a name="l00689"></a>00689 app-><a class="code" href="class_c_hash_table_example.html#a88d7ae0091bd0fa4682736db79c88975">ConstructOwnPtrHashMap</a>(); <a name="l00690"></a>00690 app-><a class="code" href="class_c_hash_table_example.html#a3c2f6d5cdfd1b1f2ac2074fab48ca98a">OperationsToPtrHashMapL</a>(); <a name="l00691"></a>00691 <a name="l00692"></a>00692 CleanupStack::PopAndDestroy(app); <a name="l00693"></a>00693 } <a name="l00694"></a>00694 <a name="l00695"></a>00695 GLDEF_C TInt E32Main() <a name="l00696"></a>00696 { <a name="l00697"></a>00697 __UHEAP_MARK; <a name="l00698"></a>00698 <a name="l00699"></a>00699 CTrapCleanup* cleanup = CTrapCleanup::New(); <a name="l00700"></a>00700 <span class="keywordflow">if</span>(cleanup == NULL) <a name="l00701"></a>00701 { <a name="l00702"></a>00702 <span class="keywordflow">return</span> KErrNoMemory; <a name="l00703"></a>00703 } <a name="l00704"></a>00704 TRAPD(err, MainL()); <a name="l00705"></a>00705 <span class="keywordflow">if</span>(err !=KErrNone) <a name="l00706"></a>00706 { <a name="l00707"></a>00707 User::Panic(KFailed, err); <a name="l00708"></a>00708 } <a name="l00709"></a>00709 <span class="keyword">delete</span> cleanup; <a name="l00710"></a>00710 <a name="l00711"></a>00711 __UHEAP_MARKEND; <a name="l00712"></a>00712 <span class="keywordflow">return</span> KErrNone; <a name="l00713"></a>00713 } <a name="l00714"></a>00714 <a name="l00715"></a>00715 <a name="l00716"></a>00716 <a name="l00717"></a>00717 <a name="l00718"></a>00718 <a name="l00719"></a>00719 <a name="l00720"></a>00720 </pre></div></div> <hr size="1"/><address style="text-align: right;"><small>Generated by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.2 </small></address> </body> </html>