Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/digits_hits/scorer/src/G4PSNofStep.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 /digits_hits/scorer/src/G4PSNofStep.cc (Version 11.3.0) and /digits_hits/scorer/src/G4PSNofStep.cc (Version 10.6.p3)


  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 //                                                 26 //
 27 //                                                 27 //
 28 // G4PSNofStep                                     28 // G4PSNofStep
 29 #include "G4PSNofStep.hh"                          29 #include "G4PSNofStep.hh"
 30 #include "G4UnitsTable.hh"                         30 #include "G4UnitsTable.hh"
 31 #include "G4VScoreHistFiller.hh"               << 
 32                                                    31 
 33 // (Description)                                   32 // (Description)
 34 //   This is a primitive scorer class for scor     33 //   This is a primitive scorer class for scoring number of steps in the
 35 //  Cell.                                          34 //  Cell.
 36 //                                                 35 //
 37 // Created: 2005-11-14  Tsukasa ASO, Akinori K     36 // Created: 2005-11-14  Tsukasa ASO, Akinori Kimura.
 38 // 2010-07-22   Introduce Unit specification.      37 // 2010-07-22   Introduce Unit specification.
 39 // 2020-10-06   Use G4VPrimitivePlotter and fi << 
 40 //              in mm vs. number of steps (not << 
 41 //                                                 38 //
 42                                                    39 
 43 G4PSNofStep::G4PSNofStep(const G4String& name, <<  40 G4PSNofStep::G4PSNofStep(G4String name, G4int depth)
 44   : G4VPrimitivePlotter(name, depth)           <<  41     :G4VPrimitiveScorer(name,depth),HCID(-1),EvtMap(0),boundaryFlag(false)
 45 {                                                  42 {
 46   SetUnit("");                                 <<  43     SetUnit("");
 47 }                                                  44 }
 48                                                    45 
 49 G4bool G4PSNofStep::ProcessHits(G4Step* aStep, <<  46 G4PSNofStep::~G4PSNofStep()
                                                   >>  47 {;}
                                                   >>  48 
                                                   >>  49 G4bool G4PSNofStep::ProcessHits(G4Step* aStep,G4TouchableHistory*)
 50 {                                                  50 {
 51   if(boundaryFlag)                             <<  51   if ( boundaryFlag ) {
 52   {                                            <<  52       if ( aStep->GetStepLength() == 0. ) return FALSE;
 53     if(aStep->GetStepLength() == 0.)           << 
 54       return false;                            << 
 55   }                                                53   }
 56   G4int index  = GetIndex(aStep);              <<  54   G4int  index = GetIndex(aStep);
 57   G4double val = 1.0;                              55   G4double val = 1.0;
 58   EvtMap->add(index, val);                     <<  56   EvtMap->add(index,val);  
 59                                                <<  57   return TRUE;
 60   if(!hitIDMap.empty() && hitIDMap.find(index) << 
 61   {                                            << 
 62     auto filler = G4VScoreHistFiller::Instance << 
 63     if(filler == nullptr)                      << 
 64     {                                          << 
 65       G4Exception(                             << 
 66         "G4PSNofStep::ProcessHits", "SCORER012 << 
 67         "G4TScoreHistFiller is not instantiate << 
 68     }                                          << 
 69     else                                       << 
 70     {                                          << 
 71       filler->FillH1(hitIDMap[index], aStep->G << 
 72     }                                          << 
 73   }                                            << 
 74                                                << 
 75   return true;                                 << 
 76 }                                                  58 }
 77                                                    59 
 78 void G4PSNofStep::Initialize(G4HCofThisEvent*      60 void G4PSNofStep::Initialize(G4HCofThisEvent* HCE)
 79 {                                                  61 {
 80   EvtMap = new G4THitsMap<G4double>(detector-> <<  62   EvtMap = new G4THitsMap<G4double>(detector->GetName(),GetName());
 81   if(HCID < 0)                                 <<  63   if(HCID < 0) {HCID = GetCollectionID(0);}
 82   {                                            <<  64   HCE->AddHitsCollection(HCID, (G4VHitsCollection*)EvtMap);
 83     HCID = GetCollectionID(0);                 <<  65 }
 84   }                                            <<  66 
 85   HCE->AddHitsCollection(HCID, (G4VHitsCollect <<  67 void G4PSNofStep::EndOfEvent(G4HCofThisEvent*)
                                                   >>  68 {;}
                                                   >>  69 
                                                   >>  70 void G4PSNofStep::clear(){
                                                   >>  71   EvtMap->clear();
 86 }                                                  72 }
 87                                                    73 
 88 void G4PSNofStep::clear() { EvtMap->clear(); } <<  74 void G4PSNofStep::DrawAll()
                                                   >>  75 {;}
 89                                                    76 
 90 void G4PSNofStep::PrintAll()                       77 void G4PSNofStep::PrintAll()
 91 {                                                  78 {
 92   G4cout << " MultiFunctionalDet  " << detecto     79   G4cout << " MultiFunctionalDet  " << detector->GetName() << G4endl;
 93   G4cout << " PrimitiveScorer " << GetName() <     80   G4cout << " PrimitiveScorer " << GetName() << G4endl;
 94   G4cout << " Number of entries " << EvtMap->e     81   G4cout << " Number of entries " << EvtMap->entries() << G4endl;
 95   for(const auto& [copy, nsteps] : *(EvtMap->G <<  82   std::map<G4int,G4double*>::iterator itr = EvtMap->GetMap()->begin();
 96   {                                            <<  83   for(; itr != EvtMap->GetMap()->end(); itr++) {
 97     G4cout << "  copy no.: " << copy           <<  84     G4cout << "  copy no.: " << itr->first
 98            << "  num of step: " << *(nsteps) < <<  85      << "  num of step: " << *(itr->second)
                                                   >>  86      << " [steps] "
                                                   >>  87      << G4endl;
 99   }                                                88   }
100 }                                                  89 }
101                                                    90 
102 void G4PSNofStep::SetUnit(const G4String& unit     91 void G4PSNofStep::SetUnit(const G4String& unit)
103 {                                                  92 {
104   if(unit.empty())                             <<  93   if (unit == "" ){
105   {                                            <<  94     unitName = unit;
106     unitName  = unit;                          << 
107     unitValue = 1.0;                               95     unitValue = 1.0;
                                                   >>  96   }else{
                                                   >>  97       G4String msg = "Invalid unit ["+unit+"] (Current  unit is [" +GetUnit()+"] ) for " + GetName();
                                                   >>  98       G4Exception("G4PSNofStep::SetUnit","DetPS0011",JustWarning,msg);
108   }                                                99   }
109   else                                         << 100 
110   {                                            << 
111     G4String msg = "Invalid unit [" + unit + " << 
112                    GetUnit() + "] ) for " + Ge << 
113     G4Exception("G4PSNofStep::SetUnit", "DetPS << 
114   }                                            << 
115 }                                                 101 }
                                                   >> 102 
                                                   >> 103 
116                                                   104