| Geant4 Cross Reference |
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 /// \file polarisation/Pol01/src/ProcessesCoun 26 /// \file polarisation/Pol01/src/ProcessesCount.cc
27 /// \brief Implementation of the ProcessesCoun 27 /// \brief Implementation of the ProcessesCount class
28 // 28 //
29 // 29 //
30 //....oooOO0OOooo........oooOO0OOooo........oo 30 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
31 //....oooOO0OOooo........oooOO0OOooo........oo 31 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
32 32
33 #include "ProcessesCount.hh" 33 #include "ProcessesCount.hh"
34 34
35 #include <iomanip> 35 #include <iomanip>
36 36
37 //....oooOO0OOooo........oooOO0OOooo........oo 37 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
38 38
39 ProcessesCount::ProcessesCount(const G4String& 39 ProcessesCount::ProcessesCount(const G4String& name) : G4VAccumulable(name) {}
40 40
41 //....oooOO0OOooo........oooOO0OOooo........oo 41 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
42 42
43 void ProcessesCount::Count(const G4String& pro 43 void ProcessesCount::Count(const G4String& procName)
44 { 44 {
45 if (const auto& [it, inserted] = fProcCounte 45 if (const auto& [it, inserted] = fProcCounter.try_emplace(procName, 1); !inserted) {
46 it->second++; // Exists already 46 it->second++; // Exists already
47 } 47 }
48 } 48 }
49 49
50 //....oooOO0OOooo........oooOO0OOooo........oo 50 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
51 51
52 void ProcessesCount::Print(G4PrintOptions /*op << 52 void ProcessesCount::Print()
53 { 53 {
54 G4int index = 0; 54 G4int index = 0;
55 std::map<G4String, G4int>::const_iterator it << 55 std::map<G4String, G4int>::iterator it;
56 for (it = fProcCounter.cbegin(); it != fProc << 56 for (it = fProcCounter.begin(); it != fProcCounter.end(); it++) {
57 G4String procName = it->first; 57 G4String procName = it->first;
58 G4int count = it->second; 58 G4int count = it->second;
59 G4cout << " " << std::setw(20) << procName 59 G4cout << " " << std::setw(20) << procName << "=" << std::setw(7) << count
60 << (++index % 3 == 0 ? "\n" : " "); 60 << (++index % 3 == 0 ? "\n" : " ");
61 } 61 }
62 G4cout << G4endl; 62 G4cout << G4endl;
63 } 63 }
64 64
65 //....oooOO0OOooo........oooOO0OOooo........oo 65 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
66 66
67 void ProcessesCount::Merge(const G4VAccumulabl 67 void ProcessesCount::Merge(const G4VAccumulable& other)
68 { 68 {
69 auto worker = dynamic_cast<const ProcessesCo 69 auto worker = dynamic_cast<const ProcessesCount&>(other);
70 70
71 for (const auto& proc : worker.fProcCounter) 71 for (const auto& proc : worker.fProcCounter) {
72 const auto& [it, inserted] = fProcCounter. 72 const auto& [it, inserted] = fProcCounter.emplace(proc);
73 if (!inserted) { 73 if (!inserted) {
74 it->second += proc.second; // proc exis 74 it->second += proc.second; // proc exists already in master
75 } 75 }
76 } 76 }
77 } 77 }
78 78
79 //....oooOO0OOooo........oooOO0OOooo........oo 79 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
80 80