#include <TBtree.h>
Inheritance diagram for TBtLeafNode:


Public Methods | |
| TBtLeafNode (TBtInnerNode *p, const TObject *obj=0, TBtree *t=0) | |
| ~TBtLeafNode () | |
| void | Add (const TObject *obj, Int_t idx) |
| 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 i) const |
| Int_t | NofKeys () const |
| Int_t | FindRank (const TObject *obj) const |
| TObject * | GetKey (Int_t idx) |
| void | SetKey (Int_t idx, TObject *obj) |
| Int_t | IndexOf (const TObject *obj) const |
| TBtLeafNode * | FirstLeafNode () |
| TBtLeafNode * | LastLeafNode () |
| void | Split () |
| void | SplitWith (TBtLeafNode *r, Int_t idx) |
| void | MergeWithRight (TBtLeafNode *r, Int_t idx) |
| void | BalanceWithLeft (TBtLeafNode *l, Int_t idx) |
| void | BalanceWithRight (TBtLeafNode *r, Int_t idx) |
| void | BalanceWith (TBtLeafNode *n, Int_t idx) |
| void | PushLeft (Int_t cnt, TBtLeafNode *l, Int_t parentIndex) |
| void | PushRight (Int_t cnt, TBtLeafNode *r, Int_t parentIndex) |
| void | AppendFrom (TBtLeafNode *src, Int_t start, Int_t stop) |
| void | Append (TObject *obj) |
| 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 |
| Int_t | IsAlmostFull () const |
| Int_t | IsLow () const |
Friends | |
| class | TBtInnerNode |
|
||||||||||||||||
|
|
|
|
|
|
||||||||||||
|
Implements TBtNode. |
|
|
Implements TBtNode. Referenced by RemoveItem(). |
|
|
Definition at line 289 of file TBtree.h. References Remove(). |
|
|
Implements TBtNode. Definition at line 421 of file TBtree.h. References Assert, and TBtNode::fLast. |
|
||||||||||||||||
|
Implements TBtNode. |
|
|
|
|
|
Implements TBtNode. |
|
|
Implements TBtNode. |
|
|
|
|
||||||||||||
|
|
|
|
|
|
|
Implements TBtNode. |
|
|
Implements TBtNode. |
|
|
Implements TBtNode. |
|
||||||||||||
|
|
|
||||||||||||
|
|
|
||||||||||||
|
|
|
||||||||||||
|
|
|
||||||||||||
|
|
|
||||||||||||||||
|
|
|
||||||||||||||||
|
|
|
||||||||||||||||
|
|
|
|
|
|
|
|
|
|
Definition at line 317 of file TBtree.h. References TBtNode::fLast. Referenced by Vsize(). |
|
|
Definition at line 427 of file TBtree.h. References Assert, TBtNode::fParent, TBtInnerNode::GetTree(), and Psize(). |
|
|
Definition at line 319 of file TBtree.h. References TBtree::fLeafMaxIndex, and TBtNode::fTree. Referenced by IsAlmostFull(), and IsFull(). |
|
|
Definition at line 320 of file TBtree.h. References TBtree::fLeafMaxIndex, and TBtNode::fTree. |
|
|
Definition at line 324 of file TBtree.h. References TBtNode::fLast, and MaxIndex(). |
|
|
Definition at line 325 of file TBtree.h. References TBtNode::fLast, and MaxIndex(). |
|
|
Definition at line 326 of file TBtree.h. References TBtNode::fLast, TBtree::fLeafLowWaterMark, and TBtNode::fTree. |
|
|
Reimplemented from TBtNode. |
1.2.16