Logo ROOT   6.21/01
Reference Guide
TBtLeafNode Class Reference

Leaf node of a TBtree.

Definition at line 270 of file TBtree.h.

Public Member Functions

 TBtLeafNode (TBtInnerNode *p, const TObject *obj=0, TBtree *t=0)
 Constructor. More...
 
 ~TBtLeafNode ()
 Destructor. More...
 
void Add (const TObject *obj, Int_t idx)
 Add the object OBJ to the leaf node, inserting it at location INDEX in the fItem array. More...
 
void Append (TObject *obj)
 Never called from anywhere where it might fill up THIS does NOT handle nofKeys. More...
 
void AppendFrom (TBtLeafNode *src, Int_t start, Int_t stop)
 A convenience function, does not worry about the element in the parent, simply moves elements from SRC[start] to SRC[stop] into the current array. More...
 
void BalanceWith (TBtLeafNode *n, Int_t idx)
 PITEM is the parent item whose key will change when keys are shifted from one LeafNode to the other. More...
 
void BalanceWithLeft (TBtLeafNode *l, Int_t idx)
 THIS has more than LEFTSIB; move some items from THIS to LEFTSIB. More...
 
void BalanceWithRight (TBtLeafNode *r, Int_t idx)
 THIS has more than RIGHTSIB; move some items from THIS to RIGHTSIB. More...
 
Int_t FindRank (const TObject *obj) const
 WHAT was not in any inner node; it is either here, or it's not in the tree. More...
 
TBtLeafNodeFirstLeafNode ()
 Return the first node. More...
 
TObjectFound (const TObject *obj, TBtNode **which, Int_t *where)
 WHAT was not in any inner node; it is either here, or it's not in the tree. More...
 
TObjectGetKey (Int_t idx)
 
Int_t IndexOf (const TObject *obj) const
 Returns a number in the range 0 to MaxIndex(). More...
 
Int_t IsAlmostFull () const
 
Int_t IsFull () const
 
Int_t IsLow () const
 
TBtLeafNodeLastLeafNode ()
 return the last node. More...
 
Int_t MaxIndex () const
 
Int_t MaxPsize () const
 
void MergeWithRight (TBtLeafNode *r, Int_t idx)
 Merge. More...
 
Int_t NofKeys (Int_t i) const
 Return the number of keys. More...
 
Int_t NofKeys () const
 Return the number of keys. More...
 
TObjectoperator[] (Int_t i) const
 
Int_t Psize () const
 
void PushLeft (Int_t cnt, TBtLeafNode *l, Int_t parentIndex)
 noFromThis==1 => moves the parent item into the leftsib, and the first item in this's array into the parent item. More...
 
void PushRight (Int_t cnt, TBtLeafNode *r, Int_t parentIndex)
 noFromThis==1 => moves the parent item into the rightsib, and the last item in this's array into the parent item. More...
 
void Remove (Int_t idx)
 Remove an element. More...
 
void RemoveItem (Int_t idx)
 
void SetKey (Int_t idx, TObject *obj)
 
void ShiftLeft (Int_t cnt)
 Shift. More...
 
void Split ()
 This function is called only when THIS is the only descendent of the root node, and THIS needs to be split. More...
 
void SplitWith (TBtLeafNode *r, Int_t idx)
 Split. More...
 
Int_t Vsize () const
 
- Public Member Functions inherited from TBtNode
 TBtNode (Int_t isleaf, TBtInnerNode *p, TBtree *t=0)
 Create a B-tree node. More...
 
virtual ~TBtNode ()
 Delete a B-tree node. More...
 
virtual TBtreeGetParentTree () const
 

Private Attributes

TObject ** fItem
 

Friends

class TBtInnerNode
 

Additional Inherited Members

- Protected Attributes inherited from TBtNode
Int_t fIsLeaf
 
Int_t fLast
 
TBtInnerNodefParent
 
TBtreefTree
 

#include <TBtree.h>

Inheritance diagram for TBtLeafNode:
[legend]

Constructor & Destructor Documentation

◆ TBtLeafNode()

TBtLeafNode::TBtLeafNode ( TBtInnerNode p,
const TObject obj = 0,
TBtree t = 0 
)

Constructor.

Definition at line 1363 of file TBtree.cxx.

◆ ~TBtLeafNode()

TBtLeafNode::~TBtLeafNode ( )

Destructor.

Definition at line 1376 of file TBtree.cxx.

Member Function Documentation

◆ Add()

void TBtLeafNode::Add ( const TObject obj,
Int_t  index 
)
virtual

Add the object OBJ to the leaf node, inserting it at location INDEX in the fItem array.

Implements TBtNode.

Definition at line 1385 of file TBtree.cxx.

◆ Append()

void TBtLeafNode::Append ( TObject obj)

Never called from anywhere where it might fill up THIS does NOT handle nofKeys.

Definition at line 1442 of file TBtree.cxx.

◆ AppendFrom()

void TBtLeafNode::AppendFrom ( TBtLeafNode src,
Int_t  start,
Int_t  stop 
)

A convenience function, does not worry about the element in the parent, simply moves elements from SRC[start] to SRC[stop] into the current array.

This should never create a full node. That is, it is not used anywhere where THIS could possibly be near full. Does NOT handle nofKeys.

Definition at line 1426 of file TBtree.cxx.

◆ BalanceWith()

void TBtLeafNode::BalanceWith ( TBtLeafNode rightsib,
Int_t  pidx 
)

PITEM is the parent item whose key will change when keys are shifted from one LeafNode to the other.

Definition at line 1475 of file TBtree.cxx.

◆ BalanceWithLeft()

