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( CexmcNmbOfHitsInRangesData( 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( CexmcNmbOfHitsInRangesData( 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( 82 CexmcNmbOf 82 CexmcNmbOfHitsInRangesData( index, 1 ) ); 83 else 83 else 84 ++found->second; 84 ++found->second; 85 } 85 } 86 86 87 87 88 void CexmcRun::IncrementNmbOfHitsTriggeredRec 88 void CexmcRun::IncrementNmbOfHitsTriggeredRecRange( G4int index ) 89 { 89 { 90 CexmcNmbOfHitsInRanges::iterator found( 90 CexmcNmbOfHitsInRanges::iterator found( 91 nmbOfHitsT 91 nmbOfHitsTriggeredRecRange.find( index ) ); 92 if ( found == nmbOfHitsTriggeredRecRange.e 92 if ( found == nmbOfHitsTriggeredRecRange.end() ) 93 nmbOfHitsTriggeredRecRange.insert( 93 nmbOfHitsTriggeredRecRange.insert( 94 CexmcNmbOf 94 CexmcNmbOfHitsInRangesData( index, 1 ) ); 95 else 95 else 96 ++found->second; 96 ++found->second; 97 } 97 } 98 98 99 99 100 void CexmcRun::IncrementNmbOfOrphanHits( G4in 100 void CexmcRun::IncrementNmbOfOrphanHits( G4int index ) 101 { 101 { 102 CexmcNmbOfHitsInRanges::iterator found( 102 CexmcNmbOfHitsInRanges::iterator found( 103 nmbOfO 103 nmbOfOrphanHits.find( index ) ); 104 if ( found == nmbOfOrphanHits.end() ) 104 if ( found == nmbOfOrphanHits.end() ) 105 nmbOfOrphanHits.insert( CexmcNmbOfHits 105 nmbOfOrphanHits.insert( CexmcNmbOfHitsInRangesData( index, 1 ) ); 106 else 106 else 107 ++found->second; 107 ++found->second; 108 } 108 } 109 109 110 110 111 void CexmcRun::IncrementNmbOfFalseHitsTrigger 111 void CexmcRun::IncrementNmbOfFalseHitsTriggeredEDT( void ) 112 { 112 { 113 ++nmbOfFalseHitsTriggeredEDT; 113 ++nmbOfFalseHitsTriggeredEDT; 114 } 114 } 115 115 116 116 117 void CexmcRun::IncrementNmbOfFalseHitsTrigger 117 void CexmcRun::IncrementNmbOfFalseHitsTriggeredRec( void ) 118 { 118 { 119 ++nmbOfFalseHitsTriggeredRec; 119 ++nmbOfFalseHitsTriggeredRec; 120 } 120 } 121 121 122 122 123 void CexmcRun::IncrementNmbOfSavedEvents( voi 123 void CexmcRun::IncrementNmbOfSavedEvents( void ) 124 { 124 { 125 ++nmbOfSavedEvents; 125 ++nmbOfSavedEvents; 126 } 126 } 127 127 128 128 129 void CexmcRun::IncrementNmbOfSavedFastEvents( 129 void CexmcRun::IncrementNmbOfSavedFastEvents( void ) 130 { 130 { 131 ++nmbOfSavedFastEvents; 131 ++nmbOfSavedFastEvents; 132 } 132 } 133 133 134 134