ROOT logo
//////////////////////////////////////////////////////////////////////////////
//
// $Id: $
//
//*-- Author  : RICH team member
//*-- Revised : Martin Jurkovic <martin.jurkovic@ph.tum.de> 2010
//
//_HADES_CLASS_DESCRIPTION
//////////////////////////////////////////////////////////////////////////////
//
//  HRichCalSim
//
//  cal class for simulated data.
//  contains OLD RICH :
//  fTrackIds[0]+fTrackIds[1] : index1-index2 range in HRichTrack category (indexes of the first and last track numbers)
//  fNofTracks = 2;
//  fEnergy = average energy of the photon hit per track
//
//  RICH700:
//  fTrackIds[10] : Geant track IDS
//  fNofTracks = number of trackIDs
//  fEnergy = 0;
//
//  isNewRich() returns kTRUE when filled by HRich700Digitizer
//
//////////////////////////////////////////////////////////////////////////////


#include "hrichcalsim.h"

#include "TBuffer.h"

ClassImp(HRichCalSim)

    HRichCalSim::HRichCalSim():
    HRichCal(),
    fNofTracks(0),
    fEnergy(0),
    fCt(0)
{
    initTrackIds();
}

HRichCalSim::HRichCalSim(Float_t ch) :
HRichCal(ch),
fNofTracks(0),
fEnergy(0),
fCt(0)
{
    initTrackIds();
}

HRichCalSim::HRichCalSim(Int_t s, Int_t r, Int_t c):
HRichCal(s, c, r),
fNofTracks(0),
fEnergy(0),
fCt(0)
{
    initTrackIds();
}

void HRichCalSim::initTrackIds()
{
    for (Int_t i = 0; i < NMAXTRACKS; i++) {
	fTrackIds[i] = -1;
    }
}

Bool_t HRichCalSim::checkTrackId(Int_t trackId)
{
    // check that trackId is not added
    // kTRUE : track is already in the list of tracks
    // kFALSE : track is not in the list of tracks
    for (Int_t i = 0; i < fNofTracks; i++) {
	if (fTrackIds[i] == trackId) return kTRUE;
    }
    return kFALSE;
}

void HRichCalSim::addTrackId(Int_t trackId)
{
    // store trackId for one richCal
    // use checkTrackId(Int_t trackId) to cekc if the
    // track is in the list of tracks already
    for (Int_t i = 0; i < fNofTracks; i++) {
	if (fTrackIds[i] == trackId) return;
    }
    if (fNofTracks >= NMAXTRACKS) return;
    fTrackIds[fNofTracks] = trackId;
    fNofTracks++;
}


Int_t HRichCalSim::getTrackId(Int_t index)
{
    if (index >= fNofTracks || index < 0 ) return -1;
    return fTrackIds[index];
}


