| class MBtreeKey |
Interface for ordering and creating keys for entries in a B-tree.
Derived classes implement this interface for particular types of key.
| Public Member Functions | |
|---|---|
| void | Between (const TAny *, const TAny *, TBtreePivot &) |
| TInt | Compare (const TAny *, const TAny *) |
| IMPORT_C const TAny * | Key (const TAny *) |
| void | Between | ( | const TAny * | aLeft, |
| const TAny * | aRight, | |||
| TBtreePivot & | aPivot | |||
| ) | const [pure virtual] | |||
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.
| const TAny * aLeft | First key |
| const TAny * aRight | Second key |
| TBtreePivot & aPivot | On return, the midpoint between the two keys |
| TInt | Compare | ( | const TAny * | aLeft, |
| const TAny * | aRight | |||
| ) | const [pure virtual] | |||
Orders two keys.
| IMPORT_C const TAny * | Key | ( | const TAny * | anEntry | ) | const [virtual] |
Gets the key value for an entry.
| const TAny * anEntry | Object for which to get the key value |
Copyright ©2010 Nokia Corporation and/or its subsidiary(-ies).
All rights
reserved. Unless otherwise stated, these materials are provided under the terms of the Eclipse Public License
v1.0.