BrDigTPC
class description - source file - inheritance tree
class BrDigTPC : public TObject
public:
BrDigTPC BrDigTPC()
BrDigTPC BrDigTPC(BrDigTPC const&)
void ~BrDigTPC()
virtual void AddAdc(Float_t x)
TClass* Class()
virtual Int_t Compare(TObject* digtpc)
virtual Float_t GetAdc()
virtual BrTPCCluster* GetClus()
virtual Int_t GetIrow()
virtual Int_t GetNhits()
virtual Int_t GetPadno()
virtual Int_t GetTime()
virtual Int_t GetUsed()
virtual void IncNhits()
virtual TClass* IsA()
virtual Bool_t IsSortable()
virtual void SetAdc(Float_t x)
virtual void SetClus(BrTPCCluster* x)
virtual void SetIrow(Int_t i)
virtual void SetNhits(Int_t i)
virtual void SetPadno(Int_t i)
virtual void SetTime(Int_t i)
virtual void SetUsed(Int_t i)
virtual void ShowMembers(TMemberInspector& insp, char* parent)
virtual void Streamer(TBuffer& b)
private:
Int_t fGvid
Int_t fIrow
Int_t fPadno
Int_t fTime
Float_t fAdc
Int_t fUsed
Int_t fNhits
BrTPCCluster* fClus
BrDigTPC is a BRAHMS data class for storing information for
one detector TPC Digitized hit.
Int_t Compare(TObject *digtpc_o)
This routine overloads TObject::Compare(TObject *object)
For BRAHMS, this routine is typically called by QSort
It needs to return 1 if you want digtpc_o to be earlier
in the list and -1 if you want digtpc_o to be later in
the list.
Inline Functions
BrDigTPC BrDigTPC()
Bool_t IsSortable()
Int_t GetIrow()
Int_t GetPadno()
Int_t GetTime()
Float_t GetAdc()
Int_t GetUsed()
Int_t GetNhits()
BrTPCCluster* GetClus()
void SetIrow(Int_t i)
void SetPadno(Int_t i)
void SetTime(Int_t i)
void SetAdc(Float_t x)
void SetUsed(Int_t i)
void SetNhits(Int_t i)
void SetClus(BrTPCCluster* x)
void AddAdc(Float_t x)
void IncNhits()
TClass* Class()
TClass* IsA()
void ShowMembers(TMemberInspector& insp, char* parent)
void Streamer(TBuffer& b)
BrDigTPC BrDigTPC(BrDigTPC const&)
void ~BrDigTPC()
ROOT page - Class index - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.