1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/persistentdata/persistentstorage/store/UBTREE/UB_KEY.CPP Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,225 @@
1.4 +// Copyright (c) 2003-2009 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 "UB_STD.H"
1.20 +
1.21 +typedef union
1.22 + {
1.23 + const TAny* tany;
1.24 + const TInt8* tint8;
1.25 + const TInt16* tint16;
1.26 + const TInt32* tint32;
1.27 + const TInt64* tint64;
1.28 + const TUint8* tuint8;
1.29 + const TUint16* tuint16;
1.30 + const TUint32* tuint32;
1.31 + } UPTR;
1.32 +
1.33 +EXPORT_C const TAny* MBtreeKey::Key(const TAny* anEntry) const
1.34 +/** Gets the key value for an entry.
1.35 +
1.36 +@param anEntry Object for which to get the key value
1.37 +@return Pointer to the key value */
1.38 + {
1.39 + return anEntry;
1.40 + }
1.41 +
1.42 +EXPORT_C TBtreeKey::TBtreeKey(TInt aLength)
1.43 +//
1.44 +// Discriminating key. Does a raw memory comparison on given length
1.45 +//
1.46 + : iKeyOffset(0),iCmpType(ECmpNormal8),iKeyLength(aLength)
1.47 + {}
1.48 +
1.49 +EXPORT_C TBtreeKey::TBtreeKey()
1.50 +//
1.51 +// Discriminating key. Does a raw memory comparison on variable length (byte counted)
1.52 +//
1.53 + : iKeyOffset(0),iCmpType(ECmpCollated16+1+ECmpNormal8)
1.54 + {}
1.55 +
1.56 +EXPORT_C TBtreeKey::TBtreeKey(TInt anOffset,TKeyCmpText aType)
1.57 +//
1.58 +// Used to specify a variable length text key, the first character is a count of the actual character data that follows
1.59 +//
1.60 + : iKeyOffset(anOffset),iCmpType(ECmpCollated16+aType+1)
1.61 + {
1.62 + switch (aType)
1.63 + {
1.64 + case ECmpNormal:
1.65 + case ECmpFolded:
1.66 + case ECmpCollated:
1.67 + Panic(EInvalidKeyComparison);
1.68 + default:
1.69 + break;
1.70 + }
1.71 + }
1.72 +
1.73 +EXPORT_C TBtreeKey::TBtreeKey(TInt anOffset,TKeyCmpText aType,TInt aLength)
1.74 +//
1.75 +// Used for fixed length charecter data. the length is the character count, not the byte size
1.76 +//
1.77 + : iKeyOffset(anOffset),iCmpType(aType),iKeyLength(aLength)
1.78 + {
1.79 + switch (aType)
1.80 + {
1.81 + case ECmpNormal:
1.82 + case ECmpFolded:
1.83 + case ECmpCollated:
1.84 + Panic(EInvalidKeyComparison);
1.85 + default:
1.86 + break;
1.87 + }
1.88 + }
1.89 +
1.90 +EXPORT_C TBtreeKey::TBtreeKey(TInt anOffset,TKeyCmpNumeric aType)
1.91 + : iKeyOffset(anOffset),iCmpType(aType)
1.92 + {
1.93 + switch (aType)
1.94 + {
1.95 + case ECmpTInt:
1.96 + case ECmpTUint:
1.97 + Panic(EInvalidKeyComparison);
1.98 + default:
1.99 + break;
1.100 + }
1.101 + }
1.102 +
1.103 +EXPORT_C const TAny* TBtreeKey::Key(const TAny* anEntry) const
1.104 + {
1.105 + return PtrAdd(anEntry,iKeyOffset);
1.106 + }
1.107 +
1.108 +EXPORT_C TInt TBtreeKey::Compare(const TAny* aLeft,const TAny* aRight) const
1.109 +//
1.110 +// do the right thing
1.111 +//
1.112 + {
1.113 + UPTR left;
1.114 + left.tany=aLeft;
1.115 + UPTR right;
1.116 + right.tany=aRight;
1.117 + switch (iCmpType)
1.118 + {
1.119 + case ECmpNormal8:
1.120 + return Mem::Compare(left.tuint8,iKeyLength,right.tuint8,iKeyLength);
1.121 + case ECmpFolded8:
1.122 + return Mem::CompareF(left.tuint8,iKeyLength,right.tuint8,iKeyLength);
1.123 + case ECmpCollated8:
1.124 + return Mem::CompareC(left.tuint8,iKeyLength,right.tuint8,iKeyLength);
1.125 + case ECmpNormal16:
1.126 + return Mem::Compare(left.tuint16,iKeyLength,right.tuint16,iKeyLength);
1.127 + case ECmpFolded16:
1.128 + return Mem::CompareF(left.tuint16,iKeyLength,right.tuint16,iKeyLength);
1.129 + case ECmpCollated16:
1.130 + return Mem::CompareC(left.tuint16,iKeyLength,right.tuint16,iKeyLength);
1.131 + case ECmpCollated16+ECmpNormal8+1:
1.132 + return Mem::Compare(left.tuint8+1,*left.tuint8,right.tuint8+1,*right.tuint8);
1.133 + case ECmpCollated16+ECmpFolded8+1:
1.134 + return Mem::CompareF(left.tuint8+1,*left.tuint8,right.tuint8+1,*right.tuint8);
1.135 + case ECmpCollated16+ECmpCollated8+1:
1.136 + return Mem::CompareC(left.tuint8+1,*left.tuint8,right.tuint8+1,*right.tuint8);
1.137 + case ECmpCollated16+ECmpNormal16+1:
1.138 + return Mem::Compare(left.tuint16+1,*left.tuint16,right.tuint16+1,*right.tuint16);
1.139 + case ECmpCollated16+ECmpFolded16+1:
1.140 + return Mem::CompareF(left.tuint16+1,*left.tuint16,right.tuint16+1,*right.tuint16);
1.141 + case ECmpCollated16+ECmpCollated16+1:
1.142 + return Mem::CompareC(left.tuint16+1,*left.tuint16,right.tuint16+1,*right.tuint16);
1.143 + case ECmpTInt8:
1.144 + return *left.tint8-*right.tint8;
1.145 + case ECmpTUint8:
1.146 + return TInt(*left.tuint8)-TInt(*right.tuint8);
1.147 + case ECmpTInt16:
1.148 + return *left.tint16-*right.tint16;
1.149 + case ECmpTUint16:
1.150 + return TInt(*left.tuint16)-TInt(*right.tuint16);
1.151 + case ECmpTInt32:
1.152 + if (*left.tint32<*right.tint32)
1.153 + return -1;
1.154 + if (*left.tint32>*right.tint32)
1.155 + return 1;
1.156 + break;
1.157 + case ECmpTUint32:
1.158 + if (*left.tuint32<*right.tuint32)
1.159 + return -1;
1.160 + if (*left.tuint32>*right.tuint32)
1.161 + return 1;
1.162 + break;
1.163 + case ECmpTInt64:
1.164 + if (*left.tint64<*right.tint64)
1.165 + return -1;
1.166 + if (*left.tint64>*right.tint64)
1.167 + return 1;
1.168 + break;
1.169 + default:
1.170 + break;
1.171 + }
1.172 + return 0;
1.173 + }
1.174 +
1.175 +EXPORT_C void TBtreeKey::Between(const TAny* aLeft,const TAny* /*aRight*/,TBtreePivot& aPivot) const
1.176 + {
1.177 +//#pragma message( __FILE__ " : 'TBtreeKey::Between()' whizzy pivot generation not implemented" )
1.178 + UPTR left;
1.179 + left.tany=aLeft;
1.180 +// UPTR right=(UPTR)aRight;
1.181 + switch (iCmpType)
1.182 + {
1.183 + case ECmpNormal8:
1.184 + case ECmpFolded8:
1.185 + case ECmpCollated8:
1.186 + aPivot.Copy(left.tuint8,iKeyLength);
1.187 + break;
1.188 + case ECmpNormal16:
1.189 + case ECmpFolded16:
1.190 + case ECmpCollated16:
1.191 + aPivot.Copy(left.tuint8,iKeyLength<<1);
1.192 + break;
1.193 + case ECmpCollated16+ECmpNormal8+1:
1.194 + case ECmpCollated16+ECmpFolded8+1:
1.195 + case ECmpCollated16+ECmpCollated8+1:
1.196 + aPivot.Copy(left.tuint8,1+*left.tuint8); // include length count
1.197 + break;
1.198 + case ECmpCollated16+ECmpNormal16+1:
1.199 + case ECmpCollated16+ECmpFolded16+1:
1.200 + case ECmpCollated16+ECmpCollated16+1:
1.201 + aPivot.Copy(left.tuint8,(1+*left.tuint16)<<1); // include length count
1.202 + break;
1.203 + case ECmpTInt8:
1.204 + aPivot.Copy(left.tuint8,sizeof(TInt8));
1.205 + break;
1.206 + case ECmpTUint8:
1.207 + aPivot.Copy(left.tuint8,sizeof(TUint8));
1.208 + break;
1.209 + case ECmpTInt16:
1.210 + aPivot.Copy(left.tuint8,sizeof(TInt16));
1.211 + break;
1.212 + case ECmpTUint16:
1.213 + aPivot.Copy(left.tuint8,sizeof(TUint16));
1.214 + break;
1.215 + case ECmpTInt32:
1.216 + aPivot.Copy(left.tuint8,sizeof(TInt16));
1.217 + break;
1.218 + case ECmpTUint32:
1.219 + aPivot.Copy(left.tuint8,sizeof(TUint32));
1.220 + break;
1.221 + case ECmpTInt64:
1.222 + aPivot.Copy(left.tuint8,sizeof(TInt64));
1.223 + break;
1.224 + default:
1.225 + break;
1.226 + }
1.227 + }
1.228 +