| 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 * =========================================== 27 * ============================================================================
28 * 28 *
29 * Filename: CexmcRun.cc 29 * Filename: CexmcRun.cc
30 * 30 *
31 * Description: run data (acceptances etc. 31 * Description: run data (acceptances etc.)
32 * 32 *
33 * Version: 1.0 33 * Version: 1.0
34 * Created: 19.12.2009 23:59:29 34 * Created: 19.12.2009 23:59:29
35 * Revision: none 35 * Revision: none
36 * Compiler: gcc 36 * Compiler: gcc
37 * 37 *
38 * Author: Alexey Radkov (), 38 * Author: Alexey Radkov (),
39 * Company: PNPI 39 * Company: PNPI
40 * 40 *
41 * =========================================== 41 * ============================================================================
42 */ 42 */
43 43
44 #include "CexmcRun.hh" 44 #include "CexmcRun.hh"
45 45
46 46
47 CexmcRun::CexmcRun() : nmbOfFalseHitsTriggered 47 CexmcRun::CexmcRun() : nmbOfFalseHitsTriggeredEDT( 0 ),
48 nmbOfFalseHitsTriggeredRec( 0 ), nmbOfSave 48 nmbOfFalseHitsTriggeredRec( 0 ), nmbOfSavedEvents( 0 ),
49 nmbOfSavedFastEvents( 0 ) 49 nmbOfSavedFastEvents( 0 )
50 { 50 {
51 } 51 }
52 52
53 53
54 void CexmcRun::IncrementNmbOfHitsSampled( G4i 54 void CexmcRun::IncrementNmbOfHitsSampled( G4int index )
55 { 55 {
56 CexmcNmbOfHitsInRanges::iterator found( 56 CexmcNmbOfHitsInRanges::iterator found(
57 nmbOfH 57 nmbOfHitsSampled.find( index ) );
58 if ( found == nmbOfHitsSampled.end() ) 58 if ( found == nmbOfHitsSampled.end() )
59 nmbOfHitsSampled.insert( CexmcNmbOfHit << 59 nmbOfHitsSampled.insert( std::pair< int, int >( index, 1 ) );
60 else 60 else
61 ++found->second; 61 ++found->second;
62 } 62 }
63 63
64 64
65 void CexmcRun::IncrementNmbOfHitsSampledFull( 65 void CexmcRun::IncrementNmbOfHitsSampledFull( G4int index )
66 { 66 {
67 CexmcNmbOfHitsInRanges::iterator found( 67 CexmcNmbOfHitsInRanges::iterator found(
68 nmbOfH 68 nmbOfHitsSampledFull.find( index ) );
69 if ( found == nmbOfHitsSampledFull.end() ) 69 if ( found == nmbOfHitsSampledFull.end() )
70 nmbOfHitsSampledFull.insert( CexmcNmbO << 70 nmbOfHitsSampledFull.insert( std::pair< int, int >( index, 1 ) );
71 else 71 else
72 ++found->second; 72 ++found->second;
73 } 73 }
74 74
75 75
76 void CexmcRun::IncrementNmbOfHitsTriggeredRea 76 void CexmcRun::IncrementNmbOfHitsTriggeredRealRange( G4int index )
77 { 77 {
78 CexmcNmbOfHitsInRanges::iterator found( 78 CexmcNmbOfHitsInRanges::iterator found(
79 nmbOfHitsT 79 nmbOfHitsTriggeredRealRange.find( index ) );
80 if ( found == nmbOfHitsTriggeredRealRange. 80 if ( found == nmbOfHitsTriggeredRealRange.end() )
81 nmbOfHitsTriggeredRealRange.insert( << 81 nmbOfHitsTriggeredRealRange.insert( std::pair< int, int >( index, 1 ) );
82 CexmcNmbOf <<
83 else 82 else
84 ++found->second; 83 ++found->second;
85 } 84 }
86 85
87 86
88 void CexmcRun::IncrementNmbOfHitsTriggeredRec 87 void CexmcRun::IncrementNmbOfHitsTriggeredRecRange( G4int index )
89 { 88 {
90 CexmcNmbOfHitsInRanges::iterator found( 89 CexmcNmbOfHitsInRanges::iterator found(
91 nmbOfHitsT 90 nmbOfHitsTriggeredRecRange.find( index ) );
92 if ( found == nmbOfHitsTriggeredRecRange.e 91 if ( found == nmbOfHitsTriggeredRecRange.end() )
93 nmbOfHitsTriggeredRecRange.insert( << 92 nmbOfHitsTriggeredRecRange.insert( std::pair< int, int >( index, 1 ) );
94 CexmcNmbOf <<
95 else 93 else
96 ++found->second; 94 ++found->second;
97 } 95 }
98 96
99 97
100 void CexmcRun::IncrementNmbOfOrphanHits( G4in 98 void CexmcRun::IncrementNmbOfOrphanHits( G4int index )
101 { 99 {
102 CexmcNmbOfHitsInRanges::iterator found( 100 CexmcNmbOfHitsInRanges::iterator found(
103 nmbOfO 101 nmbOfOrphanHits.find( index ) );
104 if ( found == nmbOfOrphanHits.end() ) 102 if ( found == nmbOfOrphanHits.end() )
105 nmbOfOrphanHits.insert( CexmcNmbOfHits << 103 nmbOfOrphanHits.insert( std::pair< int, int >( index, 1 ) );
106 else 104 else
107 ++found->second; 105 ++found->second;
108 } 106 }
109 107
110 108
111 void CexmcRun::IncrementNmbOfFalseHitsTrigger 109 void CexmcRun::IncrementNmbOfFalseHitsTriggeredEDT( void )
112 { 110 {
113 ++nmbOfFalseHitsTriggeredEDT; 111 ++nmbOfFalseHitsTriggeredEDT;
114 } 112 }
115 113
116 114
117 void CexmcRun::IncrementNmbOfFalseHitsTrigger 115 void CexmcRun::IncrementNmbOfFalseHitsTriggeredRec( void )
118 { 116 {
119 ++nmbOfFalseHitsTriggeredRec; 117 ++nmbOfFalseHitsTriggeredRec;
120 } 118 }
121 119
122 120
123 void CexmcRun::IncrementNmbOfSavedEvents( voi 121 void CexmcRun::IncrementNmbOfSavedEvents( void )
124 { 122 {
125 ++nmbOfSavedEvents; 123 ++nmbOfSavedEvents;
126 } 124 }
127 125
128 126
129 void CexmcRun::IncrementNmbOfSavedFastEvents( 127 void CexmcRun::IncrementNmbOfSavedFastEvents( void )
130 { 128 {
131 ++nmbOfSavedFastEvents; 129 ++nmbOfSavedFastEvents;
132 } 130 }
133 131
134 132