void HRichCalSim::Streamer(TBuffer &R__b)
{
   // Stream an object of class HRichCalSim.

   UInt_t R__s, R__c;
   if (R__b.IsReading()) {
      Version_t R__v = R__b.ReadVersion(&R__s, &R__c); if (R__v) { }
      HRichCal::Streamer(R__b);

      if(R__v > 1){ // RICH700 format
	  R__b.ReadStaticArray((int*)fTrackIds);
          R__b >> fNofTracks;
      } else  {
	  initTrackIds() ;
	  fNofTracks = 0;
      }
      if(R__v == 1){ // RICH format
	  Int_t   fTrack1;
	  Int_t   fTrack2;

          R__b >> fTrack1;
	  R__b >> fTrack2;

          fTrackIds[0] = fTrack1;
          fTrackIds[1] = fTrack2;
	  fNofTracks = 2;
      }
      R__b >> fEnergy;


      R__b.CheckByteCount(R__s, R__c, HRichCalSim::IsA());
   } else {
      R__c = R__b.WriteVersion(HRichCalSim::IsA(), kTRUE);
      HRichCal::Streamer(R__b);
      R__b.WriteArray(fTrackIds, NMAXTRACKS);
      R__b << fNofTracks;
      R__b << fEnergy;
      R__b.SetByteCount(R__c, kTRUE);
   }
}



 hrichcalsim.cc:1
 hrichcalsim.cc:2
 hrichcalsim.cc:3
 hrichcalsim.cc:4
 hrichcalsim.cc:5
 hrichcalsim.cc:6
 hrichcalsim.cc:7
 hrichcalsim.cc:8
 hrichcalsim.cc:9
 hrichcalsim.cc:10
 hrichcalsim.cc:11
 hrichcalsim.cc:12
 hrichcalsim.cc:13
 hrichcalsim.cc:14
 hrichcalsim.cc:15
 hrichcalsim.cc:16
 hrichcalsim.cc:17
 hrichcalsim.cc:18
 hrichcalsim.cc:19
 hrichcalsim.cc:20
 hrichcalsim.cc:21
 hrichcalsim.cc:22
 hrichcalsim.cc:23
 hrichcalsim.cc:24
 hrichcalsim.cc:25
 hrichcalsim.cc:26
 hrichcalsim.cc:27
 hrichcalsim.cc:28
 hrichcalsim.cc:29
 hrichcalsim.cc:30
 hrichcalsim.cc:31
 hrichcalsim.cc:32
 hrichcalsim.cc:33
 hrichcalsim.cc:34
 hrichcalsim.cc:35
 hrichcalsim.cc:36
 hrichcalsim.cc:37
 hrichcalsim.cc:38
 hrichcalsim.cc:39
 hrichcalsim.cc:40
 hrichcalsim.cc:41
 hrichcalsim.cc:42
 hrichcalsim.cc:43
 hrichcalsim.cc:44
 hrichcalsim.cc:45
 hrichcalsim.cc:46
 hrichcalsim.cc:47
 hrichcalsim.cc:48
 hrichcalsim.cc:49
 hrichcalsim.cc:50
 hrichcalsim.cc:51
 hrichcalsim.cc:52
 hrichcalsim.cc:53
 hrichcalsim.cc:54
 hrichcalsim.cc:55
 hrichcalsim.cc:56
 hrichcalsim.cc:57
 hrichcalsim.cc:58
 hrichcalsim.cc:59
 hrichcalsim.cc:60
 hrichcalsim.cc:61
 hrichcalsim.cc:62
 hrichcalsim.cc:63
 hrichcalsim.cc:64
 hrichcalsim.cc:65
 hrichcalsim.cc:66
 hrichcalsim.cc:67
 hrichcalsim.cc:68
 hrichcalsim.cc:69
 hrichcalsim.cc:70
 hrichcalsim.cc:71
 hrichcalsim.cc:72
 hrichcalsim.cc:73
 hrichcalsim.cc:74
 hrichcalsim.cc:75
 hrichcalsim.cc:76
 hrichcalsim.cc:77
 hrichcalsim.cc:78
 hrichcalsim.cc:79
 hrichcalsim.cc:80
 hrichcalsim.cc:81
 hrichcalsim.cc:82
 hrichcalsim.cc:83
 hrichcalsim.cc:84
 hrichcalsim.cc:85
 hrichcalsim.cc:86
 hrichcalsim.cc:87
 hrichcalsim.cc:88
 hrichcalsim.cc:89
 hrichcalsim.cc:90
 hrichcalsim.cc:91
 hrichcalsim.cc:92
 hrichcalsim.cc:93
 hrichcalsim.cc:94
 hrichcalsim.cc:95
 hrichcalsim.cc:96
 hrichcalsim.cc:97
 hrichcalsim.cc:98
 hrichcalsim.cc:99
 hrichcalsim.cc:100
 hrichcalsim.cc:101
 hrichcalsim.cc:102
 hrichcalsim.cc:103
 hrichcalsim.cc:104
 hrichcalsim.cc:105
 hrichcalsim.cc:106
 hrichcalsim.cc:107
 hrichcalsim.cc:108
 hrichcalsim.cc:109
 hrichcalsim.cc:110
 hrichcalsim.cc:111
 hrichcalsim.cc:112
 hrichcalsim.cc:113
 hrichcalsim.cc:114
 hrichcalsim.cc:115
 hrichcalsim.cc:116
 hrichcalsim.cc:117
 hrichcalsim.cc:118
 hrichcalsim.cc:119
 hrichcalsim.cc:120
 hrichcalsim.cc:121
 hrichcalsim.cc:122
 hrichcalsim.cc:123
 hrichcalsim.cc:124
 hrichcalsim.cc:125
 hrichcalsim.cc:126
 hrichcalsim.cc:127
 hrichcalsim.cc:128
 hrichcalsim.cc:129
 hrichcalsim.cc:130
 hrichcalsim.cc:131
 hrichcalsim.cc:132
 hrichcalsim.cc:133
 hrichcalsim.cc:134
 hrichcalsim.cc:135
 hrichcalsim.cc:136
 hrichcalsim.cc:137
 hrichcalsim.cc:138
 hrichcalsim.cc:139
 hrichcalsim.cc:140
 hrichcalsim.cc:141
 hrichcalsim.cc:142
 hrichcalsim.cc:143