Geant4 Cross Reference |
1 // 1 // 2 // ******************************************* 2 // ******************************************************************** 3 // * License and Disclaimer << 3 // * DISCLAIMER * 4 // * 4 // * * 5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers * 6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which * 7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: * 8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license * 9 // * include a list of copyright holders. << 10 // * 9 // * * 11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing * 12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this * 13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, * 14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its * 15 // * use. Please see the license in the file << 14 // * use. * 16 // * for the full disclaimer and the limitatio << 17 // * 15 // * * 18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the * 19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. * 20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work * 21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this * 22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. * 23 // * acceptance of all terms of the Geant4 Sof << 24 // ******************************************* 21 // ******************************************************************** 25 // 22 // 26 // 23 // >> 24 // $Id: G4CrossSectionHandler.cc,v 1.12 2001/10/08 07:48:57 pia Exp $ >> 25 // GEANT4 tag $Name: geant4-04-00 $ 27 // 26 // 28 // Author: Maria Grazia Pia (Maria.Grazia.Pia@ 27 // Author: Maria Grazia Pia (Maria.Grazia.Pia@cern.ch) 29 // 28 // 30 // History: 29 // History: 31 // ----------- 30 // ----------- 32 // 1 Aug 2001 MGP Created << 31 // 1 Aug 2001 MGP Created 33 // 19 Jul 2002 VI Create composite d << 34 // 24 Apr 2003 VI Cut per region mfp << 35 // << 36 // 15 Jul 2009 Nicolas A. Karakatsanis << 37 // << 38 // - BuildCrossSecti << 39 // logarithmic val << 40 // It retrieves th << 41 // respective log << 42 // The EM data set << 43 // These initializ << 44 // operations << 45 // 32 // 46 // ------------------------------------------- 33 // ------------------------------------------------------------------- 47 34 48 #include "G4CrossSectionHandler.hh" 35 #include "G4CrossSectionHandler.hh" 49 #include "G4VDataSetAlgorithm.hh" 36 #include "G4VDataSetAlgorithm.hh" 50 #include "G4VEMDataSet.hh" 37 #include "G4VEMDataSet.hh" 51 #include "G4EMDataSet.hh" 38 #include "G4EMDataSet.hh" 52 #include "G4CompositeEMDataSet.hh" 39 #include "G4CompositeEMDataSet.hh" 53 #include "G4ShellEMDataSet.hh" 40 #include "G4ShellEMDataSet.hh" 54 #include "G4ProductionCutsTable.hh" << 41 #include "G4MaterialTable.hh" 55 #include "G4Material.hh" 42 #include "G4Material.hh" 56 #include "G4Element.hh" 43 #include "G4Element.hh" 57 #include "Randomize.hh" << 44 #include "Randomize.hh" 58 #include <map> << 45 #include "g4std/map" 59 #include <vector> << 46 #include "g4std/vector" >> 47 #include "g4std/fstream" >> 48 #include "g4std/strstream" 60 49 61 #include "G4LogLogInterpolation.hh" 50 #include "G4LogLogInterpolation.hh" 62 51 63 //....oooOO0OOooo........oooOO0OOooo........oo << 64 << 65 G4CrossSectionHandler::G4CrossSectionHandler() 52 G4CrossSectionHandler::G4CrossSectionHandler() 66 { } 53 { } 67 54 68 //....oooOO0OOooo........oooOO0OOooo........oo << 69 << 70 G4CrossSectionHandler::~G4CrossSectionHandler( 55 G4CrossSectionHandler::~G4CrossSectionHandler() 71 { } 56 { } 72 57 73 //....oooOO0OOooo........oooOO0OOooo........oo << 58 G4std::vector<G4VEMDataSet*>* 74 << 75 std::vector<G4VEMDataSet*>* << 76 G4CrossSectionHandler::BuildCrossSectionsForMa 59 G4CrossSectionHandler::BuildCrossSectionsForMaterials(const G4DataVector& energyVector, 77 const G4DataVector*) << 60 const G4DataVector* energyCuts) 78 { 61 { 79 G4DataVector* energies; 62 G4DataVector* energies; 80 G4DataVector* data; 63 G4DataVector* data; 81 64 82 G4DataVector* log_energies; << 65 G4std::vector<G4VEMDataSet*>* matCrossSections = new G4std::vector<G4VEMDataSet*>; 83 G4DataVector* log_data; << 84 66 85 std::vector<G4VEMDataSet*>* matCrossSections << 67 const G4MaterialTable* materialTable = G4Material::GetMaterialTable(); >> 68 G4int nMaterials = G4Material::GetNumberOfMaterials(); >> 69 >> 70 size_t nOfBins = energyVector.size(); 86 71 87 const G4ProductionCutsTable* theCoupleTable= << 72 for (G4int m=0; m<nMaterials; m++) 88 G4ProductionCutsTable::GetProductionCu << 89 G4int numOfCouples = (G4int)theCoupleTable-> << 90 << 91 std::size_t nOfBins = energyVector.size(); << 92 const G4VDataSetAlgorithm* interpolationAlgo << 93 << 94 for (G4int mLocal=0; mLocal<numOfCouples; ++ << 95 { 73 { 96 const G4MaterialCutsCouple* couple = the << 74 const G4Material* material= (*materialTable)[m]; 97 const G4Material* material= couple->GetM << 75 energies = new G4DataVector; 98 G4int nElements = (G4int)material->GetNu << 76 data = new G4DataVector; 99 const G4ElementVector* elementVector = m << 77 G4VDataSetAlgorithm* interpolationAlgo = CreateInterpolation(); 100 const G4double* nAtomsPerVolume = materi << 78 for (size_t bin=0; bin<nOfBins; bin++) 101 << 79 { 102 G4VDataSetAlgorithm* algo = interpolatio << 80 G4double e = energyVector[bin]; 103 << 81 energies->push_back(e); 104 G4VEMDataSet* setForMat = new G4Composit << 82 G4double materialCrossSection = ValueForMaterial(material,e); 105 << 83 data->push_back(materialCrossSection); 106 for (G4int i=0; i<nElements; ++i) { << 84 } 107 << 85 G4VEMDataSet* dataSet = new G4EMDataSet(m,energies,data,interpolationAlgo,1.,1.); 108 G4int Z = (G4int) (*elementVector)[i]- << 86 matCrossSections->push_back(dataSet); 109 G4double density = nAtomsPerVolume[i]; << 110 << 111 energies = new G4DataVector; << 112 data = new G4DataVector; << 113 << 114 log_energies = new G4DataVector; << 115 log_data = new G4DataVector; << 116 << 117 for (std::size_t bin=0; bin<nOfBins; + << 118 { << 119 G4double e = energyVector[bin]; << 120 energies->push_back(e); << 121 if (e==0.) e=1e-300; << 122 log_energies->push_back(std::log10 << 123 G4double cross = density*FindValue(Z,e); << 124 data->push_back(cross); << 125 if (cross==0.) cross=1e-300; << 126 log_data->push_back(std::log10(cro << 127 } << 128 << 129 G4VDataSetAlgorithm* algo1 = interpola << 130 G4VEMDataSet* elSet = new G4EMDataSet( << 131 << 132 setForMat->AddComponent(elSet); << 133 } << 134 << 135 matCrossSections->push_back(setForMat); << 136 } 87 } 137 delete interpolationAlgo; << 138 return matCrossSections; 88 return matCrossSections; 139 } 89 } 140 90 141 91