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/RE02PSFlatSurfa 26 /// \file runAndEvent/RE02/src/RE02PSFlatSurfaceFlux.cc 27 /// \brief Implementation of the RE02PSFlatSur 27 /// \brief Implementation of the RE02PSFlatSurfaceFlux class 28 // 28 // 29 // 29 // 30 // 30 // 31 // RE02PSFlatSurfaceFlux 31 // RE02PSFlatSurfaceFlux 32 #include "RE02PSFlatSurfaceFlux.hh" 32 #include "RE02PSFlatSurfaceFlux.hh" 33 33 34 ////////////////////////////////////////////// 34 /////////////////////////////////////////////////////////////////////////////// 35 // 35 // 36 // The developement and research on this code 36 // The developement and research on this code is supported by Core Research 37 // for Evolutional Science and Technology (CRE 37 // for Evolutional Science and Technology (CREST) Program of Japan Science 38 // and Technology Corporation (JST). You may a 38 // and Technology Corporation (JST). You may acknowlege to JST and authers 39 // whenever you publish your results using thi 39 // whenever you publish your results using this code, as well as the Geant4 40 // collaboration. Both JST and authers remain 40 // collaboration. Both JST and authers remain to have a right to refuse to use 41 // this code for any case. 41 // this code for any case. 42 // Tsukasa Aso ( aso@toyama-cmt.ac.jp ) 42 // Tsukasa Aso ( aso@toyama-cmt.ac.jp ) 43 // Akinori Kimura ( AKimura@ashitech.ac.jp ) 43 // Akinori Kimura ( AKimura@ashitech.ac.jp ) 44 // 44 // 45 ////////////////////////////////////////////// 45 /////////////////////////////////////////////////////////////////////////////// 46 // (Description) 46 // (Description) 47 // This is a primitive scorer class for scor 47 // This is a primitive scorer class for scoring cell charge. 48 // The Cell Charge is defined by a sum of c 48 // The Cell Charge is defined by a sum of charge inside the cell 49 // which calculates the deposited charge in t 49 // which calculates the deposited charge in the cell. 50 // << 50 // 51 // << 51 // 52 // 52 // 53 // 53 // 54 // 54 // 55 // Created: 2006-06-20 Tsukasa ASO, Akinori K 55 // Created: 2006-06-20 Tsukasa ASO, Akinori Kimura. 56 // << 56 // 57 ////////////////////////////////////////////// 57 /////////////////////////////////////////////////////////////////////////////// 58 58 59 //....oooOO0OOooo........oooOO0OOooo........oo 59 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo...... 60 RE02PSFlatSurfaceFlux::RE02PSFlatSurfaceFlux(G << 60 RE02PSFlatSurfaceFlux::RE02PSFlatSurfaceFlux(G4String name, G4int direction, 61 G << 61 G4int nx, G4int ny, G4int nz) 62 : G4PSFlatSurfaceFlux(name, direction), fNx( << 62 :G4PSFlatSurfaceFlux(name,direction),fNx(nx),fNy(ny),fNz(nz) 63 { << 63 {;} 64 ; << 65 } << 66 64 67 //....oooOO0OOooo........oooOO0OOooo........oo 65 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo...... 68 RE02PSFlatSurfaceFlux::~RE02PSFlatSurfaceFlux( 66 RE02PSFlatSurfaceFlux::~RE02PSFlatSurfaceFlux() 69 { << 67 {;} 70 ; << 71 } << 72 68 73 //....oooOO0OOooo........oooOO0OOooo........oo 69 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo...... 74 G4int RE02PSFlatSurfaceFlux::GetIndex(G4Step* 70 G4int RE02PSFlatSurfaceFlux::GetIndex(G4Step* aStep) 75 { 71 { 76 const G4VTouchable* touchable = aStep->GetPr 72 const G4VTouchable* touchable = aStep->GetPreStepPoint()->GetTouchable(); 77 G4int ix = touchable->GetReplicaNumber(1); 73 G4int ix = touchable->GetReplicaNumber(1); 78 G4int iy = touchable->GetReplicaNumber(2); 74 G4int iy = touchable->GetReplicaNumber(2); 79 G4int iz = touchable->GetReplicaNumber(0); 75 G4int iz = touchable->GetReplicaNumber(0); 80 << 76 81 G4int tmp = fNy; 77 G4int tmp = fNy; 82 if (tmp) << 78 if (tmp) return iy*fNx*fNz+ix*fNz+iz; 83 return iy * fNx * fNz + ix * fNz + iz; << 79 else return iy*fNx*fNz+ix*fNz+iz; 84 else << 85 return iy * fNx * fNz + ix * fNz + iz; << 86 } 80 } 87 81