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

TBtInnerNode Class Reference

#include <TBtree.h>

Inheritance diagram for TBtInnerNode:

Inheritance graph
[legend]
Collaboration diagram for TBtInnerNode:

Collaboration graph
[legend]
List of all members.

Public Methods

 TBtInnerNode (TBtInnerNode *parent, TBtree *t=0)
 TBtInnerNode (TBtInnerNode *parent, TBtree *tree, TBtNode *oldroot)
 ~TBtInnerNode ()
void Add (const TObject *obj, Int_t idx)
void Add (TBtItem &i, Int_t idx)
void Add (Int_t at, TObject *obj, TBtNode *n)
void AddElt (TBtItem &itm, Int_t at)
void AddElt (Int_t at, TObject *obj, TBtNode *n)
void Remove (Int_t idx)
void RemoveItem (Int_t idx)
TObject * operator[] (Int_t i) const
TObject * Found (const TObject *obj, TBtNode **which, Int_t *where)
Int_t NofKeys (Int_t idx) const
Int_t NofKeys () const
void SetTree (Int_t i, TBtNode *node)
void SetKey (Int_t i, TObject *obj)
void SetItem (Int_t i, TBtItem &itm)
void SetItem (Int_t i, TObject *obj, TBtNode *node)
Int_t GetNofKeys (Int_t i) const
void SetNofKeys (Int_t i, Int_t r)
Int_t IncNofKeys (Int_t i, Int_t n=1)
Int_t DecNofKeys (Int_t i, Int_t n=1)
Int_t FindRank (const TObject *obj) const
Int_t FindRankUp (const TBtNode *n) const
TBtNode * GetTree (Int_t i) const
TObject * GetKey (Int_t i) const
TBtItem & GetItem (Int_t i) const
Int_t IndexOf (const TBtNode *n) const
void IncrNofKeys (TBtNode *np)
void DecrNofKeys (TBtNode *np)
TBtLeafNode * FirstLeafNode ()
TBtLeafNode * LastLeafNode ()
void InformParent ()
void Split ()
void SplitWith (TBtInnerNode *r, Int_t idx)
void MergeWithRight (TBtInnerNode *r, Int_t idx)
void BalanceWithLeft (TBtInnerNode *l, Int_t idx)
void BalanceWithRight (TBtInnerNode *r, Int_t idx)
void BalanceWith (TBtInnerNode *n, int idx)
void PushLeft (Int_t cnt, TBtInnerNode *leftsib, Int_t parentIdx)
void PushRight (Int_t cnt, TBtInnerNode *rightsib, Int_t parentIdx)
void AppendFrom (TBtInnerNode *src, Int_t start, Int_t stop)
void Append (TObject *obj, TBtNode *n)
void Append (TBtItem &itm)
void ShiftLeft (Int_t cnt)
Int_t Psize () const
Int_t Vsize () const
Int_t MaxIndex () const
Int_t MaxPsize () const
Int_t IsFull () const
void IsFull (TBtNode *n)
Int_t IsAlmostFull () const
Int_t IsLow () const
void IsLow (TBtNode *n)

Constructor & Destructor Documentation

TBtInnerNode::TBtInnerNode (  TBtInnerNode *    parent,
TBtree *    t = 0
) 
 

TBtInnerNode::TBtInnerNode (  TBtInnerNode *    parent,
TBtree *    tree,
TBtNode *    oldroot
) 
 

TBtInnerNode::~TBtInnerNode (    ) 
 

Member Function Documentation

void TBtInnerNode::Add (  const TObject *    obj,
Int_t    idx
)  [virtual]
 

Implements TBtNode.

void TBtInnerNode::Add (  TBtItem &    i,
Int_t    idx
) 
 

void TBtInnerNode::Add (  Int_t    at,
TObject *    obj,
TBtNode *    n
) 
 

void TBtInnerNode::AddElt (  TBtItem &    itm,
Int_t    at
) 
 

void TBtInnerNode::AddElt (  Int_t    at,
TObject *    obj,
TBtNode *    n
) 
 

void TBtInnerNode::Remove (  Int_t    idx )  [virtual]
 

Implements TBtNode.

void TBtInnerNode::RemoveItem (  Int_t    idx ) 
 

TObject* TBtInnerNode::operator[] (  Int_t    i )  const [virtual]
 

Implements TBtNode.

TObject* TBtInnerNode::Found (  const TObject *    obj,
TBtNode **    which,
Int_t *    where
)  [virtual]
 

Implements TBtNode.

Int_t TBtInnerNode::NofKeys (  Int_t    idx )  const
 

Definition at line 392 of file TBtree.h.

References GetNofKeys().

Int_t TBtInnerNode::NofKeys (    )  const [virtual]
 

Implements TBtNode.

void TBtInnerNode::SetTree (  Int_t    i,
TBtNode *    node
) 
 

Definition at line 217 of file TBtree.h.

References TBtNode::fParent, and TBtItem::fTree.

Referenced by SetItem().

void TBtInnerNode::SetKey (  Int_t    i,
TObject *    obj
) 
 

Definition at line 218 of file TBtree.h.

References TBtItem::fKey.

Referenced by SetItem().

void TBtInnerNode::SetItem (  Int_t    i,
TBtItem &    itm
) 
 

Definition at line 219 of file TBtree.h.

