Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/processes/hadronic/models/inclxx/incl_physics/src/G4INCLClustering.cc

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 ]

Diff markup

Differences between /processes/hadronic/models/inclxx/incl_physics/src/G4INCLClustering.cc (Version 11.3.0) and /processes/hadronic/models/inclxx/incl_physics/src/G4INCLClustering.cc (Version 10.3.p1)


  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 // INCL++ intra-nuclear cascade model              26 // INCL++ intra-nuclear cascade model
 27 // Alain Boudard, CEA-Saclay, France               27 // Alain Boudard, CEA-Saclay, France
 28 // Joseph Cugnon, University of Liege, Belgium     28 // Joseph Cugnon, University of Liege, Belgium
 29 // Jean-Christophe David, CEA-Saclay, France       29 // Jean-Christophe David, CEA-Saclay, France
 30 // Pekka Kaitaniemi, CEA-Saclay, France, and H     30 // Pekka Kaitaniemi, CEA-Saclay, France, and Helsinki Institute of Physics, Finland
 31 // Sylvie Leray, CEA-Saclay, France                31 // Sylvie Leray, CEA-Saclay, France
 32 // Davide Mancusi, CEA-Saclay, France              32 // Davide Mancusi, CEA-Saclay, France
 33 //                                                 33 //
 34 #define INCLXX_IN_GEANT4_MODE 1                    34 #define INCLXX_IN_GEANT4_MODE 1
 35                                                    35 
 36 #include "globals.hh"                              36 #include "globals.hh"
 37                                                    37 
 38 /** \file G4INCLClustering.cc                      38 /** \file G4INCLClustering.cc
 39  * \brief Static class for cluster formation       39  * \brief Static class for cluster formation
 40  *                                                 40  *
 41  * \date 13th July 2011                            41  * \date 13th July 2011
 42  * \author Davide Mancusi                          42  * \author Davide Mancusi
 43  */                                                43  */
 44                                                    44 
 45 #include "G4INCLIClusteringModel.hh"               45 #include "G4INCLIClusteringModel.hh"
 46 #include "G4INCLClustering.hh"                     46 #include "G4INCLClustering.hh"
 47 #include "G4INCLClusteringModelIntercomparison     47 #include "G4INCLClusteringModelIntercomparison.hh"
 48 #include "G4INCLClusteringModelNone.hh"            48 #include "G4INCLClusteringModelNone.hh"
 49                                                    49 
 50 namespace G4INCL {                                 50 namespace G4INCL {
 51                                                    51 
 52   namespace Clustering {                           52   namespace Clustering {
 53                                                    53 
 54     namespace {                                    54     namespace {
 55       G4ThreadLocal IClusteringModel *theClust     55       G4ThreadLocal IClusteringModel *theClusteringModel = NULL;
 56     }                                              56     }
 57                                                    57 
 58     Cluster* getCluster(Nucleus *n, Particle *     58     Cluster* getCluster(Nucleus *n, Particle *p) {
 59 #if !defined(NDEBUG) && !defined(INCLXX_IN_GEA     59 #if !defined(NDEBUG) && !defined(INCLXX_IN_GEANT4_MODE)
 60       Cluster * const c=theClusteringModel->ge     60       Cluster * const c=theClusteringModel->getCluster(n,p);
 61 // assert(!c || c->getA()<=n->getA()/2);           61 // assert(!c || c->getA()<=n->getA()/2);
 62       return c;                                    62       return c;
 63 #else                                              63 #else
 64       return theClusteringModel->getCluster(n,     64       return theClusteringModel->getCluster(n,p);
 65 #endif                                             65 #endif
 66     }                                              66     }
 67                                                    67 
 68     G4bool clusterCanEscape(Nucleus const * co     68     G4bool clusterCanEscape(Nucleus const * const n, Cluster const * const c) {
 69       return theClusteringModel->clusterCanEsc     69       return theClusteringModel->clusterCanEscape(n, c);
 70     }                                              70     }
 71                                                    71 
 72     IClusteringModel *getClusteringModel() { r     72     IClusteringModel *getClusteringModel() { return theClusteringModel; }
 73                                                    73 
 74     void setClusteringModel(IClusteringModel *     74     void setClusteringModel(IClusteringModel * const model) {
 75       theClusteringModel = model;                  75       theClusteringModel = model;
 76     }                                              76     }
 77                                                    77 
 78     void deleteClusteringModel() {                 78     void deleteClusteringModel() {
 79       delete theClusteringModel;                   79       delete theClusteringModel;
 80       theClusteringModel = NULL;                   80       theClusteringModel = NULL;
 81     }                                              81     }
 82                                                    82 
 83     void initialize(Config const * const theCo     83     void initialize(Config const * const theConfig) {
 84       ClusterAlgorithmType clusterAlgorithm =      84       ClusterAlgorithmType clusterAlgorithm = theConfig->getClusterAlgorithm();
 85       if(clusterAlgorithm == IntercomparisonCl     85       if(clusterAlgorithm == IntercomparisonClusterAlgorithm)
 86         setClusteringModel(new ClusteringModel     86         setClusteringModel(new ClusteringModelIntercomparison(theConfig));
 87       else // if(clusterAlgorithm == NoCluster     87       else // if(clusterAlgorithm == NoClusterAlgorithm)
 88         setClusteringModel(new ClusteringModel     88         setClusteringModel(new ClusteringModelNone);
 89     }                                              89     }
 90                                                    90 
 91   }                                                91   }
 92 }                                                  92 }
 93                                                    93