//-*-mode:c++-*- // $Id: BrTpcSequence.h,v 1.3 2001/07/06 10:11:45 pchristi Exp $ // $Author: pchristi $ // $Date: 2001/07/06 10:11:45 $ // #ifndef BRAT_TPCSequence #define BRAT_TPCSequence // // // ROOT defines // #ifndef ROOT_TObject #include "TObject.h" #endif // // Brat Includes // class BrTpcSequence : public TObject { public: BrTpcSequence(); BrTpcSequence(int); BrTpcSequence( const BrTpcSequence&); virtual ~BrTpcSequence(); Int_t Compare(TObject *BrTpcSequence); Int_t Compare(const TObject *BrTpcSequence) const; Short_t* GetSequence() {return fAdc;} Short_t GetAdc(Int_t i) const; Int_t GetClustNum() const {return fClustNum;} Int_t GetRow() const {return (Int_t) fRow;} Int_t GetPad() const {return (Int_t) fPad;} Int_t GetTime() const {return (Int_t) fTime;} Bool_t IsSortable() const {return kTRUE;} Bool_t IsEqual(TObject *obj); // Determines if 2 sequences are equal Bool_t IsEqual(const TObject *obj) const; // Determines if 2 sequences are equal virtual void Print(Option_t* option="B") const; // *MENU* void SetAdc(int i, Short_t value); void SetClustNum(Int_t value) {fClustNum=value;} void SetPad(Short_t value) { fPad = value;} void SetRow(Short_t value) { fRow = value;} void SetTime(Short_t value) { fTime = value;} Int_t GetNseq(){return (Int_t) fNseq;} private: //Short_t fNseq; // number of time bins in the sequence Int_t fNseq; // number of time bins in the sequence Short_t fRow; // padrow number for this sequence (1-based) Short_t fPad; // pad number for this sequence (0-based) Short_t fTime; // time bin for first adc value (0-based) Short_t* fAdc; //[fNseq] array of ADC values. Int_t fClustNum; //! clusternumber used by cluster algorithm- not stored. public: ClassDef(BrTpcSequence,2) // BRAHMS TPC digitized time sequence object }; #endif //////////////////////////////////////////////////////////////////// // // $Log: BrTpcSequence.h,v $ // Revision 1.3 2001/07/06 10:11:45 pchristi // Added Print method and made GetAdc(index) const // // Revision 1.2 2001/06/26 18:48:09 ejkim // Changed fNseq to be Int_t; needed by ROOT streamer. // // Revision 1.1 2001/06/22 17:33:22 cholm // Change names so that every data class has the same format so that // we have that down from the very beginning, so that we will not have to // worry about that later on. The // affected classes are: // // BrDigBB -> BrBbDig // BrDigZDC -> BrZdcDig // BrDigRHIC -> BrRichDig // BrDigDC -> BrDcDig // BrDigC1 -> BrDcC1 // BrDigHit -> BrHitDig // BrDigTof -> BrTofDig // BrTPCSequence -> BrTpcSequence // // Revision 1.2 2001/06/22 11:09:09 cholm // Bumped version number for schema evolution. // // Revision 1.1.1.1 2001/06/21 14:55:01 hagel // Initial revision of brat2 // // Revision 1.9 2001/06/17 17:20:27 pchristi // Added print method, comments, and changed fBuild to non-persistent in cluster. // GetAdc() in sequence now returns Short_t. // // Revision 1.8 2001/04/14 22:19:45 videbaek // added const methods for Compare, Isequal // // Revision 1.7 2000/10/02 17:07:36 pchristi // Cleaned up headers and source files in the tpc dir // // Revision 1.6 2000/10/02 12:34:57 pchristi // Update of the clustering algorithm and related classes. // // Revision 1.5 2000/08/28 00:17:43 videbaek // Mostly moved CVS log information to end of header files. Other changes // documenter in message to listserver August 26. // // Revision 1.4 2000/03/08 20:17:55 videbaek // Change clustering algorithms by adding a new method. BrTPCCluster is redefined. // Tracking reorganized with updates by Alv, Peter and Flemming // // Revision 1.3 1999/02/25 14:52:54 videbaek // Inserted code for using BrTPCSequnece instead of BrDigTPC for both // TPC digitization and the TPC local track reconstruction. // // Revision 1.2 1999/02/11 15:19:26 hagel // Changes to make compile under Solaris // // Revision 1.1 1999/01/28 21:27:31 videbaek // Added BrTPSSqquences to libraries. Not yet in use, though. Expected to // replace BrDigTPC objects // Added cvs flags