| 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 // 26 //
>> 27 // $Id: G4TrackLogger.cc,v 1.3 2006/06/29 18:06:01 gunter Exp $
>> 28 // GEANT4 tag $Name: geant4-09-01-patch-01 $
27 // 29 //
28 // ------------------------------------------- 30 // ----------------------------------------------------------------------
29 // GEANT 4 class source file 31 // GEANT 4 class source file
30 // 32 //
31 // G4TrackLogger.cc 33 // G4TrackLogger.cc
32 // 34 //
33 // ------------------------------------------- 35 // ----------------------------------------------------------------------
34 36
35 #include "G4TrackLogger.hh" 37 #include "G4TrackLogger.hh"
36 38
37 void G4TrackLogger::SetEventID(G4int id) << 39 G4TrackLogger::G4TrackLogger() :
38 { << 40 fPreviousEventID(-1)
>> 41 {}
>> 42
>> 43 G4TrackLogger::~G4TrackLogger(){}
>> 44
>> 45
>> 46 void G4TrackLogger::SetEventID(G4int id){
39 if (id != fPreviousEventID) { 47 if (id != fPreviousEventID) {
40 fTrackIDsSet.clear(); 48 fTrackIDsSet.clear();
41 fPreviousEventID = id; << 49 fPreviousEventID =id;
42 } 50 }
43 } 51 }
44 52
45 G4bool G4TrackLogger::FirstEnterance(G4int tri << 53 G4bool G4TrackLogger::FirstEnterance(G4int trid){
46 { <<
47 G4bool first = true; 54 G4bool first = true;
48 auto n = fTrackIDsSet.count(trid); << 55 G4int n = fTrackIDsSet.count(trid);
49 if (n == 1) { << 56 if (n==1) {
50 first = false; << 57 first=false;
51 } 58 }
52 else if (n == 0) { << 59 else if(n==0) {
53 fTrackIDsSet.insert(trid); 60 fTrackIDsSet.insert(trid);
54 } 61 }
55 else if (n > 1) { << 62 else if (n>1) {
56 G4cout << "Error G4TrackLogger::FirstEnter << 63 G4cout << "Error G4TrackLogger::FirstEnterance: "
57 << "more than one elm in set!" << G << 64 << "more than one elm in set!" << G4endl;
>> 65
58 } 66 }
59 return first; 67 return first;
60 } 68 }
61 69