| Geant4 Cross Reference |
1 //
2 // ********************************************************************
3 // * License and Disclaimer *
4 // * *
5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. *
10 // * *
11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitation of liability. *
17 // * *
18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Software license. *
24 // ********************************************************************
25 //
26 /// \file runAndEvent/RE02/src/RE02PSNofStep.cc
27 /// \brief Implementation of the RE02PSNofStep class
28 //
29 //
30 //
31 // RE02PSNofStep
32 #include "RE02PSNofStep.hh"
33
34 ///////////////////////////////////////////////////////////////////////////////
35 //
36 // The developement and research on this code is supported by Core Research
37 // for Evolutional Science and Technology (CREST) Program of Japan Science
38 // and Technology Corporation (JST). You may acknowlege to JST and authers
39 // whenever you publish your results using this code, as well as the Geant4
40 // collaboration. Both JST and authers remain to have a right to refuse to use
41 // this code for any case.
42 // Tsukasa Aso ( aso@toyama-cmt.ac.jp )
43 // Akinori Kimura ( AKimura@ashitech.ac.jp )
44 //
45 ///////////////////////////////////////////////////////////////////////////////
46 // (Description)
47 // This is a primitive scorer class for scoring cell charge.
48 // The Cell Charge is defined by a sum of charge inside the cell
49 // which calculates the deposited charge in the cell.
50 //
51 //
52 //
53 //
54 //
55 // Created: 2006-06-20 Tsukasa ASO, Akinori Kimura.
56 //
57 ///////////////////////////////////////////////////////////////////////////////
58
59 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
60 RE02PSNofStep::RE02PSNofStep(G4String name, G4int nx, G4int ny, G4int nz)
61 : G4PSNofStep(name), fNx(nx), fNy(ny), fNz(nz)
62 {
63 ;
64 }
65
66 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
67 RE02PSNofStep::~RE02PSNofStep()
68 {
69 ;
70 }
71
72 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
73 G4int RE02PSNofStep::GetIndex(G4Step* aStep)
74 {
75 const G4VTouchable* touchable = aStep->GetPreStepPoint()->GetTouchable();
76 G4int ix = touchable->GetReplicaNumber(1);
77 G4int iy = touchable->GetReplicaNumber(2);
78 G4int iz = touchable->GetReplicaNumber(0);
79
80 G4int tmp = fNy;
81 if (tmp)
82 return iy * fNx * fNz + ix * fNz + iz;
83 else
84 return iy * fNx * fNz + ix * fNz + iz;
85 }
86