26
|
1 |
/*
|
|
2 |
* Copyright (c) 2008-2009 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: Item ordered for traversing lists
|
|
15 |
*
|
|
16 |
*/
|
|
17 |
|
|
18 |
|
|
19 |
|
|
20 |
|
|
21 |
#include "mglxmedialist.h"
|
|
22 |
#include "glxlistutils.h"
|
|
23 |
#include "glxmedialistiterator.h"
|
|
24 |
|
|
25 |
#include <glxtracer.h>
|
|
26 |
#include <glxlog.h>
|
|
27 |
#include <hal.h>
|
|
28 |
|
|
29 |
const TInt KSequentialIteratorInitialValue = -1;
|
|
30 |
// Default granularity of items to request for
|
|
31 |
const TUint KGlxBlockyIteratorDefaultGranularity = 15;
|
|
32 |
|
|
33 |
const TInt KGlxLowerMemoryLimitForCacheSize = 31500000; // 30 MB
|
|
34 |
const TInt KGlxUpperMemoryLimitForCacheSize = 52500000; // 50 MB
|
|
35 |
|
|
36 |
const TInt KMaxLowMemOffsetValue = 3;
|
|
37 |
const TInt KMinLowMemOffsetValue = 1;
|
|
38 |
|
|
39 |
EXPORT_C TGlxSequentialIterator::TGlxSequentialIterator()
|
|
40 |
{
|
|
41 |
TRACER("TGlxSequentialIterator::TGlxSequentialIterator");
|
|
42 |
|
|
43 |
iList = NULL;
|
|
44 |
iCurrentItem = KSequentialIteratorInitialValue;
|
|
45 |
iRange = KMaxTInt; // To support full list length iteration,if range is not set
|
|
46 |
}
|
|
47 |
|
|
48 |
// -----------------------------------------------------------------------------
|
|
49 |
// Set to first item
|
|
50 |
// -----------------------------------------------------------------------------
|
|
51 |
//
|
|
52 |
void TGlxSequentialIterator::SetToFirst(const MGlxMediaList* aList)
|
|
53 |
{
|
|
54 |
TRACER("TGlxSequentialIterator::SetToFirst");
|
|
55 |
|
|
56 |
__ASSERT_DEBUG(aList != NULL, Panic(EGlxPanicNullPointer));
|
|
57 |
iList = aList;
|
|
58 |
iCurrentItem = KSequentialIteratorInitialValue;
|
|
59 |
}
|
|
60 |
|
|
61 |
// -----------------------------------------------------------------------------
|
|
62 |
// Return the next item index or KErrNotFound
|
|
63 |
// -----------------------------------------------------------------------------
|
|
64 |
//
|
|
65 |
TInt TGlxSequentialIterator::operator++(TInt)
|
|
66 |
{
|
|
67 |
TRACER("TGlxSequentialIterator::operator++");
|
|
68 |
|
|
69 |
iCurrentItem++;
|
|
70 |
if (iCurrentItem < iList->Count() && iCurrentItem < iRange )
|
|
71 |
{
|
|
72 |
return iCurrentItem;
|
|
73 |
}
|
|
74 |
else
|
|
75 |
{
|
|
76 |
return KErrNotFound;
|
|
77 |
}
|
|
78 |
}
|
|
79 |
|
|
80 |
// -----------------------------------------------------------------------------
|
|
81 |
// Return ETrue if index is within range, EFalse otherwise
|
|
82 |
// -----------------------------------------------------------------------------
|
|
83 |
//
|
|
84 |
TBool TGlxSequentialIterator::InRange(TInt aIndex) const
|
|
85 |
{
|
|
86 |
TRACER("TGlxSequentialIterator::InRange");
|
|
87 |
|
|
88 |
return (aIndex < iRange && aIndex < iList->Count() && aIndex >= 0);
|
|
89 |
}
|
|
90 |
// -----------------------------------------------------------------------------
|
|
91 |
// SetRange
|
|
92 |
// -----------------------------------------------------------------------------
|
|
93 |
//
|
|
94 |
EXPORT_C void TGlxSequentialIterator::SetRange( TInt aRange )
|
|
95 |
{
|
|
96 |
TRACER("TGlxSequentialIterator::SetRange");
|
|
97 |
|
|
98 |
iRange = aRange;
|
|
99 |
}
|
|
100 |
|
|
101 |
// -----------------------------------------------------------------------------
|
|
102 |
// Constructor
|
|
103 |
// -----------------------------------------------------------------------------
|
|
104 |
//
|
|
105 |
EXPORT_C TGlxSpecificIdIterator::TGlxSpecificIdIterator(const TGlxIdSpaceId& aIdSpaceId, TGlxMediaId aMediaId)
|
|
106 |
: iMediaId(aMediaId), iIdSpaceId(aIdSpaceId), iFinished(EFalse)
|
|
107 |
{
|
|
108 |
TRACER("TGlxSpecificIdIterator::TGlxSpecificIdIterator");
|
|
109 |
|
|
110 |
}
|
|
111 |
|
|
112 |
// -----------------------------------------------------------------------------
|
|
113 |
// Set to first item
|
|
114 |
// -----------------------------------------------------------------------------
|
|
115 |
//
|
|
116 |
void TGlxSpecificIdIterator::SetToFirst(const MGlxMediaList* aList)
|
|
117 |
{
|
|
118 |
TRACER("TGlxSpecificIdIterator::SetToFirst");
|
|
119 |
|
|
120 |
__ASSERT_DEBUG(aList != NULL, Panic(EGlxPanicNullPointer));
|
|
121 |
iList = aList;
|
|
122 |
iFinished = EFalse;
|
|
123 |
}
|
|
124 |
|
|
125 |
// -----------------------------------------------------------------------------
|
|
126 |
// Return the next item index or KErrNotFound
|
|
127 |
// -----------------------------------------------------------------------------
|
|
128 |
//
|
|
129 |
TInt TGlxSpecificIdIterator::operator++(TInt)
|
|
130 |
{
|
|
131 |
TRACER("TGlxSpecificIdIterator::operator++");
|
|
132 |
|
|
133 |
if (iFinished)
|
|
134 |
{
|
|
135 |
return KErrNotFound;
|
|
136 |
}
|
|
137 |
else
|
|
138 |
{
|
|
139 |
iFinished = ETrue;
|
|
140 |
return iList->Index(iIdSpaceId, iMediaId);
|
|
141 |
}
|
|
142 |
}
|
|
143 |
// -----------------------------------------------------------------------------
|
|
144 |
// Return ETrue if index is within range, EFalse otherwise
|
|
145 |
// -----------------------------------------------------------------------------
|
|
146 |
//
|
|
147 |
TBool TGlxSpecificIdIterator::InRange(TInt aIndex) const
|
|
148 |
{
|
|
149 |
TRACER("TGlxSpecificIdIterator::InRange");
|
|
150 |
|
|
151 |
return (aIndex == iList->Index(iIdSpaceId, iMediaId));
|
|
152 |
}
|
|
153 |
|
|
154 |
// -----------------------------------------------------------------------------
|
|
155 |
// Constructor
|
|
156 |
// -----------------------------------------------------------------------------
|
|
157 |
//
|
|
158 |
EXPORT_C TGlxFirstThenLastIterator::TGlxFirstThenLastIterator()
|
|
159 |
{
|
|
160 |
TRACER("TGlxFirstThenLastIterator::TGlxFirstThenLastIterator");
|
|
161 |
|
|
162 |
iCurrentItem = 0;
|
|
163 |
iList = NULL;
|
|
164 |
}
|
|
165 |
|
|
166 |
// -----------------------------------------------------------------------------
|
|
167 |
// Destructor
|
|
168 |
// -----------------------------------------------------------------------------
|
|
169 |
//
|
|
170 |
EXPORT_C TGlxFirstThenLastIterator::~TGlxFirstThenLastIterator()
|
|
171 |
{
|
|
172 |
TRACER("TGlxFirstThenLastIterator::~TGlxFirstThenLastIterator");
|
|
173 |
|
|
174 |
}
|
|
175 |
|
|
176 |
// -----------------------------------------------------------------------------
|
|
177 |
// Set to first item
|
|
178 |
// -----------------------------------------------------------------------------
|
|
179 |
//
|
|
180 |
void TGlxFirstThenLastIterator::SetToFirst(const MGlxMediaList* aList)
|
|
181 |
{
|
|
182 |
TRACER("TGlxFirstThenLastIterator::SetToFirst");
|
|
183 |
__ASSERT_DEBUG(aList, Panic(EGlxPanicNullPointer));
|
|
184 |
|
|
185 |
iList = aList;
|
|
186 |
iCurrentItem = 0;
|
|
187 |
}
|
|
188 |
|
|
189 |
// -----------------------------------------------------------------------------
|
|
190 |
// Return the next item index or KErrNotFound
|
|
191 |
// -----------------------------------------------------------------------------
|
|
192 |
//
|
|
193 |
TInt TGlxFirstThenLastIterator::operator++(TInt)
|
|
194 |
{
|
|
195 |
TRACER("TGlxFirstThenLastIterator::operator++");
|
|
196 |
__ASSERT_DEBUG(iList != NULL, Panic(EGlxPanicNullPointer));
|
|
197 |
|
|
198 |
TInt count = iList->Count();
|
|
199 |
if (count <= 0)
|
|
200 |
{
|
|
201 |
return KErrNotFound;
|
|
202 |
}
|
|
203 |
|
|
204 |
if (iCurrentItem == 0)
|
|
205 |
{
|
|
206 |
// Return first item index
|
|
207 |
iCurrentItem++;
|
|
208 |
return 0;
|
|
209 |
}
|
|
210 |
|
|
211 |
if (iCurrentItem == 1)
|
|
212 |
{
|
|
213 |
// Return last item index
|
|
214 |
iCurrentItem++;
|
|
215 |
return count - 1;
|
|
216 |
}
|
|
217 |
|
|
218 |
// At last item already
|
|
219 |
return KErrNotFound;
|
|
220 |
}
|
|
221 |
// -----------------------------------------------------------------------------
|
|
222 |
// Return ETrue if index is within range, EFalse otherwise
|
|
223 |
// -----------------------------------------------------------------------------
|
|
224 |
//
|
|
225 |
TBool TGlxFirstThenLastIterator::InRange(TInt aIndex) const
|
|
226 |
{
|
|
227 |
TRACER("TGlxFirstThenLastIterator::InRange");
|
|
228 |
__ASSERT_DEBUG(aIndex >= 0 && aIndex < iList->Count(), Panic(EGlxPanicIllegalArgument));
|
|
229 |
|
|
230 |
// Return ETrue if first or last item
|
|
231 |
return (aIndex == 0) || (aIndex == iList->Count() - 1);
|
|
232 |
}
|
|
233 |
|
|
234 |
// -----------------------------------------------------------------------------
|
|
235 |
// Constructor
|
|
236 |
// -----------------------------------------------------------------------------
|
|
237 |
//
|
|
238 |
EXPORT_C TGlxFromFocusOutwardIterator::TGlxFromFocusOutwardIterator()
|
|
239 |
{
|
|
240 |
TRACER("TGlxFromFocusOutwardIterator::TGlxFromFocusOutwardIterator");
|
|
241 |
iCurrentItem = 0;
|
|
242 |
iFrontOffset = 0;
|
|
243 |
iRearOffset = 0;
|
|
244 |
iList = NULL;
|
|
245 |
}
|
|
246 |
|
|
247 |
// -----------------------------------------------------------------------------
|
|
248 |
// Destructor
|
|
249 |
// -----------------------------------------------------------------------------
|
|
250 |
//
|
|
251 |
EXPORT_C TGlxFromFocusOutwardIterator::~TGlxFromFocusOutwardIterator()
|
|
252 |
{
|
|
253 |
TRACER("TGlxFromFocusOutwardIterator::~TGlxFromFocusOutwardIterator");
|
|
254 |
}
|
|
255 |
|
|
256 |
// ----------------------------------------------------------------------------
|
|
257 |
// Set range offsets
|
|
258 |
// ----------------------------------------------------------------------------
|
|
259 |
//
|
|
260 |
EXPORT_C void TGlxFromFocusOutwardIterator::SetRangeOffsets(TInt aRearOffset,
|
|
261 |
TInt aFrontOffset)
|
|
262 |
{
|
|
263 |
TRACER("TGlxFromFocusOutwardIterator::SetRangeOffsets");
|
|
264 |
__ASSERT_DEBUG(aRearOffset >= 0 && aFrontOffset >= 0, Panic(EGlxPanicIllegalArgument));
|
|
265 |
iFrontOffset = aFrontOffset;
|
|
266 |
iRearOffset = aRearOffset;
|
|
267 |
iOriginalFrontOffset = iFrontOffset;
|
|
268 |
iOriginalRearOffset = iRearOffset;
|
|
269 |
}
|
|
270 |
|
|
271 |
// -----------------------------------------------------------------------------
|
|
272 |
// Set to first item
|
|
273 |
// -----------------------------------------------------------------------------
|
|
274 |
//
|
|
275 |
void TGlxFromFocusOutwardIterator::SetToFirst(const MGlxMediaList* aList)
|
|
276 |
{
|
|
277 |
TRACER("TGlxFromFocusOutwardIterator::SetToFirst");
|
|
278 |
__ASSERT_DEBUG(aList != NULL, Panic(EGlxPanicNullPointer));
|
|
279 |
|
|
280 |
iList = aList;
|
|
281 |
iCurrentItem = 0;
|
|
282 |
}
|
|
283 |
|
|
284 |
// -----------------------------------------------------------------------------
|
|
285 |
// Return the item index or KErrNotFound, and goes to next
|
|
286 |
// -----------------------------------------------------------------------------
|
|
287 |
//
|
|
288 |
TInt TGlxFromFocusOutwardIterator::operator++(TInt)
|
|
289 |
{
|
|
290 |
TRACER("TGlxFromFocusOutwardIterator::operator++");
|
|
291 |
__ASSERT_DEBUG(iList != NULL, Panic(EGlxPanicNullPointer));
|
|
292 |
|
|
293 |
TInt count = iList->Count();
|
|
294 |
if (count <= 0)
|
|
295 |
{
|
|
296 |
return KErrNotFound;
|
|
297 |
}
|
|
298 |
|
|
299 |
if (iOriginalFrontOffset > KMaxLowMemOffsetValue &&
|
|
300 |
iOriginalRearOffset > KMaxLowMemOffsetValue)
|
|
301 |
{
|
|
302 |
TInt freeMemory = 0;
|
|
303 |
HAL::Get( HALData::EMemoryRAMFree, freeMemory );
|
|
304 |
if ( freeMemory < KGlxUpperMemoryLimitForCacheSize &&
|
|
305 |
freeMemory > KGlxLowerMemoryLimitForCacheSize )
|
|
306 |
{
|
|
307 |
iFrontOffset = KMaxLowMemOffsetValue;
|
|
308 |
iRearOffset = KMaxLowMemOffsetValue;
|
|
309 |
}
|
|
310 |
else if ( freeMemory < KGlxLowerMemoryLimitForCacheSize )
|
|
311 |
{
|
|
312 |
iFrontOffset = KMinLowMemOffsetValue;
|
|
313 |
iRearOffset = KMinLowMemOffsetValue;
|
|
314 |
}
|
|
315 |
else if (iFrontOffset != iOriginalFrontOffset
|
|
316 |
&& iRearOffset!= iOriginalRearOffset)
|
|
317 |
{
|
|
318 |
iFrontOffset = Max(iFrontOffset, iOriginalFrontOffset );
|
|
319 |
iRearOffset = Max(iRearOffset, iOriginalRearOffset );
|
|
320 |
}
|
|
321 |
}
|
|
322 |
|
|
323 |
// Check if out of bounds
|
|
324 |
if (iFrontOffset + iRearOffset < iCurrentItem || count <= iCurrentItem)
|
|
325 |
{
|
|
326 |
return KErrNotFound;
|
|
327 |
}
|
|
328 |
|
|
329 |
// The ranges may be inequal, which means there won't be any jumping between
|
|
330 |
// front and rear.
|
|
331 |
|
|
332 |
// |-------F----------------------|
|
|
333 |
// |< jumping zone>|
|
|
334 |
|
|
335 |
TInt index = iList->FocusIndex();
|
|
336 |
|
|
337 |
TInt min = Min(iFrontOffset, iRearOffset);
|
|
338 |
TInt jumpingZoneLength = min * 2;
|
|
339 |
if (iCurrentItem <= jumpingZoneLength)
|
|
340 |
{
|
|
341 |
// Still within the (rear-front-rear-front) jumping zone
|
|
342 |
TInt distanceFromFocus = (iCurrentItem + 1) / 2;
|
|
343 |
TBool rear = !(iCurrentItem & 1); // Rear if number is even
|
|
344 |
if (rear)
|
|
345 |
{
|
|
346 |
index -= distanceFromFocus;
|
|
347 |
}
|
|
348 |
else
|
|
349 |
{
|
|
350 |
index += distanceFromFocus;
|
|
351 |
}
|
|
352 |
}
|
|
353 |
else
|
|
354 |
{
|
|
355 |
__ASSERT_DEBUG(iFrontOffset != iRearOffset, Panic(EGlxPanicLogicError));
|
|
356 |
|
|
357 |
// index is currently focus index. Figure out how much need to move.
|
|
358 |
TInt indexesFromFocus = iCurrentItem - min;
|
|
359 |
if (iRearOffset < iFrontOffset)
|
|
360 |
{
|
|
361 |
// Front range is longer than rear, so the item is on the front side
|
|
362 |
index += indexesFromFocus;
|
|
363 |
}
|
|
364 |
else
|
|
365 |
{
|
|
366 |
// Rear range is longer than front, so the item is on the rear side
|
|
367 |
index -= indexesFromFocus;
|
|
368 |
}
|
|
369 |
}
|
|
370 |
|
|
371 |
iCurrentItem++;
|
|
372 |
|
|
373 |
// The index may be below 0 or above count. Normalise back to list indexes.
|
|
374 |
return GlxListUtils::NormalizedIndex(index, count);
|
|
375 |
}
|
|
376 |
|
|
377 |
// -----------------------------------------------------------------------------
|
|
378 |
// Return ETrue if index is within range, EFalse otherwise
|
|
379 |
// -----------------------------------------------------------------------------
|
|
380 |
//
|
|
381 |
TBool TGlxFromFocusOutwardIterator::InRange(TInt aIndex) const
|
|
382 |
{
|
|
383 |
TRACER("TGlxFromFocusOutwardIterator::InRange");
|
|
384 |
TInt count = iList->Count();
|
|
385 |
|
|
386 |
// Handle the case where range is longer than count separately, because looping will
|
|
387 |
// confuse otherwise
|
|
388 |
if (count <= iRearOffset + iFrontOffset)
|
|
389 |
{
|
|
390 |
// Range is longer than count, must be in range
|
|
391 |
return ETrue;
|
|
392 |
}
|
|
393 |
|
|
394 |
TInt focusIndex = iList->FocusIndex();
|
|
395 |
TInt firstInRange = GlxListUtils::NormalizedIndex(focusIndex - iRearOffset, count);
|
|
396 |
TInt lastInRange = GlxListUtils::NormalizedIndex(focusIndex + iFrontOffset, count);
|
|
397 |
|
|
398 |
if (firstInRange <= lastInRange)
|
|
399 |
{
|
|
400 |
// Normal case: | F-------L |
|
|
401 |
return aIndex >= firstInRange && aIndex <= lastInRange;
|
|
402 |
}
|
|
403 |
else
|
|
404 |
{
|
|
405 |
// Looping case: |----L F----|
|
|
406 |
return aIndex <= lastInRange || aIndex >= firstInRange;
|
|
407 |
}
|
|
408 |
}
|
|
409 |
|
|
410 |
// -----------------------------------------------------------------------------
|
|
411 |
// Constructor
|
|
412 |
// -----------------------------------------------------------------------------
|
|
413 |
//
|
|
414 |
EXPORT_C TGlxFromIndexOutwardBlockyIterator::TGlxFromIndexOutwardBlockyIterator(
|
|
415 |
const MGlxIndex& aIndexFunctor )
|
|
416 |
: iIndexFunctor( aIndexFunctor )
|
|
417 |
{
|
|
418 |
TRACER("TGlxFromIndexOutwardBlockyIterator::TGlxFromIndexOutwardBlockyIterator");
|
|
419 |
|
|
420 |
iCurrentItem = 0;
|
|
421 |
iFrontOffset = 2 * KGlxBlockyIteratorDefaultGranularity;
|
|
422 |
iRearOffset = 2 * KGlxBlockyIteratorDefaultGranularity;
|
|
423 |
iList = NULL;
|
|
424 |
}
|
|
425 |
|
|
426 |
// -----------------------------------------------------------------------------
|
|
427 |
// Destructor
|
|
428 |
// -----------------------------------------------------------------------------
|
|
429 |
//
|
|
430 |
EXPORT_C TGlxFromIndexOutwardBlockyIterator::~TGlxFromIndexOutwardBlockyIterator()
|
|
431 |
{
|
|
432 |
TRACER("TGlxFromIndexOutwardBlockyIterator::~TGlxFromIndexOutwardBlockyIterator");
|
|
433 |
|
|
434 |
}
|
|
435 |
|
|
436 |
// ----------------------------------------------------------------------------
|
|
437 |
// Set range offsets
|
|
438 |
// ----------------------------------------------------------------------------
|
|
439 |
//
|
|
440 |
EXPORT_C void TGlxFromIndexOutwardBlockyIterator::SetRangeOffsets(TInt aRearOffset,
|
|
441 |
TInt aFrontOffset)
|
|
442 |
{
|
|
443 |
TRACER("TGlxFromIndexOutwardBlockyIterator::SetRangeOffsets");
|
|
444 |
|
|
445 |
__ASSERT_DEBUG(aRearOffset >= 0 && aFrontOffset >= 0, Panic(EGlxPanicIllegalArgument));
|
|
446 |
iFrontOffset = Max(aFrontOffset, KGlxBlockyIteratorDefaultGranularity );
|
|
447 |
iRearOffset = Max(aRearOffset, KGlxBlockyIteratorDefaultGranularity );
|
|
448 |
}
|
|
449 |
|
|
450 |
// -----------------------------------------------------------------------------
|
|
451 |
// Set to first item
|
|
452 |
// -----------------------------------------------------------------------------
|
|
453 |
//
|
|
454 |
void TGlxFromIndexOutwardBlockyIterator::SetToFirst(const MGlxMediaList* aList)
|
|
455 |
{
|
|
456 |
TRACER("TGlxFromIndexOutwardBlockyIterator::SetToFirst");
|
|
457 |
__ASSERT_DEBUG(aList != NULL, Panic(EGlxPanicNullPointer));
|
|
458 |
|
|
459 |
iList = aList;
|
|
460 |
iCurrentItem = 0;
|
|
461 |
}
|
|
462 |
|
|
463 |
// -----------------------------------------------------------------------------
|
|
464 |
// Return the item index or KErrNotFound, and goes to next
|
|
465 |
// -----------------------------------------------------------------------------
|
|
466 |
//
|
|
467 |
TInt TGlxFromIndexOutwardBlockyIterator::operator++(TInt)
|
|
468 |
{
|
|
469 |
TRACER("TGlxFromIndexOutwardBlockyIterator::operator++");
|
|
470 |
__ASSERT_DEBUG(iList != NULL, Panic(EGlxPanicNullPointer));
|
|
471 |
|
|
472 |
TInt count = iList->Count();
|
|
473 |
if (count <= 0)
|
|
474 |
{
|
|
475 |
return KErrNotFound;
|
|
476 |
}
|
|
477 |
|
|
478 |
// Check if out of bounds
|
|
479 |
if (iFrontOffset + iRearOffset < iCurrentItem || count <= iCurrentItem)
|
|
480 |
{
|
|
481 |
return KErrNotFound;
|
|
482 |
}
|
|
483 |
|
|
484 |
// The ranges may be inequal, which means there won't be any jumping between
|
|
485 |
// front and rear.
|
|
486 |
|
|
487 |
// |-------F----------------------|
|
|
488 |
// |< jumping zone>|
|
|
489 |
|
|
490 |
TInt index = iIndexFunctor.Index();
|
|
491 |
__ASSERT_DEBUG( index >= 0 && index < count, Panic( EGlxPanicIllegalState ) );
|
|
492 |
if (index < 0 || index >= count)
|
|
493 |
{
|
|
494 |
// Invalid index, out of bounds
|
|
495 |
return KErrNotFound;
|
|
496 |
}
|
|
497 |
|
|
498 |
index -= index % KGlxBlockyIteratorDefaultGranularity;
|
|
499 |
|
|
500 |
TInt min = Min(iFrontOffset, iRearOffset);
|
|
501 |
TInt jumpingZoneLength = min * 2;
|
|
502 |
if (iCurrentItem <= jumpingZoneLength)
|
|
503 |
{
|
|
504 |
// Still within the (rear-front-rear-front) jumping zone
|
|
505 |
TInt distanceFromFocus = (iCurrentItem + 1) / 2;
|
|
506 |
TBool rear = !(iCurrentItem & 1); // Rear if number is even
|
|
507 |
if (rear)
|
|
508 |
{
|
|
509 |
index -= distanceFromFocus;
|
|
510 |
}
|
|
511 |
else
|
|
512 |
{
|
|
513 |
index += distanceFromFocus;
|
|
514 |
}
|
|
515 |
}
|
|
516 |
else
|
|
517 |
{
|
|
518 |
__ASSERT_DEBUG(iFrontOffset != iRearOffset, Panic(EGlxPanicLogicError));
|
|
519 |
|
|
520 |
// index is currently focus index. Figure out how much need to move.
|
|
521 |
TInt indexesFromFocus = iCurrentItem - min;
|
|
522 |
if (iRearOffset < iFrontOffset)
|
|
523 |
{
|
|
524 |
// Front range is longer than rear, so the item is on the front side
|
|
525 |
index += indexesFromFocus;
|
|
526 |
}
|
|
527 |
else
|
|
528 |
{
|
|
529 |
// Rear range is longer than front, so the item is on the rear side
|
|
530 |
index -= indexesFromFocus;
|
|
531 |
}
|
|
532 |
}
|
|
533 |
|
|
534 |
iCurrentItem++;
|
|
535 |
|
|
536 |
// The index may be below 0 or above count. Normalise back to list indexes.
|
|
537 |
return GlxListUtils::NormalizedIndex(index, count);
|
|
538 |
}
|
|
539 |
|
|
540 |
// -----------------------------------------------------------------------------
|
|
541 |
// Return ETrue if index is within range, EFalse otherwise
|
|
542 |
// -----------------------------------------------------------------------------
|
|
543 |
//
|
|
544 |
TBool TGlxFromIndexOutwardBlockyIterator::InRange(TInt aIndex) const
|
|
545 |
{
|
|
546 |
TRACER("TGlxFromIndexOutwardBlockyIterator::InRange");
|
|
547 |
TInt count = iList->Count();
|
|
548 |
|
|
549 |
// Handle the case where range is longer than count separately, because looping will
|
|
550 |
// confuse otherwise
|
|
551 |
if (count <= iRearOffset + iFrontOffset)
|
|
552 |
{
|
|
553 |
// Range is longer than count, must be in range
|
|
554 |
return ETrue;
|
|
555 |
}
|
|
556 |
|
|
557 |
TInt index = iIndexFunctor.Index();
|
|
558 |
__ASSERT_DEBUG( index >= 0 && index < count, Panic( EGlxPanicIllegalState ) );
|
|
559 |
if (index < 0 || index >= count)
|
|
560 |
{
|
|
561 |
// Invalid index, must be out of range
|
|
562 |
return EFalse;
|
|
563 |
}
|
|
564 |
index -= index % KGlxBlockyIteratorDefaultGranularity;
|
|
565 |
TInt firstInRange = GlxListUtils::NormalizedIndex(index - iRearOffset, count);
|
|
566 |
TInt lastInRange = GlxListUtils::NormalizedIndex(index + iFrontOffset, count);
|
|
567 |
|
|
568 |
if (firstInRange <= lastInRange)
|
|
569 |
{
|
|
570 |
// Normal case: | F-------L |
|
|
571 |
return aIndex >= firstInRange && aIndex <= lastInRange;
|
|
572 |
}
|
|
573 |
else
|
|
574 |
{
|
|
575 |
// Looping case: |----L F----|
|
|
576 |
return aIndex <= lastInRange || aIndex >= firstInRange;
|
|
577 |
}
|
|
578 |
}
|
|
579 |
|
|
580 |
// -----------------------------------------------------------------------------
|
|
581 |
// -----------------------------------------------------------------------------
|
|
582 |
// -----------------------------------------------------------------------------
|
|
583 |
|
|
584 |
// -----------------------------------------------------------------------------
|
|
585 |
// Constructor
|
|
586 |
// -----------------------------------------------------------------------------
|
|
587 |
//
|
|
588 |
EXPORT_C TGlxFromFocusOutwardBlockyIterator::TGlxFromFocusOutwardBlockyIterator()
|
|
589 |
: TGlxFromIndexOutwardBlockyIterator(*static_cast<TGlxFromIndexOutwardBlockyIterator::MGlxIndex*>(this) )
|
|
590 |
{
|
|
591 |
TRACER("TGlxFromIndexOutwardBlockyIterator::TGlxFromFocusOutwardBlockyIterator");
|
|
592 |
}
|
|
593 |
|
|
594 |
// -----------------------------------------------------------------------------
|
|
595 |
// Destructor
|
|
596 |
// -----------------------------------------------------------------------------
|
|
597 |
//
|
|
598 |
EXPORT_C TGlxFromFocusOutwardBlockyIterator::~TGlxFromFocusOutwardBlockyIterator()
|
|
599 |
{
|
|
600 |
TRACER("TGlxFromIndexOutwardBlockyIterator::~TGlxFromFocusOutwardBlockyIterator");
|
|
601 |
}
|
|
602 |
|
|
603 |
// -----------------------------------------------------------------------------
|
|
604 |
// Index
|
|
605 |
// -----------------------------------------------------------------------------
|
|
606 |
//
|
|
607 |
TInt TGlxFromFocusOutwardBlockyIterator::Index() const
|
|
608 |
{
|
|
609 |
TRACER("TGlxFromIndexOutwardBlockyIterator::Index");
|
|
610 |
return iList->FocusIndex();
|
|
611 |
}
|
|
612 |
|
|
613 |
// -----------------------------------------------------------------------------
|
|
614 |
// -----------------------------------------------------------------------------
|
|
615 |
// -----------------------------------------------------------------------------
|
|
616 |
|
|
617 |
// -----------------------------------------------------------------------------
|
|
618 |
// Constructor
|
|
619 |
// -----------------------------------------------------------------------------
|
|
620 |
//
|
|
621 |
EXPORT_C TGlxFromManualIndexOutwardBlockyIterator::TGlxFromManualIndexOutwardBlockyIterator()
|
|
622 |
: TGlxFromIndexOutwardBlockyIterator( *static_cast<TGlxFromIndexOutwardBlockyIterator::MGlxIndex*>(this) ), iIndex( 0 )
|
|
623 |
{
|
|
624 |
TRACER("TGlxFromManualIndexOutwardBlockyIterator::TGlxFromManualIndexOutwardBlockyIterator");
|
|
625 |
}
|
|
626 |
|
|
627 |
// -----------------------------------------------------------------------------
|
|
628 |
// Destructor
|
|
629 |
// -----------------------------------------------------------------------------
|
|
630 |
//
|
|
631 |
EXPORT_C TGlxFromManualIndexOutwardBlockyIterator::~TGlxFromManualIndexOutwardBlockyIterator()
|
|
632 |
{
|
|
633 |
TRACER("TGlxFromManualIndexOutwardBlockyIterator::~TGlxFromManualIndexOutwardBlockyIterator");
|
|
634 |
}
|
|
635 |
|
|
636 |
// -----------------------------------------------------------------------------
|
|
637 |
// SetIndex
|
|
638 |
// -----------------------------------------------------------------------------
|
|
639 |
//
|
|
640 |
EXPORT_C void TGlxFromManualIndexOutwardBlockyIterator::SetIndex( TInt aIndex )
|
|
641 |
{
|
|
642 |
TRACER("TGlxFromManualIndexOutwardBlockyIterator::SetIndex");
|
|
643 |
|
|
644 |
__ASSERT_DEBUG( aIndex >= 0 && aIndex < iList->Count(), Panic( EGlxPanicIllegalArgument ) );
|
|
645 |
iIndex = aIndex;
|
|
646 |
}
|
|
647 |
|
|
648 |
// -----------------------------------------------------------------------------
|
|
649 |
// Index
|
|
650 |
// -----------------------------------------------------------------------------
|
|
651 |
//
|
|
652 |
TInt TGlxFromManualIndexOutwardBlockyIterator::Index() const
|
|
653 |
{
|
|
654 |
TRACER("TGlxFromManualIndexOutwardBlockyIterator::Index");
|
|
655 |
|
|
656 |
return iIndex;
|
|
657 |
}
|
|
658 |
|
|
659 |
// -----------------------------------------------------------------------------
|
|
660 |
// -----------------------------------------------------------------------------
|
|
661 |
// -----------------------------------------------------------------------------
|
|
662 |
|
|
663 |
// -----------------------------------------------------------------------------
|
|
664 |
// Constructor
|
|
665 |
// -----------------------------------------------------------------------------
|
|
666 |
//
|
|
667 |
EXPORT_C TGlxSelectionIterator::TGlxSelectionIterator()
|
|
668 |
{
|
|
669 |
TRACER("TGlxSelectionIterator::TGlxSelectionIterator");
|
|
670 |
|
|
671 |
iCurrentItem = 0;
|
|
672 |
iList = NULL;
|
|
673 |
iRange = KMaxTInt;
|
|
674 |
iDisabledIfMoreThanRangeSelected = EFalse;
|
|
675 |
}
|
|
676 |
|
|
677 |
// -----------------------------------------------------------------------------
|
|
678 |
// Destructor
|
|
679 |
// -----------------------------------------------------------------------------
|
|
680 |
//
|
|
681 |
EXPORT_C TGlxSelectionIterator::~TGlxSelectionIterator()
|
|
682 |
{
|
|
683 |
TRACER("TGlxSelectionIterator::~TGlxSelectionIterator");
|
|
684 |
}
|
|
685 |
|
|
686 |
// -----------------------------------------------------------------------------
|
|
687 |
// Set to first item
|
|
688 |
// -----------------------------------------------------------------------------
|
|
689 |
//
|
|
690 |
EXPORT_C void TGlxSelectionIterator::SetToFirst(const MGlxMediaList* aList)
|
|
691 |
{
|
|
692 |
TRACER("TGlxSelectionIterator::SetToFirst");
|
|
693 |
__ASSERT_DEBUG(aList != NULL, Panic(EGlxPanicNullPointer));
|
|
694 |
|
|
695 |
iList = aList;
|
|
696 |
iCurrentItem = 0;
|
|
697 |
}
|
|
698 |
|
|
699 |
// -----------------------------------------------------------------------------
|
|
700 |
// Return the next item index or KErrNotFound
|
|
701 |
// -----------------------------------------------------------------------------
|
|
702 |
//
|
|
703 |
EXPORT_C TInt TGlxSelectionIterator::operator++(TInt)
|
|
704 |
{
|
|
705 |
TRACER("TGlxSelectionIterator::operator++");
|
|
706 |
__ASSERT_DEBUG(iList != NULL, Panic(EGlxPanicNullPointer));
|
|
707 |
|
|
708 |
TInt result = KErrNotFound;
|
|
709 |
|
|
710 |
TInt selectionCount = iList->SelectionCount();
|
|
711 |
|
|
712 |
if (!iDisabledIfMoreThanRangeSelected || (selectionCount <= iRange))
|
|
713 |
{
|
|
714 |
if (selectionCount == 0)
|
|
715 |
{
|
|
716 |
// If no items are selected, treat the focused index as the selection
|
|
717 |
if ( iCurrentItem == 0 )
|
|
718 |
{
|
|
719 |
result = iList->FocusIndex();
|
|
720 |
iCurrentItem++;
|
|
721 |
}
|
|
722 |
}
|
|
723 |
else
|
|
724 |
{
|
|
725 |
if ( iCurrentItem < iRange && iCurrentItem < selectionCount )
|
|
726 |
{
|
|
727 |
result = iList->SelectedItemIndex(iCurrentItem);
|
|
728 |
iCurrentItem++;
|
|
729 |
}
|
|
730 |
}
|
|
731 |
}
|
|
732 |
return result;
|
|
733 |
}
|
|
734 |
|
|
735 |
// -----------------------------------------------------------------------------
|
|
736 |
// TGlxSelectionIterator::InRange
|
|
737 |
// -----------------------------------------------------------------------------
|
|
738 |
//
|
|
739 |
|
|
740 |
EXPORT_C TBool TGlxSelectionIterator::InRange(TInt aIndex) const
|
|
741 |
{
|
|
742 |
TRACER("TGlxSelectionIterator::InRange");
|
|
743 |
__ASSERT_DEBUG(aIndex >= 0 && aIndex < iList->Count(), Panic(EGlxPanicIllegalArgument));
|
|
744 |
|
|
745 |
TInt selectionCount = iList->SelectionCount();
|
|
746 |
TBool inRange = EFalse;
|
|
747 |
|
|
748 |
if (selectionCount)
|
|
749 |
{
|
|
750 |
TBool legalIndex = EFalse;
|
|
751 |
if (selectionCount > iRange)
|
|
752 |
{
|
|
753 |
if (iDisabledIfMoreThanRangeSelected)
|
|
754 |
{
|
|
755 |
legalIndex = EFalse;
|
|
756 |
}
|
|
757 |
else
|
|
758 |
{
|
|
759 |
legalIndex = (iList->SelectedItemIndex(iRange) > aIndex);
|
|
760 |
}
|
|
761 |
}
|
|
762 |
else
|
|
763 |
{
|
|
764 |
legalIndex = ETrue;
|
|
765 |
}
|
|
766 |
|
|
767 |
if(legalIndex)
|
|
768 |
{
|
|
769 |
inRange = iList->IsSelected(aIndex);
|
|
770 |
}
|
|
771 |
}
|
|
772 |
else
|
|
773 |
{
|
|
774 |
if (!(iDisabledIfMoreThanRangeSelected && (iRange == 0)))
|
|
775 |
{
|
|
776 |
inRange = (aIndex == iList->FocusIndex());
|
|
777 |
}
|
|
778 |
}
|
|
779 |
return inRange;
|
|
780 |
}
|
|
781 |
|
|
782 |
// -----------------------------------------------------------------------------
|
|
783 |
// TGlxSelectionIterator::SetRange
|
|
784 |
// -----------------------------------------------------------------------------
|
|
785 |
//
|
|
786 |
EXPORT_C void TGlxSelectionIterator::SetRange(TInt aMaxItems)
|
|
787 |
{
|
|
788 |
TRACER("TGlxSelectionIterator::SetRange");
|
|
789 |
iRange = aMaxItems;
|
|
790 |
}
|
|
791 |
|
|
792 |
// -----------------------------------------------------------------------------
|
|
793 |
// TGlxSelectionIterator::SetDisabledIfMoreThanRangeSelected
|
|
794 |
// -----------------------------------------------------------------------------
|
|
795 |
//
|
|
796 |
EXPORT_C void TGlxSelectionIterator::SetDisabledIfMoreThanRangeSelected(TBool aDisabledIfMoreThanRangeSelected)
|
|
797 |
{
|
|
798 |
TRACER("TGlxSelectionIterator::SetDisabledIfMoreThanRangeSelected");
|
|
799 |
iDisabledIfMoreThanRangeSelected = aDisabledIfMoreThanRangeSelected;
|
|
800 |
}
|
|
801 |
// -----------------------------------------------------------------------------
|
|
802 |
// Constructor
|
|
803 |
// -----------------------------------------------------------------------------
|
|
804 |
//
|
|
805 |
EXPORT_C TGlxExclusionIterator::TGlxExclusionIterator( MGlxMediaListIterator& aIncludedItemsIterator,
|
|
806 |
MGlxMediaListIterator& aExcludedItemsIterator )
|
|
807 |
:iIncludedItemsIterator( aIncludedItemsIterator ),
|
|
808 |
iExcludedItemsIterator( aExcludedItemsIterator )
|
|
809 |
{
|
|
810 |
TRACER("TGlxExclusionIterator::TGlxExclusionIterator" );
|
|
811 |
}
|
|
812 |
|
|
813 |
// -----------------------------------------------------------------------------
|
|
814 |
// Destructor
|
|
815 |
// -----------------------------------------------------------------------------
|
|
816 |
//
|
|
817 |
EXPORT_C TGlxExclusionIterator::~TGlxExclusionIterator()
|
|
818 |
{
|
|
819 |
TRACER("TGlxExclusionIterator::~TGlxExclusionIterator");
|
|
820 |
}
|
|
821 |
|
|
822 |
// -----------------------------------------------------------------------------
|
|
823 |
// Set to first item
|
|
824 |
// -----------------------------------------------------------------------------
|
|
825 |
//
|
|
826 |
EXPORT_C void TGlxExclusionIterator::SetToFirst(const MGlxMediaList* aList)
|
|
827 |
{
|
|
828 |
TRACER("TGlxExclusionIterator::SetToFirst");
|
|
829 |
__ASSERT_DEBUG(aList != NULL, Panic(EGlxPanicNullPointer));
|
|
830 |
|
|
831 |
//implementation delegates to both the iterators
|
|
832 |
iIncludedItemsIterator.SetToFirst( aList );
|
|
833 |
iExcludedItemsIterator.SetToFirst( aList );
|
|
834 |
}
|
|
835 |
|
|
836 |
// -----------------------------------------------------------------------------
|
|
837 |
// Return the next item index or KErrNotFound
|
|
838 |
// -----------------------------------------------------------------------------
|
|
839 |
//
|
|
840 |
TInt TGlxExclusionIterator::operator++(TInt )
|
|
841 |
{
|
|
842 |
TRACER("TGlxExclusionIterator::operator++");
|
|
843 |
|
|
844 |
// This method returns the next valid item of the iterator such that
|
|
845 |
// (1) The index is within the range of iIncludedItemsIterator
|
|
846 |
// and
|
|
847 |
// (2) The index is not in the range of iExcludedItemsIterator.
|
|
848 |
// If iIncludedItemsIterator reaches its end in this process then we loop to the
|
|
849 |
// first item and repeat the above steps.
|
|
850 |
|
|
851 |
TInt index = KErrNotFound; // assign initial value for maintenance safety
|
|
852 |
|
|
853 |
do {
|
|
854 |
index = iIncludedItemsIterator++;
|
|
855 |
} while ( KErrNotFound != index && iExcludedItemsIterator.InRange( index ) );
|
|
856 |
|
|
857 |
return index;
|
|
858 |
}
|
|
859 |
|
|
860 |
|
|
861 |
// -----------------------------------------------------------------------------
|
|
862 |
// Return ETrue if index is within range, EFalse otherwise
|
|
863 |
// -----------------------------------------------------------------------------
|
|
864 |
//
|
|
865 |
TBool TGlxExclusionIterator::InRange(TInt aIndex) const
|
|
866 |
{
|
|
867 |
TRACER("TGlxExclusionIterator::InRange");
|
|
868 |
|
|
869 |
// Verify that aIndex is
|
|
870 |
// (1) In the range of iIncludedItemsIterator
|
|
871 |
// and
|
|
872 |
// (2) Not in the range of iExcludedItemsIterator
|
|
873 |
|
|
874 |
|
|
875 |
return iIncludedItemsIterator.InRange(aIndex) &&
|
|
876 |
!iExcludedItemsIterator.InRange(aIndex);
|
|
877 |
}
|
|
878 |
|
|
879 |
// -----------------------------------------------------------------------------
|
|
880 |
// Constructor
|
|
881 |
// -----------------------------------------------------------------------------
|
|
882 |
//
|
|
883 |
EXPORT_C TGlxFromManualIndexBlockyIterator::TGlxFromManualIndexBlockyIterator( )
|
|
884 |
{
|
|
885 |
TRACER("TGlxFromManualIndexBlockyIterator::TGlxFromManualIndexBlockyIterator");
|
|
886 |
iDefaultVisItems = GlxListUtils::VisibleItemsGranularityL();
|
|
887 |
iCurrentItem = 0;
|
|
888 |
iFrontOffset = 4 * iDefaultVisItems;
|
|
889 |
iRearOffset = 2 * iDefaultVisItems;
|
|
890 |
iOriginalFrontOffset = iFrontOffset;
|
|
891 |
iOriginalRearOffset = iRearOffset;
|
|
892 |
iList = NULL;
|
|
893 |
}
|
|
894 |
|
|
895 |
// -----------------------------------------------------------------------------
|
|
896 |
// Destructor
|
|
897 |
// -----------------------------------------------------------------------------
|
|
898 |
//
|
|
899 |
EXPORT_C TGlxFromManualIndexBlockyIterator::~TGlxFromManualIndexBlockyIterator()
|
|
900 |
{
|
|
901 |
TRACER("TGlxFromManualIndexBlockyIterator::~TGlxFromManualIndexBlockyIterator");
|
|
902 |
|
|
903 |
}
|
|
904 |
|
|
905 |
// ----------------------------------------------------------------------------
|
|
906 |
// Set range offsets
|
|
907 |
// ----------------------------------------------------------------------------
|
|
908 |
//
|
|
909 |
EXPORT_C void TGlxFromManualIndexBlockyIterator::SetRangeOffsets(TInt aRearOffset,
|
|
910 |
TInt aFrontOffset)
|
|
911 |
{
|
|
912 |
TRACER("TGlxFromManualIndexBlockyIterator::SetRangeOffsets");
|
|
913 |
|
|
914 |
__ASSERT_DEBUG(aRearOffset >= 0 && aFrontOffset >= 0, Panic(EGlxPanicIllegalArgument));
|
|
915 |
iFrontOffset = Max(aFrontOffset, iDefaultVisItems );
|
|
916 |
iRearOffset = Max(aRearOffset, iDefaultVisItems );
|
|
917 |
iOriginalFrontOffset = iFrontOffset;
|
|
918 |
iOriginalRearOffset = iRearOffset;
|
|
919 |
}
|
|
920 |
|
|
921 |
// -----------------------------------------------------------------------------
|
|
922 |
// Set to first item
|
|
923 |
// -----------------------------------------------------------------------------
|
|
924 |
//
|
|
925 |
void TGlxFromManualIndexBlockyIterator::SetToFirst(const MGlxMediaList* aList)
|
|
926 |
{
|
|
927 |
TRACER("TGlxFromManualIndexBlockyIterator::SetToFirst");
|
|
928 |
__ASSERT_DEBUG(aList != NULL, Panic(EGlxPanicNullPointer));
|
|
929 |
|
|
930 |
iList = aList;
|
|
931 |
iCurrentItem = 0;
|
|
932 |
}
|
|
933 |
|
|
934 |
// -----------------------------------------------------------------------------
|
|
935 |
// Return the item index or KErrNotFound, and goes to next
|
|
936 |
// -----------------------------------------------------------------------------
|
|
937 |
//
|
|
938 |
TInt TGlxFromManualIndexBlockyIterator::operator++(TInt)
|
|
939 |
{
|
|
940 |
TRACER("TGlxFromManualIndexBlockyIterator::operator++");
|
|
941 |
__ASSERT_DEBUG(iList != NULL, Panic(EGlxPanicNullPointer));
|
|
942 |
|
|
943 |
TInt count = iList->Count();
|
|
944 |
if (count <= 0)
|
|
945 |
{
|
|
946 |
return KErrNotFound;
|
|
947 |
}
|
|
948 |
|
|
949 |
if (iOriginalFrontOffset > KMaxLowMemOffsetValue* iDefaultVisItems &&
|
|
950 |
iOriginalRearOffset > KMaxLowMemOffsetValue * iDefaultVisItems)
|
|
951 |
{
|
|
952 |
TInt freeMemory = 0;
|
|
953 |
HAL::Get( HALData::EMemoryRAMFree, freeMemory );
|
|
954 |
if ( freeMemory < KGlxUpperMemoryLimitForCacheSize &&
|
|
955 |
freeMemory > KGlxLowerMemoryLimitForCacheSize )
|
|
956 |
{
|
|
957 |
iFrontOffset = 2*iDefaultVisItems;
|
|
958 |
iRearOffset = 3*iDefaultVisItems;
|
|
959 |
}
|
|
960 |
else if ( freeMemory < KGlxLowerMemoryLimitForCacheSize )
|
|
961 |
{
|
|
962 |
iFrontOffset = iDefaultVisItems;
|
|
963 |
iRearOffset = iDefaultVisItems;
|
|
964 |
}
|
|
965 |
else if (iFrontOffset != iOriginalFrontOffset
|
|
966 |
&& iRearOffset!= iOriginalRearOffset)
|
|
967 |
{
|
|
968 |
iFrontOffset = Max(iFrontOffset, iOriginalFrontOffset );
|
|
969 |
iRearOffset = Max(iRearOffset, iOriginalRearOffset );
|
|
970 |
}
|
|
971 |
}
|
|
972 |
|
|
973 |
// Check if out of bounds
|
|
974 |
if (iFrontOffset + iRearOffset < iCurrentItem || count <= iCurrentItem)
|
|
975 |
{
|
|
976 |
return KErrNotFound;
|
|
977 |
}
|
|
978 |
|
|
979 |
// The ranges may be inequal, which means there won't be any jumping between
|
|
980 |
// front and rear.
|
|
981 |
|
|
982 |
// |-------F----------------------|
|
|
983 |
// |< jumping zone>|
|
|
984 |
|
|
985 |
TInt visIndex = iList->VisibleWindowIndex();
|
|
986 |
TInt index = visIndex;
|
|
987 |
TInt listCount = iList->Count();
|
|
988 |
__ASSERT_DEBUG( index >= 0 && index <= listCount, Panic( EGlxPanicIllegalState ) );
|
|
989 |
if (index < 0 || index >= listCount)
|
|
990 |
{
|
|
991 |
// Invalid index, out of bounds
|
|
992 |
return KErrNotFound;
|
|
993 |
}
|
|
994 |
|
|
995 |
//Inorder to ensure that the start of refresh of thumbnails is contained in
|
|
996 |
//in the current visible window. We set the startIndex to center element of
|
|
997 |
//the current visible window.
|
|
998 |
TInt startIndex = index + iDefaultVisItems/2;
|
|
999 |
if (listCount < iDefaultVisItems)
|
|
1000 |
{
|
|
1001 |
startIndex = listCount/2;
|
|
1002 |
}
|
|
1003 |
|
|
1004 |
index = ( (startIndex) <= (listCount)) ? startIndex : listCount;
|
|
1005 |
|
|
1006 |
TInt min = Min(iFrontOffset, iRearOffset);
|
|
1007 |
TInt jumpingZoneLength = min * 2;
|
|
1008 |
if (iCurrentItem <= jumpingZoneLength)
|
|
1009 |
{
|
|
1010 |
// Still within the (rear-front-rear-front) jumping zone
|
|
1011 |
TInt distanceFromFocus = (iCurrentItem + 1) / 2;
|
|
1012 |
TBool rear = !(iCurrentItem & 1); // Rear if number is even
|
|
1013 |
// Check if out of bounds
|
|
1014 |
if (rear)
|
|
1015 |
{
|
|
1016 |
if (index - distanceFromFocus <= visIndex - iRearOffset)
|
|
1017 |
{
|
|
1018 |
return KErrNotFound;
|
|
1019 |
}
|
|
1020 |
index -= distanceFromFocus;
|
|
1021 |
}
|
|
1022 |
else
|
|
1023 |
{
|
|
1024 |
if (index + distanceFromFocus >= visIndex + iFrontOffset)
|
|
1025 |
{
|
|
1026 |
return KErrNotFound;
|
|
1027 |
}
|
|
1028 |
index += distanceFromFocus;
|
|
1029 |
}
|
|
1030 |
}
|
|
1031 |
else
|
|
1032 |
{
|
|
1033 |
__ASSERT_DEBUG(iFrontOffset != iRearOffset, Panic(EGlxPanicLogicError));
|
|
1034 |
|
|
1035 |
// index is currently visible index. Figure out how much need to move.
|
|
1036 |
TInt indexesFromFocus = iCurrentItem - min;
|
|
1037 |
if (iRearOffset < iFrontOffset)
|
|
1038 |
{
|
|
1039 |
// Front range is longer than rear, so the item is on the front side
|
|
1040 |
index += indexesFromFocus;
|
|
1041 |
}
|
|
1042 |
else
|
|
1043 |
{
|
|
1044 |
// Rear range is longer than front, so the item is on the rear side
|
|
1045 |
index -= indexesFromFocus;
|
|
1046 |
}
|
|
1047 |
}
|
|
1048 |
|
|
1049 |
iCurrentItem++;
|
|
1050 |
|
|
1051 |
// The index may be below 0 or above count. Normalise back to list indexes.
|
|
1052 |
return GlxListUtils::NormalizedIndex(index, count);
|
|
1053 |
}
|
|
1054 |
|
|
1055 |
// -----------------------------------------------------------------------------
|
|
1056 |
// Return ETrue if index is within range, EFalse otherwise
|
|
1057 |
// -----------------------------------------------------------------------------
|
|
1058 |
//
|
|
1059 |
TBool TGlxFromManualIndexBlockyIterator::InRange(TInt aIndex) const
|
|
1060 |
{
|
|
1061 |
TRACER("TGlxFromManualIndexBlockyIterator::InRange");
|
|
1062 |
TInt count = iList->Count();
|
|
1063 |
|
|
1064 |
// Handle the case where range is longer than count separately, because looping will
|
|
1065 |
// confuse otherwise
|
|
1066 |
if (count <= iRearOffset + iFrontOffset)
|
|
1067 |
{
|
|
1068 |
// Range is longer than count, must be in range
|
|
1069 |
return ETrue;
|
|
1070 |
}
|
|
1071 |
|
|
1072 |
TInt index = iList->VisibleWindowIndex();
|
|
1073 |
__ASSERT_DEBUG( index >= 0 && index < count, Panic( EGlxPanicIllegalState ) );
|
|
1074 |
if (index < 0 || index >= count)
|
|
1075 |
{
|
|
1076 |
// Invalid index, must be out of range
|
|
1077 |
return EFalse;
|
|
1078 |
}
|
|
1079 |
|
|
1080 |
TInt firstInRange = GlxListUtils::NormalizedIndex(index - iRearOffset, count);
|
|
1081 |
TInt lastInRange = GlxListUtils::NormalizedIndex(index + iFrontOffset, count);
|
|
1082 |
|
|
1083 |
if (firstInRange <= lastInRange)
|
|
1084 |
{
|
|
1085 |
// Normal case: | F-------L |
|
|
1086 |
return aIndex >= firstInRange && aIndex <= lastInRange;
|
|
1087 |
}
|
|
1088 |
else
|
|
1089 |
{
|
|
1090 |
// Looping case: |----L F----|
|
|
1091 |
return aIndex <= lastInRange || aIndex >= firstInRange;
|
|
1092 |
}
|
|
1093 |
}
|