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