| 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 // 26 //
>> 27 // $Id: G4PSNofStep3D.cc 67992 2013-03-13 10:59:57Z gcosmo $
27 // 28 //
28 // G4PSNofStep3D 29 // G4PSNofStep3D
29 #include "G4PSNofStep3D.hh" 30 #include "G4PSNofStep3D.hh"
30 31
31 ////////////////////////////////////////////// 32 ///////////////////////////////////////////////////////////////////////////////
32 // (Description) 33 // (Description)
33 // This is a primitive scorer class for scor 34 // This is a primitive scorer class for scoring Number of Steps in the cell.
34 // 35 //
35 // Created: 2007-08-14 Tsukasa ASO 36 // Created: 2007-08-14 Tsukasa ASO
36 // 37 //
37 ////////////////////////////////////////////// 38 ///////////////////////////////////////////////////////////////////////////////
38 39
39 G4PSNofStep3D::G4PSNofStep3D(const G4String& n << 40 G4PSNofStep3D::G4PSNofStep3D(G4String name,
40 G4int depi, G4int << 41 G4int ni, G4int nj, G4int nk,
41 : G4PSNofStep(name) << 42 G4int depi, G4int depj, G4int depk)
42 , fDepthi(depi) << 43 :G4PSNofStep(name),
43 , fDepthj(depj) << 44 fDepthi(depi),fDepthj(depj),fDepthk(depk)
44 , fDepthk(depk) <<
45 { 45 {
46 SetNijk(ni, nj, nk); << 46 fNi=ni;
>> 47 fNj=nj;
>> 48 fNk=nk;
47 } 49 }
48 50
>> 51 G4PSNofStep3D::~G4PSNofStep3D()
>> 52 {;}
>> 53
49 G4int G4PSNofStep3D::GetIndex(G4Step* aStep) 54 G4int G4PSNofStep3D::GetIndex(G4Step* aStep)
50 { 55 {
51 const G4VTouchable* touchable = aStep->GetPr 56 const G4VTouchable* touchable = aStep->GetPreStepPoint()->GetTouchable();
52 G4int i = touchable->G << 57 G4int i = touchable->GetReplicaNumber(fDepthi);
53 G4int j = touchable->G << 58 G4int j = touchable->GetReplicaNumber(fDepthj);
54 G4int k = touchable->G << 59 G4int k = touchable->GetReplicaNumber(fDepthk);
55 << 60
56 return i * fNj * fNk + j * fNk + k; << 61 return i*fNj*fNk+j*fNk+k;
57 } 62 }
58 63