TBtreeFixBase Class Reference

#include <s32btree.h>

Link against: estor.lib

class TBtreeFixBase : public TBtree

Inherits from

Public Member Functions
IMPORT_C voidConnect(MPagePool *, const MBtreeKey *)
IMPORT_C voidExtractAtL(const TBtreePos &, TAny *)
IMPORT_C voidExtractAtL(const TBtreeMark &, TAny *)
IMPORT_C TBoolInsertL(TBtreePos &, const TAny *, TAllowDuplicates)
Protected Member Functions
TBtreeFixBase(TBtreeMode, TInt, TInt)
TBtreeFixBase(const TBtreeToken &, TBtreeMode, TInt, TInt)
Inherited Enumerations
TBtree:TFind
Inherited Functions
TBtree::ClearL()
TBtree::Connect(MPagePool *,const MBtreeKey *,const MBtreeLeafOrg *,const MBtreeIndexOrg *)
TBtree::DeleteAtL(TBtreePos &)
TBtree::DeleteL(const TAny *)
TBtree::ExtractAtL(const TBtreeMark &,TAny *,TInt)const
TBtree::ExtractAtL(const TBtreePos &,TAny *,TInt)const
TBtree::FindL(TBtreePos &,const TAny *,TFind)const
TBtree::FirstL(TBtreePos &)const
TBtree::InsertL(TBtreePos &,const TAny *,TInt,TAllowDuplicates)
TBtree::IsBroken()const
TBtree::IsDirty()const
TBtree::IsEmpty()const
TBtree::IsIntact()const
TBtree::LastL(TBtreePos &)const
TBtree::MarkBroken()
TBtree::MarkCurrent()
TBtree::MarkDirty()
TBtree::NextL(TBtreeMark &)const
TBtree::NextL(TBtreePos &)const
TBtree::PreviousL(TBtreePos &)const
TBtree::RepairL()
TBtree::ResetL(TBtreeMark &)const
TBtree::Set(const TBtreeToken &,TBtreeMode)
TBtree::TBtree(TBtreeMode)
TBtree::TBtree(const TBtreeToken &,TBtreeMode)
TBtree::Token()const

Detailed Description

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

Constructor & Destructor Documentation

TBtreeFixBase ( TBtreeMode, TInt, TInt )

IMPORT_CTBtreeFixBase(TBtreeModeaMode,
TIntanEntrySize,
TIntaKeySize
)[protected]

TBtreeFixBase ( const TBtreeToken &, TBtreeMode, TInt, TInt )

IMPORT_CTBtreeFixBase(const TBtreeToken &aToken,
TBtreeModeaMode,
TIntanEntrySize,
TIntaKeySize
)[protected]

Member Function Documentation

Connect ( MPagePool *, const MBtreeKey * )

IMPORT_C voidConnect(MPagePool *aPool,
const MBtreeKey *aKey
)

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

Parameters
aPoolPage pool to provide storage for the B-tree
aKeyKey handler for the B-tree

ExtractAtL ( const TBtreePos &, TAny * )

IMPORT_C voidExtractAtL(const TBtreePos &aPos,
TAny *anEntry
)const

Gets the entry at the specified position.

Parameters
aPosPosition of the entry to get
anEntryBuffer into which to copy the entry.

ExtractAtL ( const TBtreeMark &, TAny * )

IMPORT_C voidExtractAtL(const TBtreeMark &aMark,
TAny *anEntry
)const

Gets the entry at the specified iterator position.

Parameters
aMarkPosition of the entry to get
anEntryBuffer into which to copy the entry.

InsertL ( TBtreePos &, const TAny *, TAllowDuplicates )

IMPORT_C TBoolInsertL(TBtreePos &aPos,
const TAny *anEntry,
TAllowDuplicatesaDup = ENoDuplicates
)

Inserts an entry into the tree.

Parameters
aPosOn return, the position of the entry inserted
anEntryPointer to the entry to insert
aDupFlag to indicate whether duplicate entries are allowed in the tree
Return Value
True if successful, false if the entry was a duplicate and aDup was set to ENoDuplicates
© Nokia 2005.