TBtreeInlineLeafOrg Class Reference

#include <s32btree.h>

Link against: estor.lib

class TBtreeInlineLeafOrg : public MBtreeLeafOrg

Inherits from

TBtreeInlineLeafOrg
- MBtreeLeafOrg
  - MBtreeNodeOrg

Public Member Functions
	TBtreeInlineLeafOrg()
virtual IMPORT_C void	Concatenate(TAny , const TAny )
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 &)
virtual IMPORT_C TBool	InsertOverflow(TAny , TAny , TInt, TBool, const TDesC8 &)
virtual IMPORT_C void	InsertSplit(TAny , TAny , TInt, const TDesC8 &)
virtual IMPORT_C TInt	LastEntry(const TAny *)
virtual IMPORT_C TPageRef	LinkNode(const TAny *)
virtual IMPORT_C TBool	Redistribute(TAny , TAny )
IMPORT_C void	SetEntrySize(TInt)
virtual IMPORT_C void	SetLinkNode(TAny *, TPageRef)

Inherited Functions
	MBtreeLeafOrg::Search(const TAny ,const TAny ,const MBtreeKey &,TBool,TInt &)const
	MBtreeNodeOrg::Init(TAny *)const

Constructor & Destructor Documentation

TBtreeInlineLeafOrg ( )

IMPORT_C

TBtreeInlineLeafOrg

(

)

Member Function Documentation

Concatenate ( TAny , const TAny )

IMPORT_C void	Concatenate	(	TAny *	aLeftNode,
			const TAny *	aRightNode
		)	const [virtual]

Reimplemented from MBtreeLeafOrg::Concatenate(TAny *,const TAny *)const

Delete ( TAny *, TInt )

IMPORT_C TBool	Delete	(	TAny *	aNode,
			TInt	aPos
		)	const [virtual]

Reimplemented from MBtreeNodeOrg::Delete(TAny *,TInt)const

Entry ( const TAny *, TInt )

IMPORT_C TPtrC8	Entry	(	const TAny *	aNode,
			TInt	aPos
		)	const [virtual]

Reimplemented from MBtreeNodeOrg::Entry(const TAny *,TInt)const

EntryPtr ( const TAny *, TInt )

IMPORT_C const TAny *	EntryPtr	(	const TAny *	aNode,
			TInt	aPos
		)	const [virtual]

Reimplemented from MBtreeNodeOrg::EntryPtr(const TAny *,TInt)const

Insert ( TAny *, TInt, const TDesC8 & )

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

Reimplemented from MBtreeLeafOrg::Insert(TAny *,TInt,const TDesC8 &)const

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

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

Reimplemented from MBtreeLeafOrg::InsertOverflow(TAny *,TAny *,TInt,TBool,const TDesC8 &)const

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

IMPORT_C void	InsertSplit	(	TAny *	aLeftNode,
			TAny *	aRightNode,
			TInt	aPos,
			const TDesC8 &	anEntry
		)	const [virtual]

Reimplemented from MBtreeLeafOrg::InsertSplit(TAny *,TAny *,TInt,const TDesC8 &)const

LastEntry ( const TAny * )

IMPORT_C TInt

LastEntry

(

const TAny *

aNode

)

const [virtual]

Reimplemented from MBtreeNodeOrg::LastEntry(const TAny *)const

LinkNode ( const TAny * )

IMPORT_C TPageRef

LinkNode

(

const TAny *

aNode

)

const [virtual]

Reimplemented from MBtreeLeafOrg::LinkNode(const TAny *)const

Redistribute ( TAny , TAny )

IMPORT_C TBool	Redistribute	(	TAny *	aLeftNode,
			TAny *	aRightNode
		)	const [virtual]

Reimplemented from MBtreeLeafOrg::Redistribute(TAny *,TAny *)const

SetEntrySize ( TInt )

IMPORT_C void

SetEntrySize

(

TInt

aSize

)

SetLinkNode ( TAny *, TPageRef )

IMPORT_C void	SetLinkNode	(	TAny *	aNode,
			TPageRef	aNextNode
		)	const [virtual]

Reimplemented from MBtreeLeafOrg::SetLinkNode(TAny *,TPageRef)const