MBtreeIndexOrg Class Reference

#include <s32btree.h>

Link against: estor.lib

class MBtreeIndexOrg : public MBtreeNodeOrg

Inherits from

MBtreeIndexOrg
- MBtreeNodeOrg

Public Member Functions
pure virtual TPageRef	ChildNode(const TAny *, TInt)
pure virtual void	Concatenate(TAny , const TAny , const TDesC8 &)
pure virtual TBool	Insert(TAny *, TInt, const TDesC8 &, TPageRef)
virtual IMPORT_C TBool	InsertOverflow(TAny , TAny , TInt, TBool, const TDesC8 &, TPageRef, const TDesC8 &, TBtreePivot &)
pure virtual void	InsertSplit(TAny , TAny , TInt, const TDesC8 &, TPageRef, TBtreePivot &)
pure virtual void	MakeRoot(TAny *, TPageRef)
pure virtual TBool	Redistribute(TAny , TAny , const TDesC8 &, TBtreePivot &)
virtual IMPORT_C TBool	Search(const TAny , const TAny , const MBtreeKey &, TBool, TInt &)
virtual IMPORT_C TBool	Update(TAny *, TInt, const TDesC8 &)

Inherited Functions
	MBtreeNodeOrg::Delete(TAny *,TInt)const
	MBtreeNodeOrg::Entry(const TAny *,TInt)const
	MBtreeNodeOrg::EntryPtr(const TAny *,TInt)const
	MBtreeNodeOrg::Init(TAny *)const
	MBtreeNodeOrg::LastEntry(const TAny *)const

Member Function Documentation

ChildNode ( const TAny *, TInt )

TPageRef	ChildNode	(	const TAny *	aNode,
			TInt	aPos
		)	const [pure virtual]

Concatenate ( TAny , const TAny , const TDesC8 & )

void	Concatenate	(	TAny *	aLeftNode,
			const TAny *	aRightNode,
			const TDesC8 &	aPivot
		)	const [pure virtual]

Insert ( TAny *, TInt, const TDesC8 &, TPageRef )

TBool	Insert	(	TAny *	aNode,
			TInt	aPos,
			const TDesC8 &	anEntry,
			TPageRef	aChild
		)	const [pure virtual]

InsertOverflow ( TAny , TAny , TInt, TBool, const TDesC8 &, TPageRef, const TDesC8 &, TBtreePivot & )

IMPORT_C TBool	InsertOverflow	(	TAny *	aLeftNode,
			TAny *	aRightNode,
			TInt	aPos,
			TBool	aInsertOnLeft,
			const TDesC8 &	anEntry,
			TPageRef	aChild,
			const TDesC8 &	aPivot,
			TBtreePivot &	aNewPivot
		)	const [virtual]

InsertSplit ( TAny , TAny , TInt, const TDesC8 &, TPageRef, TBtreePivot & )

void	InsertSplit	(	TAny *	aLeftNode,
			TAny *	aRightNode,
			TInt	aPos,
			const TDesC8 &	anEntry,
			TPageRef	aChild,
			TBtreePivot &	aPromote
		)	const [pure virtual]

MakeRoot ( TAny *, TPageRef )

void	MakeRoot	(	TAny *	aNode,
			TPageRef	aChild
		)	const [pure virtual]

Redistribute ( TAny , TAny , const TDesC8 &, TBtreePivot & )

TBool	Redistribute	(	TAny *	aLeftNode,
			TAny *	aRightNode,
			const TDesC8 &	aPivot,
			TBtreePivot &	aNewPivot
		)	const [pure virtual]

Search ( const TAny , const TAny , const MBtreeKey &, TBool, TInt & )

IMPORT_C TBool	Search	(	const TAny *	aNode,
			const TAny *	aKey,
			const MBtreeKey &	aComp,
			TBool	aLast,
			TInt &	aPos
		)	const [virtual]

Reimplemented from MBtreeNodeOrg::Search(const TAny *,const TAny *,const MBtreeKey &,TBool,TInt &)const

Update ( TAny *, TInt, const TDesC8 & )

IMPORT_C TBool	Update	(	TAny *	aNode,
			TInt	aPos,
			const TDesC8 &	anEntry
		)	const [virtual]