Class TBtreeFixBase

TBtreeFixBase

Support

Supported from 5.0

Description

Base class for TBtreeFix, which provides a B-tree for fixed sized entries.

Derivation

TBtree Provides ordering of entries by key value in a B+-tree (balanced tree) structure TBtreeFixBase Base class for TBtreeFix, which provides a B-tree for fixed sized entries

Defined in TBtreeFixBase:
Connect(), ExtractAtL(), InsertL()

Inherited from TBtree:
ClearL(), DeleteAtL(), DeleteL(), EEqualTo, EGreaterEqual, EGreaterThan, ELessEqual, ELessThan, FindL(), FirstL(), IsBroken(), IsDirty(), IsEmpty(), IsIntact(), LastL(), MarkBroken(), MarkCurrent(), MarkDirty(), NextL(), PreviousL(), RepairL(), ResetL(), Set(), TFind, Token()

void Connect(MPagePool* aPool,const MBtreeKey* aKey);

Description

Initalises the B-tree with a page pool and key handler.

Parameters

MPagePool* aPool Page pool to provide storage for the B-tree const MBtreeKey* aKey Key handler for the B-tree

void ExtractAtL(const TBtreePos& aPos,TAny* anEntry) const;

Description

Gets the entry at the specified position.

Parameters

const TBtreePos& aPos Position of the entry to get TAny* anEntry Buffer into which to copy the entry.

void ExtractAtL(const TBtreeMark& aMark,TAny* anEntry) const;

Description

Gets the entry at the specified iterator position.

Parameters

const TBtreeMark& aMark Position of the entry to get TAny* anEntry Buffer into which to copy the entry.

TBool InsertL(TBtreePos& aPos,const TAny* anEntry,TAllowDuplicates aDup=ENoDuplicates);

Description

Inserts an entry into the tree.

Parameters

TBtreePos& aPos On return, the position of the entry inserted const TAny* anEntry Pointer to the entry to insert TAllowDuplicates aDup=ENoDuplicates 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