/*

* Copyright (c) 2007 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:  Holds the contact information in memory. It maintains a 

*                master array of all contacts. It also has 10 pools corresponding

*                to each key id in the keyboard. Based on numeric key char of 

*                first char of firstname/ lastname a contact is added to one of the

*                pools. Implements MDataStoreObserver interface functions to

*                add/ remove contacts.

*

*/

// INCLUDE FILES

#include <MVPbkContactLink.h>

#include "CPsData.h"

#include "CPcsCache.h"

#include "CPcsDebug.h"

#include "CWords.h"

#include "CPcsAlgorithm1Utils.h"

// ============================== MEMBER FUNCTIONS ============================

// ----------------------------------------------------------------------------

// CPcsCache::NewL

// Two Phase Construction

// ----------------------------------------------------------------------------

{

    PRINT ( _L("Enter CPcsCache::NewL") );

	CPcsCache* instance= new ( ELeave ) CPcsCache();

	CleanupStack::PushL( instance );

	instance->ConstructL(aURI, aKeyMap, aUriId);

	CleanupStack::Pop( instance );

    PRINT ( _L("End CPcsCache::NewL") );

	return instance;    

} 

// ----------------------------------------------------------------------------

// CPcsCache::CPcsCache

// Constructor

// ----------------------------------------------------------------------------

CPcsCache::CPcsCache()

{

    PRINT ( _L("Enter CPcsCache::CPcsCache") );

    PRINT ( _L("End CPcsCache::CPcsCache") );

}

// ----------------------------------------------------------------------------

// CPcsCache::ConstructL

// 2nd Phase Constructor

// ----------------------------------------------------------------------------

{

    PRINT ( _L("Enter CPcsCache::ConstructL") );

    iURI = aURI.AllocL();

    iUriId = aUriId;

    //Update the caching status for this cache

    iCacheStatus = ECachingNotStarted;

    for(TInt i= 0; i <aKeyMap.PoolCount();i++ )

        {

        RPointerArray<CPcsPoolElement> *keyMap = new (ELeave) RPointerArray<CPcsPoolElement>(1);

        }

    PRINT ( _L("End CPcsCache::ConstructL") );

}

// ----------------------------------------------------------------------------

// CPcsCache::~CPcsCache

// Destructor

// ----------------------------------------------------------------------------

CPcsCache::~CPcsCache()

{

    PRINT ( _L("Enter CPcsCache::~CPcsCache") );

    iDataFields.Reset();

    iSortOrder.Reset();

    iIndexOrder.Reset();

}

// ----------------------------------------------------------------------------

// CPcsCache::GetContactsForKeyL

// Get list of pool elements specific to a pool

// ----------------------------------------------------------------------------     

void CPcsCache::GetContactsForKeyL(TInt aKeyId, RPointerArray<CPcsPoolElement>& aData)

{

    PRINT ( _L("Enter CPcsCache::GetContactsForKeyL") );

	{

		CPcsPoolElement* value = arr[i];

        aData.AppendL(value);

	}

	PRINT ( _L("End CPcsCache::GetContactsForKeyL") );

}  

// ----------------------------------------------------------------------------

// CPcsCache::GetAllContentsL

// Get all data elements in this cache

// ----------------------------------------------------------------------------     

void CPcsCache::GetAllContentsL(RPointerArray<CPsData>& aData)

{

    PRINT ( _L("Enter CPcsCache::GetAllContentsL") );

	{

        aData.AppendL(value);

	}

	PRINT ( _L("End CPcsCache::GetAllContentsL") );

}  

// ----------------------------------------------------------------------------

// CPcsCache::AddToPool

// Adds a contact to cache

// ----------------------------------------------------------------------------

{	

     // Temp hash to remember the location of pool elements

     // First TInt  = Pool 

     // Second TInt = Location in the pool

     // Required for memory optimization so that more than one pool

     // element doesn't get added for the same data

     TLinearOrder<CPcsPoolElement> rule( CPcsPoolElement::CompareByData );

     {     	

		// Recover the first character

		if ( aData.Data(dataIndex) && aData.Data(dataIndex)->Length() != 0 )

		{

		    CWords* words = CWords::NewLC(*aData.Data(dataIndex));

		    // Store the first numeric key for each word

		    {

		    	TChar firstChar = (words->MdcaPoint(i))[0];

		    }

		    CleanupStack::PopAndDestroy(words); 

		}

		    CPcsPoolElement* element = NULL;

		    // Check if an element already exists in the pool for this data

		    TInt* loc = NULL;

		    if ( loc != NULL )

		    {

		        // Exists. Then recover ...

		    	element = tmpKeyMap[*loc];

		    }

			if ( element == NULL ) // Pool element doesn't exist. Create new ...

			{

		        element = CPcsPoolElement::NewL(aData);

		    	element->ClearDataMatchAttribute();

				element->SetDataMatch(dataIndex);

				// Insert to pool

				// Store the array index in the temp hash

	        else // Pool element exists. Just alter the data match attribute

	        {

	        	element->SetDataMatch(dataIndex);

	        }

		} // for 2 loop

     } // for 1 loop

}

// ---------------------------------------------------------------------

// CPcsCache::AddToCacheL

// 

// ---------------------------------------------------------------------

void CPcsCache::AddToCacheL( CPsData& aData )

{

    // Protect against duplicate items getting added

    {

    TLinearOrder<CPsData> rule( CPcsAlgorithm1Utils::CompareDataBySortOrderL );

}

// ---------------------------------------------------------------------

// CPcsCache::RemoveContactL

// 

// ---------------------------------------------------------------------

void CPcsCache::RemoveFromCacheL( TInt aItemId )

{

    CPsData *data = NULL;

    {

    	return;

    }

    // Remove this element from pools

    {

        TBool present = GetPoolMap(*poolMap, keyIndex); 

        if ( ! present )

        {

        	continue;

        }

              arrayIndex < tmpKeyMap.Count();

              arrayIndex++ )

        {

		    CPcsPoolElement *element = tmpKeyMap[arrayIndex];

		    TInt id = element->GetPsData()->Id();

		    if ( id == aItemId )

		    {

		        data = element->GetPsData();

		    	delete element;

		    }  

        }      	

    };   

    // Remove this element from master pool

              arrayIndex++ )

    {

	    TInt id = dataElement->Id();

	    if ( id == aItemId )

	    {

	    }  

    }      	

    // Delete data 

    if ( data )

    {

    	delete data;

    	data = NULL;

    }

    // Clear up cache information

}

// ---------------------------------------------------------------------

// 

// ---------------------------------------------------------------------

{

}

// ---------------------------------------------------------------------

// CPcsCache::SetPoolMap

// 

// ---------------------------------------------------------------------

{

}

// ---------------------------------------------------------------------

// CPcsCache::GetPoolMap

// 

// ---------------------------------------------------------------------

{

}

// ---------------------------------------------------------------------

// CPcsCache::GetURI

// 

// ---------------------------------------------------------------------

TDesC& CPcsCache::GetURI()

{

	return (*iURI);

}

// ---------------------------------------------------------------------

// CPcsCache::SetDataFields

// 

// ---------------------------------------------------------------------

void CPcsCache::SetDataFields(RArray<TInt>& aDataFields)

{

	for (TInt i(0); i < aDataFields.Count(); i++)

	{

		iDataFields.Append(aDataFields[i]);

	}

}

// ---------------------------------------------------------------------

// CPcsCache::GetDataFields

// 

// ---------------------------------------------------------------------

void CPcsCache::GetDataFields(RArray<TInt>& aDataFields)

{

	for (TInt i(0); i < iDataFields.Count(); i++)

	{

		aDataFields.Append(iDataFields[i]);

	}

}

// ---------------------------------------------------------------------

// CPcsCache::UpdateCacheStatus

// 

// ---------------------------------------------------------------------

void CPcsCache::UpdateCacheStatus(TInt aStatus)

{

	iCacheStatus = aStatus;

}

// ---------------------------------------------------------------------

// CPcsCache::GetCacheStatus

// 

// ---------------------------------------------------------------------

TInt CPcsCache::GetCacheStatus()

{

	return iCacheStatus;

}

// ---------------------------------------------------------------------

// CPcsCache::GetUriId

// 

// ---------------------------------------------------------------------

TUint8 CPcsCache::GetUriId()

{

	return iUriId;

}

// ---------------------------------------------------------------------

// CPcsCache::GetUri

// 

// ---------------------------------------------------------------------

HBufC* CPcsCache::GetUri()

{

	return iURI;

}

// ---------------------------------------------------------------------

// CPcsCache::SetSortOrder

// 

// ---------------------------------------------------------------------

void CPcsCache::SetSortOrder(RArray<TInt>& aSortOrder)

{

    PRINT ( _L("Enter CPcsCache::SetSortOrder") );    

    iSortOrder.Reset();

	for (TInt i(0); i < aSortOrder.Count(); i++)

	{

		iSortOrder.Append(aSortOrder[i]);

	}

	ComputeIndexOrder();

	PRINT ( _L("End CPcsCache::SetSortOrder") );

}

// ---------------------------------------------------------------------

// CPcsCache::GetSortOrder

// 

// ---------------------------------------------------------------------

void CPcsCache::GetSortOrder(RArray<TInt>& aSortOrder)

{

    aSortOrder.Reset();

	for (TInt i(0); i < iSortOrder.Count(); i++)

	{

		aSortOrder.Append(iSortOrder[i]);

	}	

}

// ---------------------------------------------------------------------

// CPcsCache::GetIndexOrder

// 

// ---------------------------------------------------------------------

void CPcsCache::GetIndexOrder(RArray<TInt>& aIndexOrder)

{   

    aIndexOrder.Reset();

	for (TInt i(0); i < iIndexOrder.Count(); i++)

	{

		aIndexOrder.Append(iIndexOrder[i]);

	}	

}

// ---------------------------------------------------------------------

// CPcsCache::ComputeIndexOrder

// 

// ---------------------------------------------------------------------

void CPcsCache::ComputeIndexOrder()

{   

    iIndexOrder.Reset();

	{

		{

			if ( iSortOrder[i] == iDataFields[j] )

			{

				iIndexOrder.Append(j);

				break;

			}

		}