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