predictivesearch/PcsAlgorithm/Algorithm1/src/CPcsAlgorithm1Utils.cpp
branchRCL_3
changeset 32 2828b4d142c0
parent 21 b3431bff8c19
child 35 4ae315f230bc
--- a/predictivesearch/PcsAlgorithm/Algorithm1/src/CPcsAlgorithm1Utils.cpp	Tue Apr 27 16:23:35 2010 +0300
+++ b/predictivesearch/PcsAlgorithm/Algorithm1/src/CPcsAlgorithm1Utils.cpp	Tue May 11 16:00:21 2010 +0300
@@ -41,6 +41,7 @@
 void CPcsAlgorithm1Utils::FormCompleteSearchResultsL(RPointerArray<CPSDATA_R_PTR_ARRAY>& aSearchResultsArr, 
 												     RPointerArray<CPsData>& aSearchResults)
 {
+    CleanupClosePushL( aSearchResults );
 	TInt maxIndex = 0;
     TInt maxValue = aSearchResultsArr[maxIndex]->Count();
     TLinearOrder<CPsData> rule( CPcsAlgorithm1Utils::CompareDataBySortOrderL );
@@ -74,6 +75,7 @@
     		}
     	}
     }
+    CleanupStack::Pop();
 }
 
 // ----------------------------------------------------------------------------
@@ -330,6 +332,8 @@
 void CPcsAlgorithm1Utils::AppendMatchToSeqL( 
         RPointerArray<TDesC>& aMatchSeq, const TDesC& aMatch )
     {
+    CleanupResetAndDestroyPushL( aMatchSeq );
+    
     HBufC* seq = aMatch.AllocLC();
     seq->Des().UpperCase();
     TIdentityRelation<TDesC> rule(CompareExact);
@@ -342,6 +346,7 @@
         {
         CleanupStack::PopAndDestroy( seq );
         }
+    CleanupStack::Pop( &aMatchSeq );
     }
 
 // End of File