class TBtreeFix : public TBtreeFixBase;
Description
A B-tree for fixed-sized keys and entries.
Entry is the type of entry to store. Key defines how items should be ordered: there must be a member of this type in the Entry
class.
Derivation
TBtreeFixBase
-
Base class for TBtreeFix, which provides a B-tree for fixed sized entries.
TBtreeFix
-
A B-tree for fixed-sized keys and entries.
Members
Defined in TBtreeFix
:
Inherited from TBtree
:
ClearL()
Resets the B-tree to have zero-height, and a null root, and deletes all index pa...
Connect(MPagePool *,const MBtreeKey *,const MBtreeLeafOrg *,const MBtreeIndexOrg *)
DeleteAtL(TBtreePos &)
Deletes the entry at the specified position
DeleteL(const TAny *)
Deletes an entry.
EEqualTo
Find the first entry equal to the search target.
EGreaterEqual
Find the first entry greater than or equal to the search target.
EGreaterThan
Find the first entry greater than the search target.
ELessEqual
Find the last entry less than or equal to the search target.
ELessThan
Find the last entry less than the search target.
ExtractAtL(const TBtreeMark &,TAny *,TInt)const
Gets an entry at specified iterator position.
ExtractAtL(const TBtreePos &,TAny *,TInt)const
Gets the entry at the specified position.
FindL(TBtreePos &,const TAny *,TFind)const
Searches for an entry and returns its position.
FirstL(TBtreePos &)const
Goes to the first entry in the B-tree.
InsertL(TBtreePos &,const TAny *,TInt,TAllowDuplicates)
Inserts an entry into the tree.
IsBroken()const
Tests if the broken flag has been set on the B-tree.
IsDirty()const
Tests if the dirty flag has been set on the B-tree.
IsEmpty()const
Tests if the B-tree is empty.
IsIntact()const
Tests if the broken flag has not been set on the B-tree .
LastL(TBtreePos &)const
Goes to the last entry in the B-tree.
MarkBroken()
Sets the broken flag.
MarkCurrent()
Clears the dirty flag.
MarkDirty()
Sets the dirty flag.
NextL(TBtreeMark &)const
Advances an iterator to the next entry.
NextL(TBtreePos &)const
Gets the position of the entry following the specified entry.
PreviousL(TBtreePos &)const
Gets the position of the entry preceding the specified entry.
RepairL()
Attempts to repair a broken B-tree.
ResetL(TBtreeMark &)const
Resets an iterator to the root of the tree.
Set(const TBtreeToken &,TBtreeMode)
Initialises the B-tree.
TBtree(TBtreeMode)
Constructor that sets the B-tree mode.
TBtree(const TBtreeToken &,TBtreeMode)
Constructor that sets the B-tree mode and initialisation parameters.
TFind
Sets the condition for a successful match when calling TBtree::Find().
Token()const
Gets an object that encapsulates the TBtree settings.
Inherited from TBtreeFixBase
:
Connect(MPagePool *,const MBtreeKey *)
Initalises the B-tree with a page pool and key handler.
ExtractAtL(const TBtreeMark &,TAny *)const
Gets the entry at the specified iterator position.
ExtractAtL(const TBtreePos &,TAny *)const
Gets the entry at the specified position.
InsertL(TBtreePos &,const TAny *,TAllowDuplicates)
Inserts an entry into the tree.
TBtreeFixBase(TBtreeMode,TInt,TInt)
TBtreeFixBase(const TBtreeToken &,TBtreeMode,TInt,TInt)
Construction and destruction
inline TBtreeFix(TBtreeMode aMode);
Description
Constructor that sets the B-tree mode.
Parameters
TBtreeMode aMode |
B-tree operating mode
|
|
TBtreeFix(const TBtreeToken &,TBtreeMode)
inline TBtreeFix(const TBtreeToken &aToken, TBtreeMode aMode);
Description
Constructor that sets the B-tree mode and initialisation parameters.
Parameters
const TBtreeToken &aToken |
Parameters with which to initialise the B-tree
|
TBtreeMode aMode |
B-tree operating mode
|
|
FindL(TBtreePos &,const Key &,TFind)const
inline TBool FindL(TBtreePos &aPos, const Key &aKey, TFind aMode=EEqualTo) const;
Description
Parameters
Return value
InsertL(TBtreePos &,const Entry &,TAllowDuplicates)
inline TBool InsertL(TBtreePos &aPos, const Entry &anEntry, TAllowDuplicates aDup=ENoDuplicates);
Description
Inserts an entry into the tree.
Parameters
TBtreePos &aPos |
On return, the position of the entry inserted
|
const Entry &anEntry |
Entry to insert
|
TAllowDuplicates aDup |
Flag to indicate whether duplicate entries are allowed in the tree
|
|
Return value
TBool
|
True if successful, false if the entry was a duplicate and aDup was set to ENoDuplicates
|
|
inline TBool DeleteL(const Key &aKey);
Description
Delete an entry.
Parameters
const Key &aKey |
Key of the entry to delete
|
|
Return value
TBool
|
True if successful, false if the entry was not found
|
|
AtL(const TBtreePos &)const
inline Entry AtL(const TBtreePos &aPos) const;
Description
Gets the entry at the specified position.
Parameters
const TBtreePos &aPos |
Position of the entry to get
|
|
Return value
Entry |
Entry at position aPos
|
|
AtL(const TBtreeMark &)const
inline Entry AtL(const TBtreeMark &aMark) const;
Description
Gets the entry at the specified iterator position.
Parameters
const TBtreeMark &aMark |
Iterator to use to get the entry
|
|
Return value
Entry |
Entry at current iterator position
|
|
ExtractAtL(const TBtreePos &,Entry &)const
inline void ExtractAtL(const TBtreePos &aPos, Entry &anEntry) const;
Description
Gets the entry at the specified position.
Parameters
const TBtreePos &aPos |
Position of the entry to get
|
Entry &anEntry |
On return, the specified entry
|
|
ExtractAtL(const TBtreeMark &,Entry &)const
inline void ExtractAtL(const TBtreeMark &aMark, Entry &anEntry) const;
Description
Gets the entry at the specified iterator position.
Parameters
const TBtreeMark &aMark |
Iterator to use to get the entry
|
Entry &anEntry |
On return, the specified entry
|
|