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 |
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 |
||
19 |
// INCLUDES |
|
20 |
#include "CPcsAlgorithm1Utils.h" |
|
21 |
#include "CPsData.h" |
|
22 |
#include "CPcsDefs.h" |
|
23 |
#include "CPcsCache.h" |
|
24 |
#include "CPsQuery.h" |
|
25 |
#include "CPsQueryItem.h" |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
26 |
#include "CPcsDebug.h" |
63 | 27 |
|
28 |
#include <collate.h> |
|
29 |
||
30 |
// CONSTANTS |
|
31 |
_LIT(KSpace, ' '); |
|
32 |
||
33 |
// Search contacts in a group URI template |
|
34 |
_LIT(KGroupIdUri, "cntdb://c:contacts.gdb?id="); |
|
35 |
||
36 |
// ============================== MEMBER FUNCTIONS ============================ |
|
37 |
||
38 |
// ---------------------------------------------------------------------------- |
|
39 |
// CPcsAlgorithm1Utils::FormCompleteSearchResultsL() |
|
40 |
// Merges all the respective data store result sets to single set in sorted order. |
|
41 |
// ---------------------------------------------------------------------------- |
|
42 |
void CPcsAlgorithm1Utils::FormCompleteSearchResultsL(RPointerArray<CPSDATA_R_PTR_ARRAY>& aSearchResultsArr, |
|
43 |
RPointerArray<CPsData>& aSearchResults) |
|
44 |
{ |
|
45 |
CleanupClosePushL( aSearchResults ); |
|
46 |
TInt maxIndex = 0; |
|
47 |
TInt maxValue = aSearchResultsArr[maxIndex]->Count(); |
|
48 |
TLinearOrder<CPsData> rule( CPcsAlgorithm1Utils::CompareDataBySortOrderL ); |
|
49 |
||
50 |
// Find the largest array in aSearchResultsArr |
|
51 |
for(TInt i = 1; i < aSearchResultsArr.Count(); i++) |
|
52 |
{ |
|
53 |
if(aSearchResultsArr[i]->Count() > maxValue) |
|
54 |
{ |
|
55 |
maxIndex = i; |
|
56 |
maxValue =aSearchResultsArr[i]->Count(); |
|
57 |
} |
|
58 |
} |
|
59 |
||
60 |
// Assign the largets array to searchresults |
|
61 |
for(TInt i = 0; i < aSearchResultsArr[maxIndex]->Count(); i++) |
|
62 |
{ |
|
63 |
aSearchResults.Append((*(aSearchResultsArr[maxIndex]))[i]); |
|
64 |
} |
|
65 |
||
66 |
// Merge the remaining result arrays to the largest array in sequential order |
|
67 |
for(TInt i = 0; i < aSearchResultsArr.Count(); i++) |
|
68 |
{ |
|
69 |
// Check if we are not copying again the largest array |
|
70 |
if(( i != maxIndex) && ((aSearchResultsArr[i])->Count() != 0)) |
|
71 |
{ |
|
72 |
TInt numElements = (aSearchResultsArr[i])->Count(); |
|
73 |
for( TInt j = 0; j < numElements; j++) |
|
74 |
{ |
|
75 |
aSearchResults.InsertInOrderAllowRepeatsL((*(aSearchResultsArr[i]))[j], rule); |
|
76 |
} |
|
77 |
} |
|
78 |
} |
|
79 |
CleanupStack::Pop(); |
|
80 |
} |
|
81 |
||
82 |
// ---------------------------------------------------------------------------- |
|
83 |
// CPcsAlgorithm1Utils::CompareByCharacter() |
|
84 |
// Compare by character. |
|
85 |
// ---------------------------------------------------------------------------- |
|
86 |
TInt CPcsAlgorithm1Utils::CompareByCharacter( const TChar& aFirst, const TChar& aSecond ) |
|
87 |
{ |
|
88 |
TInt retValue; |
|
89 |
if ( aFirst == aSecond ) |
|
90 |
{ |
|
91 |
retValue = 0; |
|
92 |
} |
|
93 |
else if ( aFirst < aSecond ) |
|
94 |
{ |
|
95 |
retValue = -1; |
|
96 |
} |
|
97 |
else |
|
98 |
{ |
|
99 |
retValue = 1; |
|
100 |
} |
|
101 |
||
102 |
return retValue; |
|
103 |
} |
|
104 |
||
105 |
// ---------------------------------------------------------------------------- |
|
106 |
// CPcsAlgorithm1Utils::CompareByLength() |
|
107 |
// Compare by length. |
|
108 |
// ---------------------------------------------------------------------------- |
|
109 |
TInt CPcsAlgorithm1Utils::CompareByLength( const HBufC& aFirst, const HBufC& aSecond ) |
|
110 |
{ |
|
111 |
return ( aFirst.Length() - aSecond.Length() ); |
|
112 |
} |
|
113 |
||
114 |
// ---------------------------------------------------------------------------- |
|
115 |
// CPcsAlgorithm1Utils::CompareExact() |
|
116 |
// Compare strings exactly case sensitively. |
|
117 |
// ---------------------------------------------------------------------------- |
|
118 |
TBool CPcsAlgorithm1Utils::CompareExact( const TDesC& aFirst, const TDesC& aSecond ) |
|
119 |
{ |
|
120 |
return aFirst == aSecond; |
|
121 |
} |
|
122 |
||
123 |
// ---------------------------------------------------------------------------- |
|
124 |
// CPcsAlgorithm1Utils::CompareCollate() |
|
125 |
// Compare strings with collate rules depending on locale. |
|
126 |
// ---------------------------------------------------------------------------- |
|
127 |
TInt CPcsAlgorithm1Utils::CompareCollate( const TDesC& aFirst, const TDesC& aSecond ) |
|
128 |
{ |
|
129 |
return CPcsAlgorithm1Utils::MyCompareC(aFirst, aSecond); |
|
130 |
} |
|
131 |
||
132 |
// ---------------------------------------------------------------------------- |
|
133 |
// CPcsAlgorithm1Utils::MyCompareKeyAndString() |
|
134 |
// Compare for keys and strings: |
|
135 |
// - Case sensitive compare for keys, |
|
136 |
// - Case insensitive and language dependent compare for Contact Data and Query. |
|
137 |
// ---------------------------------------------------------------------------- |
|
138 |
TBool CPcsAlgorithm1Utils::MyCompareKeyAndString(const TDesC& aContactString, |
|
139 |
const TDesC& aQueryAsString, |
|
140 |
CPsQuery& aPsQuery) |
|
141 |
{ |
|
142 |
TBool comparison = MyCompareK(aContactString, aQueryAsString, aPsQuery); |
|
143 |
||
144 |
if (comparison) |
|
145 |
{ |
|
146 |
// The aContactString can be longer than aQueryAsString and we want a match to be |
|
147 |
// successful if both strings are equal for the length of the query (aQueryAsString) |
|
148 |
comparison = (MyCompareC(aContactString.Left(aQueryAsString.Length()), aQueryAsString) == 0); |
|
149 |
} |
|
150 |
||
151 |
return comparison; |
|
152 |
} |
|
153 |
||
154 |
// ---------------------------------------------------------------------------- |
|
155 |
// CPcsAlgorithm1Utils::MyCompareK() |
|
156 |
// Case sensitive compare for keys of first 2 input params. |
|
157 |
// INFO: We have some cases that TPtiKey "Z" (uppercase) is mapping chars "Zz...." |
|
158 |
// and TPtiKey "z" (lowercase) is mapping chars ".," or "Ää". |
|
159 |
// The comparison of "Z" and "z" should fail for the keys. |
|
160 |
// ---------------------------------------------------------------------------- |
|
161 |
TBool CPcsAlgorithm1Utils::MyCompareK(const TDesC& aLeft, const TDesC& aRight, CPsQuery& aPsQuery) |
|
162 |
{ |
|
163 |
TBool comparison = ETrue; |
|
164 |
||
165 |
if ( (aLeft.Length() < aPsQuery.Count()) || (aRight.Length() < aPsQuery.Count()) ) |
|
166 |
{ |
|
167 |
comparison = EFalse; |
|
168 |
} |
|
169 |
else |
|
170 |
{ |
|
171 |
for ( TInt i = 0; i < aPsQuery.Count(); i++ ) |
|
172 |
{ |
|
173 |
CPsQueryItem* currentItemPtr; |
|
174 |
TRAPD ( err, currentItemPtr = &(aPsQuery.GetItemAtL(i)) ); |
|
175 |
if ( err != KErrNone |
|
176 |
|| ( CPcsKeyMap::IsModePredictive(currentItemPtr->Mode()) |
|
177 |
&& aLeft[i] != aRight[i] ) ) |
|
178 |
{ |
|
179 |
comparison = EFalse; |
|
180 |
break; |
|
181 |
} |
|
182 |
} |
|
183 |
} |
|
184 |
||
185 |
return comparison; |
|
186 |
} |
|
187 |
||
188 |
// ---------------------------------------------------------------------------- |
|
189 |
// CPcsAlgorithm1Utils::MyCompareC() |
|
190 |
// Lang specific MyCompareC |
|
191 |
// ---------------------------------------------------------------------------- |
|
192 |
TInt CPcsAlgorithm1Utils::MyCompareC(const TDesC& aLeft, const TDesC& aRight) |
|
193 |
{ |
|
194 |
// Get the current language |
|
195 |
TLanguage lang = User::Language(); |
|
196 |
||
197 |
// Get the standard method |
|
198 |
TCollationMethod meth = *Mem::CollationMethodByIndex( 0 ); |
|
199 |
meth.iFlags |= TCollationMethod::EIgnoreNone; |
|
200 |
meth.iFlags |= TCollationMethod::EFoldCase; |
|
201 |
||
202 |
if ( lang == ELangHindi || lang == ELangMarathi ) |
|
203 |
{ |
|
204 |
meth.iFlags |= TCollationMethod::EIgnoreCombining; |
|
205 |
} |
|
206 |
||
207 |
// Collation level 0 is used |
|
208 |
TInt comparison(aLeft.CompareC( aRight, 0, &meth )); |
|
209 |
return comparison; |
|
210 |
} |
|
211 |
||
212 |
// ---------------------------------------------------------------------------- |
|
213 |
// CPcsAlgorithm1Utils::CompareDataBySortOrderL() |
|
214 |
// TLinearOrder rule for comparison of data objects |
|
215 |
// ---------------------------------------------------------------------------- |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
216 |
TInt CPcsAlgorithm1Utils::CompareDataBySortOrderL(const CPsData& aObject1, |
63 | 217 |
const CPsData& aObject2) |
218 |
{ |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
219 |
TInt compareRes = 0; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
220 |
|
63 | 221 |
if( CPsData::CompareById(aObject1, aObject2) ) |
222 |
{ |
|
223 |
return compareRes; |
|
224 |
} |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
225 |
|
63 | 226 |
// Fetch the cache list stored in TLS to recover the sort order |
227 |
typedef RPointerArray<CPcsCache> PTR; |
|
228 |
PTR* pcsCache = static_cast<PTR*>(Dll::Tls()); |
|
229 |
User::LeaveIfNull(pcsCache); |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
230 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
231 |
CPcsCache* cache1 = (*pcsCache)[aObject1.UriId()]; |
63 | 232 |
CPcsCache* cache2 = (*pcsCache)[aObject2.UriId()]; |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
233 |
RArray<TInt> indexOrder1; |
63 | 234 |
RArray<TInt> indexOrder2; |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
235 |
|
63 | 236 |
// 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
|
237 |
cache1->GetIndexOrder(indexOrder1); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
238 |
CleanupClosePushL(indexOrder1); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
239 |
cache2->GetIndexOrder(indexOrder2); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
240 |
CleanupClosePushL(indexOrder2); |
63 | 241 |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
242 |
// 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
|
243 |
TBool sameIndexOrder = ETrue; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
244 |
if ( indexOrder1.Count() != indexOrder2.Count() ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
245 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
246 |
sameIndexOrder = EFalse; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
247 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
248 |
else |
63 | 249 |
{ |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
250 |
for ( TInt i = 0; i < indexOrder1.Count(); i++ ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
251 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
252 |
if (indexOrder1[i] != indexOrder2[i]) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
253 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
254 |
sameIndexOrder = EFalse; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
255 |
break; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
256 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
257 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
258 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
259 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
260 |
// Sort Orders among different caches should be the same, anyway |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
261 |
// 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
|
262 |
if (!sameIndexOrder) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
263 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
264 |
compareRes = aObject1.UriId() - aObject2.UriId(); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
265 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
266 |
CleanupStack::PopAndDestroy(&indexOrder2); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
267 |
CleanupStack::PopAndDestroy(&indexOrder1); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
268 |
return compareRes; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
269 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
270 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
271 |
// 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
|
272 |
// fields skipping the ones that are empty |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
273 |
TInt indexCount = indexOrder1.Count(); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
274 |
TInt idx1 = 0; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
275 |
TInt idx2 = 0; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
276 |
while ( compareRes == 0 && idx1 < indexCount && idx2 < indexCount ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
277 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
278 |
// Get contact field of 1st contact |
63 | 279 |
TInt object1Idx = indexOrder1[idx1]; |
280 |
HBufC* strCompare1 = aObject1.Data(object1Idx)->Des().AllocLC(); |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
281 |
TPtr strCompare1Ptr( strCompare1->Des() ); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
282 |
CPcsAlgorithm1Utils::MyTrim( strCompare1Ptr ); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
283 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
284 |
// Get contact field of 2nd contact |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
285 |
TInt object2Idx = indexOrder2[idx2]; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
286 |
HBufC* strCompare2 = aObject2.Data(object2Idx)->Des().AllocLC(); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
287 |
TPtr strCompare2Ptr( strCompare2->Des() ); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
288 |
CPcsAlgorithm1Utils::MyTrim( strCompare2Ptr ); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
289 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
290 |
if ( strCompare1->Length() > 0 && strCompare2->Length() > 0 ) |
63 | 291 |
{ |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
292 |
compareRes = CPcsAlgorithm1Utils::MyCompareC(*strCompare1, *strCompare2); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
293 |
idx1++; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
294 |
idx2++; |
63 | 295 |
} |
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
296 |
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
|
297 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
298 |
if ( strCompare1->Length() == 0 ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
299 |
idx1++; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
300 |
if ( strCompare2->Length() == 0 ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
301 |
idx2++; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
302 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
303 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
304 |
CleanupStack::PopAndDestroy(strCompare2); |
63 | 305 |
CleanupStack::PopAndDestroy(strCompare1); |
306 |
} |
|
68
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
307 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
308 |
// 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
|
309 |
if ( compareRes == 0 ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
310 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
311 |
if ( idx1 != idx2 ) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
312 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
313 |
// Compare by index position |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
314 |
// 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
|
315 |
// Contact1=[FN:"", LN:"Smith"], idx1=2 |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
316 |
// Contact2=[FN:"Smith", LN:"Donald"], idx2=1 |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
317 |
// 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
|
318 |
// and the return value of this method has to be < 0 (idx2-idx1) |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
319 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
320 |
compareRes = idx2 - idx1; |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
321 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
322 |
else |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
323 |
{ |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
324 |
// Compare by URI ID as 1st choice and Contact ID as 2nd choice |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
325 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
326 |
compareRes == ( aObject1.UriId() != aObject2.UriId() ) ? |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
327 |
aObject1.UriId() - aObject2.UriId() : aObject1.Id() - aObject2.Id(); |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
328 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
329 |
} |
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
330 |
|
9da50d567e3c
Revision: 201033
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
63
diff
changeset
|
331 |
CleanupStack::PopAndDestroy(&indexOrder2); |
63 | 332 |
CleanupStack::PopAndDestroy(&indexOrder1); |
333 |
||
334 |
return compareRes; |
|
335 |
} |
|
336 |
||
337 |
||
338 |
// ---------------------------------------------------------------------------- |
|
339 |
// CPcsAlgorithm1Utils::MyTrim() |
|
340 |
// Trim off all white spaces and special characters |
|
341 |
// This behavior is required to mimic the current phonebook sort sequence |
|
342 |
// ---------------------------------------------------------------------------- |
|
343 |
void CPcsAlgorithm1Utils::MyTrim(TDes& aString) |
|
344 |
{ |
|
345 |
for ( TInt i = aString.Length(); --i >= 0; ) |
|
346 |
{ |
|
347 |
TChar c = (TChar) aString[i]; |
|
348 |
||
349 |
if ( ! c.IsAlphaDigit() ) |
|
350 |
{ |
|
351 |
aString.Replace( i, 1, KSpace ); |
|
352 |
} |
|
353 |
} |
|
354 |
||
355 |
aString.TrimAll(); |
|
356 |
} |
|
357 |
||
358 |
// ---------------------------------------------------------------------------- |
|
359 |
// CPcsAlgorithm1Utils::IsGroupUri() |
|
360 |
// Check if the input URI is of contact search in a group template form |
|
361 |
// ---------------------------------------------------------------------------- |
|
362 |
TBool CPcsAlgorithm1Utils::IsGroupUri(TDesC& aURI) |
|
363 |
{ |
|
364 |
TBuf<255> uri(aURI); |
|
365 |
uri.LowerCase(); |
|
366 |
||
367 |
TInt index = uri.FindF(KGroupIdUri); |
|
368 |
||
369 |
if ( index == KErrNotFound ) |
|
370 |
{ |
|
371 |
return EFalse; |
|
372 |
} |
|
373 |
||
374 |
return ETrue; |
|
375 |
} |
|
376 |
||
377 |
// ---------------------------------------------------------------------------- |
|
378 |
// CPcsAlgorithm1Helper::FilterDataFieldsL() |
|
379 |
// Constructs a bit pattern using the required/supported data fields |
|
380 |
// For example, 6, 4 and 27 are supported fields <-- 00000111 |
|
381 |
// 6 and 4 are required fields <-- 00000011 |
|
382 |
// Bit pattern returned is 00000011. |
|
383 |
// ---------------------------------------------------------------------------- |
|
384 |
TUint8 CPcsAlgorithm1Utils::FilterDataFieldsL(const RArray<TInt>& aRequiredDataFields, |
|
385 |
const RArray<TInt>& aSupportedDataFields) |
|
386 |
{ |
|
387 |
TUint8 filteredMatch = 0x0; |
|
388 |
||
389 |
for ( TInt i = 0; i < aSupportedDataFields.Count(); i++ ) |
|
390 |
{ |
|
391 |
for ( TInt j = 0; j < aRequiredDataFields.Count(); j++ ) |
|
392 |
{ |
|
393 |
if ( aSupportedDataFields[i] == aRequiredDataFields[j] ) |
|
394 |
{ |
|
395 |
TUint8 val = 1 << i; |
|
396 |
filteredMatch |= val; |
|
397 |
} |
|
398 |
} |
|
399 |
} |
|
400 |
||
401 |
return filteredMatch; |
|
402 |
} |
|
403 |
||
404 |
// ---------------------------------------------------------------------------- |
|
405 |
// CPcsAlgorithm1Utils::AppendMatchToSeqL |
|
406 |
// ---------------------------------------------------------------------------- |
|
407 |
void CPcsAlgorithm1Utils::AppendMatchToSeqL( |
|
408 |
RPointerArray<TDesC>& aMatchSeq, const TDesC& aMatch ) |
|
409 |
{ |
|
410 |
CleanupResetAndDestroyPushL( aMatchSeq ); |
|
411 |
||
412 |
HBufC* seq = aMatch.AllocLC(); |
|
413 |
seq->Des().UpperCase(); |
|
414 |
TIdentityRelation<TDesC> rule(CompareExact); |
|
415 |
if ( aMatchSeq.Find(seq, rule) == KErrNotFound ) |
|
416 |
{ |
|
417 |
aMatchSeq.AppendL(seq); |
|
418 |
CleanupStack::Pop( seq ); |
|
419 |
} |
|
420 |
else |
|
421 |
{ |
|
422 |
CleanupStack::PopAndDestroy( seq ); |
|
423 |
} |
|
424 |
CleanupStack::Pop( &aMatchSeq ); |
|
425 |
} |
|
426 |
||
427 |
// End of File |
|
428 |