Location:
S32BTREE.H
Link against: estor.lib
class MBtreeKey;
Interface for ordering and creating keys for entries in a B-tree.
Derived classes implement this interface for particular types of key.
Defined in MBtreeKey
:
Between()
, Compare()
, Key()
virtual IMPORT_C const TAny *Key(const TAny *anEntry) const;
Gets the key value for an entry.
|
|
virtual TInt Compare(const TAny *aLeft, const TAny *aRight) const=0;
Orders two keys.
|
|
virtual void Between(const TAny *aLeft, const TAny *aRight, TBtreePivot &aPivot) const=0;
Gets the midpoint between two keys.
The generated midpoint will be greater or equal to aLeft (by a comparison performed by the Compare()
function), and less than aRight.
|