sl@0: // Copyright (c) 1998-2009 Nokia Corporation and/or its subsidiary(-ies).
sl@0: // All rights reserved.
sl@0: // This component and the accompanying materials are made available
sl@0: // under the terms of "Eclipse Public License v1.0"
sl@0: // which accompanies this distribution, and is available
sl@0: // at the URL "http://www.eclipse.org/legal/epl-v10.html".
sl@0: //
sl@0: // Initial Contributors:
sl@0: // Nokia Corporation - initial contribution.
sl@0: //
sl@0: // Contributors:
sl@0: //
sl@0: // Description:
sl@0: //
sl@0: 
sl@0: #if !defined(__S32BTREE_H__)
sl@0: #define __S32BTREE_H__
sl@0: #if !defined(__S32PAGE_H__)
sl@0: #include <s32page.h>
sl@0: #endif
sl@0: 
sl@0: const TInt KMaxBtreeHeight=16;
sl@0: /** Maximum length for a B-tree key. */
sl@0: const TInt KMaxBtreeKeyLength=255;
sl@0: //
sl@0: typedef TInt TBtreeHeight;
sl@0: /** Buffer to store the result of MBtreeKey::Between(). */
sl@0: typedef TBuf8<KMaxBtreeKeyLength> TBtreePivot;
sl@0: //
sl@0: enum TBtreeMode {EBtreeSecure,EBtreeFast};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  * Encapsulates the persistent parameters for a TBtree. 
sl@0: */
sl@0: class TBtreeToken
sl@0: 	{
sl@0: public:
sl@0: /** Provides a TBtreeToken initialisation flag. */
sl@0: 	enum TEmpty {EEmpty};
sl@0: public:
sl@0: 	/** Default constuctor. */
sl@0: 	TBtreeToken() {}
sl@0: 	inline TBtreeToken(TEmpty);
sl@0: 	inline void Touch();
sl@0: //
sl@0: 	inline TBool IsBroken() const;
sl@0: 	inline TBool IsIntact() const;
sl@0: 	inline TBool IsEmpty() const;
sl@0: //
sl@0: 	IMPORT_C void ExternalizeL(RWriteStream& aStream) const;
sl@0: 	IMPORT_C void InternalizeL(RReadStream& aStream);
sl@0: protected:
sl@0: 	IMPORT_C void Clear();
sl@0: private:
sl@0: 	inline TBtreeToken(TPageRef aFirst,TPageRef aRoot,TBtreeHeight aHeight);
sl@0: private:
sl@0: 	TPageRef iFirst;
sl@0: 	TPageRef iRoot;
sl@0: 	TBtreeHeight iHeight;
sl@0: private:
sl@0: 	friend class TBtree;
sl@0: 	};
sl@0: #define KEmptyBtreeToken TBtreeToken(TBtreeToken::EEmpty)
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  */
sl@0: class TBtreePath
sl@0: 	{
sl@0: public:
sl@0: 	inline TBtreePath();
sl@0: 	inline TPageRef Node() const;
sl@0: 	inline TInt Entry() const;
sl@0: 	inline TBool IsLeaf() const;
sl@0: 	inline TBtreeHeight End() const;
sl@0: 	inline void SetEntry(TInt aEntry);
sl@0: 	void GotoRoot(TBtreeHeight aHeight,TPageRef aRoot);
sl@0: 	void Push(TPageRef aRef,TInt aEntry=0);
sl@0: 	inline void Pop();
sl@0: private:
sl@0: 	TBtreeHeight iEnd;
sl@0: 	TPageRef iNodes[KMaxBtreeHeight];
sl@0: 	TUint8 iEntries[KMaxBtreeHeight];
sl@0: 	TUint8 iLasts[KMaxBtreeHeight];
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  * Identifies a position in a B-tree.
sl@0: 
sl@0: The class has no public members. Clients use it by getting TBtreePos objects 
sl@0: from some TBtree functions, and passing them into others.  
sl@0: */
sl@0: class TBtreePos
sl@0: 	{
sl@0: private:
sl@0: 	TBtreePath iPath;
sl@0: private:
sl@0: 	friend class TBtree;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  * An iterator for a B-tree.
sl@0: 
sl@0: Functions that use a TBtreeMark are faster than those that use a TBtreePos, 
sl@0: and can be used with a broken B-tree. 
sl@0: 
sl@0: The class has no public members. Clients use it by getting TBtreeMark objects 
sl@0: from some TBtree functions, and passing them into others. 
sl@0: */
sl@0: class TBtreeMark
sl@0: 	{
sl@0: private:
sl@0: 	TPageRef iLeaf;
sl@0: 	TPageRef iLink;
sl@0: 	TUint8 iEntry;
sl@0: 	TUint8 iLast;
sl@0: private:
sl@0: 	friend class TBtree;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  * Interface for ordering and creating keys for entries in a B-tree.
sl@0: 
sl@0: Derived classes implement this interface for particular types of key. 
sl@0: */
sl@0: class MBtreeKey
sl@0: 	{
sl@0: public:
sl@0: 	virtual IMPORT_C const TAny* Key(const TAny* anEntry) const;
sl@0: 	
sl@0: 	/** Orders two keys.
sl@0: 	
sl@0: 	@param aLeft Pointer to first key
sl@0: 	@param aRight Pointer to second key
sl@0: 	@return Positive, if the first key is after the second key; negative, if 
sl@0: 	the first key is before the second key; zero, if the keys are equal */
sl@0: 	virtual TInt Compare(const TAny* aLeft,const TAny* aRight) const=0;
sl@0: 	
sl@0: 	/** Gets the midpoint between two keys.
sl@0: 	
sl@0: 	The generated midpoint will be greater or equal to aLeft (by a comparison 
sl@0: 	performed by the Compare() function), and less than aRight.
sl@0: 	
sl@0: 	@param aLeft First key
sl@0: 	@param aRight Second key
sl@0: 	@param aPivot On return, the midpoint between the two keys */
sl@0: 	virtual void Between(const TAny* aLeft,const TAny* aRight,TBtreePivot& aPivot) const=0;
sl@0: 	};
sl@0: 
sl@0: class MBtreeNodeOrg;
sl@0: class MBtreeLeafOrg;
sl@0: class MBtreeIndexOrg;
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  * Provides ordering of entries by key value in a B+-tree (balanced tree) 
sl@0: structure.
sl@0: 
sl@0: Entries and keys are handled as untyped TAny* parameters. You specify an entry 
sl@0: in the tree to manipulate through a position (TBtreePos) variable. You can 
sl@0: also use iterator functions, which take a TBtreeMark, to move through entries 
sl@0: in the tree. The tree's settings can be persisted using a TBtreeToken.
sl@0: 
sl@0: To use this class, you must provide a page pool, based on MPagePool, in which 
sl@0: to store entries in the tree, and a key handler, based on MBtreeKey, to provide 
sl@0: order and keys.
sl@0: 
sl@0: @see MBtreeKey
sl@0: @see MPagePool
sl@0: @see TBtreeMark
sl@0: @see TBtreePos
sl@0: @see TBtreeToken 
sl@0: */
sl@0: class TBtree
sl@0: 	{
sl@0: public:
sl@0: /** Sets the condition for a successful match when calling TBtree::Find(). */
sl@0: 	enum TFind {
sl@0: 		/** Find the first entry greater than or equal to the search target. */
sl@0: 		EGreaterEqual,
sl@0: 		/** Find the first entry equal to the search target. */
sl@0: 		EEqualTo,
sl@0: 		/** Find the last entry less than the search target. */
sl@0: 		ELessThan,
sl@0: 		/** Find the first entry greater than the search target. */
sl@0: 		EGreaterThan,
sl@0: 		/** Find the last entry less than or equal to the search target. */
sl@0: 		ELessEqual};
sl@0: public:
sl@0: 	IMPORT_C TBtree(TBtreeMode aMode);
sl@0: 	IMPORT_C TBtree(const TBtreeToken& aToken,TBtreeMode aMode);
sl@0: 	IMPORT_C void Connect(MPagePool* aPool,const MBtreeKey* aKey,const MBtreeLeafOrg* aLeafOrg,const MBtreeIndexOrg* anIndexOrg);
sl@0: 	IMPORT_C void Set(const TBtreeToken& aToken,TBtreeMode aMode);
sl@0: 	IMPORT_C TBtreeToken Token() const;
sl@0: //
sl@0: 	inline TBool IsDirty() const;
sl@0: 	inline void MarkCurrent();
sl@0: 	inline void MarkDirty();
sl@0: //
sl@0: 	inline TBool IsBroken() const;
sl@0: 	inline TBool IsIntact() const;
sl@0: 	inline void MarkBroken();
sl@0: 	IMPORT_C TInt RepairL();
sl@0: //
sl@0: 	inline TBool IsEmpty() const;
sl@0: 	IMPORT_C void ClearL();
sl@0: //
sl@0: 	IMPORT_C TBool FirstL(TBtreePos& aPos) const;
sl@0: 	IMPORT_C TBool LastL(TBtreePos& aPos) const;
sl@0: 	IMPORT_C TBool NextL(TBtreePos& aPos) const;
sl@0: 	IMPORT_C TBool PreviousL(TBtreePos& aPos) const;
sl@0: //
sl@0: 	IMPORT_C TBool FindL(TBtreePos& aPos,const TAny* aKey,TFind aMode=EEqualTo) const;
sl@0: 	IMPORT_C TBool InsertL(TBtreePos& aPos,const TAny* anEntry,TInt aLength,TAllowDuplicates aDup=ENoDuplicates);
sl@0: 	IMPORT_C TBool DeleteL(const TAny* aKey);
sl@0: 	IMPORT_C void DeleteAtL(TBtreePos& aPos);
sl@0: 	IMPORT_C void ExtractAtL(const TBtreePos& aPos,TAny* anEntry,TInt aMaxLength) const;
sl@0: //
sl@0: 	IMPORT_C TBool ResetL(TBtreeMark& aMark) const;
sl@0: 	IMPORT_C TBool NextL(TBtreeMark& aMark) const;
sl@0: 	IMPORT_C void ExtractAtL(const TBtreeMark& aMark,TAny* anEntry,TInt aMaxLength) const;
sl@0: private:
sl@0: 	TBool AscendAtLastL(TBtreePath& aPath) const;
sl@0: 	TBool AscendAtFirstL(TBtreePath& aPath) const;
sl@0: 	void DescendFirstL(TBtreePath& aPath) const;
sl@0: 	void DescendLastL(TBtreePath& aPath) const;
sl@0: //
sl@0: 	TBool SearchL(TBtreePath& aPath,const TAny* aKey,TBool aAfter=EFalse) const;
sl@0: 	void NewPivot(const TAny* aLeftNode,const TAny* aRightNode,TBtreePivot& aPivot) const;
sl@0: 	void ReplacePivotL(TBtreePath& aPath,TAny* aNode,TBtreePivot& aPivot);
sl@0: 	void InsertAtL(TBtreePath& aPath,const TDesC8& anEntry);
sl@0: 	void InsertAtL(TBtreePath& aPath,TBtreePivot& aPivot,TPageRef aChild);
sl@0: 	TBool InsertAtL(TBtreePath& aPath,const TDesC8& anEntry,TPageRef aChild,TBtreePivot& aPivot,TPageRef& aPromote);
sl@0: 	void DeleteAtL(TBtreePath& aPath);
sl@0: 	void DeleteIndexSetL();
sl@0: 	void DeleteIndexNodesL(TBtreePath& aPath,TBool aLeadingEdge);
sl@0: //
sl@0: 	void NewTreeL();
sl@0: 	void NewRootL();
sl@0: //
sl@0: 	void BeginUpdateL();
sl@0: 	void EndUpdate();
sl@0: 	inline void MarkIntact();
sl@0: 	void CheckIntactL() const;
sl@0: //
sl@0: 	inline TBool IsRoot(const TBtreePath& aPath) const;
sl@0: 	inline const MBtreeNodeOrg* NodeOrg(TBool aLeaf) const;
sl@0: 	void GotoRoot(TBtreePath& aPath) const;
sl@0: //
sl@0: 	TAny* GetNodeL(const TBtreePath& aPath) const;
sl@0: 	void PutNode(TAny* aNode,TBool aLeaf) const;
sl@0: //
sl@0: 	TInt LastEntryL(const TBtreePath& aPath) const;
sl@0: 	TPageRef ChildNodeL(const TBtreePath& aPath) const;
sl@0: 	TPageRef LastChildNodeL(TBtreePath& aPath) const;
sl@0: 	TPageRef ChildNodeL(TBtreePath& aPath,TInt aChild) const;
sl@0: private:
sl@0: 	enum {ESecure=EBtreeSecure,EFast=EBtreeFast,EBroken=0x40000000,EDirty=0x80000000};
sl@0: private:
sl@0: 	MPagePool* iPages;
sl@0: 	const MBtreeKey* iKey;
sl@0: 	const MBtreeLeafOrg* iLeafOrg;
sl@0: 	const MBtreeIndexOrg* iIndexOrg;
sl@0: 	TPageRef iFirst;
sl@0: 	TPageRef iRoot;
sl@0: 	TBtreeHeight iHeight;
sl@0: 	TInt iStatus;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  */
sl@0: class MBtreeNodeOrg
sl@0: 	{
sl@0: public:
sl@0: 	virtual IMPORT_C void Init(TAny* aNode) const;
sl@0: 	virtual TInt LastEntry(const TAny* aNode) const=0;
sl@0: 	virtual TPtrC8 Entry(const TAny* aNode,TInt aPos) const=0;
sl@0: 	virtual const TAny* EntryPtr(const TAny* aNode,TInt aPos) const=0;
sl@0: 	virtual TBool Search(const TAny* aNode,const TAny* aKey,const MBtreeKey& aComp,TBool aLast,TInt& aPos) const=0;
sl@0: 	virtual TBool Delete(TAny* aNode,TInt aPos) const=0;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  */
sl@0: class MBtreeLeafOrg : public MBtreeNodeOrg
sl@0: 	{
sl@0: public:
sl@0: 	IMPORT_C TBool Search(const TAny* aNode,const TAny* aKey,const MBtreeKey& aComp,TBool aLast,TInt& aPos) const;
sl@0: 	virtual TBool Insert(TAny* aNode,TInt aPos,const TDesC8& anEntry) const=0;
sl@0: 	virtual IMPORT_C TBool InsertOverflow(TAny* aLeftNode,TAny* aRightNode,TInt aPos,TBool aInsertOnLeft,const TDesC8& anEntry) const;
sl@0: 	virtual void InsertSplit(TAny* aLeftNode,TAny* aRightNode,TInt aPos,const TDesC8& anEntry) const=0;
sl@0: 	virtual TBool Redistribute(TAny* aLeftNode,TAny* aRightNode) const=0;
sl@0: 	virtual void Concatenate(TAny* aLeftNode,const TAny* aRightNode) const=0;
sl@0: 	virtual TPageRef LinkNode(const TAny* aNode) const=0;
sl@0: 	virtual void SetLinkNode(TAny* aNode,TPageRef aNextNode) const=0;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  */
sl@0: class MBtreeIndexOrg : public MBtreeNodeOrg
sl@0: 	{
sl@0: public:
sl@0: 	IMPORT_C TBool Search(const TAny* aNode,const TAny* aKey,const MBtreeKey& aComp,TBool aLast,TInt& aPos) const;
sl@0: 	virtual TBool Insert(TAny* aNode,TInt aPos,const TDesC8& anEntry,TPageRef aChild) const=0;
sl@0: 	virtual IMPORT_C TBool InsertOverflow(TAny* aLeftNode,TAny* aRightNode,TInt aPos,TBool aInsertOnLeft,const TDesC8& anEntry,TPageRef aChild,const TDesC8& aPivot,TBtreePivot& aNewPivot) const;
sl@0: 	virtual void InsertSplit(TAny* aLeftNode,TAny* aRightNode,TInt aPos,const TDesC8& anEntry,TPageRef aChild,TBtreePivot& aPromote) const=0;
sl@0: 	virtual IMPORT_C TBool Update(TAny* aNode,TInt aPos,const TDesC8& anEntry) const;
sl@0: 	virtual TBool Redistribute(TAny* aLeftNode,TAny* aRightNode,const TDesC8& aPivot,TBtreePivot& aNewPivot) const=0;
sl@0: 	virtual void Concatenate(TAny* aLeftNode,const TAny* aRightNode,const TDesC8& aPivot) const=0;
sl@0: 	virtual void MakeRoot(TAny* aNode,TPageRef aChild) const=0;
sl@0: 	virtual TPageRef ChildNode(const TAny* aNode,TInt aPos) const=0;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  */
sl@0: class TBtreeInlineLeafOrg : public MBtreeLeafOrg
sl@0: 	{
sl@0: public:
sl@0: 	IMPORT_C TBtreeInlineLeafOrg();
sl@0: 	IMPORT_C void SetEntrySize(TInt aSize);
sl@0: //
sl@0: 	IMPORT_C TInt LastEntry(const TAny* aNode) const;
sl@0: 	IMPORT_C TPtrC8 Entry(const TAny* aNode,TInt aPos) const;
sl@0: 	IMPORT_C const TAny* EntryPtr(const TAny* aNode,TInt aPos) const;
sl@0: 	IMPORT_C TBool Insert(TAny* aNode,TInt aPos,const TDesC8& anEntry) const;
sl@0: 	IMPORT_C TBool InsertOverflow(TAny* aLeftNode,TAny* aRightNode,TInt aPos,TBool aInsertOnLeft,const TDesC8& anEntry) const;
sl@0: 	IMPORT_C void InsertSplit(TAny* aLeftNode,TAny* aRightNode,TInt aPos,const TDesC8& anEntry) const;
sl@0: 	IMPORT_C TBool Delete(TAny* aNode,TInt aPos) const;
sl@0: 	IMPORT_C TBool Redistribute(TAny* aLeftNode,TAny* aRightNode) const;
sl@0: 	IMPORT_C void Concatenate(TAny* aLeftNode,const TAny* aRightNode) const;
sl@0: 	IMPORT_C TPageRef LinkNode(const TAny* aNode) const;
sl@0: 	IMPORT_C void SetLinkNode(TAny* aNode,TPageRef aNextNode) const;
sl@0: private:
sl@0: 	TAny* DoRedistribute(TAny* aLeftNode,TAny* aRightNode,TInt aInsertPos=-1) const;
sl@0: 	struct SHeader
sl@0: 		{
sl@0: 		TInt32 iCount;
sl@0: 		TPageRef iLink;
sl@0: 		};
sl@0: 	struct SNode
sl@0: 		{
sl@0: 		SHeader iHead;
sl@0: 		TUint8 iEntries[KPoolPageSize-sizeof(SHeader)];
sl@0: 		};
sl@0: private:
sl@0: 	inline static const SNode* Node(const TAny* aNode);
sl@0: 	inline static SNode* Node(TAny* aNode);
sl@0: 	inline const TUint8* Entry(const SNode* aNode,TInt anEntry) const;
sl@0: 	inline TUint8* Entry(SNode* aNode,TInt anEntry) const;
sl@0: private:
sl@0: 	TInt iEntrySize;
sl@0: 	TInt iMaxEntries;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  */
sl@0: class TBtreeInlineIndexOrg : public MBtreeIndexOrg
sl@0: 	{
sl@0: public:
sl@0: 	IMPORT_C TBtreeInlineIndexOrg();
sl@0: 	IMPORT_C void SetEntrySize(TInt aSize);
sl@0: //
sl@0: 	IMPORT_C TBool Insert(TAny* aNode,TInt aPos,const TDesC8& anEntry,TPageRef aChild) const;
sl@0: 	IMPORT_C TBool InsertOverflow(TAny* aLeftNode,TAny* aRightNode,TInt aPos,TBool aInsertOnLeft,const TDesC8& anEntry,TPageRef aChild,const TDesC8& aPivot,TBtreePivot& aNewPivot) const;
sl@0: 	IMPORT_C void InsertSplit(TAny* aLeftNode,TAny* aRightNode,TInt aPos,const TDesC8& anEntry,TPageRef aChild,TBtreePivot& aPromote) const;
sl@0: 	IMPORT_C TBool Update(TAny* aNode,TInt aPos,const TDesC8& anEntry) const;
sl@0: 	IMPORT_C TBool Delete(TAny* aNode,TInt aPos) const;
sl@0: 	IMPORT_C TBool Redistribute(TAny* aLeftNode,TAny* aRightNode,const TDesC8& aPivot,TBtreePivot& aNewPivot) const;
sl@0: 	IMPORT_C void Concatenate(TAny* aLeftNode,const TAny* aRightNode,const TDesC8& aPivot) const;
sl@0: 
sl@0: 	IMPORT_C void MakeRoot(TAny* aNode,TPageRef aChild) const;
sl@0: 	IMPORT_C TInt LastEntry(const TAny* aNode) const;
sl@0: 	IMPORT_C TPtrC8 Entry(const TAny* aNode,TInt aPos) const;
sl@0: 	IMPORT_C const TAny* EntryPtr(const TAny* aNode,TInt aPos) const;
sl@0: 	IMPORT_C TPageRef ChildNode(const TAny* aNode,TInt aPos) const;
sl@0: private:
sl@0: 	struct SEntry
sl@0: 		{
sl@0: 		TPageRef iChild;
sl@0: 		TUint8 iKey[4]; // at least four bytes of key
sl@0: 		};
sl@0: 	struct SHeader
sl@0: 		{
sl@0: 		TInt32 iCount;
sl@0: 		};
sl@0: 	struct SNode
sl@0: 		{
sl@0: 		SHeader iHead;
sl@0: 		TUint8 iEntries[KPoolPageSize-sizeof(SHeader)];
sl@0: 		};
sl@0: 	SNode* DoRedistribute(TAny* aLeftNode,TAny* aRightNode,const TDesC8& aPivot,TBtreePivot& aNewPivot,TInt aInsertPos=-1) const;
sl@0: private:
sl@0: 	inline static const SNode* Node(const TAny* aNode);
sl@0: 	inline static SNode* Node(TAny* aNode);
sl@0: 	inline const SEntry* Entry(const SNode* aNode,TInt anEntry) const;
sl@0: 	inline SEntry* Entry(SNode* aNode,TInt anEntry) const;
sl@0: 	inline TInt KeySize() const;
sl@0: private:
sl@0: 	TInt iEntrySize;
sl@0: 	TInt iMaxEntries;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  */
sl@0: class TBtreeKey : public MBtreeKey
sl@0: 	{
sl@0: public:
sl@0: 	IMPORT_C TBtreeKey();
sl@0: 	IMPORT_C TBtreeKey(TInt aLength);
sl@0: 	IMPORT_C TBtreeKey(TInt anOffset,TKeyCmpText aType);
sl@0: 	IMPORT_C TBtreeKey(TInt anOffset,TKeyCmpText aType,TInt aLength);
sl@0: 	IMPORT_C TBtreeKey(TInt anOffset,TKeyCmpNumeric aType);
sl@0: //
sl@0: 	IMPORT_C const TAny* Key(const TAny* anEntry) const;
sl@0: 	IMPORT_C TInt Compare(const TAny* aLeft,const TAny* aRight) const;
sl@0: 	IMPORT_C void Between(const TAny* aLeft,const TAny* aRight,TBtreePivot& aPivot) const;
sl@0: protected:
sl@0: 	TInt iKeyOffset;
sl@0: 	TInt iCmpType;
sl@0: 	TInt iKeyLength;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  * Base class for TBtreeFix, which provides a B-tree for fixed sized entries.  
sl@0: */
sl@0: class TBtreeFixBase : public TBtree
sl@0: 	{
sl@0: public:
sl@0: 	IMPORT_C void Connect(MPagePool* aPool,const MBtreeKey* aKey);
sl@0: 	IMPORT_C TBool InsertL(TBtreePos& aPos,const TAny* anEntry,TAllowDuplicates aDup=ENoDuplicates);
sl@0: 	IMPORT_C void ExtractAtL(const TBtreePos& aPos,TAny* anEntry) const;
sl@0: 	IMPORT_C void ExtractAtL(const TBtreeMark& aMark,TAny* anEntry) const;
sl@0: protected:
sl@0: 	IMPORT_C TBtreeFixBase(TBtreeMode aMode,TInt anEntrySize,TInt aKeySize);
sl@0: 	IMPORT_C TBtreeFixBase(const TBtreeToken& aToken,TBtreeMode aMode,TInt anEntrySize,TInt aKeySize);
sl@0: private:
sl@0: 	TInt iEntrySize;
sl@0: 	TBtreeInlineLeafOrg iLeafOrgFix;
sl@0: 	TBtreeInlineIndexOrg iIndexOrgFix;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  * A B-tree for fixed-sized keys and entries.
sl@0: 
sl@0: Entry is the type of entry to store. Key defines how items should be ordered: 
sl@0: there must be a member of this type in the Entry class. 
sl@0: */
sl@0: template <class Entry,class Key>
sl@0: class TBtreeFix : public TBtreeFixBase
sl@0: 	{
sl@0: public:
sl@0: 	inline TBtreeFix(TBtreeMode aMode);
sl@0: 	inline TBtreeFix(const TBtreeToken& aToken,TBtreeMode aMode);
sl@0: //
sl@0: 	inline TBool FindL(TBtreePos& aPos,const Key& aKey,TFind aMode=EEqualTo) const;
sl@0: 	inline TBool InsertL(TBtreePos& aPos,const Entry& anEntry,TAllowDuplicates aDup=ENoDuplicates);
sl@0: 	inline TBool DeleteL(const Key& aKey);
sl@0: //
sl@0: 	inline Entry AtL(const TBtreePos& aPos) const;
sl@0: 	inline Entry AtL(const TBtreeMark& aMark) const;
sl@0: 	inline void ExtractAtL(const TBtreePos& aPos,Entry& anEntry) const;
sl@0: 	inline void ExtractAtL(const TBtreeMark& aMark,Entry& anEntry) const;
sl@0: 	};
sl@0: 
sl@0: /**
sl@0:  * @publishedAll 
sl@0:  * @released
sl@0:  * A specialisation of the B-tree for untyped fixed sized items. 
sl@0: */
sl@0: TEMPLATE_SPECIALIZATION class TBtreeFix<TAny,TAny> : public TBtreeFixBase
sl@0: 	{
sl@0: public:
sl@0: 	inline TBtreeFix(TBtreeMode aMode,TInt anEntrySize,TInt aKeySize);
sl@0: 	inline TBtreeFix(const TBtreeToken& aToken,TBtreeMode aMode,TInt anEntrySize,TInt aKeySize);
sl@0: 	};
sl@0: 
sl@0: #include <s32btree.inl>
sl@0: #endif