#include <BichselData.h>

Collaboration diagram for BichselData:

Public Member Functions
bool	empty () const
size_t	size () const
double	lastBetaGammaValue () const
void	addNewLogBetaGamma (double logBetaGamma)
void	addEntry (double logBetaGamma, double logCollisionEnergy, double logIntegratedCrossSection)
void	updateAfterLastEntry ()
std::pair< int, int >	getBetaGammaIndices (double BetaGammaLog10) const
double	interpolateCollisionEnergy (std::pair< int, int > indices_BetaGammaLog10, double IntXLog10) const
double	interpolateCollisionEnergy (double BetaGammaLog10, double IntXLog10) const
double	interpolateCrossSection (std::pair< int, int > indices_BetaGammaLog10, double BetaGammaLog10) const
double	interpolateCrossSection (double BetaGammaLog10) const

Public Attributes
std::vector< double >	logBetaGammaVector
std::vector< std::vector< double > >	logCollisionEnergyVectorOfVector
std::vector< std::vector< double > >	logIntegratedCrossSectionsVectorOfVector
std::vector< double >	logHighestCrossSectionsVector

Detailed Description

Definition at line 14 of file BichselData.h.

Member Function Documentation

◆ addEntry()

void BichselData::addEntry	(	double	logBetaGamma,
		double	logCollisionEnergy,
		double	logIntegratedCrossSection )

Definition at line 34 of file BichselData.cxx.

                                                                                                     {
  if (empty() or (lastBetaGammaValue() != logBetaGamma)) { // a new BetaGamma
    addNewLogBetaGamma(logBetaGamma);
  }
  logCollisionEnergyVectorOfVector.back().push_back(logCollisionEnergy);
  logIntegratedCrossSectionsVectorOfVector.back().push_back(logIntegratedCrossSection);
}

◆ addNewLogBetaGamma()

void BichselData::addNewLogBetaGamma ( double logBetaGamma )

Definition at line 22 of file BichselData.cxx.

                                                  {
  
  if (not empty()) {
    logHighestCrossSectionsVector.push_back(logIntegratedCrossSectionsVectorOfVector.back().back());
  }
  logBetaGammaVector.push_back(logBetaGamma);
  //insert empty arrays
  logCollisionEnergyVectorOfVector.emplace_back();
  logIntegratedCrossSectionsVectorOfVector.emplace_back();
}

◆ empty()

bool BichselData::empty ( ) const

inline

Definition at line 22 of file BichselData.h.

22{ return logBetaGammaVector.empty();}

◆ getBetaGammaIndices()

std::pair< int, int > BichselData::getBetaGammaIndices ( double BetaGammaLog10 ) const

Definition at line 51 of file BichselData.cxx.

                                                            {
  std::pair<int, int> indices_BetaGammaLog10;
  if (empty()) return {-1,-1};
  if (BetaGammaLog10 > logBetaGammaVector.back()) { // last one is used because when beta-gamma is very large,
                                                            // energy deposition behavior is very similar
    indices_BetaGammaLog10.first = logBetaGammaVector.size() - 1;
    indices_BetaGammaLog10.second = logBetaGammaVector.size() - 1;
  } else {
    indices_BetaGammaLog10 =PixelDigitization::fastSearch(logBetaGammaVector, BetaGammaLog10);
  }
 
  return indices_BetaGammaLog10;
}

◆ interpolateCollisionEnergy() [1/2]

double BichselData::interpolateCollisionEnergy	(	double	BetaGammaLog10,
		double	IntXLog10 ) const

Definition at line 108 of file BichselData.cxx.

                                                                                     {
  std::pair<int, int> indices_BetaGammaLog10 = getBetaGammaIndices(BetaGammaLog10);
  return interpolateCollisionEnergy(indices_BetaGammaLog10, IntXLog10);
}

◆ interpolateCollisionEnergy() [2/2]

double BichselData::interpolateCollisionEnergy	(	std::pair< int, int >	indices_BetaGammaLog10,
		double	IntXLog10 ) const

