| Geant4 Cross Reference |
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 // INCL++ intra-nuclear cascade model
27 // Alain Boudard, CEA-Saclay, France
28 // Joseph Cugnon, University of Liege, Belgium
29 // Jean-Christophe David, CEA-Saclay, France
30 // Pekka Kaitaniemi, CEA-Saclay, France, and Helsinki Institute of Physics, Finland
31 // Sylvie Leray, CEA-Saclay, France
32 // Davide Mancusi, CEA-Saclay, France
33 //
34 #define INCLXX_IN_GEANT4_MODE 1
35
36 #include "globals.hh"
37
38 /** \file G4INCLCoulombNone.cc
39 * \brief Placeholder class for no Coulomb distortion.
40 *
41 * \date 14 February 2011
42 * \author Davide Mancusi
43 */
44
45 #include "G4INCLCoulombNone.hh"
46 #include "G4INCLIntersection.hh"
47
48 namespace G4INCL {
49
50 ParticleEntryAvatar *CoulombNone::bringToSurface(Particle * const p, Nucleus * const n) const {
51 Intersection intersection = IntersectionFactory::getEarlierTrajectoryIntersection(p->getPosition(), p->getPropagationVelocity(), n->getUniverseRadius());
52 if(intersection.exists) { // If the particle enters the nucleus
53 p->setPosition(intersection.position);
54 return new ParticleEntryAvatar(0.0, n, p);
55 } else // If the particle does NOT enter the nucleus
56 return NULL;
57 }
58
59 IAvatarList CoulombNone::bringToSurface(Cluster * const c, Nucleus * const n) const {
60 // The avatar list that we will return
61 IAvatarList theAvatarList;
62
63 // Loop over the particles in the cluster
64 ParticleList const &projectiles = c->getParticles();
65 std::list<Intersection> theIntersections;
66 G4double theFirstEntryTime = 1E+60; // a large time
67 G4int theFirstID = 0;
68 for(ParticleIter p=projectiles.begin(), e=projectiles.end(); p!=e; ++p) {
69 // Check if the particle enters the nucleus
70 Intersection intersection(IntersectionFactory::getEarlierTrajectoryIntersection(
71 (*p)->getPosition(),
72 (*p)->getPropagationVelocity(),
73 n->getUniverseRadius()));
74 // Store the intersections
75 theIntersections.push_back(intersection);
76 if(intersection.exists) {
77 // Position the particle at the entry point
78 (*p)->setPosition(intersection.position);
79
80 // Keep track of the first entering particle
81 if(intersection.time < theFirstEntryTime) {
82 theFirstEntryTime = intersection.time;
83 theFirstID = (G4int)(*p)->getID();
84 }
85 }
86 }
87
88 std::list<Intersection>::const_iterator intIter = theIntersections.begin();
89 for(ParticleIter p=projectiles.begin(), e=projectiles.end(); p!=e; ++p, ++intIter) {
90
91 if((*intIter).exists) {
92 // If the particle enters the nucleus, generate a ParticleEntryAvatar
93 // for it and add it to the list of avatars that we will return
94 if((*p)->getID() == theFirstID) {
95 // The first particle always enters exactly at t=0 (in order to
96 // avoid negative entry times due to rounding)
97 theAvatarList.push_back(new ParticleEntryAvatar(0.0, n, *p));
98 } else
99 theAvatarList.push_back(new ParticleEntryAvatar(intIter->time - theFirstEntryTime, n, *p));
100 }
101
102 }
103
104 return theAvatarList;
105 }
106
107 }
108