Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/examples/extended/medical/DICOM/include/DicomRun.hh

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 ]

  1 //
  2 // ********************************************************************
  3 // * License and Disclaimer                                           *
  4 // *                                                                  *
  5 // * The  Geant4 software  is  copyright of the Copyright Holders  of *
  6 // * the Geant4 Collaboration.  It is provided  under  the terms  and *
  7 // * conditions of the Geant4 Software License,  included in the file *
  8 // * LICENSE and available at  http://cern.ch/geant4/license .  These *
  9 // * include a list of copyright holders.                             *
 10 // *                                                                  *
 11 // * Neither the authors of this software system, nor their employing *
 12 // * institutes,nor the agencies providing financial support for this *
 13 // * work  make  any representation or  warranty, express or implied, *
 14 // * regarding  this  software system or assume any liability for its *
 15 // * use.  Please see the license in the file  LICENSE  and URL above *
 16 // * for the full disclaimer and the limitation of liability.         *
 17 // *                                                                  *
 18 // * This  code  implementation is the result of  the  scientific and *
 19 // * technical work of the GEANT4 collaboration.                      *
 20 // * By using,  copying,  modifying or  distributing the software (or *
 21 // * any work based  on the software)  you  agree  to acknowledge its *
 22 // * use  in  resulting  scientific  publications,  and indicate your *
 23 // * acceptance of all terms of the Geant4 Software license.          *
 24 // ********************************************************************
 25 //
 26 //
 27 /// \file medical/DICOM/include/DicomRun.hh
 28 /// \brief Definition of the DicomRun class
 29 //
 30 
 31 #ifndef DicomRun_h
 32 #define DicomRun_h 1
 33 
 34 #include "G4Event.hh"
 35 #include "G4Run.hh"
 36 #include "G4THitsMap.hh"
 37 
 38 #include <vector>
 39 
 40 //---------------------------------------------------------------------
 41 /// DicomRun class
 42 ///
 43 /// Example implementation for multi-functional-detector and
 44 /// primitive scorer.
 45 /// This DicomRun class has collections which accumulate
 46 /// a event information into a run information.
 47 //---------------------------------------------------------------------
 48 
 49 class DicomRun : public G4Run
 50 {
 51   public:
 52     // constructor and destructor.
 53     //  vector of multifunctionaldetector name has to given to constructor.
 54     DicomRun();
 55     DicomRun(const std::vector<G4String> mfdName);
 56     virtual ~DicomRun();
 57 
 58     // virtual method from G4Run.
 59     // The method is overriden in this class for scoring.
 60     virtual void RecordEvent(const G4Event*);
 61 
 62     // Access methods for scoring information.
 63     // - Number of HitsMap for this RUN.
 64     //   This is equal to number of collections.
 65     size_t GetNumberOfHitsMap() const { return fRunMap.size(); }
 66     // - Get HitsMap of this RUN.
 67     //   by sequential number, by multifucntional name and collection name,
 68     //   and by collection name with full path.
 69     G4THitsMap<G4double>* GetHitsMap(G4int i) const { return fRunMap[i]; }
 70     G4THitsMap<G4double>* GetHitsMap(const G4String& detName, const G4String& colName) const;
 71     G4THitsMap<G4double>* GetHitsMap(const G4String& fullName) const;
 72 
 73     void ConstructMFD(const std::vector<G4String>&);
 74 
 75     virtual void Merge(const G4Run*);
 76 
 77   private:
 78     std::vector<G4String> fCollName;
 79     std::vector<G4int> fCollID;
 80     std::vector<G4THitsMap<G4double>*> fRunMap;
 81 };
 82 
 83 //==========================================================================
 84 //          Generic Functions to help with merge
 85 //==========================================================================
 86 template<typename T>
 87 inline void Copy(std::vector<T>& main, const std::vector<T>& data)
 88 {
 89   for (size_t i = main.size(); i < data.size(); ++i) {
 90     main.push_back(data.at(i));
 91   }
 92 }
 93 //==========================================================================
 94 template<typename T>
 95 inline size_t Copy(std::vector<T*>& main, const std::vector<T*>& data)
 96 {
 97   size_t size_diff = data.size() - main.size();
 98   for (size_t i = main.size(); i < data.size(); ++i) {
 99     main.push_back(new T(*data.at(i)));
100   }
101   return size_diff;
102 }
103 //==========================================================================
104 template<typename T>
105 inline void Print(const std::vector<T>& data)
106 {
107   G4cout << G4endl;
108   for (size_t i = 0; i < data.size(); ++i) {
109     G4cout << "\t\t" << i << " \t\t " << data.at(i) << G4endl;
110   }
111   G4cout << G4endl;
112 }
113 //==========================================================================
114 
115 #endif
116