| [833] | 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 | //
|
|---|
| [921] | 27 | // $Id: G4PhysicsFreeVector.cc,v 1.12 2008/09/22 14:49:57 gcosmo Exp $
|
|---|
| [1058] | 28 | // GEANT4 tag $Name: geant4-09-02-ref-02 $
|
|---|
| [833] | 29 | //
|
|---|
| 30 | //
|
|---|
| 31 | //--------------------------------------------------------------------
|
|---|
| 32 | // GEANT 4 class implementation file
|
|---|
| 33 | //
|
|---|
| 34 | // G4PhysicsFreeVector.cc
|
|---|
| 35 | //
|
|---|
| 36 | // History:
|
|---|
| 37 | // 02 Dec. 1995, G.Cosmo : Structure created based on object model
|
|---|
| 38 | // 06 June 1996, K.Amako : The 1st version of implemented
|
|---|
| 39 | // 01 Jul. 1996, K.Amako : Cache mechanism and hidden bin from the
|
|---|
| 40 | // user introduced
|
|---|
| 41 | // 26 Sep. 1996, K.Amako : Constructor with only 'bin size' added
|
|---|
| 42 | // 11 Nov. 2000, H.Kurashige : use STL vector for dataVector and binVector
|
|---|
| 43 | //
|
|---|
| 44 | //--------------------------------------------------------------------
|
|---|
| 45 |
|
|---|
| 46 | #include "G4PhysicsFreeVector.hh"
|
|---|
| 47 |
|
|---|
| 48 |
|
|---|
| [921] | 49 | G4PhysicsFreeVector::G4PhysicsFreeVector()
|
|---|
| 50 | : G4PhysicsVector()
|
|---|
| [833] | 51 | {
|
|---|
| 52 | type = T_G4PhysicsFreeVector;
|
|---|
| 53 | }
|
|---|
| 54 |
|
|---|
| 55 | G4PhysicsFreeVector::G4PhysicsFreeVector(size_t theNbin)
|
|---|
| [921] | 56 | : G4PhysicsVector()
|
|---|
| [833] | 57 | {
|
|---|
| 58 | type = T_G4PhysicsFreeVector;
|
|---|
| 59 | numberOfBin = theNbin;
|
|---|
| 60 |
|
|---|
| 61 | // Add extra one bin (hidden to user) to handle correctly when
|
|---|
| 62 | // Energy=theEmax in getValue.
|
|---|
| 63 | dataVector.reserve(numberOfBin+1);
|
|---|
| 64 | binVector.reserve(numberOfBin+1);
|
|---|
| 65 |
|
|---|
| 66 | for (size_t i=0; i<=numberOfBin; i++)
|
|---|
| 67 | {
|
|---|
| 68 | binVector.push_back(0.0);
|
|---|
| 69 | dataVector.push_back(0.0);
|
|---|
| 70 | }
|
|---|
| 71 | }
|
|---|
| 72 |
|
|---|
| 73 | G4PhysicsFreeVector::G4PhysicsFreeVector(const G4DataVector& theBinVector,
|
|---|
| 74 | const G4DataVector& theDataVector)
|
|---|
| 75 | {
|
|---|
| 76 | type = T_G4PhysicsFreeVector;
|
|---|
| 77 | numberOfBin = theBinVector.size();
|
|---|
| 78 |
|
|---|
| 79 | // Add extra one bin (hidden to user) to handle correctly when
|
|---|
| 80 | // Energy=theEmax in getValue.
|
|---|
| 81 | dataVector.reserve(numberOfBin+1);
|
|---|
| 82 | binVector.reserve(numberOfBin+1);
|
|---|
| 83 |
|
|---|
| 84 | for (size_t i=0; i<numberOfBin; i++)
|
|---|
| 85 | {
|
|---|
| 86 | binVector.push_back(theBinVector[i]);
|
|---|
| 87 | dataVector.push_back(theDataVector[i]);
|
|---|
| 88 | }
|
|---|
| 89 |
|
|---|
| 90 | // Put values to extra hidden bin. For 'binVector', the 'edgeMin' of the
|
|---|
| 91 | // extra hidden bin is assumed to have the following value. For binary
|
|---|
| 92 | // search, this value is completely arbitrary if it is greater than
|
|---|
| 93 | // the 'edgeMin' at 'numberOfBin-1'.
|
|---|
| 94 | binVector.push_back ( theBinVector[numberOfBin-1] + 1.0 );
|
|---|
| 95 |
|
|---|
| 96 |
|
|---|
| 97 | // Put values to extra hidden bin. For 'dataVector', the 'value' of the
|
|---|
| 98 | // extra hidden bin is assumed to have the same as the one at 'numberBin-1'.
|
|---|
| 99 | dataVector.push_back( theDataVector[numberOfBin-1] );
|
|---|
| 100 |
|
|---|
| 101 | edgeMin = binVector[0];
|
|---|
| 102 | edgeMax = binVector[numberOfBin-1];
|
|---|
| 103 | }
|
|---|
| 104 |
|
|---|
| [921] | 105 | G4PhysicsFreeVector::~G4PhysicsFreeVector()
|
|---|
| 106 | {
|
|---|
| 107 | }
|
|---|
| [833] | 108 |
|
|---|
| 109 | void G4PhysicsFreeVector::PutValue( size_t theBinNumber, G4double theBinValue,
|
|---|
| 110 | G4double theDataValue )
|
|---|
| 111 | {
|
|---|
| 112 | binVector[theBinNumber] = theBinValue;
|
|---|
| 113 | dataVector[theBinNumber] = theDataValue;
|
|---|
| 114 |
|
|---|
| 115 | if( theBinNumber == numberOfBin-1 )
|
|---|
| 116 | {
|
|---|
| 117 | edgeMax = binVector[numberOfBin-1];
|
|---|
| 118 |
|
|---|
| 119 | // Put values to extra hidden bin. For 'binVector', the 'edgeMin'
|
|---|
| 120 | // of the extra hidden bin is assumed to have the following value.
|
|---|
| 121 | // For binary search, this value is completely arbitrary if it is
|
|---|
| 122 | // greater than the 'edgeMin' at 'numberOfBin-1'.
|
|---|
| 123 | binVector[numberOfBin] = theBinValue + 1.0;
|
|---|
| 124 |
|
|---|
| 125 | // Put values to extra hidden bin. For 'dataVector', the 'value'
|
|---|
| 126 | // of the extra hidden bin is assumed to have the same as the one
|
|---|
| 127 | // at 'numberBin-1'.
|
|---|
| 128 | dataVector[numberOfBin] = theDataValue;
|
|---|
| 129 | }
|
|---|
| 130 |
|
|---|
| 131 | if( theBinNumber == 0 )
|
|---|
| 132 | {
|
|---|
| 133 | edgeMin = binVector[0];
|
|---|
| 134 | }
|
|---|
| 135 | }
|
|---|