/*
* Author: Andrej Prochazka
* Copyright(C) 2017
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see .
*/
#ifndef STORAGE
#define STORAGE
#include
#include
//#include
#include
#include "catima/constants.h"
#include "catima/catima.h"
namespace catima{
enum interpolation_t {cspline, linear};
//inline double energy_function( int i ) { return exp(M_LN10*(logEmin + ((double)i)*(logEmax-logEmin)/(max_datapoints - 1.0))); }
//enum DataType{TYPE_RANGE,TYPE_LS};
/*
template
struct EnergyTable{
constexpr EnergyTable(double logmin, double logmax):values(),step(0.0),num(N){
step = (logmax-logmin)/(N - 1.0);
for(auto i=0;i
struct EnergyTable{
EnergyTable(double logmin, double logmax):values(),step(0.0),num(N){
step = (logmax-logmin)/(N - 1.0);
for(auto i=0;i energy_table;
template
int EnergyTable_index(const EnergyTable &table, double val){
val = log(val)/M_LN10;
if(valtable.values[table.num-1])return -1;
int i = (int)val/table.step;
//double x = 1.0 - ((val - table.valuesp[i])/table.step);
return i;
}
template
double EnergyTable_interpolate(const EnergyTable &table, double xval, double *y){
double r;
double lxval = log(xval)/M_LN10;
if(xvaltable.values[table.num-1])return 0.0;
if(xval==table.values[table.num-1])return y[table.num-1];
int i = (int)(lxval/table.step);
double linstep = table.values[i+1] - table.values[i];
double x = 1.0 - ((xval - table.values[i])/linstep);
r = (x*y[i]) + ((1-x)*y[i+1]);
return r;
}
/*
template
struct EnergyTableLinear{
constexpr EnergyTableLinear():values(),num(N){
for(auto i=0;i range;
std::vector range_straggling;
std::vector angular_variance;
DataPoint(){};
DataPoint(const Projectile _p, const Material _m,Config _c=default_config):p(_p),m(_m),config(_c){};
~DataPoint();
friend bool operator==(const DataPoint &a, const DataPoint &b);
};
class Data{
public:
Data();
~Data();
void Add(const Projectile &p, const Material &t, Config c=default_config);
int GetN() const {return storage.size();};
void Reset(){storage.clear();storage.resize(max_storage_data);};
DataPoint& Get(const Projectile &p, const Material &t, Config c=default_config);
int get_index() {return std::distance(storage.begin(),index);}
private:
std::vector storage;
std::vector::iterator index;
};
/// Interpolation class, to store interpolated values
class Interpolator{
public:
Interpolator(const double *x, const double *y, int num,interpolation_t type=cspline);
Interpolator(const std::vector& x, const std::vector& y,interpolation_t type=cspline);
~Interpolator();
double operator()(double x){return eval(x);};
double eval(double x);
double derivative(double x);
double get_min(){return min;};
double get_max(){return max;};
private:
double min=0;
double max=0;
gsl_interp_accel *acc;
gsl_spline *spline;
};
extern Data _storage;
inline DataPoint& get_data(const Projectile &p, const Material &t, Config c=default_config){
return _storage.Get(p, t, c);
}
bool operator==(const DataPoint &a, const DataPoint &b);
}
#endif