#ifndef HHODORAW_H
#define HHODORAW_H

#include "hlocateddataobject.h"

class HHodoRaw : public HLocatedDataObject {
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
public:
  HHodoRaw(void) {clear();}
  ~HHodoRaw(void) {}
  void clear(void) {
    nHits=0;
    module=fiber=time1=width1=time2=width2=time3=width3=time4=width4=-1;
  } 
  Int_t getNHits(void) const { return nHits; }
  Int_t getModule(void) const {return module;}  
  Int_t getFiber(void) const {return fiber;}  
  void getAddress(Int_t& m,Int_t& f) {
      m=module;
      f=fiber;
  }
  Int_t getTime(const Int_t n) const;
  Int_t getWidth(const Int_t n) const;
  inline Int_t getADC(const Int_t n){return(getWidth(n));}// Alias for getWidth
  void getTimeAndWidth(const Int_t,Int_t&,Int_t&);
  inline void getTimeAndADC(const Int_t n,Int_t &t,Int_t &a){getTimeAndWidth(n,t,a);};// Alias for getTimeAndWidth
  void setModule(Int_t m) {module=m;}
  void setFiber(Int_t f) {fiber=f;}
  void setMult(Int_t mu) {nHits=mu;}// use fill and fill_l/t and multiplicity will always be correct
  inline Int_t getMaxMult(void){ return(4);}// return number of multiplicity supported (constant)
  void setAddress(const Int_t m,const Int_t f) {
    module=m;
    fiber=f;
  }
  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);

  ClassDef(HHodoRaw,1) // Raw data of Pion Hodoscopes
};

#endif /* !HHODORAW_H */

Last change: Sat May 22 12:57:35 2010
Last generated: 2010-05-22 12:57

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.