void TBtLeafNode::BalanceWithLeft ( TBtLeafNode l,
Int_t  idx 
)

THIS has more than LEFTSIB; move some items from THIS to LEFTSIB.

Definition at line 1452 of file TBtree.cxx.

◆ BalanceWithRight()

void TBtLeafNode::BalanceWithRight ( TBtLeafNode r,
Int_t  idx 
)

THIS has more than RIGHTSIB; move some items from THIS to RIGHTSIB.

Definition at line 1463 of file TBtree.cxx.

◆ FindRank()

Int_t TBtLeafNode::FindRank ( const TObject what) const
virtual

WHAT was not in any inner node; it is either here, or it's not in the tree.

Implements TBtNode.

Definition at line 1487 of file TBtree.cxx.

◆ FirstLeafNode()

TBtLeafNode * TBtLeafNode::FirstLeafNode ( )
virtual

Return the first node.

Implements TBtNode.

Definition at line 1501 of file TBtree.cxx.

◆ Found()

TObject * TBtLeafNode::Found ( const TObject what,
TBtNode **  which,
Int_t where 
)
virtual

WHAT was not in any inner node; it is either here, or it's not in the tree.

Implements TBtNode.

Definition at line 1510 of file TBtree.cxx.

◆ GetKey()

TObject* TBtLeafNode::GetKey ( Int_t  idx)
inline

Definition at line 292 of file TBtree.h.

◆ IndexOf()

Int_t TBtLeafNode::IndexOf ( const TObject obj) const

Returns a number in the range 0 to MaxIndex().

Definition at line 1533 of file TBtree.cxx.

◆ IsAlmostFull()

Int_t TBtLeafNode::IsAlmostFull ( ) const
inline

Definition at line 320 of file TBtree.h.

◆ IsFull()

Int_t TBtLeafNode::IsFull ( ) const
inline

Definition at line 319 of file TBtree.h.

◆ IsLow()

Int_t TBtLeafNode::IsLow ( ) const
inline

Definition at line 321 of file TBtree.h.

◆ LastLeafNode()

TBtLeafNode * TBtLeafNode::LastLeafNode ( )
virtual

return the last node.

Implements TBtNode.

Definition at line 1546 of file TBtree.cxx.

◆ MaxIndex()

Int_t TBtLeafNode::MaxIndex ( ) const
inline

Definition at line 314 of file TBtree.h.

◆ MaxPsize()

Int_t TBtLeafNode::MaxPsize ( ) const
inline

Definition at line 315 of file TBtree.h.

◆ MergeWithRight()

void TBtLeafNode::MergeWithRight ( TBtLeafNode r,
Int_t  idx 
)

Merge.

Definition at line 1554 of file TBtree.cxx.

◆ NofKeys() [1/2]

Int_t TBtLeafNode::NofKeys ( Int_t  i) const

Return the number of keys.

Definition at line 1567 of file TBtree.cxx.

◆ NofKeys() [2/2]

Int_t TBtLeafNode::NofKeys ( ) const
virtual

Return the number of keys.

Implements TBtNode.

Definition at line 1575 of file TBtree.cxx.

◆ operator[]()

TObject * TBtLeafNode::operator[] ( Int_t  i) const
inlinevirtual

Implements TBtNode.

Definition at line 424 of file TBtree.h.

◆ Psize()

Int_t TBtLeafNode::Psize ( ) const
inline

Definition at line 312 of file TBtree.h.

◆ PushLeft()

void TBtLeafNode::PushLeft ( Int_t  noFromThis,
TBtLeafNode leftsib,
Int_t  pidx 
)

noFromThis==1 => moves the parent item into the leftsib, and the first item in this's array into the parent item.

Definition at line 1593 of file TBtree.cxx.

◆ PushRight()

void TBtLeafNode::PushRight ( Int_t  noFromThis,
TBtLeafNode rightsib,
Int_t  pidx 
)

noFromThis==1 => moves the parent item into the rightsib, and the last item in this's array into the parent item.

Definition at line 1612 of file TBtree.cxx.

◆ Remove()

void TBtLeafNode::Remove ( Int_t  idx)
virtual

Remove an element.

Implements TBtNode.

Definition at line 1656 of file TBtree.cxx.

◆ RemoveItem()

void TBtLeafNode::RemoveItem ( Int_t  idx)
inline

Definition at line 284 of file TBtree.h.

◆ SetKey()

void TBtLeafNode::SetKey ( Int_t  idx,
TObject obj 
)
inline

Definition at line 293 of file TBtree.h.

◆ ShiftLeft()

void TBtLeafNode::ShiftLeft ( Int_t  cnt)

Shift.

Definition at line 1679 of file TBtree.cxx.

◆ Split()

void TBtLeafNode::Split ( )
virtual

This function is called only when THIS is the only descendent of the root node, and THIS needs to be split.

Assumes that idx of THIS in Parent is 0.

Implements TBtNode.

Definition at line 1693 of file TBtree.cxx.

◆ SplitWith()

void TBtLeafNode::SplitWith ( TBtLeafNode r,
Int_t  idx 
)

Split.

Definition at line 1706 of file TBtree.cxx.

◆ Vsize()

Int_t TBtLeafNode::Vsize ( ) const
inline

Definition at line 430 of file TBtree.h.

Friends And Related Function Documentation

◆ TBtInnerNode

friend class TBtInnerNode
friend

Definition at line 272 of file TBtree.h.

Member Data Documentation

◆ fItem

TObject** TBtLeafNode::fItem
private

Definition at line 275 of file TBtree.h.


The documentation for this class was generated from the following files: