1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/persistentdata/persistentstorage/store/UCONT/UC_SET.CPP Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,179 @@
1.4 +// Copyright (c) 1998-2010 Nokia Corporation and/or its subsidiary(-ies).
1.5 +// All rights reserved.
1.6 +// This component and the accompanying materials are made available
1.7 +// under the terms of "Eclipse Public License v1.0"
1.8 +// which accompanies this distribution, and is available
1.9 +// at the URL "http://www.eclipse.org/legal/epl-v10.html".
1.10 +//
1.11 +// Initial Contributors:
1.12 +// Nokia Corporation - initial contribution.
1.13 +//
1.14 +// Contributors:
1.15 +//
1.16 +// Description:
1.17 +//
1.18 +
1.19 +#include "UC_STD.H"
1.20 +
1.21 +EXPORT_C void TPagedSetToken::ExternalizeL(RWriteStream &aStream) const
1.22 + {
1.23 + __ASSERT_DEBUG(iCount>=0,User::Invariant());
1.24 + TBtreeToken::ExternalizeL(aStream);
1.25 + aStream.WriteInt32L(iCount);
1.26 + }
1.27 +
1.28 +EXPORT_C void TPagedSetToken::InternalizeL(RReadStream &aStream)
1.29 + {
1.30 + TBtreeToken::InternalizeL(aStream);
1.31 + iCount=aStream.ReadInt32L();
1.32 + if (iCount<0)
1.33 + __LEAVE(KErrCorrupt);
1.34 + }
1.35 +
1.36 +EXPORT_C void TPagedSetToken::Clear()
1.37 + {
1.38 + TBtreeToken::Clear();
1.39 + iCount=0;
1.40 + }
1.41 +
1.42 +EXPORT_C TPagedSetBase::TPagedSetBase(TInt anEntrySize)
1.43 +//
1.44 +// Constructor creating a new set.
1.45 +//
1.46 + : iTree(EBtreeSecure,anEntrySize,anEntrySize),iKey(anEntrySize),iCount(0)
1.47 + {}
1.48 +
1.49 +EXPORT_C TPagedSetBase::TPagedSetBase(const TPagedSetToken &aToken,TInt anEntrySize)
1.50 +//
1.51 +// Constructor reinstating an existing set.
1.52 +//
1.53 + : iTree(aToken,EBtreeSecure,anEntrySize,anEntrySize),iKey(anEntrySize),iCount(aToken.iCount)
1.54 + {}
1.55 +
1.56 +EXPORT_C void TPagedSetBase::Connect(MPagePool *aPool)
1.57 +//
1.58 +// Hook the tree up to its bits.
1.59 +//
1.60 + {
1.61 + iTree.Connect(aPool,&iKey);
1.62 + }
1.63 +
1.64 +EXPORT_C void TPagedSetBase::Set(const TPagedSetToken &aToken)
1.65 +//
1.66 +// Set to the state described by aToken.
1.67 +//
1.68 + {
1.69 + iTree.Set(aToken,EBtreeSecure);
1.70 + iCount=aToken.iCount;
1.71 + }
1.72 +
1.73 +EXPORT_C TPagedSetToken TPagedSetBase::Token() const
1.74 +//
1.75 +// Build the streaming token for the set.
1.76 +//
1.77 + {
1.78 + return TPagedSetToken(iTree.Token(),iCount);
1.79 + }
1.80 +
1.81 +EXPORT_C TInt TPagedSetBase::RepairL()
1.82 +//
1.83 +// Repair a broken set.
1.84 +//
1.85 + {
1.86 + TInt count=iTree.RepairL();
1.87 + iCount=count;
1.88 + return count;
1.89 + }
1.90 +
1.91 +EXPORT_C void TPagedSetBase::ClearL()
1.92 +//
1.93 +// Empty the set.
1.94 +//
1.95 + {
1.96 + iTree.ClearL();
1.97 + iCount=0;
1.98 + }
1.99 +
1.100 +EXPORT_C TBool TPagedSetBase::ContainsL(const TAny *aPtr) const
1.101 +//
1.102 +// Return whether the set contains an entry equal to the one pointed to by aPtr.
1.103 +//
1.104 + {
1.105 + TBtreePos pos;
1.106 + return iTree.FindL(pos,aPtr);
1.107 + }
1.108 +
1.109 +EXPORT_C void TPagedSetBase::InsertL(const TAny *aPtr)
1.110 +//
1.111 +// Insert an entry into the set.
1.112 +//
1.113 + {
1.114 + TBtreePos pos;
1.115 + if (!iTree.InsertL(pos,aPtr))
1.116 + __LEAVE(KErrAlreadyExists); // a duplicate
1.117 +//
1.118 + ++iCount;
1.119 + }
1.120 +
1.121 +EXPORT_C void TPagedSetBase::DeleteL(const TAny *aPtr)
1.122 +//
1.123 +// Delete an entry from the set.
1.124 +//
1.125 + {
1.126 + if (!iTree.DeleteL(aPtr))
1.127 + __LEAVE(KErrNotFound);
1.128 +//
1.129 + --iCount;
1.130 + }
1.131 +
1.132 +EXPORT_C void TPagedSetBase::InsertAllowDuplicatesL(const TAny *aPtr)
1.133 +//
1.134 +// Insert an entry into the set, allow duplicates.
1.135 +//
1.136 + {
1.137 + TBtreePos pos;
1.138 + __DEBUG(TBool success=)iTree.InsertL(pos,aPtr,EAllowDuplicates);
1.139 + __ASSERT_DEBUG(success,User::Invariant());
1.140 + ++iCount;
1.141 + }
1.142 +
1.143 +EXPORT_C TBool TPagedSetIterBase::ResetL()
1.144 + {
1.145 + return iTree->ResetL(iMark);
1.146 + }
1.147 +
1.148 +EXPORT_C TBool TPagedSetIterBase::NextL()
1.149 + {
1.150 + return iTree->NextL(iMark);
1.151 + }
1.152 +
1.153 +EXPORT_C void TPagedSetIterBase::ExtractAtL(TAny* aPtr) const
1.154 + {
1.155 + iTree->ExtractAtL(iMark,aPtr);
1.156 + }
1.157 +
1.158 +EXPORT_C TBool TPagedSetBiIterBase::FirstL()
1.159 + {
1.160 + return iTree->FirstL(iPos);
1.161 + }
1.162 +
1.163 +EXPORT_C TBool TPagedSetBiIterBase::LastL()
1.164 + {
1.165 + return iTree->LastL(iPos);
1.166 + }
1.167 +
1.168 +EXPORT_C TBool TPagedSetBiIterBase::NextL()
1.169 + {
1.170 + return iTree->NextL(iPos);
1.171 + }
1.172 +
1.173 +EXPORT_C TBool TPagedSetBiIterBase::PreviousL()
1.174 + {
1.175 + return iTree->PreviousL(iPos);
1.176 + }
1.177 +
1.178 +EXPORT_C void TPagedSetBiIterBase::ExtractAtL(TAny* aPtr) const
1.179 + {
1.180 + iTree->ExtractAtL(iPos,aPtr);
1.181 + }
1.182 +