#include <s32btree.h>
Link against: estor.lib
| class TBtreeInlineIndexOrg : public MBtreeIndexOrg |
| Public Member Functions | |
|---|---|
| TBtreeInlineIndexOrg() | |
| virtual IMPORT_C TPageRef | ChildNode(const TAny *, TInt) |
| virtual IMPORT_C void | Concatenate(TAny *, const TAny *, const TDesC8 &) |
| virtual IMPORT_C TBool | Delete(TAny *, TInt) |
| virtual IMPORT_C TPtrC8 | Entry(const TAny *, TInt) |
| virtual IMPORT_C const TAny * | EntryPtr(const TAny *, TInt) |
| virtual IMPORT_C TBool | Insert(TAny *, TInt, const TDesC8 &, TPageRef) |
| virtual IMPORT_C TBool | InsertOverflow(TAny *, TAny *, TInt, TBool, const TDesC8 &, TPageRef, const TDesC8 &, TBtreePivot &) |
| virtual IMPORT_C void | InsertSplit(TAny *, TAny *, TInt, const TDesC8 &, TPageRef, TBtreePivot &) |
| virtual IMPORT_C TInt | LastEntry(const TAny *) |
| virtual IMPORT_C void | MakeRoot(TAny *, TPageRef) |
| virtual IMPORT_C TBool | Redistribute(TAny *, TAny *, const TDesC8 &, TBtreePivot &) |
| IMPORT_C void | SetEntrySize(TInt) |
| virtual IMPORT_C TBool | Update(TAny *, TInt, const TDesC8 &) |
| Inherited Functions | |
|---|---|
| MBtreeIndexOrg::Search(const TAny *,const TAny *,const MBtreeKey &,TBool,TInt &)const | |
| MBtreeNodeOrg::Init(TAny *)const | |
| IMPORT_C | TBtreeInlineIndexOrg | ( | ) |
Reimplemented from MBtreeIndexOrg::ChildNode(const TAny *,TInt)const
| IMPORT_C void | Concatenate | ( | TAny * | aLeftNode, |
| const TAny * | aRightNode, | |||
| const TDesC8 & | aPivot | |||
| ) | const [virtual] | |||
Reimplemented from MBtreeIndexOrg::Concatenate(TAny *,const TAny *,const TDesC8 &)const
Reimplemented from MBtreeNodeOrg::Delete(TAny *,TInt)const
Reimplemented from MBtreeNodeOrg::Entry(const TAny *,TInt)const
Reimplemented from MBtreeNodeOrg::EntryPtr(const TAny *,TInt)const
Reimplemented from MBtreeIndexOrg::Insert(TAny *,TInt,const TDesC8 &,TPageRef)const
| IMPORT_C TBool | InsertOverflow | ( | TAny * | aLeftNode, |
| TAny * | aRightNode, | |||
| TInt | aPos, | |||
| TBool | aInsertOnLeft, | |||
| const TDesC8 & | anEntry, | |||
| TPageRef | aChild, | |||
| const TDesC8 & | aPivot, | |||
| TBtreePivot & | aNewPivot | |||
| ) | const [virtual] | |||
Reimplemented from MBtreeIndexOrg::InsertOverflow(TAny *,TAny *,TInt,TBool,const TDesC8 &,TPageRef,const TDesC8 &,TBtreePivot &)const
| IMPORT_C void | InsertSplit | ( | TAny * | aLeftNode, |
| TAny * | aRightNode, | |||
| TInt | aPos, | |||
| const TDesC8 & | anEntry, | |||
| TPageRef | aChild, | |||
| TBtreePivot & | aPromote | |||
| ) | const [virtual] | |||
Reimplemented from MBtreeIndexOrg::InsertSplit(TAny *,TAny *,TInt,const TDesC8 &,TPageRef,TBtreePivot &)const
Reimplemented from MBtreeNodeOrg::LastEntry(const TAny *)const
Reimplemented from MBtreeIndexOrg::MakeRoot(TAny *,TPageRef)const
| IMPORT_C TBool | Redistribute | ( | TAny * | aLeftNode, |
| TAny * | aRightNode, | |||
| const TDesC8 & | aPivot, | |||
| TBtreePivot & | aNewPivot | |||
| ) | const [virtual] | |||