| 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 // G4WeightWindowAlgorithm implementation 26 // G4WeightWindowAlgorithm implementation
27 // 27 //
28 // Author: Michael Dressel (CERN), 2003 28 // Author: Michael Dressel (CERN), 2003
29 // ------------------------------------------- 29 // ----------------------------------------------------------------------
30 #include "G4WeightWindowAlgorithm.hh" 30 #include "G4WeightWindowAlgorithm.hh"
31 #include "Randomize.hh" 31 #include "Randomize.hh"
32 32
33 G4WeightWindowAlgorithm:: 33 G4WeightWindowAlgorithm::
34 G4WeightWindowAlgorithm(G4double upperLimitFac 34 G4WeightWindowAlgorithm(G4double upperLimitFactor,
35 G4double survivalFacto 35 G4double survivalFactor,
36 G4int maxNumberOfSplit 36 G4int maxNumberOfSplits)
37 : fUpperLimitFactor(upperLimitFactor), 37 : fUpperLimitFactor(upperLimitFactor),
38 fSurvivalFactor(survivalFactor), 38 fSurvivalFactor(survivalFactor),
39 fMaxNumberOfSplits(maxNumberOfSplits) 39 fMaxNumberOfSplits(maxNumberOfSplits)
40 { 40 {
41 } 41 }
42 42
43 G4WeightWindowAlgorithm::~G4WeightWindowAlgori << 43 G4WeightWindowAlgorithm::~G4WeightWindowAlgorithm()
>> 44 {
>> 45 }
44 46
45 G4Nsplit_Weight 47 G4Nsplit_Weight
46 G4WeightWindowAlgorithm::Calculate(G4double in 48 G4WeightWindowAlgorithm::Calculate(G4double init_w,
47 G4double lo 49 G4double lowerWeightBound) const
48 { 50 {
49 G4double survivalWeight = lowerWeightBound * 51 G4double survivalWeight = lowerWeightBound * fSurvivalFactor;
50 G4double upperWeight = lowerWeightBound * fU 52 G4double upperWeight = lowerWeightBound * fUpperLimitFactor;
51 53
52 // initialize return value for case weight i 54 // initialize return value for case weight in window
53 // 55 //
54 G4Nsplit_Weight nw; 56 G4Nsplit_Weight nw;
55 nw.fN = 1; 57 nw.fN = 1;
56 nw.fW = init_w; 58 nw.fW = init_w;
57 59
58 if (init_w > upperWeight) 60 if (init_w > upperWeight)
59 { 61 {
60 // splitting 62 // splitting
61 // 63 //
62 G4double temp_wi_ws = init_w/upperWeight; 64 G4double temp_wi_ws = init_w/upperWeight;
63 auto split_i = static_cast<G4int>(temp_wi << 65 G4int split_i = static_cast<G4int>(temp_wi_ws);
64 if(split_i != temp_wi_ws) { ++split_i; } 66 if(split_i != temp_wi_ws) { ++split_i; }
65 G4double wi_ws = init_w/split_i; 67 G4double wi_ws = init_w/split_i;
66 68
67 // values in case integer mode or in csae 69 // values in case integer mode or in csae of double
68 // mode and the lower number of splits wil 70 // mode and the lower number of splits will be diced
69 // 71 //
70 nw.fN = split_i; 72 nw.fN = split_i;
71 nw.fW = wi_ws; 73 nw.fW = wi_ws;
72 74
73 //TB if (wi_ws <= fMaxNumberOfSplits) { 75 //TB if (wi_ws <= fMaxNumberOfSplits) {
74 //TB if (wi_ws > int_wi_ws) { 76 //TB if (wi_ws > int_wi_ws) {
75 //TB // double mode 77 //TB // double mode
76 //TB G4double p2 = wi_ws - int_wi_ws; 78 //TB G4double p2 = wi_ws - int_wi_ws;
77 //TB G4double r = G4UniformRand(); 79 //TB G4double r = G4UniformRand();
78 //TB if (r<p2) { 80 //TB if (r<p2) {
79 //TB nw.fN = int_wi_ws + 1; 81 //TB nw.fN = int_wi_ws + 1;
80 //TB } 82 //TB }
81 //TB } 83 //TB }
82 //TB } 84 //TB }
83 //TB else { 85 //TB else {
84 //TB // fMaxNumberOfSplits < wi_ws 86 //TB // fMaxNumberOfSplits < wi_ws
85 //TB nw.fN = fMaxNumberOfSplits; 87 //TB nw.fN = fMaxNumberOfSplits;
86 //TB nw.fW = init_w/fMaxNumberOfSplits; 88 //TB nw.fW = init_w/fMaxNumberOfSplits;
87 //TB } 89 //TB }
88 90
89 } 91 }
90 else if (init_w < lowerWeightBound) // Russ 92 else if (init_w < lowerWeightBound) // Russian roulette
91 { 93 {
92 G4double wi_ws = init_w/survivalWeight; 94 G4double wi_ws = init_w/survivalWeight;
93 G4double p = std::max(wi_ws,1./fMaxNumberO 95 G4double p = std::max(wi_ws,1./fMaxNumberOfSplits);
94 G4double r = G4UniformRand(); 96 G4double r = G4UniformRand();
95 if (r<p) 97 if (r<p)
96 { 98 {
97 nw.fW = init_w/p; 99 nw.fW = init_w/p;
98 nw.fN = 1; 100 nw.fN = 1;
99 } 101 }
100 else 102 else
101 { 103 {
102 nw.fW = 0; 104 nw.fW = 0;
103 nw.fN = 0; 105 nw.fN = 0;
104 } 106 }
105 } 107 }
106 // else do nothing 108 // else do nothing
107 109
108 return nw; 110 return nw;
109 } 111 }
110 112
111 113