#include <s32btree.h>
| class TBtreeKey : public MBtreeKey |
| Protected Attributes | |
|---|---|
| TInt | iCmpType |
| TInt | iKeyLength |
| TInt | iKeyOffset |
| Public Member Functions | |
|---|---|
| TBtreeKey() | |
| TBtreeKey(TInt) | |
| TBtreeKey(TInt, TKeyCmpText) | |
| TBtreeKey(TInt, TKeyCmpText, TInt) | |
| TBtreeKey(TInt, TKeyCmpNumeric) | |
| virtual IMPORT_C void | Between(const TAny *, const TAny *, TBtreePivot &) |
| virtual IMPORT_C TInt | Compare(const TAny *, const TAny *) |
| virtual IMPORT_C const TAny * | Key(const TAny *) |
| IMPORT_C | TBtreeKey | ( | TInt | anOffset, |
| TKeyCmpText | aType, | |||
| TInt | aLength | |||
| ) | ||||
| IMPORT_C void | Between | ( | const TAny * | aLeft, |
| const TAny * | aRight, | |||
| TBtreePivot & | aPivot | |||
| ) | const [virtual] | |||
Reimplemented from MBtreeKey::Between(const TAny *,const TAny *,TBtreePivot &)const
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.
| Parameter | Description |
|---|---|
| aLeft | First key |
| aRight | Second key |
| aPivot | On return, the midpoint between the two keys |
Reimplemented from MBtreeKey::Compare(const TAny *,const TAny *)const
Orders two keys.
| Parameter | Description |
|---|---|
| aLeft | Pointer to first key |
| aRight | Pointer to second key |
Returns: 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
Reimplemented from MBtreeKey::Key(const TAny *)const
Gets the key value for an entry.
| Parameter | Description |
|---|---|
| anEntry | Object for which to get the key value |
Returns: Pointer to the key value