#include "hhodoraw.h"

HHodoRaw


class description - source file - inheritance tree (.pdf)

class HHodoRaw : public HLocatedDataObject

Inheritance Chart:
TObject
<-
HLocatedDataObject
<-
HHodoRaw

    public:
HHodoRaw() HHodoRaw(const HHodoRaw&) ~HHodoRaw() static TClass* Class() void clear() Bool_t fill(const Int_t, const Int_t) Bool_t fill_lead(const Int_t time) Bool_t fill_trail(const Int_t time) Int_t getADC(const Int_t n) void getAddress(Int_t& m, Int_t& f) Int_t getFiber() const Int_t getMaxMult() Int_t getModule() const Int_t getNHits() const Int_t getTime(const Int_t n) const void getTimeAndADC(const Int_t n, Int_t& t, Int_t& a) void getTimeAndWidth(const Int_t, Int_t&, Int_t&) Int_t getWidth(const Int_t n) const virtual TClass* IsA() const HHodoRaw& operator=(const HHodoRaw&) void setAddress(const Int_t m, const Int_t f) void setFiber(Int_t f) void setModule(Int_t m) void setMult(Int_t mu) virtual void ShowMembers(TMemberInspector& insp, char* parent) virtual void Streamer(TBuffer& b) void StreamerNVirtual(TBuffer& b)

Data Members


    protected:
Int_t nHits number of hits Int_t module module number Int_t fiber fiber number Int_t time1 tdc time of 1st hit Int_t width1 width of 1st hit Int_t time2 tdc time of 2nd hit Int_t width2 width of 2nd hit Int_t time3 tdc time of 3rd hit Int_t width3 width of 3rd hit Int_t time4 tdc time of 4th hit Int_t width4 width of 4th hit

Class Description


 HHodoRaw

 Unpacked raw data of the Pion Hodoscopes

 The class accepts up to 4 hits per channel.
 The addresses of the fibers can be accessed via the inline functions
     void setModule(const Int_t)
     void setFiber(const Int_t)
     void setAddress(const Int_t module,const Int_t fiber)
     Int_t getModule(void) const
     Int_t getFiber(void) const
     void getAddress(Int_t& module,Int_t& fiber)
 and the number of hits with the inline function
     Int_t getNHits(void) const
 The inline function clear() sets the data members to the following values:
      nHits=0;
      module=fiber=time1=width1=time2=width2=time3=width3=time4=width4=-1;



Int_t getTime(const Int_t n) const
 Returns the time of the nth hit (1<=n<=4)

Int_t getWidth(const Int_t n) const
 Returns the width of the nth hit (1<=n<=4)

void getTimeAndWidth(const Int_t n, Int_t& time, Int_t& width )
 Returns the time and width of the nth hit (1<=n<=4)

Bool_t fill(const Int_t time,const Int_t width)
 Stores the given time and width in the next data element time* and width*
 and sets the multiplicity.
 Return kFALSE if 4 hits are already stored.

Bool_t fill_lead(const Int_t time)
 Stores the given time in the next data element time*
 and sets the multiplicity.
 Return kFALSE if 4 hits are already stored.

Bool_t fill_trail(const Int_t time)
 Calculates the time between trailing and LAST(!) leading hit.
 No other check if its really the right one,
 i am depending on the TDC to deliver the right order
 Return kFALSE if no leading yet or more than 4 Hits



Inline Functions


               void ~HHodoRaw()
           HHodoRaw HHodoRaw()
               void clear()
              Int_t getNHits() const
              Int_t getModule() const
              Int_t getFiber() const
               void getAddress(Int_t& m, Int_t& f)
              Int_t getADC(const Int_t n)
               void getTimeAndADC(const Int_t n, Int_t& t, Int_t& a)
               void setModule(Int_t m)
               void setFiber(Int_t f)
               void setMult(Int_t mu)
              Int_t getMaxMult()
               void setAddress(const Int_t m, const Int_t f)
            TClass* Class()
            TClass* IsA() const
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)
               void StreamerNVirtual(TBuffer& b)
           HHodoRaw HHodoRaw(const HHodoRaw&)
          HHodoRaw& operator=(const HHodoRaw&)


Last update: Fri Jan 26 11:56:12 2007


ROOT page - Class index - Class Hierarchy - 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.