ROOT » TREE » TREE » TTreeFriendLeafIter

class TTreeFriendLeafIter: public TIterator


Iterator on all the leaves in a TTree and its friend

Function Members (Methods)

static TClass*Class()
virtual const TCollection*GetCollection() const
virtual Option_t*GetOption() const
virtual TClass*IsA() const
virtual TObject*Next()
virtual Bool_toperator!=(const TIterator&) const
Bool_toperator!=(const TTreeFriendLeafIter&) const
virtual TObject*operator*() const
virtual TIterator&operator=(const TIterator& rhs)
TTreeFriendLeafIter&operator=(const TTreeFriendLeafIter& rhs)
Bool_tTIterator::operator==(const TIterator& other) const
virtual voidReset()
virtual voidShowMembers(TMemberInspector& insp) const
virtual voidStreamer(TBuffer&)
voidStreamerNVirtual(TBuffer& ClassDef_StreamerNVirtual_b)
TTreeFriendLeafIter(const TTreeFriendLeafIter& iter)
TTreeFriendLeafIter(const TTree* t, Bool_t dir = kIterForward)

Data Members

Bool_tfDirectioniteration direction
TIterator*fLeafItercurrent leaf sub-iterator.
TTree*fTreetree being iterated
TIterator*fTreeItercurrent tree sub-iterator.

Class Charts

Inheritance Inherited Members Includes Libraries
Class Charts

Function documentation

TTreeFriendLeafIter(const TTree* t, Bool_t dir = kIterForward)
 Create a new iterator. By default the iteration direction
 is kIterForward. To go backward use kIterBackward.
TTreeFriendLeafIter(const TTreeFriendLeafIter& iter)
 Copy constructor.  Does NOT copy the 'cursor' location!
TIterator& operator=(const TIterator& rhs)
 Overridden assignment operator. Does NOT copy the 'cursor' location!
TTreeFriendLeafIter& operator=(const TTreeFriendLeafIter& rhs)
 Overridden assignment operator.  Does NOT copy the 'cursor' location!
TObject* Next()
 Go the next friend element
Option_t* GetOption() const
 Returns the object option stored in the list.
void Reset(Option_t* option = "")
{ }
{ SafeDelete(fLeafIter); SafeDelete(fTreeIter); }
const TCollection * GetCollection() const
{ return 0; }
TObject * operator*() const
 TODO: Implement me