2 // ********************************************************************
3 // * License and Disclaimer *
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. *
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. *
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 // ********************************************************************
27 // $Id: G4NavigationHistory.icc 86527 2014-11-13 15:06:24Z gcosmo $
30 // class G4NavigationHistory Inline implementation
32 // ----------------------------------------------------------------------
34 extern G4GEOM_DLL G4ThreadLocal
35 G4Allocator<G4NavigationHistory> *aNavigHistoryAllocator;
37 // There is no provision that this class is subclassed.
38 // If it is subclassed & new data members are added then the
39 // following "new" & "delete" will fail and give errors.
42 void* G4NavigationHistory::operator new(size_t)
44 if (!aNavigHistoryAllocator)
46 aNavigHistoryAllocator = new G4Allocator<G4NavigationHistory>;
48 return (void *) aNavigHistoryAllocator->MallocSingle();
52 void G4NavigationHistory::operator delete(void *aHistory)
54 aNavigHistoryAllocator->FreeSingle((G4NavigationHistory *) aHistory);
59 G4NavigationHistory::operator=(const G4NavigationHistory &h)
61 if (&h == this) { return *this; }
63 // *fNavHistory=*(h.fNavHistory); // This works, but is very slow.
65 if( GetMaxDepth() != h.GetMaxDepth() )
67 fNavHistory->resize( h.GetMaxDepth() );
70 for ( G4int ilev=h.fStackDepth; ilev>=0; --ilev )
72 (*fNavHistory)[ilev] = (*h.fNavHistory)[ilev];
74 fStackDepth=h.fStackDepth;
80 void G4NavigationHistory::Reset()
86 void G4NavigationHistory::Clear()
88 G4AffineTransform origin(G4ThreeVector(0.,0.,0.));
89 G4NavigationLevel tmpNavLevel = G4NavigationLevel(0, origin, kNormal, -1) ;
92 for (G4int ilev=fNavHistory->size()-1; ilev>=0; ilev--)
94 (*fNavHistory)[ilev] = tmpNavLevel;
99 void G4NavigationHistory::SetFirstEntry(G4VPhysicalVolume* pVol)
101 G4ThreeVector translation(0.,0.,0.);
104 // Protection needed in case pVol=null
105 // so that a touchable-history can signal OutOfWorld
109 translation = pVol->GetTranslation();
110 copyNo = pVol->GetCopyNo();
113 G4NavigationLevel( pVol, G4AffineTransform(translation), kNormal, copyNo );
117 const G4AffineTransform* G4NavigationHistory::GetPtrTopTransform() const
119 return (*fNavHistory)[fStackDepth].GetPtrTransform();
123 const G4AffineTransform& G4NavigationHistory::GetTopTransform() const
125 return (*fNavHistory)[fStackDepth].GetTransform();
129 G4int G4NavigationHistory::GetTopReplicaNo() const
131 return (*fNavHistory)[fStackDepth].GetReplicaNo();
135 EVolume G4NavigationHistory::GetTopVolumeType() const
137 return (*fNavHistory)[fStackDepth].GetVolumeType();
141 G4VPhysicalVolume* G4NavigationHistory::GetTopVolume() const
143 return (*fNavHistory)[fStackDepth].GetPhysicalVolume();
147 G4int G4NavigationHistory::GetDepth() const
153 const G4AffineTransform&
154 G4NavigationHistory::GetTransform(G4int n) const
156 return (*fNavHistory)[n].GetTransform();
160 G4int G4NavigationHistory::GetReplicaNo(G4int n) const
162 return (*fNavHistory)[n].GetReplicaNo();
166 EVolume G4NavigationHistory::GetVolumeType(G4int n) const
168 return (*fNavHistory)[n].GetVolumeType();
172 G4VPhysicalVolume* G4NavigationHistory::GetVolume(G4int n) const
174 return (*fNavHistory)[n].GetPhysicalVolume();
178 G4int G4NavigationHistory::GetMaxDepth() const
180 return fNavHistory->size();
184 void G4NavigationHistory::BackLevel()
186 assert( fStackDepth>0 );
188 // Tell the level that I am forgetting it
189 // delete (*fNavHistory)[fStackDepth];
195 void G4NavigationHistory::BackLevel(G4int n)
197 assert( n<=fStackDepth );
202 void G4NavigationHistory::EnlargeHistory()
204 G4int len = fNavHistory->size();
205 if ( len==fStackDepth )
207 // Note: Resize operation clears additional entries
209 G4int nlen = len+kHistoryStride;
210 fNavHistory->resize(nlen);
216 void G4NavigationHistory::NewLevel( G4VPhysicalVolume *pNewMother,
221 EnlargeHistory(); // Enlarge if required
222 (*fNavHistory)[fStackDepth] =
223 G4NavigationLevel( pNewMother,
224 (*fNavHistory)[fStackDepth-1].GetTransform(),
225 G4AffineTransform(pNewMother->GetRotation(),
226 pNewMother->GetTranslation()),
229 // The constructor computes the new global->local transform