20
|
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: Predictive Contact Search Algorithm 1 main class
|
|
15 |
*
|
|
16 |
*/
|
|
17 |
|
|
18 |
|
|
19 |
// INCLUDES
|
|
20 |
#include "CPcsAlgorithm1.h"
|
|
21 |
#include "CPcsAlgorithm1Helper.h"
|
|
22 |
#include "CPcsAlgorithm1MultiSearchHelper.h"
|
|
23 |
#include "CPcsAlgorithm1Utils.h"
|
|
24 |
#include "CPcsDebug.h"
|
|
25 |
#include "CPcsCache.h"
|
|
26 |
#include "CPcsKeyMap.h"
|
|
27 |
#include "CPsData.h"
|
|
28 |
#include "CWords.h"
|
|
29 |
#include "CPsQuery.h"
|
|
30 |
#include "CPsDataPluginInterface.h"
|
|
31 |
#include "CPcsDefs.h"
|
|
32 |
|
|
33 |
const TText KSpace = ' ';
|
|
34 |
|
|
35 |
|
|
36 |
// ============================== MEMBER FUNCTIONS ============================
|
|
37 |
|
|
38 |
// ----------------------------------------------------------------------------
|
|
39 |
// CPcsAlgorithm1::NewL
|
|
40 |
// Two Phase Construction
|
|
41 |
// ----------------------------------------------------------------------------
|
|
42 |
CPcsAlgorithm1* CPcsAlgorithm1::NewL()
|
|
43 |
{
|
|
44 |
PRINT ( _L("Enter CPcsAlgorithm1::NewL") );
|
|
45 |
|
|
46 |
CPcsAlgorithm1* self = new ( ELeave ) CPcsAlgorithm1();
|
|
47 |
CleanupStack::PushL( self );
|
|
48 |
self->ConstructL();
|
|
49 |
CleanupStack::Pop( self );
|
|
50 |
|
|
51 |
PRINT ( _L("End CPcsAlgorithm1::NewL") );
|
|
52 |
|
|
53 |
return self;
|
|
54 |
}
|
|
55 |
|
|
56 |
// ----------------------------------------------------------------------------
|
|
57 |
// CPcsAlgorithm1::CPcsAlgorithm1
|
|
58 |
// Two Phase Construction
|
|
59 |
// ----------------------------------------------------------------------------
|
|
60 |
CPcsAlgorithm1::CPcsAlgorithm1()
|
|
61 |
{
|
|
62 |
PRINT ( _L("Enter CPcsAlgorithm1::CPcsAlgorithm1") );
|
|
63 |
PRINT ( _L("End CPcsAlgorithm1::CPcsAlgorithm1") );
|
|
64 |
}
|
|
65 |
|
|
66 |
// ----------------------------------------------------------------------------
|
|
67 |
// CPcsAlgorithm1::ConstructL
|
|
68 |
// Two Phase Construction
|
|
69 |
// ----------------------------------------------------------------------------
|
|
70 |
void CPcsAlgorithm1::ConstructL()
|
|
71 |
{
|
|
72 |
PRINT ( _L("Enter CPcsAlgorithm1::ConstructL") );
|
|
73 |
|
|
74 |
iCacheStatus = ECachingNotStarted; // Starting status
|
|
75 |
iCacheError = KErrNone; // No error
|
|
76 |
|
|
77 |
iPluginLauncher = CIdle::NewL( CActive::EPriorityStandard );
|
|
78 |
|
|
79 |
// Define cache status property used to inform clients about the caching status.
|
|
80 |
DefinePropertyL( EPsKeyCacheStatus );
|
|
81 |
|
|
82 |
// Define cache error property used to inform client about the errors.
|
|
83 |
DefinePropertyL( EPsKeyCacheError );
|
|
84 |
|
|
85 |
// Define properties for notifying about cache updates
|
|
86 |
DefinePropertyL( EPsKeyContactRemovedCounter );
|
|
87 |
DefinePropertyL( EPsKeyContactModifiedCounter );
|
|
88 |
DefinePropertyL( EPsKeyContactAddedCounter );
|
|
89 |
|
|
90 |
// Initialize key map and pti engine
|
|
91 |
TInt keyMapErr = KErrNone;
|
|
92 |
TRAP( keyMapErr, iKeyMap = CPcsKeyMap::NewL() );
|
|
93 |
if ( keyMapErr != KErrNone )
|
|
94 |
{
|
|
95 |
PRINT ( _L("**********************************************."));
|
|
96 |
PRINT1( _L("CPcsAlgorithm1::ConstructL() KeyMap construction error. The keymap crashed with error code %d."),keyMapErr );
|
|
97 |
PRINT ( _L("Please check the keypad/language for which keymap got crashed.") );
|
|
98 |
PRINT ( _L("**********************************************."));
|
|
99 |
User::Leave( keyMapErr ); // we can't go on without a key map; constructing cache needs it
|
|
100 |
}
|
|
101 |
|
|
102 |
// Initialize helpers
|
|
103 |
iHelper = CPcsAlgorithm1Helper::NewL(this);
|
|
104 |
iMultiSearchHelper = CPcsAlgorithm1MultiSearchHelper::NewL(this);
|
|
105 |
|
|
106 |
if(!iPluginLauncher->IsActive())
|
|
107 |
{
|
|
108 |
iPluginLauncher->Start(TCallBack(CPcsAlgorithm1::DoLaunchPluginsL, this));
|
|
109 |
}
|
|
110 |
|
|
111 |
PRINT ( _L("End CPcsAlgorithm1::ConstructL") );
|
|
112 |
}
|
|
113 |
|
|
114 |
// ----------------------------------------------------------------------------
|
|
115 |
// CPcsAlgorithm1::~CPcsAlgorithm1
|
|
116 |
// Destructor
|
|
117 |
// ----------------------------------------------------------------------------
|
|
118 |
CPcsAlgorithm1::~CPcsAlgorithm1()
|
|
119 |
{
|
|
120 |
PRINT ( _L("Enter CPcsAlgorithm1::~CPcsAlgorithm1") );
|
|
121 |
|
|
122 |
// Clear TLS
|
|
123 |
Dll::SetTls(NULL);
|
|
124 |
|
|
125 |
// Cleanup cache
|
|
126 |
iPcsCache.ResetAndDestroy();
|
|
127 |
|
|
128 |
// Cleanup adapters interface and key handling
|
|
129 |
delete iKeyMap;
|
|
130 |
delete iPsDataPluginInterface;
|
|
131 |
|
|
132 |
// Cleanup helpers
|
|
133 |
delete iHelper;
|
|
134 |
delete iMultiSearchHelper;
|
|
135 |
|
|
136 |
delete iPluginLauncher;
|
|
137 |
|
|
138 |
PRINT ( _L("End CPcsAlgorithm1::~CPcsAlgorithm1") );
|
|
139 |
}
|
|
140 |
|
|
141 |
// ----------------------------------------------------------------------------
|
|
142 |
// CPcsAlgorithm1::DefinePropertyL
|
|
143 |
// Define a P&S property with given key under the internal category
|
|
144 |
// UID of PCS. Leave if definition fails for any other reason than
|
|
145 |
// key already existing.
|
|
146 |
// ----------------------------------------------------------------------------
|
|
147 |
void CPcsAlgorithm1::DefinePropertyL( TPcsInternalKeyCacheStatus aPsKey )
|
|
148 |
{
|
|
149 |
TInt err = RProperty::Define( KPcsInternalUidCacheStatus,
|
|
150 |
aPsKey,
|
|
151 |
RProperty::EInt );
|
|
152 |
if ( err != KErrAlreadyExists )
|
|
153 |
{
|
|
154 |
User::LeaveIfError(err);
|
|
155 |
}
|
|
156 |
}
|
|
157 |
|
|
158 |
// ----------------------------------------------------------------------------
|
|
159 |
// CPcsAlgorithm1::RemoveSpacesL
|
|
160 |
// Remove leading and trailing spaces of search query
|
|
161 |
// ----------------------------------------------------------------------------
|
|
162 |
void CPcsAlgorithm1::RemoveSpacesL(CPsQuery& aQuery)
|
|
163 |
{
|
|
164 |
PRINT ( _L("Enter CPcsAlgorithm1::RemoveSpacesL") );
|
|
165 |
|
|
166 |
//PRINTQUERY ( _L("CPcsAlgorithm1::RemoveSpacesL (BEFORE): "), aQuery );
|
|
167 |
|
|
168 |
// Remove all leading " "
|
|
169 |
while ( aQuery.Count() > 0 )
|
|
170 |
{
|
|
171 |
CPsQueryItem& item = aQuery.GetItemAtL(0); // First
|
|
172 |
if ( !item.Character().IsSpace() )
|
|
173 |
{
|
|
174 |
break;
|
|
175 |
}
|
|
176 |
aQuery.Remove(0);
|
|
177 |
}
|
|
178 |
|
|
179 |
// Remove all trailing " "
|
|
180 |
while ( aQuery.Count() > 0 )
|
|
181 |
{
|
|
182 |
CPsQueryItem& item = aQuery.GetItemAtL(aQuery.Count()-1); // Last
|
|
183 |
if ( !item.Character().IsSpace() )
|
|
184 |
{
|
|
185 |
break;
|
|
186 |
}
|
|
187 |
aQuery.Remove(aQuery.Count()-1);
|
|
188 |
}
|
|
189 |
|
|
190 |
//PRINTQUERY ( _L("CPcsAlgorithm1::RemoveSpacesL (AFTER): "), aQuery );
|
|
191 |
|
|
192 |
PRINT ( _L("End CPcsAlgorithm1::RemoveSpacesL") );
|
|
193 |
}
|
|
194 |
|
|
195 |
// ----------------------------------------------------------------------------
|
|
196 |
// CPcsAlgorithm1::ReplaceZeroWithSpaceL
|
|
197 |
// Replace all "0"s in a search query with " "s if those characters are on
|
|
198 |
// the same key.
|
|
199 |
// ----------------------------------------------------------------------------
|
|
200 |
TBool CPcsAlgorithm1::ReplaceZeroWithSpaceL(CPsQuery& aQuery)
|
|
201 |
{
|
|
202 |
PRINT ( _L("Enter CPcsAlgorithm1::ReplaceZeroWithSpaceL") );
|
|
203 |
|
|
204 |
//PRINTQUERY ( _L("CPcsAlgorithm1::ReplaceZeroWithSpaceL (BEFORE): "), aQuery );
|
|
205 |
|
|
206 |
TBool queryModified = EFalse;
|
|
207 |
|
|
208 |
/* In phones like E52 and E55, where the "0" and the " " characters are on
|
|
209 |
* the same key, the "0"s have to be considered as possible separators.
|
|
210 |
*
|
|
211 |
* In phones like N97 and E72, where the "0" and the " " characters are on
|
|
212 |
* different keys, the "0"s must not be considered as possible separators.
|
|
213 |
*/
|
|
214 |
|
|
215 |
// Skip initial "0"s, they are not replaced into spaces
|
|
216 |
TInt skipIndex = 0;
|
|
217 |
while ( (skipIndex < aQuery.Count()) &&
|
|
218 |
(aQuery.GetItemAtL(skipIndex).Character().GetNumericValue() == 0) )
|
|
219 |
{
|
|
220 |
skipIndex++;
|
|
221 |
}
|
|
222 |
|
|
223 |
// Replace remaining "0"s into spaces in case they are entered with a keyboard
|
|
224 |
// that has "0" and " " on the same key.
|
|
225 |
for ( TInt index = skipIndex; index < aQuery.Count(); index++ )
|
|
226 |
{
|
|
227 |
CPsQueryItem& item = aQuery.GetItemAtL(index);
|
|
228 |
|
|
229 |
if ( iKeyMap->GetSpaceAndZeroOnSameKey( item.Mode() ) &&
|
|
230 |
item.Character().GetNumericValue() == 0 )
|
|
231 |
{
|
|
232 |
item.SetCharacter(KSpace);
|
|
233 |
queryModified = ETrue;
|
|
234 |
}
|
|
235 |
}
|
|
236 |
|
|
237 |
//PRINTQUERY ( _L("CPcsAlgorithm1::ReplaceZeroWithSpaceL (AFTER): "), aQuery );
|
|
238 |
|
|
239 |
PRINT1 ( _L("CPcsAlgorithm1::ReplaceZeroWithSpaceL: Query modified (0=not, 1=yes): %d"), queryModified );
|
|
240 |
|
|
241 |
PRINT ( _L("End CPcsAlgorithm1::ReplaceZeroWithSpaceL") );
|
|
242 |
|
|
243 |
return queryModified;
|
|
244 |
}
|
|
245 |
|
|
246 |
// ----------------------------------------------------------------------------
|
|
247 |
// CPcsAlgorithm1::PerformSearchL
|
|
248 |
// Search function for cache
|
|
249 |
// ----------------------------------------------------------------------------
|
|
250 |
void CPcsAlgorithm1::PerformSearchL(const CPsSettings& aSettings,
|
|
251 |
CPsQuery& aQuery,
|
|
252 |
RPointerArray<CPsClientData>& aSearchResults,
|
|
253 |
RPointerArray<CPsPattern>& aSearchSeqs)
|
|
254 |
{
|
|
255 |
PRINT ( _L("Enter CPcsAlgorithm1::PerformSearchL") );
|
|
256 |
|
|
257 |
__LATENCY_MARK ( _L("CPcsAlgorithm1::PerformSearchL") );
|
|
258 |
|
|
259 |
// Check aSettings
|
|
260 |
RPointerArray<TDesC> searchUris;
|
|
261 |
CleanupResetAndDestroyPushL( searchUris );
|
|
262 |
aSettings.SearchUrisL(searchUris);
|
|
263 |
|
|
264 |
if ( searchUris.Count() <= 0)
|
|
265 |
{
|
|
266 |
PRINT ( _L("searchUris.Count() <= 0, Leave from CPcsAlgorithm1::PerformSearchL") );
|
|
267 |
User::Leave(KErrArgument);
|
|
268 |
}
|
|
269 |
CleanupStack::PopAndDestroy( &searchUris ); // ResetAndDestroy
|
|
270 |
|
|
271 |
// Local arrays to hold the search results
|
|
272 |
RPointerArray<CPsData> tempSearchResults;
|
|
273 |
CleanupClosePushL( tempSearchResults );
|
|
274 |
RPointerArray<CPsData> tempSearchResultsIni;
|
|
275 |
CleanupClosePushL( tempSearchResultsIni );
|
|
276 |
RPointerArray<CPsData> tempSearchResultsMod;
|
|
277 |
CleanupClosePushL( tempSearchResultsMod );
|
|
278 |
|
|
279 |
// ----------------------- Perform the basic search -----------------------
|
|
280 |
/* Even before replacing zeroes with spaces the query can have multiple words
|
|
281 |
* Some phones support infact double keyboards with possibility to type a space in qwerty mode
|
|
282 |
* A space in qwerty mode can even be typed disabling temporarily PCS
|
|
283 |
*/
|
|
284 |
RemoveSpacesL(aQuery);
|
|
285 |
PRINTQUERY ( _L("CPcsAlgorithm1::PerformSearchL: 1st search query: "), aQuery );
|
|
286 |
DoSearchL(aSettings, aQuery, tempSearchResultsIni, aSearchSeqs );
|
|
287 |
// ------------------------------------------------------------------------
|
|
288 |
|
|
289 |
// ---- Perform new search after "0" replacement if query is not empty ----
|
|
290 |
/* Examples:
|
|
291 |
* - If the original search string is "Abc0" then we will search again with "Abc".
|
|
292 |
* - If the original search string is "00" then we will not search again.
|
|
293 |
* - If the original search string is "00Zxc" then we will search again with "Zxc".
|
|
294 |
*/
|
|
295 |
TBool isQueryModified = ReplaceZeroWithSpaceL(aQuery);
|
|
296 |
RemoveSpacesL(aQuery);
|
|
297 |
if ( isQueryModified && (aQuery.Count() > 0) )
|
|
298 |
{
|
|
299 |
PRINTQUERY ( _L("CPcsAlgorithm1::PerformSearchL: 2nd search query: "), aQuery );
|
|
300 |
DoSearchL(aSettings, aQuery, tempSearchResultsMod, aSearchSeqs );
|
|
301 |
}
|
|
302 |
// ------------------------------------------------------------------------
|
|
303 |
|
|
304 |
// ------------------ Merge and sort the search results -------------------
|
|
305 |
if ( tempSearchResultsIni.Count() + tempSearchResultsMod.Count() > 0)
|
|
306 |
{
|
|
307 |
// Sort rule
|
|
308 |
TLinearOrder<CPsData> rule( CPcsAlgorithm1Utils::CompareDataBySortOrderL );
|
|
309 |
|
|
310 |
// Avoid duplicates and add new results
|
|
311 |
TIdentityRelation<CPsData> identityRule(CPsData::CompareById);
|
|
312 |
|
|
313 |
for ( TInt i = 0; i < tempSearchResultsIni.Count(); i++ )
|
|
314 |
{
|
|
315 |
if ( tempSearchResults.Find( tempSearchResultsIni[i],identityRule ) == KErrNotFound )
|
|
316 |
{
|
|
317 |
if (aSettings.GetSortType() == EAlphabetical)
|
|
318 |
{
|
|
319 |
tempSearchResults.InsertInOrderAllowRepeats(tempSearchResultsIni[i], rule);
|
|
320 |
}
|
|
321 |
else
|
|
322 |
{
|
|
323 |
tempSearchResults.AppendL(tempSearchResultsIni[i]);
|
|
324 |
}
|
|
325 |
}
|
|
326 |
}
|
|
327 |
|
|
328 |
for ( TInt i = 0; i < tempSearchResultsMod.Count(); i++ )
|
|
329 |
{
|
|
330 |
if ( tempSearchResults.Find( tempSearchResultsMod[i],identityRule ) == KErrNotFound )
|
|
331 |
{
|
|
332 |
if (aSettings.GetSortType() == EAlphabetical)
|
|
333 |
{
|
|
334 |
tempSearchResults.InsertInOrderAllowRepeats(tempSearchResultsMod[i], rule);
|
|
335 |
}
|
|
336 |
else
|
|
337 |
{
|
|
338 |
tempSearchResults.AppendL(tempSearchResultsMod[i]);
|
|
339 |
}
|
|
340 |
}
|
|
341 |
}
|
|
342 |
}
|
|
343 |
// ------------------------------------------------------------------------
|
|
344 |
|
|
345 |
// ------------------ Write result objects to the stream ------------------
|
|
346 |
// Truncate the result set if required
|
|
347 |
TInt maxNumToDisplay = aSettings.MaxResults();
|
|
348 |
TInt resultSetCount = tempSearchResults.Count();
|
|
349 |
TInt numToDisplay = 0;
|
|
350 |
if ( maxNumToDisplay == -1 )
|
|
351 |
{
|
|
352 |
numToDisplay = resultSetCount;
|
|
353 |
}
|
|
354 |
else
|
|
355 |
{
|
|
356 |
numToDisplay = Min( maxNumToDisplay, resultSetCount );
|
|
357 |
}
|
|
358 |
|
|
359 |
// Copy desired number of results from tempSearchResults to the results stream
|
|
360 |
for (TInt i = 0; i < numToDisplay; i++)
|
|
361 |
{
|
|
362 |
aSearchResults.Append(WriteClientDataL(*(tempSearchResults[i])));
|
|
363 |
}
|
|
364 |
// ------------------------------------------------------------------------
|
|
365 |
|
|
366 |
// Cleanup local results array
|
|
367 |
CleanupStack::PopAndDestroy( &tempSearchResultsMod ); // Close, don't destroy
|
|
368 |
CleanupStack::PopAndDestroy( &tempSearchResultsIni ); // Close, don't destroy
|
|
369 |
CleanupStack::PopAndDestroy( &tempSearchResults ); // Close, don't destroy
|
|
370 |
|
|
371 |
__LATENCY_MARKEND ( _L("CPcsAlgorithm1::PerformSearchL") );
|
|
372 |
|
|
373 |
PRINT ( _L("End CPcsAlgorithm1::PerformSearchL") );
|
|
374 |
}
|
|
375 |
|
|
376 |
// ----------------------------------------------------------------------------
|
|
377 |
// CPcsAlgorithm1::SearchInputL
|
|
378 |
// Search function for input string
|
|
379 |
// ----------------------------------------------------------------------------
|
|
380 |
void CPcsAlgorithm1::SearchInputL(CPsQuery& aQuery,
|
|
381 |
TDesC& aData,
|
|
382 |
RPointerArray<TDesC>& aMatchSet,
|
|
383 |
RArray<TPsMatchLocation>& aMatchLocation )
|
|
384 |
{
|
|
385 |
PRINT ( _L("Enter CPcsAlgorithm1::SearchInputL") );
|
|
386 |
|
|
387 |
__LATENCY_MARK ( _L("CPcsAlgorithm1::SearchInputL") );
|
|
388 |
|
|
389 |
// ----------------------- Perform the basic search -----------------------
|
|
390 |
/* Even before replacing zeroes with spaces the query can have multiple words
|
|
391 |
* Some phones support infact double keyboards with possibility to type a space in qwerty mode
|
|
392 |
* A space in qwerty mode can even be typed disabling temporarily PCS
|
|
393 |
*/
|
|
394 |
RemoveSpacesL(aQuery);
|
|
395 |
DoSearchInputL(aQuery, aData, aMatchSet, aMatchLocation);
|
|
396 |
PRINTQUERY ( _L("CPcsAlgorithm1::SearchInputL: 1st search: "), aQuery );
|
|
397 |
PRINT1 ( _L("CPcsAlgorithm1::SearchInputL: 1st search: Search Data: %S"), &aData );
|
|
398 |
PRINTMATCHSET ( _L("CPcsAlgorithm1::SearchInputL: 1st search: "), aMatchSet );
|
|
399 |
PRINTMATCHLOC ( _L("CPcsAlgorithm1::SearchInputL: 1st search: "), aMatchLocation );
|
|
400 |
// ------------------------------------------------------------------------
|
|
401 |
|
|
402 |
// ---- Perform new search after "0" replacement if query is not empty ----
|
|
403 |
/* Examples:
|
|
404 |
* - If the original search string is "Abc0" then we will search again with "Abc".
|
|
405 |
* - If the original search string is "00" then we will not search again.
|
|
406 |
*/
|
|
407 |
TBool isQueryModified = ReplaceZeroWithSpaceL(aQuery);
|
|
408 |
RemoveSpacesL(aQuery);
|
|
409 |
if ( isQueryModified && (aQuery.Count() > 0) )
|
|
410 |
{
|
|
411 |
DoSearchInputL(aQuery, aData, aMatchSet, aMatchLocation);
|
|
412 |
PRINTQUERY ( _L("CPcsAlgorithm1::SearchInputL: 2nd search: "), aQuery );
|
|
413 |
PRINT1 ( _L("CPcsAlgorithm1::SearchInputL: 2nd search: Search Data: %S"), &aData );
|
|
414 |
PRINTMATCHSET ( _L("CPcsAlgorithm1::SearchInputL: 2nd search: "), aMatchSet );
|
|
415 |
PRINTMATCHLOC ( _L("CPcsAlgorithm1::SearchInputL: 2nd search: "), aMatchLocation );
|
|
416 |
}
|
|
417 |
/* In cases like we have a contact "Nik0 Abc" and the search query is "Nik0" we do:
|
|
418 |
* - a 1st search with "Nik0" that matches "Nik0" (4 chars) of "Nik0 Abc",
|
|
419 |
* - a 2nd search with "Nik" that matches "Nik" (3 chars) of "Nik0 Abc".
|
|
420 |
* We have to remove from aMatchLocation the occurrence that has a shorter match length.
|
|
421 |
* We have to remove the match ("Nik" in this case) even from aMatchSet if there is not
|
|
422 |
* any other match for it than the one in "Nik0".
|
|
423 |
*/
|
|
424 |
|
|
425 |
// --- Remove duplicate items from aMatchLocation ---
|
|
426 |
TInt i = 0;
|
|
427 |
TBool incrementFirstCursor;
|
|
428 |
while ( i < aMatchLocation.Count() )
|
|
429 |
{
|
|
430 |
incrementFirstCursor = ETrue;
|
|
431 |
TInt j = i+1;
|
|
432 |
while ( j < aMatchLocation.Count() )
|
|
433 |
{
|
|
434 |
if (aMatchLocation[j].index == aMatchLocation[i].index)
|
|
435 |
{
|
|
436 |
// Remove match location item with smallest length if 2 items have same index
|
|
437 |
if ( aMatchLocation[j].length <= aMatchLocation[i].length )
|
|
438 |
{
|
|
439 |
aMatchLocation.Remove(j);
|
|
440 |
continue; // Do not increment j
|
|
441 |
}
|
|
442 |
else
|
|
443 |
{
|
|
444 |
aMatchLocation.Remove(i);
|
|
445 |
incrementFirstCursor = EFalse; // Do not increment i
|
|
446 |
break;
|
|
447 |
}
|
|
448 |
}
|
|
449 |
j++;
|
|
450 |
}
|
|
451 |
if ( incrementFirstCursor )
|
|
452 |
{
|
|
453 |
i++;
|
|
454 |
}
|
|
455 |
}
|
|
456 |
|
|
457 |
// --- Remove duplicate items from aMatchSet ---
|
|
458 |
HBufC* dataUpper = HBufC::NewLC(aData.Length());
|
|
459 |
dataUpper->Des().Copy(aData);
|
|
460 |
dataUpper->Des().UpperCase(); // Get uppercase, as aMatchSet is in upper case
|
|
461 |
|
|
462 |
TInt k = 0;
|
|
463 |
while ( k < aMatchSet.Count() )
|
|
464 |
{
|
|
465 |
TBool keepMatch = EFalse;
|
|
466 |
TInt startCursor = -1;
|
|
467 |
|
|
468 |
TInt offsetCursor;
|
|
469 |
while ( KErrNotFound != (offsetCursor = dataUpper->Mid(startCursor + 1).Find(*aMatchSet[k])) )
|
|
470 |
{
|
|
471 |
// startCursor = index of match item *aMatchSet[k] into search string aData
|
|
472 |
startCursor = offsetCursor + startCursor + 1;
|
|
473 |
for ( TInt i = 0; i < aMatchLocation.Count(); i++ )
|
|
474 |
{
|
|
475 |
// If match item was found in the location list, then keep it
|
|
476 |
if ( (aMatchLocation[i].index == startCursor) &&
|
|
477 |
(aMatchLocation[i].length == aMatchSet[k]->Length()) )
|
|
478 |
{
|
|
479 |
keepMatch = ETrue;
|
|
480 |
break;
|
|
481 |
}
|
|
482 |
}
|
|
483 |
}
|
|
484 |
|
|
485 |
if ( keepMatch )
|
|
486 |
{
|
|
487 |
k++;
|
|
488 |
}
|
|
489 |
else
|
|
490 |
{
|
|
491 |
aMatchSet.Remove(k); // Do not increment k
|
|
492 |
}
|
|
493 |
// --- Remove items End ---
|
|
494 |
|
|
495 |
}
|
|
496 |
CleanupStack::PopAndDestroy( dataUpper );
|
|
497 |
// ------------------------------------------------------------------------
|
|
498 |
|
|
499 |
// Sort match set
|
|
500 |
iHelper->SortSearchSeqsL(aMatchSet);
|
|
501 |
|
|
502 |
PRINTQUERY ( _L("CPcsAlgorithm1::SearchInputL: Final: "), aQuery );
|
|
503 |
PRINT1 ( _L("CPcsAlgorithm1::SearchInputL: Final: Search Data: %S"), &aData );
|
|
504 |
PRINTMATCHSET ( _L("CPcsAlgorithm1::SearchInputL: Final: "), aMatchSet );
|
|
505 |
PRINTMATCHLOC ( _L("CPcsAlgorithm1::SearchInputL: Final: "), aMatchLocation );
|
|
506 |
|
|
507 |
__LATENCY_MARKEND ( _L("CPcsAlgorithm1::SearchInputL") );
|
|
508 |
|
|
509 |
PRINT ( _L("End CPcsAlgorithm1::SearchInputL") );
|
|
510 |
}
|
|
511 |
|
|
512 |
// ----------------------------------------------------------------------------
|
|
513 |
// CPcsAlgorithm1::SearchMatchStringL
|
|
514 |
// Search function for input string, result also as string
|
|
515 |
// ----------------------------------------------------------------------------
|
|
516 |
void CPcsAlgorithm1::SearchMatchStringL( CPsQuery& aSearchQuery,
|
|
517 |
TDesC& aSearchData,
|
|
518 |
TDes& aMatch )
|
|
519 |
{
|
|
520 |
PRINT ( _L("Enter CPcsAlgorithm1::SearchMatchStringL") );
|
|
521 |
|
|
522 |
__LATENCY_MARK ( _L("CPcsAlgorithm1::SearchMatchStringL") );
|
|
523 |
|
|
524 |
// ---------------------- Perform the initial search ----------------------
|
|
525 |
iMultiSearchHelper->LookupMatchL( aSearchQuery, aSearchData, aMatch );
|
|
526 |
PRINTQUERY ( _L("CPcsAlgorithm1::SearchMatchStringL: 1st search: "), aSearchQuery );
|
|
527 |
PRINT1 ( _L("CPcsAlgorithm1::SearchMatchStringL: 1st search: Search Data: %S"), &aSearchData );
|
|
528 |
PRINT1 ( _L("CPcsAlgorithm1::SearchMatchStringL: 1st search: Result: %S"), &aMatch );
|
|
529 |
// ------------------------------------------------------------------------
|
|
530 |
|
|
531 |
// ---- Perform new search after "0" replacement if query is not empty ----
|
|
532 |
/* Examples:
|
|
533 |
* - If the original search string is "Abc0" then we will search again with "Abc".
|
|
534 |
* - If the original search string is "00" then we will not search again.
|
|
535 |
*/
|
|
536 |
if ( aMatch.Length() <= 0 )
|
|
537 |
{
|
|
538 |
TBool isQueryModified = ReplaceZeroWithSpaceL(aSearchQuery);
|
|
539 |
if ( isQueryModified && (aSearchQuery.Count() > 0) )
|
|
540 |
{
|
|
541 |
iMultiSearchHelper->LookupMatchL( aSearchQuery, aSearchData, aMatch );
|
|
542 |
PRINTQUERY ( _L("CPcsAlgorithm1::SearchMatchStringL: 2nd search: "), aSearchQuery );
|
|
543 |
PRINT1 ( _L("CPcsAlgorithm1::SearchMatchStringL: 2nd search: Search Data: %S"), &aSearchData );
|
|
544 |
PRINT1 ( _L("CPcsAlgorithm1::SearchMatchStringL: 2nd search: Result: %S"), &aMatch );
|
|
545 |
}
|
|
546 |
}
|
|
547 |
|
|
548 |
__LATENCY_MARKEND ( _L("CPcsAlgorithm1::SearchMatchStringL") );
|
|
549 |
|
|
550 |
PRINT ( _L("End CPcsAlgorithm1::SearchMatchStringL") );
|
|
551 |
}
|
|
552 |
|
|
553 |
// ----------------------------------------------------------------------------
|
|
554 |
// CPcsAlgorithm1::DoSearchL
|
|
555 |
// Search function helper
|
|
556 |
// ----------------------------------------------------------------------------
|
|
557 |
void CPcsAlgorithm1::DoSearchL( const CPsSettings& aSettings,
|
|
558 |
CPsQuery& aQuery,
|
|
559 |
RPointerArray<CPsData>& aSearchResults,
|
|
560 |
RPointerArray<CPsPattern>& aSearchSeqs )
|
|
561 |
{
|
|
562 |
PRINT ( _L("Enter CPcsAlgorithm1::DoSearchL") );
|
|
563 |
|
|
564 |
__LATENCY_MARK ( _L("CPcsAlgorithm1::DoSearchL") );
|
|
565 |
|
|
566 |
// (0)------------------ Check if group search is required ---------------
|
|
567 |
RArray<TInt> contactsInGroup;
|
|
568 |
CleanupClosePushL( contactsInGroup );
|
|
569 |
RArray<TInt> groupIdArray;
|
|
570 |
CleanupClosePushL( groupIdArray );
|
|
571 |
|
|
572 |
// Create a new settings instance
|
|
573 |
CPsSettings* tempSettings = aSettings.CloneL();
|
|
574 |
CleanupStack::PushL( tempSettings );
|
|
575 |
|
|
576 |
TBool isGroupSearch = IsGroupSearchL(*tempSettings, groupIdArray);
|
|
577 |
|
|
578 |
if ( isGroupSearch )
|
|
579 |
{
|
|
580 |
// Replace groups URI with contacts DB URI in new search settings
|
|
581 |
ReplaceGroupsUriL(*tempSettings);
|
|
582 |
|
|
583 |
// List of contacts in this group
|
|
584 |
GetContactsInGroupL ( groupIdArray[0], contactsInGroup );
|
|
585 |
}
|
|
586 |
|
|
587 |
// -----------------------------------------------------------------------
|
|
588 |
|
|
589 |
// Extract query list.
|
|
590 |
RPointerArray<CPsQuery> queryList = iMultiSearchHelper->MultiQueryL(aQuery);
|
|
591 |
CleanupResetAndDestroyPushL( queryList );
|
|
592 |
PRINTQUERYLIST ( _L("CPcsAlgorithm1::DoSearchL: "), queryList );
|
|
593 |
|
|
594 |
// (1)-------------------- No query return all contacts -------------------
|
|
595 |
if ( queryList.Count() == 0 )
|
|
596 |
{
|
|
597 |
GetAllContentsL(*tempSettings, aSearchResults);
|
|
598 |
|
|
599 |
if ( isGroupSearch )
|
|
600 |
{
|
|
601 |
FilterSearchResultsForGroupsL( contactsInGroup, aSearchResults );
|
|
602 |
}
|
|
603 |
}
|
|
604 |
// ------------------------------------------------------------------------
|
|
605 |
|
|
606 |
// (2)-------------------- Perform a single query search ------------------
|
|
607 |
else if ( queryList.Count() == 1 ) // single query
|
|
608 |
{
|
|
609 |
PRINT ( _L("CPcsAlgorithm1::DoSearchL: Query received is Single. Performing a SingleSearch") );
|
|
610 |
|
|
611 |
iHelper->SearchSingleL(*tempSettings, *queryList[0], isGroupSearch,
|
|
612 |
contactsInGroup, aSearchResults, aSearchSeqs);
|
|
613 |
}
|
|
614 |
// ------------------------------------------------------------------------
|
|
615 |
|
|
616 |
// (3)-------------------- Perform a multi query search -------------------
|
|
617 |
else // multiple query
|
|
618 |
{
|
|
619 |
PRINT ( _L("CPcsAlgorithm1::DoSearchL: Query received is Multiple. Performing a MultiSearch") );
|
|
620 |
|
|
621 |
// Search results
|
|
622 |
iMultiSearchHelper->SearchMultiL(*tempSettings, queryList, isGroupSearch,
|
|
623 |
contactsInGroup, aSearchResults, aSearchSeqs);
|
|
624 |
}
|
|
625 |
// -------------------------------------------------------------------------
|
|
626 |
|
|
627 |
// Cleanup
|
|
628 |
|
|
629 |
CleanupStack::PopAndDestroy( &queryList ); // ResetAndDestroy
|
|
630 |
CleanupStack::PopAndDestroy( tempSettings );
|
|
631 |
CleanupStack::PopAndDestroy( &groupIdArray ); // Close
|
|
632 |
CleanupStack::PopAndDestroy( &contactsInGroup ); // Close
|
|
633 |
|
|
634 |
__LATENCY_MARKEND ( _L("CPcsAlgorithm1::DoSearchL") );
|
|
635 |
|
|
636 |
PRINT ( _L("End CPcsAlgorithm1::DoSearchL") );
|
|
637 |
}
|
|
638 |
|
|
639 |
// ----------------------------------------------------------------------------
|
|
640 |
// CPcsAlgorithm1::DoSearchInputL
|
|
641 |
// Search function helper
|
|
642 |
// ----------------------------------------------------------------------------
|
|
643 |
void CPcsAlgorithm1::DoSearchInputL( CPsQuery& aQuery,
|
|
644 |
const TDesC& aData,
|
|
645 |
RPointerArray<TDesC>& aMatchSet,
|
|
646 |
RArray<TPsMatchLocation>& aMatchLocation )
|
|
647 |
{
|
|
648 |
PRINT ( _L("Enter CPcsAlgorithm1::DoSearchInputL") );
|
|
649 |
|
|
650 |
TInt queryWords = iMultiSearchHelper->CountMultiQueryWordsL(aQuery);
|
|
651 |
|
|
652 |
// No query
|
|
653 |
if ( queryWords == 0 )
|
|
654 |
{
|
|
655 |
PRINT ( _L("CPcsAlgorithm1::DoSearchInputL: Query received is empty") );
|
|
656 |
return;
|
|
657 |
}
|
|
658 |
|
|
659 |
RPointerArray<CPsQuery> queryList = iMultiSearchHelper->MultiQueryL(aQuery);
|
|
660 |
CleanupResetAndDestroyPushL( queryList );
|
|
661 |
|
|
662 |
PRINTQUERYLIST ( _L("CPcsAlgorithm1::DoSearchInputL: "), queryList );
|
|
663 |
|
|
664 |
if ( queryList.Count() == 1 ) // Single query
|
|
665 |
{
|
|
666 |
PRINT ( _L("CPcsAlgorithm1::DoSearchInputL: Query received is single. Performing a single search.") );
|
|
667 |
iHelper->SearchMatchSeqL(aQuery,
|
|
668 |
aData,
|
|
669 |
aMatchSet,
|
|
670 |
aMatchLocation);
|
|
671 |
}
|
|
672 |
else // multiple query
|
|
673 |
{
|
|
674 |
PRINT ( _L("CPcsAlgorithm1::DoSearchInputL: Query received is Multiple. Performing a MultiSearch") );
|
|
675 |
iMultiSearchHelper->SearchMatchSeqMultiL(queryList,
|
|
676 |
aData,
|
|
677 |
aMatchSet,
|
|
678 |
aMatchLocation);
|
|
679 |
}
|
|
680 |
|
|
681 |
// Delete all the query elements
|
|
682 |
CleanupStack::PopAndDestroy( &queryList ); // ResetAndDestroy
|
|
683 |
|
|
684 |
PRINT ( _L("End CPcsAlgorithm1::DoSearchInputL") );
|
|
685 |
}
|
|
686 |
|
|
687 |
// ----------------------------------------------------------------------------
|
|
688 |
// CPcsAlgorithm1::AddData
|
|
689 |
// Add a data element to the pool
|
|
690 |
// ----------------------------------------------------------------------------
|
|
691 |
void CPcsAlgorithm1::AddData(TDesC& aDataStore, CPsData* aData)
|
|
692 |
{
|
|
693 |
TInt arrayIndex = GetCacheIndex(aDataStore);
|
|
694 |
|
|
695 |
if ( arrayIndex < 0 ) return;
|
|
696 |
|
|
697 |
CPcsCache* cache = iPcsCache[arrayIndex];
|
|
698 |
|
|
699 |
// Fill the data store index
|
|
700 |
TInt dataStoreIndex = FindStoreUri(aDataStore);
|
|
701 |
if ( dataStoreIndex >= 0 )
|
|
702 |
{
|
|
703 |
aData->SetUriId(dataStoreIndex);
|
|
704 |
}
|
|
705 |
else
|
|
706 |
{
|
|
707 |
PRINT(_L("CPcsAlgorithm1::AddData: Unknown data store"));
|
|
708 |
return;
|
|
709 |
}
|
|
710 |
|
|
711 |
TRAPD(err, cache->AddToCacheL(*aData));
|
|
712 |
|
|
713 |
if ( err != KErrNone )
|
|
714 |
{
|
|
715 |
SetCachingError(aDataStore, err);
|
|
716 |
}
|
|
717 |
}
|
|
718 |
|
|
719 |
// ----------------------------------------------------------------------------
|
|
720 |
// CPcsAlgorithm1::RemoveData
|
|
721 |
// Remove a data element from the pool
|
|
722 |
// ----------------------------------------------------------------------------
|
|
723 |
void CPcsAlgorithm1::RemoveData(TDesC& aDataStore, TInt aItemId)
|
|
724 |
{
|
|
725 |
TInt arrayIndex = GetCacheIndex(aDataStore);
|
|
726 |
|
|
727 |
if ( arrayIndex < 0 ) return;
|
|
728 |
|
|
729 |
CPcsCache* cache = iPcsCache[arrayIndex];
|
|
730 |
|
|
731 |
TRAPD(err, cache->RemoveFromCacheL(aItemId));
|
|
732 |
|
|
733 |
if ( err != KErrNone )
|
|
734 |
{
|
|
735 |
SetCachingError(aDataStore, err);
|
|
736 |
}
|
|
737 |
}
|
|
738 |
|
|
739 |
// ---------------------------------------------------------------------
|
|
740 |
// CPcsAlgorithm1::RemoveAll
|
|
741 |
// Remove all the contacts from a datastore
|
|
742 |
// ---------------------------------------------------------------------
|
|
743 |
void CPcsAlgorithm1::RemoveAll(TDesC& aDataStore)
|
|
744 |
{
|
|
745 |
TInt dataStoreIndex = GetCacheIndex(aDataStore);
|
|
746 |
|
|
747 |
if(dataStoreIndex < 0) return;
|
|
748 |
|
|
749 |
CPcsCache* cache = iPcsCache[dataStoreIndex];
|
|
750 |
|
|
751 |
cache->RemoveAllFromCache();
|
|
752 |
}
|
|
753 |
|
|
754 |
// ----------------------------------------------------------------------------
|
|
755 |
// CPcsAlgorithm1::GetCacheIndex
|
|
756 |
// Return the cache index for a data store
|
|
757 |
// ----------------------------------------------------------------------------
|
|
758 |
TInt CPcsAlgorithm1::GetCacheIndex(const TDesC& aDataStore)
|
|
759 |
{
|
|
760 |
for ( int i = 0; i < iPcsCache.Count(); i++ )
|
|
761 |
{
|
|
762 |
CPcsCache* cache = iPcsCache[i];
|
|
763 |
|
|
764 |
if ( cache->GetURI().CompareC(aDataStore) == 0 ) return i;
|
|
765 |
}
|
|
766 |
|
|
767 |
return KErrNotFound;
|
|
768 |
}
|
|
769 |
|
|
770 |
// ----------------------------------------------------------------------------
|
|
771 |
// CPcsAlgorithm1::AddDataStore
|
|
772 |
// Adds a new store
|
|
773 |
// ----------------------------------------------------------------------------
|
|
774 |
void CPcsAlgorithm1::AddDataStore(TDesC& aDataStore)
|
|
775 |
{
|
|
776 |
// Check if the datastore cache already exists
|
|
777 |
TInt index = GetCacheIndex(aDataStore);
|
|
778 |
if ( index != KErrNotFound )
|
|
779 |
{
|
|
780 |
// Already exists
|
|
781 |
return;
|
|
782 |
}
|
|
783 |
|
|
784 |
// Create a new cache
|
|
785 |
CPcsCache* cache = NULL;
|
|
786 |
TRAPD(err, cache = CPcsCache::NewL(aDataStore, *iKeyMap, (TUint8) iPcsCache.Count()));
|
|
787 |
if ( err != KErrNone )
|
|
788 |
{
|
|
789 |
SetCachingError(aDataStore, err);
|
|
790 |
return;
|
|
791 |
}
|
|
792 |
|
|
793 |
RArray<TInt> dataFields;
|
|
794 |
TRAP(err, iPsDataPluginInterface->GetSupportedDataFieldsL(cache->GetURI(), dataFields));
|
|
795 |
if ( err != KErrNone )
|
|
796 |
{
|
|
797 |
SetCachingError(aDataStore, err);
|
|
798 |
return;
|
|
799 |
}
|
|
800 |
cache->SetDataFields(dataFields);
|
|
801 |
|
|
802 |
// Check if sort order is persisted already
|
|
803 |
RArray<TInt> sortOrder;
|
|
804 |
TRAP(err, ReadSortOrderFromCenRepL(cache->GetURI(), sortOrder));
|
|
805 |
if ( err != KErrNone )
|
|
806 |
{
|
|
807 |
SetCachingError(aDataStore, err);
|
|
808 |
return;
|
|
809 |
}
|
|
810 |
|
|
811 |
if ( sortOrder.Count() == 0 )
|
|
812 |
{
|
|
813 |
cache->SetSortOrder(dataFields); // Initial sort order
|
|
814 |
}
|
|
815 |
else
|
|
816 |
{
|
|
817 |
cache->SetSortOrder(sortOrder); // Persisted sort order
|
|
818 |
}
|
|
819 |
|
|
820 |
sortOrder.Close();
|
|
821 |
dataFields.Close();
|
|
822 |
|
|
823 |
iPcsCache.Append(cache);
|
|
824 |
|
|
825 |
TRAP(err, iPsDataPluginInterface->RequestForDataL(aDataStore));
|
|
826 |
if ( err != KErrNone )
|
|
827 |
{
|
|
828 |
PRINT ( _L("CPcsAlgorithm1::AddDataStore() Set Caching Error ") );
|
|
829 |
SetCachingError(aDataStore, err);
|
|
830 |
UpdateCachingStatus(aDataStore,ECachingCompleteWithErrors);
|
|
831 |
return;
|
|
832 |
}
|
|
833 |
}
|
|
834 |
|
|
835 |
// ----------------------------------------------------------------------------
|
|
836 |
// CPcsAlgorithm1::RemoveDataStore
|
|
837 |
// Removes an existing data store
|
|
838 |
// ----------------------------------------------------------------------------
|
|
839 |
void CPcsAlgorithm1::RemoveDataStore(TDesC& aDataStore)
|
|
840 |
{
|
|
841 |
for ( int i = 0; i < iPcsCache.Count(); i++ )
|
|
842 |
{
|
|
843 |
CPcsCache* cache = iPcsCache[i];
|
|
844 |
|
|
845 |
if ( cache->GetURI().CompareC(aDataStore) == 0 )
|
|
846 |
{
|
|
847 |
delete iPcsCache[i];
|
|
848 |
iPcsCache.Remove(i);
|
|
849 |
}
|
|
850 |
}
|
|
851 |
}
|
|
852 |
|
|
853 |
// ----------------------------------------------------------------------------
|
|
854 |
// CPcsAlgorithm1::IsLanguageSupportedL
|
|
855 |
// Returns ETrue if this language is supported
|
|
856 |
// ----------------------------------------------------------------------------
|
|
857 |
TBool CPcsAlgorithm1::IsLanguageSupportedL(TUint32 aLang)
|
|
858 |
{
|
|
859 |
return iKeyMap->IsLanguageSupported(aLang);
|
|
860 |
}
|
|
861 |
|
|
862 |
// ----------------------------------------------------------------------------
|
|
863 |
// CPcsAlgorithm1::GetUriForIdL
|
|
864 |
// Get the URI string for this internal id
|
|
865 |
// ----------------------------------------------------------------------------
|
|
866 |
const TDesC& CPcsAlgorithm1::GetUriForIdL(TUint8 aUriId)
|
|
867 |
{
|
|
868 |
TBool found = EFalse;
|
|
869 |
TInt i = 0;
|
|
870 |
|
|
871 |
for ( i = 0; i < iPcsCache.Count(); i++ )
|
|
872 |
{
|
|
873 |
if ( iPcsCache[i]->GetUriId() == aUriId )
|
|
874 |
{
|
|
875 |
found = ETrue;
|
|
876 |
break;
|
|
877 |
}
|
|
878 |
}
|
|
879 |
|
|
880 |
if ( ! found )
|
|
881 |
{
|
|
882 |
User::Leave(KErrNotFound);
|
|
883 |
}
|
|
884 |
|
|
885 |
return iPcsCache[i]->GetURI();
|
|
886 |
}
|
|
887 |
|
|
888 |
// ----------------------------------------------------------------------------
|
|
889 |
// CPcsAlgorithm1::FindStoreUri
|
|
890 |
// Checks if this store exists
|
|
891 |
// ----------------------------------------------------------------------------
|
|
892 |
TInt CPcsAlgorithm1::FindStoreUri ( const TDesC& aDataStore )
|
|
893 |
{
|
|
894 |
for ( TInt i = 0; i < iPcsCache.Count(); i++ )
|
|
895 |
{
|
|
896 |
if ( aDataStore.CompareC(iPcsCache[i]->GetURI()) == 0 )
|
|
897 |
{
|
|
898 |
return i;
|
|
899 |
}
|
|
900 |
}
|
|
901 |
|
|
902 |
return KErrNotFound;
|
|
903 |
}
|
|
904 |
|
|
905 |
// ----------------------------------------------------------------------------
|
|
906 |
// CPcsAlgorithm1::UpdateCachingStatus
|
|
907 |
// Update caching status
|
|
908 |
// ----------------------------------------------------------------------------
|
|
909 |
void CPcsAlgorithm1::UpdateCachingStatus(TDesC& aDataStore, TInt aStatus)
|
|
910 |
{
|
|
911 |
PRINT ( _L("Enter CPcsAlgorithm1::UpdateCachingStatus") );
|
|
912 |
PRINT2 ( _L("CPcsAlgorithm1::UpdateCachingStatus: Request received for URI=%S with status=%d"),
|
|
913 |
&aDataStore, aStatus );
|
|
914 |
|
|
915 |
// Handle data store update events
|
|
916 |
if ( aStatus == ECacheUpdateContactRemoved ||
|
|
917 |
aStatus == ECacheUpdateContactModified ||
|
|
918 |
aStatus == ECacheUpdateContactAdded )
|
|
919 |
{
|
|
920 |
HandleCacheUpdated( static_cast<TCachingStatus>(aStatus) );
|
|
921 |
return;
|
|
922 |
}
|
|
923 |
|
|
924 |
// If not a cache update event, then this event is related to the initial
|
|
925 |
// cache construction.
|
|
926 |
|
|
927 |
// Check if any error occurred and update the cache error
|
|
928 |
if ( aStatus < 0 )
|
|
929 |
{
|
|
930 |
SetCachingError(aDataStore, aStatus);
|
|
931 |
}
|
|
932 |
else
|
|
933 |
{
|
|
934 |
TInt index = FindStoreUri(aDataStore);
|
|
935 |
iPcsCache[index]->UpdateCacheStatus(aStatus);
|
|
936 |
}
|
|
937 |
|
|
938 |
TCachingStatus status = ECachingNotStarted;
|
|
939 |
TUint countNotStarted = 0;
|
|
940 |
TUint countInProgress = 0;
|
|
941 |
TUint countCompleted = 0;
|
|
942 |
TUint countCompletedWithErrors = 0;
|
|
943 |
TInt cacheCount = iPcsCache.Count();
|
|
944 |
for ( TInt i = 0; i < cacheCount; i++ )
|
|
945 |
{
|
|
946 |
PRINT3 ( _L("CPcsAlgorithm1::UpdateCachingStatus: URI[%d]=%S, cache status=%d"),
|
|
947 |
i, &iPcsCache[i]->GetURI(), iPcsCache[i]->GetCacheStatus() );
|
|
948 |
|
|
949 |
switch ( iPcsCache[i]->GetCacheStatus() )
|
|
950 |
{
|
|
951 |
case ECachingNotStarted:
|
|
952 |
{
|
|
953 |
countNotStarted++;
|
|
954 |
break;
|
|
955 |
}
|
|
956 |
case ECachingInProgress:
|
|
957 |
{
|
|
958 |
countInProgress++;
|
|
959 |
break;
|
|
960 |
}
|
|
961 |
case ECachingComplete:
|
|
962 |
{
|
|
963 |
countCompleted++;
|
|
964 |
break;
|
|
965 |
}
|
|
966 |
case ECachingCompleteWithErrors:
|
|
967 |
{
|
|
968 |
countCompletedWithErrors++;
|
|
969 |
break;
|
|
970 |
}
|
|
971 |
default:
|
|
972 |
{
|
|
973 |
// Default completed state
|
|
974 |
countCompleted++;
|
|
975 |
break;
|
|
976 |
}
|
|
977 |
}
|
|
978 |
}
|
|
979 |
|
|
980 |
// Calculate cumulative status according to single caches statuses
|
|
981 |
if ( countCompleted > 0 && ( countCompleted + countNotStarted ) == cacheCount )
|
|
982 |
{
|
|
983 |
// If at least one caching is finished
|
|
984 |
// set status to ECachingComplete or ECachingCompleteWithErrors
|
|
985 |
// according to iCacheError
|
|
986 |
status = ( iCacheError == KErrNone ) ? ECachingComplete : ECachingCompleteWithErrors;
|
|
987 |
}
|
|
988 |
else if ( countInProgress > 0 )
|
|
989 |
{
|
|
990 |
// Else if at least one caching is in progress,
|
|
991 |
// set status to ECachingInProgress
|
|
992 |
status = ECachingInProgress;
|
|
993 |
}
|
|
994 |
else if ( countCompletedWithErrors > 0 )
|
|
995 |
{
|
|
996 |
// Else if at least one caching is completed with errors,
|
|
997 |
//set status to ECachingCompleteWithErrors
|
|
998 |
status = ECachingCompleteWithErrors;
|
|
999 |
}
|
|
1000 |
else
|
|
1001 |
{
|
|
1002 |
// countNotStarted == cacheCount
|
|
1003 |
// status is set to default ECachingNotStarted
|
|
1004 |
}
|
|
1005 |
|
|
1006 |
PRINT1 ( _L("CPcsAlgorithm1::UpdateCachingStatus: Cumulative caching status is %d"),
|
|
1007 |
status );
|
|
1008 |
|
|
1009 |
// Check if status changed
|
|
1010 |
if ( status != iCacheStatus )
|
|
1011 |
{
|
|
1012 |
PRINT2 ( _L("CPcsAlgorithm1::UpdateCachingStatus: Cumulative caching changed: %d -> %d"),
|
|
1013 |
iCacheStatus, status );
|
|
1014 |
|
|
1015 |
iCacheStatus = status;
|
|
1016 |
RProperty::Set(KPcsInternalUidCacheStatus, EPsKeyCacheStatus, iCacheStatus );
|
|
1017 |
}
|
|
1018 |
|
|
1019 |
PRINT( _L("End CPcsAlgorithm1::UpdateCachingStatus") );
|
|
1020 |
}
|
|
1021 |
|
|
1022 |
// ----------------------------------------------------------------------------
|
|
1023 |
// CPcsAlgorithm1::SetCachingError
|
|
1024 |
// Updates cachinge error
|
|
1025 |
// ----------------------------------------------------------------------------
|
|
1026 |
void CPcsAlgorithm1::SetCachingError(const TDesC& aDataStore, TInt aError)
|
|
1027 |
{
|
|
1028 |
PRINT2 ( _L("CPcsAlgorithm1::SetCachingError: URI=%S, ERROR=%d"), &aDataStore, aError );
|
|
1029 |
|
|
1030 |
iCacheError = aError;
|
|
1031 |
RProperty::Set( KPcsInternalUidCacheStatus, EPsKeyCacheError, iCacheError );
|
|
1032 |
}
|
|
1033 |
|
|
1034 |
// ----------------------------------------------------------------------------
|
|
1035 |
// CPcsAlgorithm1::GetAllContentsL
|
|
1036 |
// Returns all the contents of a store
|
|
1037 |
// ----------------------------------------------------------------------------
|
|
1038 |
void CPcsAlgorithm1::GetAllContentsL ( const CPsSettings& aSettings,
|
|
1039 |
RPointerArray<CPsData>& aResults )
|
|
1040 |
{
|
|
1041 |
__LATENCY_MARK ( _L("CPcsAlgorithm1::GetAllContentsL") );
|
|
1042 |
|
|
1043 |
PRINT ( _L("Enter CPcsAlgorithm1::GetAllContentsL") );
|
|
1044 |
|
|
1045 |
// To hold array of results from different data stores
|
|
1046 |
typedef RPointerArray<CPsData> CPSDATA_R_PTR_ARRAY;
|
|
1047 |
RPointerArray<CPSDATA_R_PTR_ARRAY> searchResultsArr;
|
|
1048 |
CleanupResetAndDestroyPushL( searchResultsArr );
|
|
1049 |
// TODO: Here's still a potential memory leak if a leave happens. The child
|
|
1050 |
// arrays of searchResultsArr are not Reset in that case. The CPsData objects
|
|
1051 |
// may leak as well. Handling this safely is somewhat complicated because some of
|
|
1052 |
// the CPsData objects may already be transferred to ownership of aResults array
|
|
1053 |
// at the time the leave happens, and those items must not be deleted.
|
|
1054 |
|
|
1055 |
// Get the data stores
|
|
1056 |
RPointerArray<TDesC> dataStores;
|
|
1057 |
CleanupResetAndDestroyPushL( dataStores );
|
|
1058 |
aSettings.SearchUrisL(dataStores);
|
|
1059 |
|
|
1060 |
// Get all contacts for each data store
|
|
1061 |
for ( TInt dsIndex = 0;
|
|
1062 |
dsIndex < dataStores.Count();
|
|
1063 |
dsIndex++ )
|
|
1064 |
{
|
|
1065 |
RPointerArray<CPsData> *temp = new (ELeave) RPointerArray<CPsData>();
|
|
1066 |
searchResultsArr.Append(temp);
|
|
1067 |
|
|
1068 |
TInt arrayIndex = GetCacheIndex(*(dataStores[dsIndex]));
|
|
1069 |
|
|
1070 |
if ( arrayIndex < 0 ) continue;
|
|
1071 |
|
|
1072 |
CPcsCache* cache = GetCache(arrayIndex);
|
|
1073 |
|
|
1074 |
cache->GetAllContentsL(*(searchResultsArr[dsIndex]));
|
|
1075 |
}
|
|
1076 |
|
|
1077 |
CleanupStack::PopAndDestroy( &dataStores ); // ResetAndDestroy
|
|
1078 |
|
|
1079 |
// Merge the results from different data stores
|
|
1080 |
CPcsAlgorithm1Utils::FormCompleteSearchResultsL(searchResultsArr,
|
|
1081 |
aResults);
|
|
1082 |
|
|
1083 |
// Cleanup the local arrays
|
|
1084 |
for(TInt i = 0; i < searchResultsArr.Count(); i++)
|
|
1085 |
{
|
|
1086 |
searchResultsArr[i]->Reset();
|
|
1087 |
}
|
|
1088 |
CleanupStack::PopAndDestroy( &searchResultsArr ); // ResetAndDestroy
|
|
1089 |
|
|
1090 |
PRINT1 ( _L("Number of results = %d"), aResults.Count() );
|
|
1091 |
|
|
1092 |
PRINT ( _L("End CPcsAlgorithm1::GetAllContentsL") );
|
|
1093 |
|
|
1094 |
__LATENCY_MARKEND ( _L("CPcsAlgorithm1::GetAllContentsL") );
|
|
1095 |
}
|
|
1096 |
|
|
1097 |
// ----------------------------------------------------------------------------
|
|
1098 |
// CPcsAlgorithm1::IsGroupSearchL
|
|
1099 |
// Checks if a group search is required
|
|
1100 |
// ----------------------------------------------------------------------------
|
|
1101 |
TBool CPcsAlgorithm1::IsGroupSearchL ( CPsSettings& aSettings,
|
|
1102 |
RArray<TInt>& aGroupIdArray )
|
|
1103 |
{
|
|
1104 |
PRINT ( _L("Enter CPcsAlgorithm1::IsGroupSearchL") );
|
|
1105 |
|
|
1106 |
// Get the groupIds in the seach settings
|
|
1107 |
aSettings.GetGroupIdsL(aGroupIdArray);
|
|
1108 |
|
|
1109 |
// Get the current URIs defined in settings
|
|
1110 |
RPointerArray<TDesC> searchUris;
|
|
1111 |
CleanupResetAndDestroyPushL( searchUris );
|
|
1112 |
aSettings.SearchUrisL(searchUris);
|
|
1113 |
|
|
1114 |
if ( aGroupIdArray.Count() && (searchUris.Count() > aGroupIdArray.Count() ) )
|
|
1115 |
{
|
|
1116 |
// There is an error, either there are more than one groups
|
|
1117 |
// or the settings contain a combination of group/non-group Uris
|
|
1118 |
aGroupIdArray.Close();
|
|
1119 |
User::Leave(KErrArgument);
|
|
1120 |
}
|
|
1121 |
|
|
1122 |
CleanupStack::PopAndDestroy( &searchUris ); // ResetAndDestroy
|
|
1123 |
|
|
1124 |
PRINT ( _L("End CPcsAlgorithm1::IsGroupSearchL") );
|
|
1125 |
|
|
1126 |
if ( aGroupIdArray.Count() == 1 )
|
|
1127 |
return ETrue;
|
|
1128 |
|
|
1129 |
return EFalse;
|
|
1130 |
}
|
|
1131 |
|
|
1132 |
// ----------------------------------------------------------------------------
|
|
1133 |
// CPcsAlgorithm1::ReplaceGroupsUriL
|
|
1134 |
// Replace groups uri to contacts uri
|
|
1135 |
// ----------------------------------------------------------------------------
|
|
1136 |
void CPcsAlgorithm1::ReplaceGroupsUriL( CPsSettings& aSettings )
|
|
1137 |
{
|
|
1138 |
RPointerArray<TDesC> uri;
|
|
1139 |
CleanupResetAndDestroyPushL( uri );
|
|
1140 |
|
|
1141 |
// Set contacts db uri
|
|
1142 |
HBufC* cntdb = KVPbkDefaultCntDbURI().AllocLC();
|
|
1143 |
uri.AppendL(cntdb);
|
|
1144 |
CleanupStack::Pop( cntdb ); // ownership transferred
|
|
1145 |
aSettings.SetSearchUrisL(uri);
|
|
1146 |
|
|
1147 |
// Cleanup
|
|
1148 |
CleanupStack::PopAndDestroy( &uri ); // ResetAndDestroy
|
|
1149 |
}
|
|
1150 |
|
|
1151 |
// ----------------------------------------------------------------------------
|
|
1152 |
// CPcsAlgorithm1::FilterSearchResultsForGroupsL
|
|
1153 |
// Filters the results that belong to a group
|
|
1154 |
// ----------------------------------------------------------------------------
|
|
1155 |
void CPcsAlgorithm1::FilterSearchResultsForGroupsL(RArray<TInt>& contactsInGroup,
|
|
1156 |
RPointerArray<CPsData>& aSearchResults)
|
|
1157 |
{
|
|
1158 |
PRINT ( _L("Enter CPcsAlgorithm1::FilterSearchResultsForGroupsL") );
|
|
1159 |
|
|
1160 |
// for each search result
|
|
1161 |
// Note: aSearchResults.Count() is to be checked everytime,
|
|
1162 |
// since the elements are being removed dynamically.
|
|
1163 |
for ( TInt j = 0 ; j < aSearchResults.Count(); j++ )
|
|
1164 |
{
|
|
1165 |
TBool includeResult = EFalse;
|
|
1166 |
|
|
1167 |
if ( contactsInGroup.Find(aSearchResults[j]->Id()) != KErrNotFound )
|
|
1168 |
{
|
|
1169 |
includeResult = ETrue;
|
|
1170 |
}
|
|
1171 |
|
|
1172 |
if ( includeResult == EFalse )
|
|
1173 |
{
|
|
1174 |
aSearchResults.Remove(j);
|
|
1175 |
j--; // j is decremented, since that object is removed
|
|
1176 |
}
|
|
1177 |
}
|
|
1178 |
|
|
1179 |
PRINT ( _L("End CPcsAlgorithm1::FilterSearchResultsForGroupsL") );
|
|
1180 |
}
|
|
1181 |
|
|
1182 |
|
|
1183 |
// ----------------------------------------------------------------------------
|
|
1184 |
// CPcsAlgorithm1::GetContactsInGroupL
|
|
1185 |
// Recover contacts that belong to a group
|
|
1186 |
// ----------------------------------------------------------------------------
|
|
1187 |
void CPcsAlgorithm1::GetContactsInGroupL( TInt aGroupId,
|
|
1188 |
RArray<TInt>& aGroupContactIds )
|
|
1189 |
{
|
|
1190 |
// Clear results array
|
|
1191 |
aGroupContactIds.Reset();
|
|
1192 |
|
|
1193 |
// Cache Index for group database
|
|
1194 |
TInt cacheIndex = GetCacheIndex(KVPbkDefaultGrpDbURI);
|
|
1195 |
|
|
1196 |
// Get the groups contact ids
|
|
1197 |
if ( cacheIndex != -1 )
|
|
1198 |
{
|
|
1199 |
RPointerArray<CPsData> groups;
|
|
1200 |
CleanupClosePushL( groups );
|
|
1201 |
|
|
1202 |
// Get all groups
|
|
1203 |
iPcsCache[cacheIndex]->GetAllContentsL(groups);
|
|
1204 |
|
|
1205 |
// Get all contacts in group
|
|
1206 |
for ( TInt i = 0; i < groups.Count(); i++ )
|
|
1207 |
{
|
|
1208 |
if ( groups[i]->Id() == aGroupId )
|
|
1209 |
{
|
|
1210 |
groups[i]->IntDataExt(aGroupContactIds); // All contacts in group
|
|
1211 |
break;
|
|
1212 |
}
|
|
1213 |
}
|
|
1214 |
|
|
1215 |
CleanupStack::PopAndDestroy( &groups ); // Close
|
|
1216 |
}
|
|
1217 |
}
|
|
1218 |
|
|
1219 |
// ----------------------------------------------------------------------------
|
|
1220 |
// CPcsAlgorithm1::GetDataOrderL
|
|
1221 |
//
|
|
1222 |
// ----------------------------------------------------------------------------
|
|
1223 |
void CPcsAlgorithm1::GetDataOrderL ( TDesC& aURI,
|
|
1224 |
RArray<TInt>& aDataOrder )
|
|
1225 |
{
|
|
1226 |
PRINT ( _L("End CPcsAlgorithm1::GetDataOrderL") );
|
|
1227 |
|
|
1228 |
TInt arrayIndex = KErrNotFound;
|
|
1229 |
|
|
1230 |
if ( CPcsAlgorithm1Utils::IsGroupUri(aURI) )
|
|
1231 |
{
|
|
1232 |
// If search in a group uri, use contacts db
|
|
1233 |
arrayIndex = GetCacheIndex(KVPbkDefaultCntDbURI);
|
|
1234 |
}
|
|
1235 |
else
|
|
1236 |
{
|
|
1237 |
arrayIndex = GetCacheIndex(aURI);
|
|
1238 |
}
|
|
1239 |
|
|
1240 |
if ( arrayIndex < 0 ) return;
|
|
1241 |
|
|
1242 |
CPcsCache* cache = iPcsCache[arrayIndex];
|
|
1243 |
|
|
1244 |
aDataOrder.Reset();
|
|
1245 |
|
|
1246 |
// Get the data fields for this cache
|
|
1247 |
cache->GetDataFields(aDataOrder);
|
|
1248 |
|
|
1249 |
PRINT ( _L("End CPcsAlgorithm1::GetDataOrderL") );
|
|
1250 |
}
|
|
1251 |
|
|
1252 |
// ----------------------------------------------------------------------------
|
|
1253 |
// CPcsAlgorithm1::GetSortOrderL
|
|
1254 |
//
|
|
1255 |
// ----------------------------------------------------------------------------
|
|
1256 |
void CPcsAlgorithm1::GetSortOrderL ( TDesC& aURI,
|
|
1257 |
RArray<TInt>& aDataOrder )
|
|
1258 |
{
|
|
1259 |
PRINT ( _L("End CPcsAlgorithm1::GetSortOrderL") );
|
|
1260 |
|
|
1261 |
TInt arrayIndex = KErrNotFound;
|
|
1262 |
|
|
1263 |
if ( CPcsAlgorithm1Utils::IsGroupUri(aURI) )
|
|
1264 |
{
|
|
1265 |
// If search in a group uri, use contacts db
|
|
1266 |
arrayIndex = GetCacheIndex(KVPbkDefaultCntDbURI);
|
|
1267 |
}
|
|
1268 |
else
|
|
1269 |
{
|
|
1270 |
arrayIndex = GetCacheIndex(aURI);
|
|
1271 |
}
|
|
1272 |
|
|
1273 |
if ( arrayIndex < 0 ) return;
|
|
1274 |
|
|
1275 |
CPcsCache* cache = iPcsCache[arrayIndex];
|
|
1276 |
|
|
1277 |
aDataOrder.Reset();
|
|
1278 |
|
|
1279 |
// Get the data fields for this cache
|
|
1280 |
cache->GetSortOrder(aDataOrder);
|
|
1281 |
|
|
1282 |
PRINT ( _L("End CPcsAlgorithm1::GetSortOrderL") );
|
|
1283 |
}
|
|
1284 |
|
|
1285 |
// ----------------------------------------------------------------------------
|
|
1286 |
// CPcsAlgorithm1::ChangeSortOrderL
|
|
1287 |
//
|
|
1288 |
// ----------------------------------------------------------------------------
|
|
1289 |
void CPcsAlgorithm1::ChangeSortOrderL ( TDesC& aURI,
|
|
1290 |
RArray<TInt>& aSortOrder )
|
|
1291 |
{
|
|
1292 |
PRINT ( _L("Enter CPcsAlgorithm1::ChangeSortOrderL") );
|
|
1293 |
|
|
1294 |
PRINT ( _L("CPcsAlgorithm1::ChangeSortOrderL. Sort order change received.") );
|
|
1295 |
PRINT1 ( _L("CPcsAlgorithm1::ChangeSortOrderL. URI = %S"), &aURI );
|
|
1296 |
|
|
1297 |
// If URI is search in a group URI return
|
|
1298 |
if ( CPcsAlgorithm1Utils::IsGroupUri(aURI) )
|
|
1299 |
{
|
|
1300 |
PRINT ( _L("CPcsAlgorithm1::ChangeSortOrderL. Sort order change not supported.") );
|
|
1301 |
return;
|
|
1302 |
}
|
|
1303 |
|
|
1304 |
// Check if a cache exists
|
|
1305 |
TInt arrayIndex = GetCacheIndex(aURI);
|
|
1306 |
if ( arrayIndex < 0 )
|
|
1307 |
{
|
|
1308 |
PRINT ( _L("CPcsAlgorithm1::ChangeSortOrderL. Cache for URI doesn't exist.") );
|
|
1309 |
return;
|
|
1310 |
}
|
|
1311 |
|
|
1312 |
// Cache instance for this URI
|
|
1313 |
CPcsCache* cache = iPcsCache[arrayIndex];
|
|
1314 |
|
|
1315 |
// Check if received sort order is same as before
|
|
1316 |
RArray<TInt> mySortOrder;
|
|
1317 |
cache->GetSortOrder(mySortOrder);
|
|
1318 |
|
|
1319 |
if ( aSortOrder.Count() == mySortOrder.Count() )
|
|
1320 |
{
|
|
1321 |
TBool same = ETrue;
|
|
1322 |
for ( TInt i = 0; i < mySortOrder.Count(); i++ )
|
|
1323 |
{
|
|
1324 |
if ( mySortOrder[i] != aSortOrder[i] )
|
|
1325 |
{
|
|
1326 |
same = EFalse;
|
|
1327 |
break;
|
|
1328 |
}
|
|
1329 |
}
|
|
1330 |
|
|
1331 |
if ( same )
|
|
1332 |
{
|
|
1333 |
PRINT ( _L("CPcsAlgorithm1::ChangeSortOrderL. Same sort order received. Ignoring ...") );
|
|
1334 |
PRINT ( _L("End CPcsAlgorithm1::ChangeSortOrderL.") );
|
|
1335 |
mySortOrder.Reset();
|
|
1336 |
return;
|
|
1337 |
}
|
|
1338 |
}
|
|
1339 |
|
|
1340 |
mySortOrder.Reset();
|
|
1341 |
|
|
1342 |
PRINT ( _L("CPcsAlgorithm1::ChangeSortOrderL. New sort order received. Refreshing ...") );
|
|
1343 |
// Set the new sort order on the cache
|
|
1344 |
cache->SetSortOrder(aSortOrder);
|
|
1345 |
|
|
1346 |
// Persist the changes in sort order
|
|
1347 |
WriteSortOrderToCenRepL(aURI, aSortOrder);
|
|
1348 |
|
|
1349 |
// Resort data
|
|
1350 |
TInt err = KErrNone;
|
|
1351 |
TRAP(err, cache->ResortdataInPoolsL());
|
|
1352 |
if ( err != KErrNone )
|
|
1353 |
{
|
|
1354 |
PRINT ( _L("CPcsAlgorithm1::ChangeSortOrderL() Set Caching Error ") );
|
|
1355 |
SetCachingError(aURI, err);
|
|
1356 |
UpdateCachingStatus(aURI,ECachingCompleteWithErrors);
|
|
1357 |
return;
|
|
1358 |
}
|
|
1359 |
|
|
1360 |
PRINT ( _L("End CPcsAlgorithm1::ChangeSortOrderL") );
|
|
1361 |
}
|
|
1362 |
|
|
1363 |
// ----------------------------------------------------------------------------
|
|
1364 |
// CPcsAlgorithm1::GetAdaptiveGridL
|
|
1365 |
//
|
|
1366 |
// ----------------------------------------------------------------------------
|
|
1367 |
void CPcsAlgorithm1::GetAdaptiveGridL( const MDesCArray& aURIs,
|
|
1368 |
const TBool aCompanyName,
|
|
1369 |
TDes& aAdaptiveGrid )
|
|
1370 |
{
|
|
1371 |
PRINT ( _L("Enter CPcsAlgorithm1::GetAdaptiveGridL") );
|
|
1372 |
|
|
1373 |
PRINT1 ( _L("CPcsAlgorithm1::GetAdaptiveGridL. Request of Adaptive Grid for %d URI(s)"),
|
|
1374 |
aURIs.MdcaCount() );
|
|
1375 |
|
|
1376 |
if ( iCacheStatus != ECachingComplete )
|
|
1377 |
{
|
|
1378 |
PRINT ( _L("CPcsAlgorithm1::GetAdaptiveGridL: PCS Caching is not ready, returning empty Adaptive Grid") );
|
|
1379 |
aAdaptiveGrid.Zero();
|
|
1380 |
}
|
|
1381 |
else
|
|
1382 |
{
|
|
1383 |
GetAdaptiveGridFromCacheL( aURIs, aCompanyName, aAdaptiveGrid );
|
|
1384 |
}
|
|
1385 |
|
|
1386 |
PRINT ( _L("End CPcsAlgorithm1::GetAdaptiveGridL") );
|
|
1387 |
}
|
|
1388 |
|
|
1389 |
// ----------------------------------------------------------------------------
|
|
1390 |
// CPcsAlgorithm1::GetAdaptiveGridFromCacheL
|
|
1391 |
//
|
|
1392 |
// ----------------------------------------------------------------------------
|
|
1393 |
void CPcsAlgorithm1::GetAdaptiveGridFromCacheL( const MDesCArray& aURIs,
|
|
1394 |
const TBool aCompanyName,
|
|
1395 |
TDes& aAdaptiveGrid )
|
|
1396 |
{
|
|
1397 |
PRINT ( _L("Enter CPcsAlgorithm1::GetAdaptiveGridFromCacheL") );
|
|
1398 |
|
|
1399 |
PRINT1 ( _L("CPcsAlgorithm1::GetAdaptiveGridFromCacheL. Request of Adaptive Grid for %d URI(s)"),
|
|
1400 |
aURIs.MdcaCount() );
|
|
1401 |
|
|
1402 |
RArray<TInt> cacheIds;
|
|
1403 |
CleanupClosePushL( cacheIds );
|
|
1404 |
|
|
1405 |
// Create the list of the cache indexes that will form the Adaptive Grid
|
|
1406 |
for ( TInt i=0; i < aURIs.MdcaCount(); i++ )
|
|
1407 |
{
|
|
1408 |
TPtrC16 uri = aURIs.MdcaPoint(i);
|
|
1409 |
|
|
1410 |
// If URI is a group URI skip it
|
|
1411 |
if ( CPcsAlgorithm1Utils::IsGroupUri( uri ) )
|
|
1412 |
{
|
|
1413 |
PRINT1 ( _L("CPcsAlgorithm1::GetAdaptiveGridFromCacheL. Adaptive Grid for URI \"%S\" is not supported. Skipping"),
|
|
1414 |
&uri );
|
|
1415 |
continue;
|
|
1416 |
}
|
|
1417 |
|
|
1418 |
TInt cacheIndex = GetCacheIndex( uri );
|
|
1419 |
if ( cacheIndex == KErrNotFound )
|
|
1420 |
{
|
|
1421 |
PRINT1 ( _L("CPcsAlgorithm1::GetAdaptiveGridFromCacheL. Cache for URI \"%S\" doesn't exist"),
|
|
1422 |
&uri );
|
|
1423 |
continue;
|
|
1424 |
}
|
|
1425 |
|
|
1426 |
PRINT1 ( _L("CPcsAlgorithm1::GetAdaptiveGridFromCacheL. Cache for URI \"%S\" will be used to form the Adaptive Grid"),
|
|
1427 |
&uri );
|
|
1428 |
|
|
1429 |
cacheIds.AppendL( cacheIndex );
|
|
1430 |
}
|
|
1431 |
|
|
1432 |
PRINT1 ( _L("CPcsAlgorithm1::GetAdaptiveGridFromCacheL. Number of caches that will be used to form the grid is %d"),
|
|
1433 |
cacheIds.Count( ) );
|
|
1434 |
|
|
1435 |
// Create the Adaptive Grid from the cache(s)
|
|
1436 |
if ( cacheIds.Count() == 1 ) // No merge if we have only one cache
|
|
1437 |
{
|
|
1438 |
// Cache instance for this URI
|
|
1439 |
CPcsCache* cache = iPcsCache[cacheIds[0]];
|
|
1440 |
|
|
1441 |
// Get the Adaptive Grid
|
|
1442 |
cache->GetAdaptiveGridL( aCompanyName, aAdaptiveGrid );
|
|
1443 |
|
|
1444 |
PRINT1 ( _L("CPcsAlgorithm1::GetAdaptiveGridFromCacheL. Adaptive Grid: \"%S\" (No merge was needed)"),
|
|
1445 |
&aAdaptiveGrid );
|
|
1446 |
}
|
|
1447 |
else if ( cacheIds.Count() > 1 ) // Merge if we have more than one cache
|
|
1448 |
{
|
|
1449 |
RArray<TChar> gridAll;
|
|
1450 |
CleanupClosePushL( gridAll );
|
|
1451 |
TUint gridSize = 0;
|
|
1452 |
|
|
1453 |
HBufC16* gridOne = HBufC::NewLC(KPsAdaptiveGridStringMaxLen);
|
|
1454 |
TPtr16 gridOnePtr( gridOne->Des( ));
|
|
1455 |
|
|
1456 |
TLinearOrder<TChar> rule( CPcsAlgorithm1Utils::CompareByCharacter );
|
|
1457 |
|
|
1458 |
// Loop through the caches that form the Adaptive Grid
|
|
1459 |
for ( TUint i=0;
|
|
1460 |
gridSize < KPsAdaptiveGridStringMaxLen && i < cacheIds.Count();
|
|
1461 |
i++ )
|
|
1462 |
{
|
|
1463 |
// Cache instance for this URI
|
|
1464 |
CPcsCache* cache = iPcsCache[cacheIds[i]];
|
|
1465 |
|
|
1466 |
// Get the Adaptive Grid
|
|
1467 |
gridOnePtr.Zero();
|
|
1468 |
cache->GetAdaptiveGridL( aCompanyName, gridOnePtr );
|
|
1469 |
|
|
1470 |
PRINT2 ( _L("CPcsAlgorithm1::GetAdaptiveGridFromCacheL. Adaptive Grid for cache \"%S\" is \"%S\""),
|
|
1471 |
&cache->GetURI(), &gridOnePtr );
|
|
1472 |
|
|
1473 |
// Loop through the characters of the Adaptive Grid for the cache
|
|
1474 |
for ( TUint j=0;
|
|
1475 |
gridSize < KPsAdaptiveGridStringMaxLen && j < gridOnePtr.Length();
|
|
1476 |
j++ )
|
|
1477 |
{
|
|
1478 |
if ( i == 0 ) // Grid from one cache is already ordered with no repetitions
|
|
1479 |
{
|
|
1480 |
gridAll.Append( gridOnePtr[j]);
|
|
1481 |
}
|
|
1482 |
else // Grids from more caches can have repeated characters
|
|
1483 |
{
|
|
1484 |
gridAll.InsertInOrder( gridOnePtr[j], rule ); // No repeats !!!
|
|
1485 |
}
|
|
1486 |
gridSize++;
|
|
1487 |
}
|
|
1488 |
}
|
|
1489 |
|
|
1490 |
// Form the Adaptive Grid to be returned
|
|
1491 |
aAdaptiveGrid.Zero();
|
|
1492 |
for ( TUint i=0; i < gridAll.Count(); i++ )
|
|
1493 |
{
|
|
1494 |
aAdaptiveGrid.Append( gridAll[i] );
|
|
1495 |
}
|
|
1496 |
|
|
1497 |
PRINT1 ( _L("CPcsAlgorithm1::GetAdaptiveGridFromCacheL. Adaptive Grid: \"%S\" (Merge was done)"),
|
|
1498 |
&aAdaptiveGrid );
|
|
1499 |
|
|
1500 |
CleanupStack::PopAndDestroy( gridOne );
|
|
1501 |
CleanupStack::PopAndDestroy( &gridAll ); // Close
|
|
1502 |
}
|
|
1503 |
|
|
1504 |
CleanupStack::PopAndDestroy( &cacheIds ); // Close
|
|
1505 |
|
|
1506 |
PRINT ( _L("End CPcsAlgorithm1::GetAdaptiveGridFromCacheL") );
|
|
1507 |
}
|
|
1508 |
|
|
1509 |
// ---------------------------------------------------------------------------------
|
|
1510 |
// Read the persisted sort order from the central repository
|
|
1511 |
// Persisted sort order is of form URI Field1 Field2 Field3 .. FieldN (space delimited)
|
|
1512 |
// ---------------------------------------------------------------------------------
|
|
1513 |
void CPcsAlgorithm1::ReadSortOrderFromCenRepL(const TDesC& aURI,
|
|
1514 |
RArray<TInt>& aSortOrder)
|
|
1515 |
{
|
|
1516 |
PRINT ( _L("Enter CPcsAlgorithm1::ReadSortOrderFromCenRepL.") );
|
|
1517 |
|
|
1518 |
aSortOrder.Reset();
|
|
1519 |
|
|
1520 |
CRepository *repository = CRepository::NewL( KCRUidPSSortOrder );
|
|
1521 |
|
|
1522 |
// Read the sort order from cenrep
|
|
1523 |
TBuf<KCRMaxLen> str;
|
|
1524 |
|
|
1525 |
for ( TInt i(KCenrepFieldsStartKey);
|
|
1526 |
i < KCenrepFieldsStartKey + KCenrepNumberOfFieldsCount;
|
|
1527 |
i++ )
|
|
1528 |
{
|
|
1529 |
TInt err = repository->Get( i, str );
|
|
1530 |
|
|
1531 |
if ( KErrNone != err )
|
|
1532 |
{
|
|
1533 |
break;
|
|
1534 |
}
|
|
1535 |
|
|
1536 |
if (str != KNullDesC)
|
|
1537 |
{
|
|
1538 |
TLex lex(str);
|
|
1539 |
|
|
1540 |
// Extract the URI
|
|
1541 |
TPtrC token = lex.NextToken();
|
|
1542 |
|
|
1543 |
if ( aURI.Compare(token) == 0 )
|
|
1544 |
{
|
|
1545 |
// Extract the sort order
|
|
1546 |
token.Set(lex.NextToken());
|
|
1547 |
|
|
1548 |
while ( token.Length() != 0 )
|
|
1549 |
{
|
|
1550 |
TLex lex1(token);
|
|
1551 |
|
|
1552 |
TInt intVal;
|
|
1553 |
TInt err = lex1.Val(intVal);
|
|
1554 |
|
|
1555 |
if ( KErrNone == err )
|
|
1556 |
{
|
|
1557 |
aSortOrder.Append(intVal);
|
|
1558 |
}
|
|
1559 |
|
|
1560 |
// Next token
|
|
1561 |
token.Set(lex.NextToken());
|
|
1562 |
}
|
|
1563 |
|
|
1564 |
break;
|
|
1565 |
}
|
|
1566 |
}
|
|
1567 |
|
|
1568 |
}
|
|
1569 |
|
|
1570 |
delete repository;
|
|
1571 |
|
|
1572 |
PRINT ( _L("End CPcsAlgorithm1::ReadSortOrderFromCenRepL.") );
|
|
1573 |
}
|
|
1574 |
|
|
1575 |
// ---------------------------------------------------------------------------------
|
|
1576 |
// Write the sort order into the central repository
|
|
1577 |
// Persisted sort order is of form URI Field1 Field2 Field3 .. FieldN (space delimited)
|
|
1578 |
// ---------------------------------------------------------------------------------
|
|
1579 |
void CPcsAlgorithm1::WriteSortOrderToCenRepL(const TDesC& aURI,
|
|
1580 |
RArray<TInt>& aSortOrder)
|
|
1581 |
{
|
|
1582 |
PRINT ( _L("Enter CPcsAlgorithm1::WriteSortOrderToCenRepL.") );
|
|
1583 |
|
|
1584 |
CRepository *repository = CRepository::NewLC( KCRUidPSSortOrder );
|
|
1585 |
|
|
1586 |
// Check if there an entry for this URI in cenrep
|
|
1587 |
TBuf<KCRMaxLen> str;
|
|
1588 |
TInt keyIndex = -1;
|
|
1589 |
|
|
1590 |
for ( TInt i(KCenrepFieldsStartKey);
|
|
1591 |
i < KCenrepFieldsStartKey + KCenrepNumberOfFieldsCount;
|
|
1592 |
i++ )
|
|
1593 |
{
|
|
1594 |
TInt err = repository->Get( i, str );
|
|
1595 |
|
|
1596 |
if ( KErrNone != err )
|
|
1597 |
{
|
|
1598 |
PRINT ( _L("CPcsAlgorithm1::WriteSortOrderToCenRepL. cenrep error.") );
|
|
1599 |
return;
|
|
1600 |
}
|
|
1601 |
|
|
1602 |
if (str != KNullDesC)
|
|
1603 |
{
|
|
1604 |
TLex lex(str);
|
|
1605 |
|
|
1606 |
// Extract the URI
|
|
1607 |
TPtrC token = lex.NextToken();
|
|
1608 |
|
|
1609 |
if ( aURI.Compare(token) == 0 )
|
|
1610 |
{
|
|
1611 |
keyIndex = i; // i has the key index for this URI
|
|
1612 |
break;
|
|
1613 |
}
|
|
1614 |
}
|
|
1615 |
}
|
|
1616 |
|
|
1617 |
// No entry for this URI in cenrep
|
|
1618 |
// Find the next free location in cenrep
|
|
1619 |
if ( keyIndex == -1 )
|
|
1620 |
{
|
|
1621 |
// Find the next free key index
|
|
1622 |
for ( TInt i(KCenrepFieldsStartKey);
|
|
1623 |
i < KCenrepFieldsStartKey + KCenrepNumberOfFieldsCount;
|
|
1624 |
i++ )
|
|
1625 |
{
|
|
1626 |
TInt err = repository->Get( i, str );
|
|
1627 |
|
|
1628 |
if ( KErrNone != err )
|
|
1629 |
{
|
|
1630 |
PRINT ( _L("CPcsAlgorithm1::WriteSortOrderToCenRepL. cenrep error.") );
|
|
1631 |
return;
|
|
1632 |
}
|
|
1633 |
|
|
1634 |
if (str == KNullDesC)
|
|
1635 |
{
|
|
1636 |
keyIndex = i; // i has the next free location
|
|
1637 |
break;
|
|
1638 |
}
|
|
1639 |
}
|
|
1640 |
}
|
|
1641 |
|
|
1642 |
if ( keyIndex == -1 )
|
|
1643 |
{
|
|
1644 |
PRINT ( _L("CPcsAlgorithm1::WriteSortOrderToCenRepL. Persist limit violated.") );
|
|
1645 |
return;
|
|
1646 |
}
|
|
1647 |
|
|
1648 |
// Persist the sort order
|
|
1649 |
HBufC* str1 = HBufC::NewLC(KCRMaxLen);
|
|
1650 |
TPtr ptr(str1->Des());
|
|
1651 |
|
|
1652 |
// Append the URI
|
|
1653 |
ptr.Append(aURI);
|
|
1654 |
ptr.Append(KSpace);
|
|
1655 |
|
|
1656 |
// Append the sort order fields
|
|
1657 |
for ( TInt j = 0; j < aSortOrder.Count(); j++ )
|
|
1658 |
{
|
|
1659 |
ptr.AppendNum(aSortOrder[j]);
|
|
1660 |
ptr.Append(KSpace);
|
|
1661 |
}
|
|
1662 |
|
|
1663 |
// Write to persistent store
|
|
1664 |
TInt err = repository->Set(keyIndex, ptr);
|
|
1665 |
|
|
1666 |
User::LeaveIfError(err);
|
|
1667 |
|
|
1668 |
CleanupStack::PopAndDestroy( str1 );
|
|
1669 |
|
|
1670 |
CleanupStack::PopAndDestroy( repository );
|
|
1671 |
|
|
1672 |
PRINT ( _L("End CPcsAlgorithm1::WriteSortOrderToCenRepL.") );
|
|
1673 |
}
|
|
1674 |
|
|
1675 |
// ---------------------------------------------------------------------------------
|
|
1676 |
// WriteClientDataL.
|
|
1677 |
// Write the content required by client
|
|
1678 |
// ---------------------------------------------------------------------------------
|
|
1679 |
CPsClientData* CPcsAlgorithm1::WriteClientDataL( CPsData& aPsData )
|
|
1680 |
{
|
|
1681 |
CPsClientData* clientData = CPsClientData::NewL();
|
|
1682 |
CleanupStack::PushL(clientData);
|
|
1683 |
|
|
1684 |
// set Id
|
|
1685 |
clientData->SetId(aPsData.Id());
|
|
1686 |
|
|
1687 |
// set Uri
|
|
1688 |
clientData->SetUriL(GetUriForIdL(aPsData.UriId()));
|
|
1689 |
|
|
1690 |
// set pointer to the each data element
|
|
1691 |
for(TInt i = 0; i < aPsData.DataElementCount(); i++)
|
|
1692 |
{
|
|
1693 |
clientData->SetDataL(i, *(aPsData.Data(i)));
|
|
1694 |
}
|
|
1695 |
|
|
1696 |
// set data extension
|
|
1697 |
clientData->SetDataExtensionL(aPsData.DataExtension());
|
|
1698 |
|
|
1699 |
// Set the Field match
|
|
1700 |
clientData->SetFieldMatch(aPsData.DataMatch()) ;
|
|
1701 |
CleanupStack::Pop(clientData);
|
|
1702 |
|
|
1703 |
return clientData;
|
|
1704 |
}
|
|
1705 |
|
|
1706 |
// ---------------------------------------------------------------------------------
|
|
1707 |
// HandleCacheUpdated.
|
|
1708 |
// ---------------------------------------------------------------------------------
|
|
1709 |
void CPcsAlgorithm1::HandleCacheUpdated( TCachingStatus aStatus )
|
|
1710 |
{
|
|
1711 |
TInt psKey( KErrNotFound );
|
|
1712 |
|
|
1713 |
switch ( aStatus )
|
|
1714 |
{
|
|
1715 |
case ECacheUpdateContactRemoved:
|
|
1716 |
psKey = EPsKeyContactRemovedCounter;
|
|
1717 |
break;
|
|
1718 |
|
|
1719 |
case ECacheUpdateContactModified:
|
|
1720 |
psKey = EPsKeyContactModifiedCounter;
|
|
1721 |
break;
|
|
1722 |
|
|
1723 |
case ECacheUpdateContactAdded:
|
|
1724 |
psKey = EPsKeyContactAddedCounter;
|
|
1725 |
break;
|
|
1726 |
|
|
1727 |
default:
|
|
1728 |
break;
|
|
1729 |
}
|
|
1730 |
|
|
1731 |
if ( psKey != KErrNotFound )
|
|
1732 |
{
|
|
1733 |
// Increment the related counter in P&S by one to signal the clients about
|
|
1734 |
// the cache update.
|
|
1735 |
TInt counter( KErrNotFound );
|
|
1736 |
TInt err = RProperty::Get( KPcsInternalUidCacheStatus, psKey, counter );
|
|
1737 |
if ( !err )
|
|
1738 |
{
|
|
1739 |
counter++;
|
|
1740 |
RProperty::Set( KPcsInternalUidCacheStatus, psKey, counter );
|
|
1741 |
}
|
|
1742 |
}
|
|
1743 |
}
|
|
1744 |
|
|
1745 |
// ---------------------------------------------------------------------------------
|
|
1746 |
// DoLaunchPluginsL.
|
|
1747 |
// launch plugins by idle
|
|
1748 |
// ---------------------------------------------------------------------------------
|
|
1749 |
TInt CPcsAlgorithm1::DoLaunchPluginsL(TAny* aPtr)
|
|
1750 |
{
|
|
1751 |
CPcsAlgorithm1* ptr = (CPcsAlgorithm1*) aPtr;
|
|
1752 |
ptr->DoLaunchPluginsL();
|
|
1753 |
return EFalse;
|
|
1754 |
}
|
|
1755 |
|
|
1756 |
// ---------------------------------------------------------------------------------
|
|
1757 |
// DoLaunchPluginsL.
|
|
1758 |
// lauch plugins
|
|
1759 |
// ---------------------------------------------------------------------------------
|
|
1760 |
void CPcsAlgorithm1::DoLaunchPluginsL()
|
|
1761 |
{
|
|
1762 |
// Initialize available data adapters
|
|
1763 |
iPsDataPluginInterface = CPsDataPluginInterface::NewL(this, this);
|
|
1764 |
iPsDataPluginInterface->InstantiateAllPlugInsL();
|
|
1765 |
|
|
1766 |
// Store the cache list in TLS
|
|
1767 |
// Required to support sort order changes in a memory efficient way
|
|
1768 |
// This avoids storing sort order information in the CPsData element
|
|
1769 |
// and storing it in CPcsCache. Refer CPcsAlgorithm1Utils::CompareDataBySortOrderL
|
|
1770 |
// to see how this is being used.
|
|
1771 |
User::LeaveIfError( Dll::SetTls(&iPcsCache) );
|
|
1772 |
|
|
1773 |
// Initialize cache
|
|
1774 |
RPointerArray<TDesC> dataStores;
|
|
1775 |
CleanupClosePushL( dataStores );
|
|
1776 |
|
|
1777 |
iPsDataPluginInterface->GetAllSupportedDataStoresL(dataStores);
|
|
1778 |
|
|
1779 |
for ( TInt dIndex = 0; dIndex < dataStores.Count(); dIndex++ )
|
|
1780 |
{
|
|
1781 |
AddDataStore(*(dataStores[dIndex]));
|
|
1782 |
}
|
|
1783 |
|
|
1784 |
CleanupStack::PopAndDestroy( &dataStores ); // Close
|
|
1785 |
}
|
|
1786 |
|
|
1787 |
// End of file
|
|
1788 |
|