Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/geometry/management/include/G4NavigationHistory.icc

Version: [ ReleaseNotes ] [ 1.0 ] [ 1.1 ] [ 2.0 ] [ 3.0 ] [ 3.1 ] [ 3.2 ] [ 4.0 ] [ 4.0.p1 ] [ 4.0.p2 ] [ 4.1 ] [ 4.1.p1 ] [ 5.0 ] [ 5.0.p1 ] [ 5.1 ] [ 5.1.p1 ] [ 5.2 ] [ 5.2.p1 ] [ 5.2.p2 ] [ 6.0 ] [ 6.0.p1 ] [ 6.1 ] [ 6.2 ] [ 6.2.p1 ] [ 6.2.p2 ] [ 7.0 ] [ 7.0.p1 ] [ 7.1 ] [ 7.1.p1 ] [ 8.0 ] [ 8.0.p1 ] [ 8.1 ] [ 8.1.p1 ] [ 8.1.p2 ] [ 8.2 ] [ 8.2.p1 ] [ 8.3 ] [ 8.3.p1 ] [ 8.3.p2 ] [ 9.0 ] [ 9.0.p1 ] [ 9.0.p2 ] [ 9.1 ] [ 9.1.p1 ] [ 9.1.p2 ] [ 9.1.p3 ] [ 9.2 ] [ 9.2.p1 ] [ 9.2.p2 ] [ 9.2.p3 ] [ 9.2.p4 ] [ 9.3 ] [ 9.3.p1 ] [ 9.3.p2 ] [ 9.4 ] [ 9.4.p1 ] [ 9.4.p2 ] [ 9.4.p3 ] [ 9.4.p4 ] [ 9.5 ] [ 9.5.p1 ] [ 9.5.p2 ] [ 9.6 ] [ 9.6.p1 ] [ 9.6.p2 ] [ 9.6.p3 ] [ 9.6.p4 ] [ 10.0 ] [ 10.0.p1 ] [ 10.0.p2 ] [ 10.0.p3 ] [ 10.0.p4 ] [ 10.1 ] [ 10.1.p1 ] [ 10.1.p2 ] [ 10.1.p3 ] [ 10.2 ] [ 10.2.p1 ] [ 10.2.p2 ] [ 10.2.p3 ] [ 10.3 ] [ 10.3.p1 ] [ 10.3.p2 ] [ 10.3.p3 ] [ 10.4 ] [ 10.4.p1 ] [ 10.4.p2 ] [ 10.4.p3 ] [ 10.5 ] [ 10.5.p1 ] [ 10.6 ] [ 10.6.p1 ] [ 10.6.p2 ] [ 10.6.p3 ] [ 10.7 ] [ 10.7.p1 ] [ 10.7.p2 ] [ 10.7.p3 ] [ 10.7.p4 ] [ 11.0 ] [ 11.0.p1 ] [ 11.0.p2 ] [ 11.0.p3, ] [ 11.0.p4 ] [ 11.1 ] [ 11.1.1 ] [ 11.1.2 ] [ 11.1.3 ] [ 11.2 ] [ 11.2.1 ] [ 11.2.2 ] [ 11.3.0 ]

  1 //
  2 // ********************************************************************
  3 // * License and Disclaimer                                           *
  4 // *                                                                  *
  5 // * The  Geant4 software  is  copyright of the Copyright Holders  of *
  6 // * the Geant4 Collaboration.  It is provided  under  the terms  and *
  7 // * conditions of the Geant4 Software License,  included in the file *
  8 // * LICENSE and available at  http://cern.ch/geant4/license .  These *
  9 // * include a list of copyright holders.                             *
 10 // *                                                                  *
 11 // * Neither the authors of this software system, nor their employing *
 12 // * institutes,nor the agencies providing financial support for this *
 13 // * work  make  any representation or  warranty, express or implied, *
 14 // * regarding  this  software system or assume any liability for its *
 15 // * use.  Please see the license in the file  LICENSE  and URL above *
 16 // * for the full disclaimer and the limitation of liability.         *
 17 // *                                                                  *
 18 // * This  code  implementation is the result of  the  scientific and *
 19 // * technical work of the GEANT4 collaboration.                      *
 20 // * By using,  copying,  modifying or  distributing the software (or *
 21 // * any work based  on the software)  you  agree  to acknowledge its *
 22 // * use  in  resulting  scientific  publications,  and indicate your *
 23 // * acceptance of all terms of the Geant4 Software license.          *
 24 // ********************************************************************
 25 //
 26 // class G4NavigationHistory Inline implementation
 27 //
 28 // ----------------------------------------------------------------------
 29 
 30 extern G4GEOM_DLL G4Allocator<G4NavigationHistory>*& aNavigHistoryAllocator();
 31 
 32 // There is no provision that this class is subclassed.
 33 // If it is subclassed & new data members are added then the
 34 // following "new" & "delete" will fail and give errors. 
 35 //
 36 inline
 37 void* G4NavigationHistory::operator new(std::size_t)
 38 {
 39   if (aNavigHistoryAllocator() == nullptr)
 40   {
 41     aNavigHistoryAllocator() = new G4Allocator<G4NavigationHistory>;
 42   }
 43   return (void *) aNavigHistoryAllocator()->MallocSingle();
 44 }
 45 
 46 inline
 47 void G4NavigationHistory::operator delete(void *aHistory)
 48 {
 49   aNavigHistoryAllocator()->FreeSingle((G4NavigationHistory *) aHistory);
 50 }
 51 
 52 inline
 53 G4NavigationHistory&
 54 G4NavigationHistory::operator=(const G4NavigationHistory &h)
 55 {
 56   if (&h == this)  { return *this; }
 57 
 58   // *fNavHistory=*(h.fNavHistory);   // This works, but is very slow.
 59 
 60   if( GetMaxDepth() != h.GetMaxDepth() )
 61   {
 62     fNavHistory->resize( h.GetMaxDepth() );
 63   }
 64 
 65   for ( auto  ilev=G4int(h.fStackDepth); ilev>=0; --ilev )
 66   { 
 67     (*fNavHistory)[ilev] = (*h.fNavHistory)[ilev];
 68   }
 69   fStackDepth = h.fStackDepth;
 70 
 71   return *this;
 72 }
 73 
 74 inline
 75 void G4NavigationHistory::Reset()
 76 {
 77   fStackDepth=0;
 78 }
 79 
 80 inline
 81 void G4NavigationHistory::Clear()
 82 {
 83   G4AffineTransform origin(G4ThreeVector(0.,0.,0.));
 84   G4NavigationLevel tmpNavLevel = G4NavigationLevel(nullptr, origin, kNormal, -1) ;
 85 
 86   Reset();
 87   for (auto  ilev=G4long(fNavHistory->size()-1); ilev>=0; --ilev)
 88   {
 89      (*fNavHistory)[ilev] = tmpNavLevel;
 90   }
 91 }
 92 
 93 inline
 94 void G4NavigationHistory::SetFirstEntry(G4VPhysicalVolume* pVol)
 95 {
 96   G4ThreeVector translation(0.,0.,0.);
 97   G4int copyNo = -1;
 98 
 99   // Protection needed in case pVol=null 
100   // so that a touchable-history can signal OutOfWorld 
101   //
102   if( pVol != nullptr )
103   {
104     translation = pVol->GetTranslation();
105     copyNo = pVol->GetCopyNo();
106   }
107   (*fNavHistory)[0] =
108     G4NavigationLevel( pVol, G4AffineTransform(translation), kNormal, copyNo );
109 }
110 
111 inline
112 const G4AffineTransform* G4NavigationHistory::GetPtrTopTransform() const
113 {
114   return (*fNavHistory)[fStackDepth].GetPtrTransform();
115 }
116 
117 inline
118 const G4AffineTransform& G4NavigationHistory::GetTopTransform() const
119 {
120   return (*fNavHistory)[fStackDepth].GetTransform();
121 }
122 
123 inline
124 G4int G4NavigationHistory::GetTopReplicaNo() const
125 {
126   return (*fNavHistory)[fStackDepth].GetReplicaNo();
127 }
128 
129 inline
130 EVolume G4NavigationHistory::GetTopVolumeType() const
131 {
132   return (*fNavHistory)[fStackDepth].GetVolumeType();
133 }
134 
135 inline
136 G4VPhysicalVolume* G4NavigationHistory::GetTopVolume() const
137 {
138   return (*fNavHistory)[fStackDepth].GetPhysicalVolume();
139 }
140 
141 inline
142 std::size_t G4NavigationHistory::GetDepth() const
143 {
144   return fStackDepth;
145 }
146 
147 inline
148 const G4AffineTransform&
149 G4NavigationHistory::GetTransform(G4int n) const
150 {
151   return (*fNavHistory)[n].GetTransform();
152 }
153 
154 inline
155 G4int G4NavigationHistory::GetReplicaNo(G4int n) const
156 {
157   return (*fNavHistory)[n].GetReplicaNo();
158 }
159 
160 inline
161 EVolume G4NavigationHistory::GetVolumeType(G4int n) const
162 {
163   return (*fNavHistory)[n].GetVolumeType();
164 }
165 
166 inline
167 G4VPhysicalVolume* G4NavigationHistory::GetVolume(G4int n) const
168 {
169   return (*fNavHistory)[n].GetPhysicalVolume();
170 }
171 
172 inline
173 std::size_t G4NavigationHistory::GetMaxDepth() const
174 {
175   return fNavHistory->size();
176 }
177 
178 inline
179 void G4NavigationHistory::BackLevel()
180 {
181   assert( fStackDepth>0 );
182 
183   // Tell  the  level  that I am forgetting it
184   // delete (*fNavHistory)[fStackDepth];
185   //
186   --fStackDepth;
187 }
188 
189 inline
190 void G4NavigationHistory::BackLevel(G4int n)
191 {
192   assert( n<=G4int(fStackDepth) );
193   fStackDepth-=n;
194 }
195 
196 inline
197 void G4NavigationHistory::EnlargeHistory()
198 {
199   std::size_t len = fNavHistory->size();
200   if ( len == fStackDepth )
201   {
202     // Note: Resize operation clears additional entries
203     //
204     std::size_t nlen = len+kHistoryStride;
205     fNavHistory->resize(nlen);
206   }  
207 }
208 
209 
210 inline
211 void G4NavigationHistory::NewLevel( G4VPhysicalVolume* pNewMother,
212                                     EVolume vType,
213                                     G4int nReplica )
214 {
215   ++fStackDepth;
216   EnlargeHistory();  // Enlarge if required
217   (*fNavHistory)[fStackDepth] =
218     G4NavigationLevel( pNewMother, 
219                        (*fNavHistory)[fStackDepth-1].GetTransform(),
220                        G4AffineTransform(pNewMother->GetRotation(),
221                        pNewMother->GetTranslation()),
222                        vType,
223                        nReplica ); 
224   // The constructor computes the new global->local transform
225 }
226