| Geant4 Cross Reference |
1 // 1
2 // *******************************************
3 // * License and Disclaimer
4 // *
5 // * The Geant4 software is copyright of th
6 // * the Geant4 Collaboration. It is provided
7 // * conditions of the Geant4 Software License
8 // * LICENSE and available at http://cern.ch/
9 // * include a list of copyright holders.
10 // *
11 // * Neither the authors of this software syst
12 // * institutes,nor the agencies providing fin
13 // * work make any representation or warran
14 // * regarding this software system or assum
15 // * use. Please see the license in the file
16 // * for the full disclaimer and the limitatio
17 // *
18 // * This code implementation is the result
19 // * technical work of the GEANT4 collaboratio
20 // * By using, copying, modifying or distri
21 // * any work based on the software) you ag
22 // * use in resulting scientific publicati
23 // * acceptance of all terms of the Geant4 Sof
24 // *******************************************
25 //
26 // Class G4VIntersectionLocator inline methods
27 //
28 // 27.10.07 - John Apostolakis, Tatiana Nikiti
29 // -------------------------------------------
30
31 inline G4double G4VIntersectionLocator::GetDel
32 {
33 return fiDeltaIntersection;
34 }
35
36 inline G4double G4VIntersectionLocator::GetEps
37 {
38 return fiEpsilonStep;
39 }
40
41 inline G4Navigator* G4VIntersectionLocator::Ge
42 {
43 return fiNavigator;
44 }
45
46 inline G4ChordFinder* G4VIntersectionLocator::
47 {
48 return fiChordFinder;
49 }
50
51 inline G4int G4VIntersectionLocator::GetVerbos
52 {
53 return fVerboseLevel;
54 }
55
56 inline G4bool G4VIntersectionLocator::GetAdjus
57 {
58 return fUseNormalCorrection;
59 }
60
61 inline void G4VIntersectionLocator::
62 AddAdjustementOfFoundIntersection(G4bool UseCo
63 {
64 fUseNormalCorrection = UseCorrection;
65 }
66
67 inline void G4VIntersectionLocator::SetEpsilon
68 {
69 fiEpsilonStep = EpsilonStep;
70 }
71
72 inline void G4VIntersectionLocator::
73 SetDeltaIntersectionFor( G4double deltaInterse
74 {
75 fiDeltaIntersection = deltaIntersection;
76 }
77
78 inline void G4VIntersectionLocator::SetNavigat
79 {
80 fiNavigator = fNavigator;
81 }
82
83 inline void G4VIntersectionLocator::SetChordFi
84 {
85 fiChordFinder = fCFinder;
86 }
87
88 inline void G4VIntersectionLocator::SetSafetyP
89 {
90 fiUseSafety = UseSafety;
91 }
92
93 inline void G4VIntersectionLocator::SetVerbose
94 {
95 fVerboseLevel = fVerbose;
96 }
97
98 inline G4bool
99 G4VIntersectionLocator::IntersectChord( const
100 const
101 G4doub
102 G4doub
103 G4Thre
104 G4doub
105 G4Thre
106 G4bool
107 {
108 G4bool CalledNavigator = false;
109
110 // Calculate the direction and length of the
111
112 G4ThreeVector ChordAB_Vector = EndPointB -
113 G4double ChordAB_Length = ChordAB_Vect
114 G4ThreeVector ChordAB_Dir = ChordAB_Vector.
115 G4bool intersects;
116 G4ThreeVector OriginShift = StartPointA - Pr
117 G4double MagSqShift = OriginShift.mag2() ;
118 G4double currentSafety;
119
120 if( MagSqShift >= sqr(PreviousSafety) )
121 {
122 currentSafety = 0.0 ;
123 }
124 else
125 {
126 currentSafety = PreviousSafety - std::sqrt
127 }
128
129 if( fiUseSafety && (ChordAB_Length <= curren
130 {
131 // The Step is guaranteed to be taken
132
133 LinearStepLength = ChordAB_Length;
134 intersects = false;
135 NewSafety = currentSafety;
136 CalledNavigator = false;
137 }
138 else
139 {
140 // Check whether any volumes are encounter
141
142 LinearStepLength = GetNavigatorFor()->Comp
143 ChordAB_Dir,
144 intersects = (LinearStepLength <= ChordAB_
145 // G4Navigator contracts to return k_in
146 // and it did not find a surface bounda
147
148 LinearStepLength = std::min( LinearStepLen
149 CalledNavigator = true;
150
151 // Save the last calculated safety!
152
153 PreviousSftOrigin = StartPointA;
154 PreviousSafety = NewSafety;
155
156 if( intersects )
157 {
158 // Intersection Point of chord AB and e
159 // or a
160 IntersectionPoint = StartPointA + Linea
161 }
162 }
163 if( ptrCalledNavigator != nullptr )
164 {
165 *ptrCalledNavigator = CalledNavigator;
166 }
167
168 return intersects;
169 }
170