26 #ifndef ROOT_TSeqCollection 150 virtual void Split() = 0;
207 void RemoveItem(
Int_t idx);
213 Int_t NofKeys()
const;
248 void ShiftLeft(
Int_t cnt);
260 Int_t IsLow()
const {
return fLast < fTree->fInnerLowWaterMark; }
339 public std::iterator<std::bidirectional_iterator_tag,
340 TObject*, std::ptrdiff_t,
341 const TObject**, const TObject*&> {
396 return fItem[i].fNofKeysInTree;
401 return GetNofKeys(idx);
406 fItem[i].fNofKeysInTree =
r;
411 return (fItem[i].fNofKeysInTree += n);
416 return (fItem[i].fNofKeysInTree -= n);
void SetItem(Int_t i, TBtItem &itm)
TObject * At(Int_t idx) const
friend class TBtInnerNode
void SetKey(Int_t idx, TObject *obj)
#define Split(a, ahi, alo)
void SetItem(Int_t i, TObject *obj, TBtNode *node)
void AddLast(TObject *obj)
Int_t DecNofKeys(Int_t i, Int_t n=1)
void AppendFrom(TBtInnerNode *src, Int_t start, Int_t stop)
This should never create a full node that is, it is not used anywhere where THIS could possibly be ne...
TIterator * MakeIterator(Bool_t dir=kIterForward) const
Returns a B-tree iterator.
void SetNofKeys(Int_t i, Int_t r)
Int_t IsAlmostFull() const
TObject * operator[](Int_t i) const
void RemoveItem(Int_t idx)
void Add(TObject *obj)
Add object to B-tree.
virtual ~TBtree()
Delete B-tree.
Abstract base class (ABC) of a TBtree node.
TBtLeafNode * FirstLeafNode()
Return the first node.
void AddAfter(const TObject *, TObject *obj)
void RootIsEmpty()
If root is empty clean up its space.
void Clear(Option_t *option="")
Remove all objects from B-tree.
virtual ~TBtNode()
Delete a B-tree node.
TObject * After(const TObject *obj) const
Cannot use this method since B-tree decides order.
void BalanceWithRight(TBtInnerNode *r, Int_t idx)
THIS has more than RIGHTSIB.
Int_t IdxAdd(const TObject &obj)
Add object and return its index in the tree.
Iterator abstract base class.
Int_t NofKeys() const
Return the number of keys.
void PushLeft(Int_t cnt, TBtInnerNode *leftsib, Int_t parentIdx)
noFromThis==1 => moves the parent item into the leftsib, and the first item in this's array into the ...
Int_t FindRank(const TObject *obj) const
Recursively look for WHAT starting in the current node.
Sequenceable collection abstract base class.
void SetTree(Int_t i, TBtNode *node)
#define ClassDef(name, id)
TObject ** GetObjectRef(const TObject *) const
TObject * Found(const TObject *obj, TBtNode **which, Int_t *where)
Recursively look for WHAT starting in the current node.
Item stored in inner nodes of a TBtree.
TObject * GetKey(Int_t idx)
TBtLeafNode * LastLeafNode()
Return the last leaf node.
const Bool_t kIterForward
Bool_t operator!=(const TDatime &d1, const TDatime &d2)
TBtLeafNode * LastLeafNode()
return the last node.
TBtItem & GetItem(Int_t i) const
void MergeWithRight(TBtInnerNode *r, Int_t idx)
Merge the 2 part of the tree.
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.
TBtNode * GetTree(Int_t i) const
void Append(TObject *obj, TBtNode *n)
Never called from anywhere where it might fill up THIS.
TTime operator*(const TTime &t1, const TTime &t2)
Collection abstract base class.
Int_t NofKeys() const
Number of key.
void RootIsFull()
The root of the tree is full.
TObject * operator[](Int_t i) const
void Init(Int_t i)
Initialize a B-tree.
void Reset(Detail::TBranchProxy *x)
TBtree(Int_t ordern=3)
Create a B-tree of certain order (by default 3).
virtual TBtree * GetParentTree() const
Int_t IsAlmostFull() const
TObject * Before(const TObject *obj) const
May not use this method since B-tree decides order.
void AddAt(TObject *obj, Int_t)
TObject * GetKey(Int_t i) const
void AddFirst(TObject *obj)
Int_t Rank(const TObject *obj) const
Returns the rank of the object in the tree.
TObject * Remove(TObject *obj)
Remove an object from the tree.
Int_t IncNofKeys(Int_t i, Int_t n=1)
virtual Int_t IndexOf(const TObject *obj) const
Return index of object in collection.
void SetKey(Int_t i, TObject *obj)
void Delete(Option_t *option="")
Remove all objects from B-tree AND delete all heap based objects.
void BalanceWithLeft(TBtInnerNode *l, Int_t idx)
THIS has more than LEFTSIB.
void PushRight(Int_t cnt, TBtInnerNode *rightsib, Int_t parentIdx)
The operation is three steps:
void AddBefore(const TObject *, TObject *obj)
Mother of all ROOT objects.
TObject * Found(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.
void operator=(const TCollection &)
TBtLeafNode * FirstLeafNode()
Return the first leaf node.
void ShiftLeft(Int_t cnt)
Shift to the left.
void SplitWith(TBtInnerNode *r, Int_t idx)
THIS and SIB are too full; create a NEWNODE, and balance the number of keys between the three of them...
TObject * FindObject(const char *name) const
Find object using its name (see object's GetName()).
const TCollection * GetCollection() const
Int_t GetNofKeys(Int_t i) const
void BalanceWith(TBtInnerNode *n, int idx)
PINDX is the index of the parent item whose key will change when keys are shifted from one InnerNode ...