ROOT logo
ROOT » CORE » CONT » TBtreeIter

class TBtreeIter: public TIterator, public iterator<bidirectional_iterator_tag,TObject*,long,const TObject**,const TObject*&>


TBtreeIter

Iterator of btree.


This class is also known as (typedefs to this class)

TBtree::Iterator_t

Function Members (Methods)

public:
TBtreeIter(const TBtreeIter& iter)
TBtreeIter(const TBtree* t, Bool_t dir = kIterForward)
virtual~TBtreeIter()
static TClass*Class()
virtual const TCollection*GetCollection() const
virtual Option_t*TIterator::GetOption() const
virtual TClass*IsA() const
virtual TObject*Next()
virtual Bool_toperator!=(const TIterator& aIter) const
Bool_toperator!=(const TBtreeIter& aIter) const
TObject*TIterator::operator()()
virtual TObject*operator*() const
virtual TIterator&operator=(const TIterator& rhs)
TBtreeIter&operator=(const TBtreeIter& rhs)
virtual voidReset()
virtual voidShowMembers(TMemberInspector&)
virtual voidStreamer(TBuffer&)
voidStreamerNVirtual(TBuffer& ClassDef_StreamerNVirtual_b)
private:
TBtreeIter()

Data Members

private:
Int_tfCurCursorcurrent position in btree
Int_tfCursornext position in btree
Bool_tfDirectioniteration direction
const TBtree*fTreebtree being iterated

Class Charts

Inheritance Inherited Members Includes Libraries
Class Charts

Function documentation

TBtreeIter(const TBtree* t, Bool_t dir = kIterForward)
 Create a B-tree iterator.
TBtreeIter(const TBtreeIter& iter)
 Copy ctor.
TIterator & operator=(const TIterator& rhs)
 Overridden assignment operator.
TBtreeIter & operator=(const TBtreeIter& rhs)
 Overloaded assignment operator.
void Reset()
 Reset the B-tree iterator.
TObject * Next()
 Get next object from B-tree. Returns 0 when no more objects in tree.
Bool_t operator!=(const TIterator& aIter) const
 This operator compares two TIterator objects.
Bool_t operator!=(const TBtreeIter& aIter) const
 This operator compares two TBtreeIter objects.
TObject* operator*() const
 Return current object or nullptr.
TBtreeIter()
{ }
~TBtreeIter()
{ }
const TCollection * GetCollection() const
{ return fTree; }