|
|
|
|
Location:
S32BTREE.H
Link against: estor.lib
class TBtreeFixBase : public TBtree;
Base class for TBtreeFix, which provides a B-tree for fixed sized entries.
TBtree - Provides ordering of entries by key value in a B+-tree (balanced tree) structure
TBtreeFixBase - Base class for
Defined in TBtreeFixBase:
Connect(), ExtractAtL(), ExtractAtL(), InsertL(), TBtreeFixBase(), TBtreeFixBase()
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()
protected: IMPORT_C TBtreeFixBase(TBtreeMode aMode, TInt anEntrySize, TInt aKeySize);
|
protected: IMPORT_C TBtreeFixBase(const TBtreeToken &aToken, TBtreeMode aMode, TInt anEntrySize, TInt aKeySize);
|
IMPORT_C void Connect(MPagePool *aPool, const MBtreeKey *aKey);
Initalises the B-tree with a page pool and key handler.
|
IMPORT_C TBool InsertL(TBtreePos &aPos, const TAny *anEntry, TAllowDuplicates aDup=ENoDuplicates);
Inserts an entry into the tree.
|
|
IMPORT_C void ExtractAtL(const TBtreePos &aPos, TAny *anEntry) const;
Gets the entry at the specified position.
|
IMPORT_C void ExtractAtL(const TBtreeMark &aMark, TAny *anEntry) const;
Gets the entry at the specified iterator position.
|