equal
deleted
inserted
replaced
33 // Merges all the respective data store result sets to single set in sorted order. |
33 // Merges all the respective data store result sets to single set in sorted order. |
34 // ---------------------------------------------------------------------------- |
34 // ---------------------------------------------------------------------------- |
35 void CPcsAlgorithm2Utils::FormCompleteSearchResultsL(RPointerArray<CPSDATA_R_PTR_ARRAY>& aSearchResultsArr, |
35 void CPcsAlgorithm2Utils::FormCompleteSearchResultsL(RPointerArray<CPSDATA_R_PTR_ARRAY>& aSearchResultsArr, |
36 RPointerArray<CPsData>& SearchResults) |
36 RPointerArray<CPsData>& SearchResults) |
37 { |
37 { |
|
38 CleanupClosePushL( SearchResults ); |
|
39 |
38 TInt maxIndex = 0; |
40 TInt maxIndex = 0; |
39 TInt maxValue = aSearchResultsArr[maxIndex]->Count(); |
41 TInt maxValue = aSearchResultsArr[maxIndex]->Count(); |
40 TLinearOrder<CPsData> rule(CPcsAlgorithm2Utils::CompareDataBySortOrder); |
42 TLinearOrder<CPsData> rule(CPcsAlgorithm2Utils::CompareDataBySortOrder); |
41 |
43 |
42 // Find the largest array in aSearchResultsArr |
44 // Find the largest array in aSearchResultsArr |
66 { |
68 { |
67 SearchResults.InsertInOrderAllowRepeatsL((*(aSearchResultsArr[i]))[j], rule); |
69 SearchResults.InsertInOrderAllowRepeatsL((*(aSearchResultsArr[i]))[j], rule); |
68 } |
70 } |
69 } |
71 } |
70 } |
72 } |
|
73 CleanupStack::Pop(); |
71 } |
74 } |
72 |
75 |
73 // ---------------------------------------------------------------------------- |
76 // ---------------------------------------------------------------------------- |
74 // CPcsAlgorithm2Utils::MyCompareC() |
77 // CPcsAlgorithm2Utils::MyCompareC() |
75 // Lang specific MyCompareC |
78 // Lang specific MyCompareC |