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