Definition at line 73 of file BichselData.cxx.

                                                                                                        {
  if ((indices_BetaGammaLog10.first == -1) && (indices_BetaGammaLog10.second == -1)) return -1.;
  if (empty()) return -1.;
 
 
  // BetaGammaLog10_2 then
  std::pair<int, int> indices_IntXLog10_x2 =
    PixelDigitization::fastSearch(logIntegratedCrossSectionsVectorOfVector[indices_BetaGammaLog10.second], IntXLog10);
  if (indices_IntXLog10_x2.first < 0) {
    return -1;
  }
  if (indices_IntXLog10_x2.second < 0) {
    return -1;
  }
  
  double y21 = logIntegratedCrossSectionsVectorOfVector.at(indices_BetaGammaLog10.second).at(indices_IntXLog10_x2.first);
  double y22 = logIntegratedCrossSectionsVectorOfVector.at(indices_BetaGammaLog10.second).at(indices_IntXLog10_x2.second);
  const auto diff = y22 - y21;
  if (diff<1e-300){
    //these are the same value
    return -1;
  }  
  double Est_x2 =
    ((y22 - IntXLog10) *
     logCollisionEnergyVectorOfVector[indices_BetaGammaLog10.second][indices_IntXLog10_x2.first] +
     (IntXLog10 - y21) *
     logCollisionEnergyVectorOfVector[indices_BetaGammaLog10.second][indices_IntXLog10_x2.second]) / diff;
  double Est = std::clamp(Est_x2,-300.,300.);
  return std::pow(10., Est);
}

◆ interpolateCrossSection() [1/2]

double BichselData::interpolateCrossSection ( double BetaGammaLog10 ) const

Definition at line 150 of file BichselData.cxx.

                                                                {
  std::pair<int, int> indices_BetaGammaLog10 = getBetaGammaIndices(BetaGammaLog10);
  return interpolateCrossSection(indices_BetaGammaLog10, BetaGammaLog10);
}

◆ interpolateCrossSection() [2/2]

double BichselData::interpolateCrossSection	(	std::pair< int, int >	indices_BetaGammaLog10,
		double	BetaGammaLog10 ) const

Definition at line 117 of file BichselData.cxx.

                                                                                                          {
  if (empty()) return -1;
  if (indices_BetaGammaLog10.first < 0) {
    return -1;
  }
  if (indices_BetaGammaLog10.second < 0) {
    return -1;
  }
  if (indices_BetaGammaLog10.second == indices_BetaGammaLog10.first){ //either an exact value or the last one in the table
    return std::pow(10., logHighestCrossSectionsVector.at(indices_BetaGammaLog10.first));
  }
  double BetaGammaLog10_1 = logBetaGammaVector.at(indices_BetaGammaLog10.first);
  double BetaGammaLog10_2 = logBetaGammaVector.at(indices_BetaGammaLog10.second);
 
  // obtain estimation
  double Est_1 = logHighestCrossSectionsVector.at(indices_BetaGammaLog10.first);
  double Est_2 = logHighestCrossSectionsVector.at(indices_BetaGammaLog10.second);
 
  // final estimation
  const auto diff=BetaGammaLog10_2 - BetaGammaLog10_1;
  if (diff<1e-300){
    return -1;
  } 
  double Est = ((BetaGammaLog10_2 - BetaGammaLog10) * Est_1 + (BetaGammaLog10 - BetaGammaLog10_1) * Est_2) /diff;
  Est = std::clamp(Est,-300.,300.);
  return std::pow(10., Est);
  
  
}

◆ lastBetaGammaValue()

double BichselData::lastBetaGammaValue ( ) const

Definition at line 12 of file BichselData.cxx.

                                     { 
  if (not logBetaGammaVector.empty()){
    return logBetaGammaVector.back();
  } else {
    return std::numeric_limits<double>::quiet_NaN();
  }
}

◆ size()

size_t BichselData::size ( ) const

inline

Definition at line 23 of file BichselData.h.

23{ return logBetaGammaVector.size();}

◆ updateAfterLastEntry()

void BichselData::updateAfterLastEntry ( )

Definition at line 42 of file BichselData.cxx.

                                      {
  logHighestCrossSectionsVector.push_back(logIntegratedCrossSectionsVectorOfVector.back().back());
}

Member Data Documentation

◆ logBetaGammaVector

std::vector<double> BichselData::logBetaGammaVector

Definition at line 16 of file BichselData.h.

◆ logCollisionEnergyVectorOfVector

std::vector<std::vector<double> > BichselData::logCollisionEnergyVectorOfVector

Definition at line 17 of file BichselData.h.

◆ logHighestCrossSectionsVector

std::vector<double> BichselData::logHighestCrossSectionsVector

Definition at line 19 of file BichselData.h.

◆ logIntegratedCrossSectionsVectorOfVector

std::vector<std::vector<double> > BichselData::logIntegratedCrossSectionsVectorOfVector

Definition at line 18 of file BichselData.h.

The documentation for this struct was generated from the following files:

Public Member Functions

Public Attributes