]> git.uio.no Git - u/mrichter/AliRoot.git/blame - EVGEN/AliGenReaderEcalHijing.cxx
Cleaning up warnings (Sun)
[u/mrichter/AliRoot.git] / EVGEN / AliGenReaderEcalHijing.cxx
CommitLineData
b152a071 1/**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
3 * *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
6 * *
7 * Permission to use, copy, modify and distribute this software and its *
8 * documentation strictly for non-commercial purposes is hereby granted *
9 * without fee, provided that the above copyright notice appears in all *
10 * copies and that both the copyright notice and this permission notice *
11 * appear in the supporting documentation. The authors make no claims *
12 * about the suitability of this software for any purpose. It is *
13 * provided "as is" without express or implied warranty. *
14 **************************************************************************/
15
88cb7938 16/* $Id$ */
93de1f83 17//
18// Realisation of AliGenReader to be used with AliGenExtFile
19// It reads Hijing events from a ntuple like event structure.
20// The event format is defined in Init()
21// NextEvent() is used to loop over events and NextParticle() to loop over particles.
22// Author: andreas.morsch@cern.ch
23//
b152a071 24#include <TFile.h>
b152a071 25#include <TParticle.h>
88cb7938 26#include <TTree.h>
27#include <TVirtualMC.h>
b152a071 28
29#include "AliGenReaderEcalHijing.h"
88cb7938 30
b152a071 31ClassImp(AliGenReaderEcalHijing)
32
33
34AliGenReaderEcalHijing::AliGenReaderEcalHijing()
35{
36// Default constructor
37 fNcurrent = 0;
38 fTreeNtuple = 0;
39}
40
41void AliGenReaderEcalHijing::Init()
42{
43//
44// reset the existing file environment and open a new root file if
45// the pointer to the Fluka tree is null
46
47 TFile *pFile=0;
48 if (!pFile) {
49 pFile = new TFile(fFileName);
50 pFile->cd();
51 printf("\n I have opened %s file \n", fFileName);
52 }
53// get the tree address in the Fluka boundary source file
54 fTreeNtuple = (TTree*)gDirectory->Get("h2");
55 TTree *h2=fTreeNtuple;
56 h2->SetMakeClass(1);
57//Set branch addresses
58 h2->SetBranchAddress("njatt", &fNjatt);
59 h2->SetBranchAddress("nahij", &fNahij);
60 h2->SetBranchAddress("nphij", &fNphij);
61 h2->SetBranchAddress("khij", fKhij) ;
62 h2->SetBranchAddress("pxhij", fPxhij);
63 h2->SetBranchAddress("pyhij", fPyhij);
64 h2->SetBranchAddress("pzhij", fPzhij);
65 h2->SetBranchAddress("ehij", fEhij) ;
66}
67
68Int_t AliGenReaderEcalHijing::NextEvent()
69{
70// Read the next event
58323221 71 Int_t nTracks=0, nread=0;
b152a071 72
73 TFile* pFile = fTreeNtuple->GetCurrentFile();
74 pFile->cd();
75
76 Int_t nentries = (Int_t) fTreeNtuple->GetEntries();
77 if (fNcurrent < nentries) {
78 Int_t nb = (Int_t)fTreeNtuple->GetEvent(fNcurrent);
79 nread += nb;
80 fNcurrent++;
81 printf("\n Next event contains %d tracks! \n", fNphij);
82 nTracks = fNphij;
83 fNparticle = 0;
84 return nTracks;
85 }
86 return 0;
87}
88
89TParticle* AliGenReaderEcalHijing::NextParticle()
90{
b152a071 91// Read the next particle
93de1f83 92
93 Float_t p[4];
b152a071 94 Int_t ipart = fKhij[fNparticle];
95 p[0] = fPxhij[fNparticle];
96 p[1] = fPyhij[fNparticle];
97 p[2] = fPzhij[fNparticle];
98 p[3] = fEhij[fNparticle];
99
100 Double_t amass = TDatabasePDG::Instance()->GetParticle(ipart)->Mass();
101
102 if(p[3] <= amass) {
103 Warning("Generate","Particle %d E = %f mass = %f \n",
104 ipart, p[3], amass);
105 }
106 TParticle* particle =
107 new TParticle(ipart, 0, -1, -1, -1, -1, p[0], p[1], p[2], p[3],
108 0., 0., 0., 0.);
109 fNparticle++;
110 return particle;
111}
112
113
114
115AliGenReaderEcalHijing& AliGenReaderEcalHijing::operator=(const AliGenReaderEcalHijing& rhs)
116{
117// Assignment operator
198bb1c7 118 rhs.Copy(*this);
119 return (*this);
120}
121
dc1d768c 122void AliGenReaderEcalHijing::Copy(TObject&) const
198bb1c7 123{
124 //
125 // Copy
126 //
127 Fatal("Copy","Not implemented!\n");
b152a071 128}
129
130
131
132
133
134