#include <S32BTREE.H>
Link against:
estor.lib
class TBtreeKey : public MBtreeKey;
Description
Derivation
MBtreeKey
-
Interface for ordering and creating keys for entries in a B-tree.
TBtreeKey
- (No abstract)
Members
Defined in TBtreeKey
:
Construction and destruction
IMPORT_C TBtreeKey();
Description
IMPORT_C TBtreeKey(TInt aLength);
Description
Parameters
TBtreeKey(TInt,TKeyCmpText)
IMPORT_C TBtreeKey(TInt anOffset, TKeyCmpText aType);
Description
Parameters
TBtreeKey(TInt,TKeyCmpText,TInt)
IMPORT_C TBtreeKey(TInt anOffset, TKeyCmpText aType, TInt aLength);
Description
Parameters
TBtreeKey(TInt,TKeyCmpNumeric)
IMPORT_C TBtreeKey(TInt anOffset, TKeyCmpNumeric aType);
Description
Parameters
IMPORT_C virtual const TAny* Key(const TAny *anEntry) const;
Description
Gets the key value for an entry.
Parameters
const TAny *anEntry |
Object for which to get the key value
|
|
Return value
const TAny * |
Pointer to the key value
|
|
Compare(const TAny *,const TAny *)const
IMPORT_C virtual TInt Compare(const TAny *aLeft, const TAny *aRight) const;
Description
Orders two keys.
Parameters
const TAny *aLeft |
Pointer to first key
|
const TAny *aRight |
Pointer to second key
|
|
Return value
TInt
|
Positive, if the first key is after the second key; negative, if the first key is before the second key; zero, if the keys
are equal
|
|
Between(const TAny *,const TAny *,TBtreePivot &)const
IMPORT_C virtual void Between(const TAny *aLeft, const TAny *aRight, TBtreePivot &aPivot) const;
Description
Gets the midpoint between two keys.
The generated midpoint will be greater or equal to aLeft (by a comparison performed by the TBtreeKey::Compare(const TAny *,const TAny *)const
function), and less than aRight.
Parameters
const TAny *aLeft |
First key
|
const TAny *aRight |
Second key
|
TBuf8 &aPivot |
On return, the midpoint between the two keys
|
|
protected: TInt iKeyOffset;
Description
protected: TInt iCmpType;
Description
protected: TInt iKeyLength;
Description