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] |
| K | key [2 *ORDER] |
| Bool_t | isLeaf |
| UInt_t | n |
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.
|
|||||
|
Definition at line 110 of file CdbRooRoAbsBtreeR.rdl. |
|
|||||||||
|
Definition at line 44 of file CdbRooRoAbsBtreeR.rdl. References CdbRooRoBtreeNodeR< K, ORDER >::isLeaf, CdbRooRoBtreeNodeR< K, ORDER >::n, and CdbRooRoBtreeNodeR< K, ORDER >::parent. |
|
||||||||||
|
Definition at line 45 of file CdbRooRoAbsBtreeR.rdl. References CdbRooRoBtreeNodeR< K, ORDER >::isLeaf, CdbRooRoBtreeNodeR< K, ORDER >::n, and CdbRooRoBtreeNodeR< K, ORDER >::parent. |
|
||||||||||
|
Definition at line 50 of file CdbRooRoAbsBtreeR.rdl. |
|
|||||||||
|
The destructor. NOTE: The destructor is NOT virtual because this is an embedded class. Definition at line 60 of file CdbRooRoAbsBtreeR.rdl. |
|
||||||||||||||||
|
|
|
||||||||||
|
Definition at line 66 of file CdbRooRoAbsBtreeR.rdl. |
|
|||||
|
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(). |
|
|||||
|
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(). |
|
|||||
|
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(). |
|
|||||
|
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(). |
|
|||||
|
Definition at line 91 of file CdbRooRoAbsBtreeR.rdl. Referenced by CdbRooRoBtreeNodeR< K, ORDER >::CdbRooRoBtreeNodeR(), CdbRooRoAbsBtreeR< K, FCP, ORDER >::insert(), and operator<<(). |
1.3-rc3