References TBtNode::fParent, and TBtItem::fTree.

void TBtInnerNode::SetItem (  Int_t    i,
TObject *    obj,
TBtNode *    node
) 
 

Definition at line 220 of file TBtree.h.

References SetKey(), and SetTree().

Int_t TBtInnerNode::GetNofKeys (  Int_t    i )  const
 

Definition at line 386 of file TBtree.h.

References Assert, TBtNode::fLast, and TBtItem::fNofKeysInTree.

Referenced by NofKeys().

void TBtInnerNode::SetNofKeys (  Int_t    i,
Int_t    r
) 
 

Definition at line 397 of file TBtree.h.

References TBtItem::fNofKeysInTree.

Int_t TBtInnerNode::IncNofKeys (  Int_t    i,
Int_t    n = 1
) 
 

Definition at line 402 of file TBtree.h.

References TBtItem::fNofKeysInTree.

Int_t TBtInnerNode::DecNofKeys (  Int_t    i,
Int_t    n = 1
) 
 

Definition at line 407 of file TBtree.h.

References TBtItem::fNofKeysInTree.

Int_t TBtInnerNode::FindRank (  const TObject *    obj )  const [virtual]
 

Implements TBtNode.

Int_t TBtInnerNode::FindRankUp (  const TBtNode *    n )  const
 

TBtNode* TBtInnerNode::GetTree (  Int_t    i )  const
 

Definition at line 227 of file TBtree.h.

References TBtItem::fTree.

Referenced by TBtLeafNode::Vsize(), and Vsize().

TObject* TBtInnerNode::GetKey (  Int_t    i )  const
 

Definition at line 228 of file TBtree.h.

References TBtItem::fKey.

TBtItem& TBtInnerNode::GetItem (  Int_t    i )  const
 

Definition at line 229 of file TBtree.h.

Int_t TBtInnerNode::IndexOf (  const TBtNode *    n )  const
 

void TBtInnerNode::IncrNofKeys (  TBtNode *    np ) 
 

void TBtInnerNode::DecrNofKeys (  TBtNode *    np ) 
 

TBtLeafNode* TBtInnerNode::FirstLeafNode (    )  [virtual]
 

Implements TBtNode.

TBtLeafNode* TBtInnerNode::LastLeafNode (    )  [virtual]
 

Implements TBtNode.

void TBtInnerNode::InformParent (    ) 
 

void TBtInnerNode::Split (    )  [virtual]
 

Implements TBtNode.

void TBtInnerNode::SplitWith (  TBtInnerNode *    r,
Int_t    idx
) 
 

void TBtInnerNode::MergeWithRight (  TBtInnerNode *    r,
Int_t    idx
) 
 

void TBtInnerNode::BalanceWithLeft (  TBtInnerNode *    l,
Int_t    idx
) 
 

void TBtInnerNode::BalanceWithRight (  TBtInnerNode *    r,
Int_t    idx
) 
 

void TBtInnerNode::BalanceWith (  TBtInnerNode *    n,
int    idx
) 
 

void TBtInnerNode::PushLeft (  Int_t    cnt,
TBtInnerNode *    leftsib,
Int_t    parentIdx
) 
 

void TBtInnerNode::PushRight (  Int_t    cnt,
TBtInnerNode *    rightsib,
Int_t    parentIdx
) 
 

void TBtInnerNode::AppendFrom (  TBtInnerNode *    src,
Int_t    start,
Int_t    stop
) 
 

void TBtInnerNode::Append (  TObject *    obj,
TBtNode *    n
) 
 

void TBtInnerNode::Append (  TBtItem &    itm ) 
 

void TBtInnerNode::ShiftLeft (  Int_t    cnt ) 
 

Int_t TBtInnerNode::Psize (    )  const
 

Definition at line 253 of file TBtree.h.

References TBtNode::fLast.

Referenced by Vsize().

Int_t TBtInnerNode::Vsize (    )  const
 

Definition at line 412 of file TBtree.h.

References Assert, TBtNode::fParent, GetTree(), and Psize().

Int_t TBtInnerNode::MaxIndex (    )  const
 

Definition at line 255 of file TBtree.h.

References TBtree::fInnerMaxIndex, and TBtNode::fTree.

Referenced by IsAlmostFull(), and IsFull().

Int_t TBtInnerNode::MaxPsize (    )  const
 

Definition at line 256 of file TBtree.h.

References TBtree::fInnerMaxIndex, and TBtNode::fTree.

Int_t TBtInnerNode::IsFull (    )  const
 

Definition at line 260 of file TBtree.h.

References TBtNode::fLast, and MaxIndex().

void TBtInnerNode::IsFull (  TBtNode *    n ) 
 

Int_t TBtInnerNode::IsAlmostFull (    )  const
 

Definition at line 262 of file TBtree.h.

References TBtNode::fLast, and MaxIndex().

Int_t TBtInnerNode::IsLow (    )  const
 

Definition at line 263 of file TBtree.h.

References TBtree::fInnerLowWaterMark, TBtNode::fLast, and TBtNode::fTree.

void TBtInnerNode::IsLow (  TBtNode *    n ) 
 

The documentation for this class was generated from the following file:
Generated on Thu Dec 18 14:56:50 2003 for ROOT by doxygen1.2.16