author | Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com> |
Tue, 14 Sep 2010 20:54:53 +0300 | |
branch | RCL_3 |
changeset 68 | 9da50d567e3c |
parent 63 | f4a778e096c2 |
child 85 | 38bb213f60ba |
permissions | -rw-r--r-- |
63 | 1 |
/* |
2 |
* Copyright (c) 2007 Nokia Corporation and/or its subsidiary(-ies). |
|
3 |
* All rights reserved. |
|
4 |
* This component and the accompanying materials are made available |
|
5 |
* under the terms of "Eclipse Public License v1.0" |
|
6 |
* which accompanies this distribution, and is available |
|
7 |
* at the URL "http://www.eclipse.org/legal/epl-v10.html". |
|
8 |
* |
|
9 |
* Initial Contributors: |
|
10 |
* Nokia Corporation - initial contribution. |
|
11 |
* |
|
12 |
* Contributors: |
|
13 |
* |
|
14 |
* Description: Supports initial search feature. |
|
15 |
* |
|
16 |
*/ |
|
17 |
||
18 |
// INCLUDES |
|
19 |
#include "CPcsAlgorithm2Utils.h" |
|
20 |
#include "CPsData.h" |
|
21 |
#include "CPsQuery.h" |
|
22 |
#include "CPcsDefs.h" |
|
23 |
#include "CPcsCache.h" |
|
24 |
#include <collate.h> |
|
25 |
// CONSTANTS |
|
26 |
_LIT(KSpace, ' '); |
|
27 |
// Search contacts in a group URI template |
|
28 |
_LIT(KGroupIdUri, "cntdb://c:contacts.gdb?id="); |
|
29 |
||
30 |
// ============================== MEMBER FUNCTIONS ============================ |
|
31 |
||
32 |
// ---------------------------------------------------------------------------- |
|
33 |
// CPcsAlgorithm2Utils::FormCompleteSearchResultsL() |
|
34 |
// Merges all the respective data store result sets to single set in sorted order. |
|
35 |
// ---------------------------------------------------------------------------- |
|
36 |
void CPcsAlgorithm2Utils::FormCompleteSearchResultsL(RPointerArray<CPSDATA_R_PTR_ARRAY>& aSearchResultsArr, |
|
37 |
RPointerArray<CPsData>& aSearchResults) |
|
38 |
{ |
|
39 |
TInt maxIndex = 0; |
|
40 |
TInt maxValue = aSearchResultsArr[maxIndex]->Count(); |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
41 |
TLinearOrder<CPsData> rule(CPcsAlgorithm2Utils::CompareDataBySortOrderL); |
63 | 42 |
|
43 |
// Find the largest array in aSearchResultsArr |
|
44 |
const TInt searchResultsArrCount = aSearchResultsArr.Count(); |
|
45 |
for (TInt i = 1; i < searchResultsArrCount; i++) |
|
46 |
{ |
|
47 |
if (aSearchResultsArr[i]->Count() > maxValue) |
|
48 |
{ |
|
49 |
maxIndex = i; |
|
50 |
maxValue = aSearchResultsArr[i]->Count(); |
|
51 |
} |
|
52 |
} |
|
53 |
||
54 |
// Assign the largets array to searchresults |
|
55 |
const TInt cnt = aSearchResultsArr[maxIndex]->Count(); |
|
56 |
for (TInt i = 0; i < cnt; i++) |
|
57 |
{ |
|
58 |
aSearchResults.Append((*(aSearchResultsArr[maxIndex]))[i]); |
|
59 |
} |
|
60 |
||
61 |
// Merge the remaining result arrays to the largest array in sequential order |
|
62 |
||
63 |
for (TInt i = 0; i < searchResultsArrCount; i++) |
|
64 |
{ |
|
65 |
// Check if we are not copying again the largest array |
|
66 |
if ((i != maxIndex) && ((aSearchResultsArr[i])->Count() != 0)) |
|
67 |
{ |
|
68 |
TInt numElements = (aSearchResultsArr[i])->Count(); |
|
69 |
for (TInt j = 0; j < numElements; j++) |
|
70 |
{ |
|
71 |
aSearchResults.InsertInOrderAllowRepeatsL((*(aSearchResultsArr[i]))[j], rule); |
|
72 |
} |
|
73 |
} |
|
74 |
} |
|
75 |
} |
|
76 |
||
77 |
// ---------------------------------------------------------------------------- |
|
78 |
// CPcsAlgorithm2Utils::MyCompareC() |
|
79 |
// Lang specific MyCompareC |
|
80 |
// ---------------------------------------------------------------------------- |
|
81 |
TInt CPcsAlgorithm2Utils::MyCompareC(const TDesC& aLeft, const TDesC& aRight) |
|
82 |
{ |
|
83 |
// Get the current language |
|
84 |
TLanguage lang = User::Language(); |
|
85 |
||
86 |
// Get the standard method |
|
87 |
TCollationMethod meth = *Mem::CollationMethodByIndex(0); |
|
88 |
meth.iFlags |= TCollationMethod::EIgnoreNone; |
|
89 |
meth.iFlags |= TCollationMethod::EFoldCase; |
|
90 |
||
91 |
if (lang == ELangHindi || lang == ELangMarathi) |
|
92 |
{ |
|
93 |
meth.iFlags |= TCollationMethod::EIgnoreCombining; |
|
94 |
} |
|
95 |
||
96 |
// Collation level 3 is used |
|
97 |
TInt comparison(aLeft.CompareC(aRight, 3, &meth)); |
|
98 |
return comparison; |
|
99 |
} |
|
100 |
||
101 |
// ---------------------------------------------------------------------------- |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
102 |
// CPcsAlgorithm2Utils::CompareDataBySortOrderL() |
63 | 103 |
// TLinearOrder rule for comparison of data objects |
104 |
// ---------------------------------------------------------------------------- |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
105 |
TInt CPcsAlgorithm2Utils::CompareDataBySortOrderL(const CPsData& aObject1, |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
106 |
const CPsData& aObject2) |
63 | 107 |
{ |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
108 |
TInt compareRes = 0; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
109 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
110 |
if( CPsData::CompareById(aObject1, aObject2) ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
111 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
112 |
return compareRes; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
113 |
} |
63 | 114 |
|
115 |
// Fetch the cache list stored in TLS to recover the sort order |
|
116 |
typedef RPointerArray<CPcsCache> PTR; |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
117 |
PTR* pcsCache = static_cast<PTR*>(Dll::Tls()); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
118 |
User::LeaveIfNull(pcsCache); |
63 | 119 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
120 |
CPcsCache* cache1 = (*pcsCache)[aObject1.UriId()]; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
121 |
CPcsCache* cache2 = (*pcsCache)[aObject2.UriId()]; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
122 |
RArray<TInt> indexOrder1; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
123 |
RArray<TInt> indexOrder2; |
63 | 124 |
|
125 |
// Get the index order based on sort order from the cache |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
126 |
cache1->GetIndexOrder(indexOrder1); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
127 |
CleanupClosePushL(indexOrder1); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
128 |
cache2->GetIndexOrder(indexOrder2); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
129 |
CleanupClosePushL(indexOrder2); |
63 | 130 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
131 |
// Check if Sort Order is identical (it must be for same cache) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
132 |
TBool sameIndexOrder = ETrue; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
133 |
if ( indexOrder1.Count() != indexOrder2.Count() ) |
63 | 134 |
{ |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
135 |
sameIndexOrder = EFalse; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
136 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
137 |
else |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
138 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
139 |
for ( TInt i = 0; i < indexOrder1.Count(); i++ ) |
63 | 140 |
{ |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
141 |
if (indexOrder1[i] != indexOrder2[i]) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
142 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
143 |
sameIndexOrder = EFalse; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
144 |
break; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
145 |
} |
63 | 146 |
} |
147 |
} |
|
148 |
||
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
149 |
// Sort Orders among diffent caches should be the same, anyway |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
150 |
// if caches and SO are different we compare by cache URI index |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
151 |
if (!sameIndexOrder) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
152 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
153 |
compareRes = aObject1.UriId() - aObject2.UriId(); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
154 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
155 |
CleanupStack::PopAndDestroy(&indexOrder2); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
156 |
CleanupStack::PopAndDestroy(&indexOrder1); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
157 |
return compareRes; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
158 |
} |
63 | 159 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
160 |
// The comparison between contacts data is done for the sort order |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
161 |
// fields skipping the ones that are empty |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
162 |
TInt indexCount = indexOrder1.Count(); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
163 |
TInt idx1 = 0; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
164 |
TInt idx2 = 0; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
165 |
while ( compareRes == 0 && idx1 < indexCount && idx2 < indexCount ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
166 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
167 |
// Get contact field of 1st contact |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
168 |
TInt object1Idx = indexOrder1[idx1]; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
169 |
HBufC* strCompare1 = aObject1.Data(object1Idx)->Des().AllocLC(); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
170 |
TPtr strCompare1Ptr( strCompare1->Des() ); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
171 |
CPcsAlgorithm2Utils::MyTrim( strCompare1Ptr ); |
63 | 172 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
173 |
// Get contact field of 2nd contact |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
174 |
TInt object2Idx = indexOrder2[idx2]; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
175 |
HBufC* strCompare2 = aObject2.Data(object2Idx)->Des().AllocLC(); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
176 |
TPtr strCompare2Ptr( strCompare2->Des() ); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
177 |
CPcsAlgorithm2Utils::MyTrim( strCompare2Ptr ); |
63 | 178 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
179 |
if ( strCompare1->Length() > 0 && strCompare2->Length() > 0 ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
180 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
181 |
compareRes = CPcsAlgorithm2Utils::MyCompareC(*strCompare1, *strCompare2); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
182 |
idx1++; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
183 |
idx2++; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
184 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
185 |
else // Increment only the index of the contact with empty field |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
186 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
187 |
if ( strCompare1->Length() == 0 ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
188 |
idx1++; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
189 |
if ( strCompare2->Length() == 0 ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
190 |
idx2++; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
191 |
} |
63 | 192 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
193 |
CleanupStack::PopAndDestroy(strCompare2); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
194 |
CleanupStack::PopAndDestroy(strCompare1); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
195 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
196 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
197 |
// We do not return that contacts are equal by SO |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
198 |
if ( compareRes == 0 ) |
63 | 199 |
{ |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
200 |
if ( idx1 != idx2 ) |
63 | 201 |
{ |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
202 |
// Compare by index position |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
203 |
// If idx1 > idx2 and SO is "FN LN" it means for instance that: |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
204 |
// Contact1=[FN:"", LN:"Smith"], idx1=2 |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
205 |
// Contact2=[FN:"Smith", LN:"Donald"], idx2=1 |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
206 |
// Therefore Contact1="Smith" is < than Contact2="Smith Donald" |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
207 |
// and the return value of this method has to be < 0 (idx2-idx1) |
63 | 208 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
209 |
compareRes = idx2 - idx1; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
210 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
211 |
else |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
212 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
213 |
// Compare by URI ID as 1st choice and Contact ID as 2nd choice |
63 | 214 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
215 |
compareRes == ( aObject1.UriId() != aObject2.UriId() ) ? |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
216 |
aObject1.UriId() - aObject2.UriId() : aObject1.Id() - aObject2.Id(); |
63 | 217 |
} |
218 |
} |
|
219 |
||
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
220 |
CleanupStack::PopAndDestroy(&indexOrder2); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
221 |
CleanupStack::PopAndDestroy(&indexOrder1); |
63 | 222 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
223 |
return compareRes; |
63 | 224 |
} |
225 |
||
226 |
// ---------------------------------------------------------------------------- |
|
227 |
// CPcsAlgorithm2Utils::CompareExact() |
|
228 |
// |
|
229 |
// ---------------------------------------------------------------------------- |
|
230 |
TBool CPcsAlgorithm2Utils::CompareExact(const TDesC& aFirst, const TDesC& aSecond) |
|
231 |
{ |
|
232 |
return aFirst == aSecond; |
|
233 |
} |
|
234 |
||
235 |
// ---------------------------------------------------------------------------- |
|
236 |
// CPcsAlgorithm2Utils::CompareLength() |
|
237 |
// |
|
238 |
// ---------------------------------------------------------------------------- |
|
239 |
TInt CPcsAlgorithm2Utils::CompareLength(const CPsQuery& aFirst, const CPsQuery& aSecond) |
|
240 |
{ |
|
241 |
CPsQuery& first = const_cast<CPsQuery&> (aFirst); |
|
242 |
CPsQuery& second = const_cast<CPsQuery&> (aSecond); |
|
243 |
||
244 |
return (first.Count() - second.Count()); |
|
245 |
} |
|
246 |
||
247 |
// ---------------------------------------------------------------------------- |
|
248 |
// CPcsAlgorithm2Utils::MyTrim() |
|
249 |
// Trim off all white spaces and special characters |
|
250 |
// This behavior is required to mimic the current phonebook sort sequence |
|
251 |
// ---------------------------------------------------------------------------- |
|
252 |
void CPcsAlgorithm2Utils::MyTrim(TDes& aString) |
|
253 |
{ |
|
254 |
for (TInt i = aString.Length(); --i >= 0;) |
|
255 |
{ |
|
256 |
TChar c = (TChar) aString[i]; |
|
257 |
||
258 |
if (!c.IsAlphaDigit()) |
|
259 |
{ |
|
260 |
aString.Replace(i, 1, KSpace); |
|
261 |
} |
|
262 |
} |
|
263 |
||
264 |
aString.TrimAll(); |
|
265 |
} |
|
266 |
||
267 |
// ---------------------------------------------------------------------------- |
|
268 |
// CPcsAlgorithm2Utils::IsGroupUri() |
|
269 |
// Check if the input URI is of contact search in a group template form |
|
270 |
// ---------------------------------------------------------------------------- |
|
271 |
TBool CPcsAlgorithm2Utils::IsGroupUri(TDesC& aURI) |
|
272 |
{ |
|
273 |
TBuf<255> uri(aURI); |
|
274 |
uri.LowerCase(); |
|
275 |
||
276 |
TInt index = uri.FindF(KGroupIdUri); |
|
277 |
||
278 |
if (index == KErrNotFound) |
|
279 |
{ |
|
280 |
return EFalse; |
|
281 |
} |
|
282 |
||
283 |
return ETrue; |
|
284 |
} |
|
285 |
||
286 |
// ---------------------------------------------------------------------------- |
|
287 |
// CPcsAlgorithm1Helper::FilterDataFieldsL() |
|
288 |
// Constructs a bit pattern using the required/supported data fields |
|
289 |
// For example, 6, 4 and 27 are supported fields <-- 00000111 |
|
290 |
// 6 and 4 are required fields <-- 00000011 |
|
291 |
// Bit pattern returned is 00000011. |
|
292 |
// ---------------------------------------------------------------------------- |
|
293 |
TUint8 CPcsAlgorithm2Utils::FilterDataFieldsL(const RArray<TInt>& aRequiredDataFields, |
|
294 |
const RArray<TInt>& aSupportedDataFields) |
|
295 |
{ |
|
296 |
TUint8 filteredMatch = 0x0; |
|
297 |
const TInt supportedDataFieldsCount = aSupportedDataFields.Count(); |
|
298 |
const TInt requiredDataFieldsCount = aRequiredDataFields.Count(); |
|
299 |
for ( TInt i = 0; i < supportedDataFieldsCount; i++ ) |
|
300 |
{ |
|
301 |
for ( TInt j = 0; j < requiredDataFieldsCount; j++ ) |
|
302 |
{ |
|
303 |
if ( aSupportedDataFields[i] == aRequiredDataFields[j] ) |
|
304 |
{ |
|
305 |
TUint8 val = 1 << i; |
|
306 |
filteredMatch |= val; |
|
307 |
} |
|
308 |
} |
|
309 |
} |
|
310 |
||
311 |
return filteredMatch; |
|
312 |
} |
|
313 |
||
314 |
// ---------------------------------------------------------------------------- |
|
315 |
// CPcsAlgorithm2Utils::AppendMatchToSeqL |
|
316 |
// ---------------------------------------------------------------------------- |
|
317 |
void CPcsAlgorithm2Utils::AppendMatchToSeqL( |
|
318 |
RPointerArray<TDesC>& aMatchSeq, const TDesC& aMatch ) |
|
319 |
{ |
|
320 |
HBufC* seq = aMatch.AllocLC(); |
|
321 |
seq->Des().UpperCase(); |
|
322 |
TIdentityRelation<TDesC> rule(CompareExact); |
|
323 |
if ( aMatchSeq.Find(seq, rule) == KErrNotFound ) |
|
324 |
{ |
|
325 |
aMatchSeq.AppendL(seq); |
|
326 |
CleanupStack::Pop( seq ); |
|
327 |
} |
|
328 |
else |
|
329 |
{ |
|
330 |
CleanupStack::PopAndDestroy( seq ); |
|
331 |
} |
|
332 |
} |
|
333 |
||
334 |
// ---------------------------------------------------------------------------- |
|
335 |
// CPcsAlgorithm2Utils::MatchesOverlap |
|
336 |
// Check if two match location items have overlapping indices. |
|
337 |
// ---------------------------------------------------------------------------- |
|
338 |
TBool CPcsAlgorithm2Utils::MatchesOverlap( const TPsMatchLocation& aFirst, |
|
339 |
const TPsMatchLocation& aSecond ) |
|
340 |
{ |
|
341 |
TBool overlap = EFalse; |
|
342 |
||
343 |
if ( aFirst.index == aSecond.index ) |
|
344 |
{ |
|
345 |
overlap = ETrue; |
|
346 |
} |
|
347 |
else |
|
348 |
{ |
|
349 |
// give arguments alias names where first begins before the second |
|
350 |
TInt firstPos( aFirst.index ); |
|
351 |
TInt firstLen( aFirst.length ); |
|
352 |
TInt secondPos( aSecond.index ); |
|
353 |
if ( firstPos > secondPos ) |
|
354 |
{ |
|
355 |
firstPos = aSecond.index; |
|
356 |
firstLen = aSecond.length; |
|
357 |
secondPos = aFirst.index; |
|
358 |
} |
|
359 |
||
360 |
// there is an overlap if the end of the first comes after |
|
361 |
// beginning of the second |
|
362 |
if ( firstPos + firstLen > secondPos ) |
|
363 |
{ |
|
364 |
overlap = ETrue; |
|
365 |
} |
|
366 |
} |
|
367 |
||
368 |
return overlap; |
|
369 |
} |
|
370 |
||
371 |
// End of File |
|
372 |