Logo ROOT  
Reference Guide
ROOT::Experimental::TTreeReaderFast::Iterator_t Class Reference

Definition at line 45 of file TTreeReaderFast.hxx.

Public Member Functions

 Iterator_t ()
 Default-initialize the iterator as "past the end". More...
 
 Iterator_t (TTreeReaderFast &reader, Long64_t first)
 Initialize the iterator with the reader it steers and a tree entry number; -1 is invalid. More...
 
bool operator!= (const Iterator_t &lhs) const
 Compare two iterators for inequality. More...
 
Long64_t operator* ()
 Set the entry number in the reader and return it. More...
 
Long64_t operator* () const
 
Iterator_toperator++ ()
 Increment the iterator (prefix ++i). More...
 
Iterator_t operator++ (int)
 Increment the iterator (postfix i++). More...
 
bool operator== (const Iterator_t &lhs) const
 Compare two iterators for equality. More...
 

Private Member Functions

bool IsValid () const
 Whether the iterator points to a valid entry. More...
 

Private Attributes

Int_t fCount {0}
 Number of entries inside this cluster. More...
 
Long64_t fEntry {-1}
 Entry number of the tree referenced by this iterator; -1 is invalid. More...
 
Int_tfIdx {nullptr}
 Current offset inside this cluster. More...
 
TTreeReaderFastfReader {nullptr}
 The reader we select the entries on. More...
 

#include <ROOT/TTreeReaderFast.hxx>

Inheritance diagram for ROOT::Experimental::TTreeReaderFast::Iterator_t:
[legend]

Constructor & Destructor Documentation

◆ Iterator_t() [1/2]

ROOT::Experimental::TTreeReaderFast::Iterator_t::Iterator_t ( )
inline

Default-initialize the iterator as "past the end".

Definition at line 58 of file TTreeReaderFast.hxx.

◆ Iterator_t() [2/2]

ROOT::Experimental::TTreeReaderFast::Iterator_t::Iterator_t ( TTreeReaderFast reader,
Long64_t  first 
)
inline

Initialize the iterator with the reader it steers and a tree entry number; -1 is invalid.

Definition at line 62 of file TTreeReaderFast.hxx.

Member Function Documentation

◆ IsValid()

bool ROOT::Experimental::TTreeReaderFast::Iterator_t::IsValid ( ) const
inlineprivate

Whether the iterator points to a valid entry.

Definition at line 54 of file TTreeReaderFast.hxx.

◆ operator!=()

Compare two iterators for inequality.

Definition at line 78 of file TTreeReaderFast.hxx.

◆ operator*() [1/2]

Long64_t ROOT::Experimental::TTreeReaderFast::Iterator_t::operator* ( )
inline

Set the entry number in the reader and return it.

Definition at line 107 of file TTreeReaderFast.hxx.

◆ operator*() [2/2]

Long64_t ROOT::Experimental::TTreeReaderFast::Iterator_t::operator* ( ) const
inline

Definition at line 111 of file TTreeReaderFast.hxx.

◆ operator++() [1/2]

Iterator_t & ROOT::Experimental::TTreeReaderFast::Iterator_t::operator++ ( )
inline

Increment the iterator (prefix ++i).

Definition at line 90 of file TTreeReaderFast.hxx.

◆ operator++() [2/2]

Iterator_t ROOT::Experimental::TTreeReaderFast::Iterator_t::operator++ ( int  )
inline

Increment the iterator (postfix i++).

Definition at line 83 of file TTreeReaderFast.hxx.

◆ operator==()

bool ROOT::Experimental::TTreeReaderFast::Iterator_t::operator== ( const Iterator_t lhs) const
inline

Compare two iterators for equality.

Definition at line 71 of file TTreeReaderFast.hxx.

Member Data Documentation

◆ fCount

Int_t ROOT::Experimental::TTreeReaderFast::Iterator_t::fCount {0}
private

Number of entries inside this cluster.

Definition at line 49 of file TTreeReaderFast.hxx.

◆ fEntry

Long64_t ROOT::Experimental::TTreeReaderFast::Iterator_t::fEntry {-1}
private

Entry number of the tree referenced by this iterator; -1 is invalid.

Definition at line 50 of file TTreeReaderFast.hxx.

◆ fIdx

Int_t* ROOT::Experimental::TTreeReaderFast::Iterator_t::fIdx {nullptr}
private

Current offset inside this cluster.

Definition at line 48 of file TTreeReaderFast.hxx.

◆ fReader

TTreeReaderFast* ROOT::Experimental::TTreeReaderFast::Iterator_t::fReader {nullptr}
private

The reader we select the entries on.

Definition at line 51 of file TTreeReaderFast.hxx.


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