//	$Id: BrZdcDig.cxx,v 1.1 2001/06/22 17:33:24 cholm Exp $
//
//	$Log: BrZdcDig.cxx,v $
//	Revision 1.1  2001/06/22 17:33:24  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.1.1.1  2001/06/21 14:55:01  hagel
//	Initial revision of brat2
//	
//	Revision 1.5  2000/03/21 21:22:49  cholm
//	Several changes: A few hacks where needed to compile on Digital Unix, noticably in my - Christian Holm - classes for the DB and Exceptions. Proberly still need to do something to some of Konstantins stuff. Also, I removed a lot of warnings fromt the compiler, by teddying up the code. Several places, old C-style indecies in for loops were assumed. Corrected. Unused variables have been commented out.
//	
//	Revision 1.4  1999/06/18 22:37:15  hagel
//	Various modifications to make read raw data
//	
//	Revision 1.3  1999/06/14 14:17:27  hagel
//	Cleanup
//
//	Revision 1.2  1999/06/08 22:24:23  hagel
//	A place holder that is sort of functional.  It is used on first ZDC data file
//
//	Revision 1.1  1999/06/01 21:13:22  hagel
//	Placeholder version copied from BB until real version comes
//
//
//	Brat Beam beam counter structure
//
//___________________
//
//	BrZdcDig
//
//  Copied from BrDigBB as a placeholder until M. Murray supplies "real one"
//  only names have been changed
//
//  Elementary objects for digitized BB information. They
//  constitute a simple class (like structures).
//  The class is implemented as inheriting from TObject. The main
//  reason for this is to have the capabilities of manipulating these
//	interactively within root.
//

#include "BrZdcDig.h"

#include <iostream.h>

ClassImp(BrZdcDig);

 Int_t BrZdcDig::Compare(TObject *digbb_p)
{
  // This routine overloads TObject::Compare(TObject *object)
  // For BRAHMS, this routine is typically called by QSort
  // It needs to return 1 if you want digtof_o to be earlier
  // in the list and -1 if you want digtof_o to be later in
  // the list.
  // I (fv) do not really know if we need this for BB.
  //
  // BrZdcDig * digbb = (BrZdcDig*) digbb_p;
  
  //if( fTubeNo > digbb->GetTubeNo() ) return 1;
  //if( fTubeNo < digbb->GetTubeNo() ) return -1;
  cout<< "Inside compare, need to implement!!!" <<endl;
  return 0;
}

 Int_t BrZdcDig::GetLeftAdc(const Int_t i) const {
if(i<kNumZDCChan) {
   return fLeftAdc[i];
   }
else return 0;
}
 Int_t BrZdcDig::GetLeftTdc(const Int_t i) const {
if(i<kNumZDCChan) {
   return fLeftTdc[i];
   }
else return 0;
}
 Int_t BrZdcDig::GetRightAdc(const Int_t i) const {
if(i<kNumZDCChan) {
   return fRightAdc[i];
   }
else return 0;
}

 Int_t BrZdcDig::GetRightTdc(const Int_t i) const {
if(i<kNumZDCChan) {
   return fRightTdc[i];
   }
else return 0;
}

 
 void BrZdcDig::SetLeftTdc(const Int_t itube,const Int_t time) {
if(itube<kNumZDCChan) {
   fLeftTdc[itube] = time;
   }
else return;
}
 void BrZdcDig::SetLeftAdc(const Int_t itube,const Int_t val) {
if(itube<kNumZDCChan) {
   fLeftAdc[itube] = val;
   }
else return;
}
 void BrZdcDig::SetRightTdc(const Int_t itube,const Int_t time) {
if(itube<kNumZDCChan) {
   fRightTdc[itube] = time;
   }
else return;
}
 void BrZdcDig::SetRightAdc(const Int_t itube,const Int_t val) {
if(itube<kNumZDCChan) {
   fRightAdc[itube] = val;
   }
else return;
}

 void BrZdcDig::List(){
  //
  // List the content of an object on cout
  //
/*
  cout << "Id       " << fId << "n";
  cout << " Tube No." << fTubeNo << "n";
  cout << " Adc     " << fAdc << "n";
  cout << " Tdc     " << fTdc  << "n";
  cout << flush;
*/  
}

Copyright ; 2002 BRAHMS Collaboration <brahmlib@rcf.rhic.bnl.gov>
Last Update on by

Validate HTML
Validate CSS