TBtreeFix Class Reference
| class TBtreeFix : public TBtreeFixBase |
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.
| 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 |
| | TBtreeFixBase::Connect(MPagePool *,const MBtreeKey *) |
| | TBtreeFixBase::ExtractAtL(const TBtreeMark &,TAny *)const |
| | TBtreeFixBase::ExtractAtL(const TBtreePos &,TAny *)const |
| | TBtreeFixBase::InsertL(TBtreePos &,const TAny *,TAllowDuplicates) |
| | TBtreeFixBase::TBtreeFixBase(TBtreeMode,TInt,TInt) |
| | TBtreeFixBase::TBtreeFixBase(const TBtreeToken &,TBtreeMode,TInt,TInt) |
Constructor & Destructor Documentation
TBtreeFix(TBtreeMode)
Constructor that sets the B-tree mode.
TBtreeFix(const TBtreeToken &, TBtreeMode)
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 |
Member Functions Documentation
AtL(const TBtreePos &)
| Entry | AtL | ( | const TBtreePos & | aPos | ) | const [inline] |
Gets the entry at the specified position.
Parameters
| const TBtreePos & aPos | Position of the entry to get |
AtL(const TBtreeMark &)
Gets the entry at the specified iterator position.
Parameters
| const TBtreeMark & aMark | Iterator to use to get the entry |
DeleteL(const Key &)
|
TBool
| DeleteL | ( | const Key & | aKey | ) | [inline] |
Parameters
| const Key & aKey | Key of the entry to delete |
ExtractAtL(const TBtreePos &, Entry &)
| void | ExtractAtL | ( | const TBtreePos & | aPos, |
| | Entry & | anEntry |
| | ) | const [inline] |
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 &)
| void | ExtractAtL | ( | const TBtreeMark & | aMark, |
| | Entry & | anEntry |
| | ) | const [inline] |
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 |
FindL(TBtreePos &, const Key &, TFind)
InsertL(TBtreePos &, const Entry &, TAllowDuplicates)
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 = ENoDuplicates | Flag to indicate whether duplicate entries are allowed in the tree |
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.