| 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 // G4MagIntegratorStepper inline methods imple << 26 // $Id: G4MagIntegratorStepper.icc 66356 2012-12-18 09:02:32Z gcosmo $
27 // 27 //
28 // Author: J.Apostolakis, CERN - 15.01.1997 <<
29 // ------------------------------------------- <<
30 28
31 inline 29 inline
32 G4int G4MagIntegratorStepper::IntegrationOrder <<
33 { <<
34 return fIntegrationOrder; <<
35 } <<
36 <<
37 inline <<
38 G4EquationOfMotion* G4MagIntegratorStepper::Ge 30 G4EquationOfMotion* G4MagIntegratorStepper::GetEquationOfMotion()
39 { 31 {
40 return fEquation_Rhs; << 32 return fEquation_Rhs;
41 } 33 }
42 34
43 inline << 35 inline void
44 const G4EquationOfMotion* G4MagIntegratorStepp << 36 G4MagIntegratorStepper::SetEquationOfMotion(G4EquationOfMotion* newEquation)
45 { <<
46 return fEquation_Rhs; <<
47 } <<
48 <<
49 inline <<
50 void G4MagIntegratorStepper::SetEquationOfMoti <<
51 { 37 {
52 if( newEq != nullptr ) << 38 if( newEquation != 0 )
53 { 39 {
54 fEquation_Rhs = newEq; << 40 fEquation_Rhs= newEquation;
55 } 41 }
56 } 42 }
57 43
58 inline 44 inline
59 unsigned long G4MagIntegratorStepper::GetfNoRH <<
60 { <<
61 return fNoRHSCalls; <<
62 } <<
63 <<
64 inline <<
65 void G4MagIntegratorStepper::ResetfNORHSCalls( <<
66 { <<
67 fNoRHSCalls = 0; <<
68 } <<
69 <<
70 inline <<
71 G4bool G4MagIntegratorStepper::IsFSAL() const <<
72 { <<
73 return fIsFSAL; <<
74 } <<
75 <<
76 inline <<
77 void G4MagIntegratorStepper::SetIntegrationOrd <<
78 { <<
79 fIntegrationOrder = order; <<
80 } <<
81 <<
82 inline <<
83 void G4MagIntegratorStepper::SetFSAL(G4bool fl <<
84 { <<
85 fIsFSAL = flag; <<
86 } <<
87 <<
88 inline <<
89 G4int G4MagIntegratorStepper::GetNumberOfVaria 45 G4int G4MagIntegratorStepper::GetNumberOfVariables() const
90 { 46 {
91 return fNoIntegrationVariables; 47 return fNoIntegrationVariables;
92 } 48 }
93 49
94 50
95 inline 51 inline
96 G4int G4MagIntegratorStepper::GetNumberOfState 52 G4int G4MagIntegratorStepper::GetNumberOfStateVariables() const
97 { 53 {
98 return fNoStateVariables; 54 return fNoStateVariables;
99 } 55 }
100 56
101 inline 57 inline
102 void G4MagIntegratorStepper::RightHandSide(con << 58 void G4MagIntegratorStepper::RightHandSide( const double y[], double dydx[] )
103 <<
104 { <<
105 fEquation_Rhs->RightHandSide(y, dydx); <<
106 ++fNoRHSCalls; // IncrementRHSCalls(); <<
107 } <<
108 <<
109 inline <<
110 void G4MagIntegratorStepper::RightHandSide(con <<
111 <<
112 <<
113 { 59 {
114 fEquation_Rhs->EvaluateRhsReturnB(y, dydx, f << 60 fEquation_Rhs-> RightHandSide(y, dydx);
115 ++fNoRHSCalls; <<
116 } 61 }
117 62
118 inline 63 inline
119 void G4MagIntegratorStepper::NormaliseTangentV 64 void G4MagIntegratorStepper::NormaliseTangentVector( G4double vec[6] )
120 { 65 {
121 G4double drds2 = vec[3]*vec[3]+vec[4]*vec[4] 66 G4double drds2 = vec[3]*vec[3]+vec[4]*vec[4]+vec[5]*vec[5];
122 67
123 if( std::fabs(drds2 - 1.0) > 1.e-14 ) 68 if( std::fabs(drds2 - 1.0) > 1.e-14 )
124 { 69 {
125 G4double normx = 1.0 / std::sqrt(drds2); 70 G4double normx = 1.0 / std::sqrt(drds2);
126 for(auto i=3; i<6; ++i) { vec[i] *= normx; << 71 for(G4int i=3;i<6;i++) { vec[i] *= normx; }
127 } 72 }
128 } 73 }
129 74
130 inline 75 inline
131 void G4MagIntegratorStepper::NormalisePolariza 76 void G4MagIntegratorStepper::NormalisePolarizationVector( G4double vec[12] )
132 { 77 {
133 G4double drds2 = vec[9]*vec[9]+vec[10]*vec[1 78 G4double drds2 = vec[9]*vec[9]+vec[10]*vec[10]+vec[11]*vec[11];
134 79
135 if( drds2 > 0. ) 80 if( drds2 > 0. )
136 { 81 {
137 if( std::fabs(drds2 - 1.0) > 1.e-14 ) 82 if( std::fabs(drds2 - 1.0) > 1.e-14 )
138 { 83 {
139 G4double normx = 1.0 / std::sqrt(drds2); 84 G4double normx = 1.0 / std::sqrt(drds2);
140 for(auto i=9; i<12; ++i) { vec[i] *= no << 85 for(G4int i=9;i<12;i++) { vec[i] *= normx; }
141 } 86 }
142 } 87 }
143 } 88 }
144 89