--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/homescreenpluginsrv/hspsdom/src/hspsdomstringpooloptimizer.cpp Fri Mar 12 15:43:54 2010 +0200
@@ -0,0 +1,197 @@
+/*
+* Copyright (c) 2005,2006 Nokia Corporation and/or its subsidiary(-ies).
+* All rights reserved.
+* This component and the accompanying materials are made available
+* under the terms of "Eclipse Public License v1.0"
+* which accompanies this distribution, and is available
+* at the URL "http://www.eclipse.org/legal/epl-v10.html".
+*
+* Initial Contributors:
+* Nokia Corporation - initial contribution.
+*
+* Contributors:
+*
+* Description: Optimizer module for ChspsDomStringPool.
+*
+*/
+
+
+
+// INCLUDE FILES
+#include "hspsdomstringpooloptimizer.h"
+
+const TInt KMaxEstimateThreshold = 2;
+
+// ============================ MEMBER FUNCTIONS ===============================
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizerEntry::ThspsDomStringPoolOptimizerEntry
+// -----------------------------------------------------------------------------
+//
+ThspsDomStringPoolOptimizerEntry::ThspsDomStringPoolOptimizerEntry( TInt aIndex,
+ const TDesC8& aString) :
+ iIndex( aIndex ),
+ iString( aString )
+ {
+ }
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizer::AddEntryL
+// -----------------------------------------------------------------------------
+//
+void ThspsDomStringPoolOptimizer::AddEntryL( ThspsDomStringPoolOptimizerEntry& aEntry )
+ {
+ TBool positionFound = EFalse;
+
+ if( iEntries.Count() > 0 )
+ {
+ const TInt estimate = FindInsertionIndexEstimate(
+ aEntry.iString,
+ 0,
+ iEntries.Count() - 1 );
+
+ if( estimate != KErrNotFound )
+ {
+ for( TInt i = estimate; i < iEntries.Count(); i++ )
+ {
+ if( aEntry.iString.Compare( iEntries[i].iString ) < 0 )
+ {
+ positionFound = ETrue;
+ iEntries.InsertL( aEntry, i );
+ break;
+ }
+ }
+ }
+ }
+
+ if( !positionFound )
+ {
+ iEntries.AppendL( aEntry );
+ }
+ }
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizer::ThspsDomStringPoolOptimizerGetIndex
+// -----------------------------------------------------------------------------
+//
+TInt ThspsDomStringPoolOptimizer::GetIndex( const TDesC8& aString )
+ {
+ if( iEntries.Count() == 0 )
+ {
+ return KErrNotFound;
+ }
+
+ TInt index = FindEntry( aString, 0, iEntries.Count() - 1 );
+ if( index >= 0 && index < iEntries.Count() )
+ {
+ return iEntries[index].iIndex;
+ }
+ else
+ {
+ // Error code.
+ return index;
+ }
+ }
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizer::Close
+// -----------------------------------------------------------------------------
+//
+void ThspsDomStringPoolOptimizer::Close()
+ {
+ iEntries.Close();
+ }
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizer::Count
+// -----------------------------------------------------------------------------
+//
+TInt ThspsDomStringPoolOptimizer::Count()
+ {
+ return iEntries.Count();
+ }
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizer::Entry
+// -----------------------------------------------------------------------------
+//
+ThspsDomStringPoolOptimizerEntry& ThspsDomStringPoolOptimizer::Entry(
+ const TInt aIndex )
+ {
+ return iEntries[ aIndex ];
+ }
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizer::Reset
+// -----------------------------------------------------------------------------
+//
+void ThspsDomStringPoolOptimizer::Reset()
+ {
+ iEntries.Reset();
+ }
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizer::FindEntry
+// -----------------------------------------------------------------------------
+//
+TInt ThspsDomStringPoolOptimizer::FindEntry( const TDesC8& aString,
+ const TInt aLeft,
+ const TInt aRight )
+ {
+ if( aLeft > aRight )
+ {
+ return KErrNotFound;
+ }
+
+ const TUint middle = ( aLeft + aRight ) >> 1; // >> 1 means "divided by two".
+ ThspsDomStringPoolOptimizerEntry& entryAtMiddle = iEntries[ middle ];
+ const TInt comparisonResult = aString.Compare( entryAtMiddle.iString );
+
+ if( comparisonResult > 0 )
+ {
+ return FindEntry( aString, middle + 1, aRight);
+ }
+ else if( comparisonResult < 0 )
+ {
+ return FindEntry( aString, aLeft, middle - 1 );
+ }
+ else
+ {
+ return middle;
+ }
+ }
+
+// -----------------------------------------------------------------------------
+// ThspsDomStringPoolOptimizer::FindEntry
+// -----------------------------------------------------------------------------
+//
+TInt ThspsDomStringPoolOptimizer::FindInsertionIndexEstimate( const TDesC8& aString,
+ const TInt aLeft,
+ const TInt aRight )
+ {
+ if( ( aRight - aLeft ) <= KMaxEstimateThreshold )
+ {
+ return aLeft;
+ }
+
+ const TUint middle = ( aLeft + aRight ) >> 1;
+
+ ThspsDomStringPoolOptimizerEntry& entryAtMiddle = iEntries[ middle ];
+ const TInt comparisonResult = aString.Compare( entryAtMiddle.iString );
+
+ if( comparisonResult > 0 )
+ {
+ return FindInsertionIndexEstimate( aString, middle, aRight);
+ }
+ else if( comparisonResult < 0 )
+ {
+ return FindInsertionIndexEstimate( aString, aLeft, middle );
+ }
+ else
+ {
+ // Should not go here. There should be only one of a kind in the list.
+ return KErrNotFound;
+ }
+ }
+
+// End of File