Main Page   Namespace List   Class Hierarchy   Compound List   File List   Namespace Members   Compound Members   File Members  

CdbRooRoBtreeNodeR< K, ORDER > Class Template Reference

An embeddable node class for the persistent capable B-tree. More...

List of all members.

Public Types

typedef CdbRooRoBtreeNodeR<
K, ORDER > 
MyType

Public Member Functions

 CdbRooRoBtreeNodeR ()
 CdbRooRoBtreeNodeR (UInt_t p)
 CdbRooRoBtreeNodeR (const CdbRooRoBtreeNodeR< K, ORDER > &theNode)
virtual ~CdbRooRoBtreeNodeR ()
 The destructor.

CdbRooRoBtreeNodeR< K, ORDER > & operator= (const CdbRooRoBtreeNodeR< K, ORDER > &theNode)
 ClassDef (MyType, 1)

Public Attributes

UInt_t parent
UInt_t child [2 *ORDER+1]
key [2 *ORDER]
Bool_t isLeaf
UInt_t n


Detailed Description

template<class K, UInt_t ORDER>
class CdbRooRoBtreeNodeR< K, ORDER >

An embeddable node class for the persistent capable B-tree.

This template class implement nodes for the corresponding B-tree data structures and related algorithms.

The template is parametrized by mean of the following parameters:

K - is a type of keys. This type has to provide the following methods:

default constructor copy constructor destructor

and operators:

= == < << (into std::ostream)

ORDER - is an order of the tree.

Definition at line 36 of file CdbRooRoAbsBtreeR.rdl.


Member Typedef Documentation

template<class K, UInt_t ORDER>
typedef CdbRooRoBtreeNodeR<K,ORDER> CdbRooRoBtreeNodeR< K, ORDER >::MyType
 

Definition at line 110 of file CdbRooRoAbsBtreeR.rdl.


Constructor & Destructor Documentation

template<class K, UInt_t ORDER>
CdbRooRoBtreeNodeR< K, ORDER >::CdbRooRoBtreeNodeR   [inline]
 

Definition at line 44 of file CdbRooRoAbsBtreeR.rdl.

References CdbRooRoBtreeNodeR< K, ORDER >::isLeaf, CdbRooRoBtreeNodeR< K, ORDER >::n, and CdbRooRoBtreeNodeR< K, ORDER >::parent.

template<class K, UInt_t ORDER>
CdbRooRoBtreeNodeR< K, ORDER >::CdbRooRoBtreeNodeR UInt_t    p [inline]
 

Definition at line 45 of file CdbRooRoAbsBtreeR.rdl.

References CdbRooRoBtreeNodeR< K, ORDER >::isLeaf, CdbRooRoBtreeNodeR< K, ORDER >::n, and CdbRooRoBtreeNodeR< K, ORDER >::parent.

template<class K, UInt_t ORDER>
CdbRooRoBtreeNodeR< K, ORDER >::CdbRooRoBtreeNodeR const CdbRooRoBtreeNodeR< K, ORDER > &    theNode [inline]
 

Definition at line 50 of file CdbRooRoAbsBtreeR.rdl.

template<class K, UInt_t ORDER>
virtual CdbRooRoBtreeNodeR< K, ORDER >::~CdbRooRoBtreeNodeR   [inline, virtual]
 

The destructor.

NOTE: The destructor is NOT virtual because this is an embedded class.

Definition at line 60 of file CdbRooRoAbsBtreeR.rdl.


Member Function Documentation

template<class K, UInt_t ORDER>
CdbRooRoBtreeNodeR< K, ORDER >::ClassDef MyType   ,
 
 

template<class K, UInt_t ORDER>
CdbRooRoBtreeNodeR<K,ORDER>& CdbRooRoBtreeNodeR< K, ORDER >::operator= const CdbRooRoBtreeNodeR< K, ORDER > &    theNode [inline]
 

Definition at line 66 of file CdbRooRoAbsBtreeR.rdl.


Member Data Documentation

template<class K, UInt_t ORDER>
UInt_t CdbRooRoBtreeNodeR< K, ORDER >::child[ 2 * ORDER + 1 ]
 

Definition at line 95 of file CdbRooRoAbsBtreeR.rdl.

Referenced by CdbRooRoAbsBtreeR< K, FCP, ORDER >::insert(), CdbRooRoBtreeR< K, FCP, ORDER >::release(), and CdbRooRoAbsBtreeR< K, FCP, ORDER >::remove().

template<class K, UInt_t ORDER>
Bool_t CdbRooRoBtreeNodeR< K, ORDER >::isLeaf
 

Definition at line 103 of file CdbRooRoAbsBtreeR.rdl.

Referenced by CdbRooRoBtreeNodeR< K, ORDER >::CdbRooRoBtreeNodeR(), CdbRooRoAbsBtreeR< K, FCP, ORDER >::insert(), and CdbRooRoAbsBtreeR< K, FCP, ORDER >::remove().

template<class K, UInt_t ORDER>
K CdbRooRoBtreeNodeR< K, ORDER >::key[ 2 * ORDER ]
 

Definition at line 99 of file CdbRooRoAbsBtreeR.rdl.

Referenced by CdbRooRoAbsBtreeR< K, FCP, ORDER >::insert(), CdbRooRoAbsBtreeR< K, FCP, ORDER >::remove(), and CdbRooRoAbsBtreeR< K, FCP, ORDER >::search().

template<class K, UInt_t ORDER>
UInt_t CdbRooRoBtreeNodeR< K, ORDER >::n
 

Definition at line 108 of file CdbRooRoAbsBtreeR.rdl.

Referenced by CdbRooRoBtreeNodeR< K, ORDER >::CdbRooRoBtreeNodeR(), CdbRooRoAbsBtreeR< K, FCP, ORDER >::insert(), CdbRooRoAbsBtreeR< K, FCP, ORDER >::remove(), and CdbRooRoAbsBtreeR< K, FCP, ORDER >::search().

template<class K, UInt_t ORDER>
UInt_t CdbRooRoBtreeNodeR< K, ORDER >::parent
 

Definition at line 91 of file CdbRooRoAbsBtreeR.rdl.

Referenced by CdbRooRoBtreeNodeR< K, ORDER >::CdbRooRoBtreeNodeR(), CdbRooRoAbsBtreeR< K, FCP, ORDER >::insert(), and operator<<().


The documentation for this class was generated from the following file:
Generated on Mon Dec 5 18:22:24 2005 for CDB by doxygen1.3-rc3