1
0
Fork 0
mirror of https://github.com/gwm17/catima.git synced 2024-11-26 20:18:51 -05:00
catima/storage.h

184 lines
5.3 KiB
C
Raw Normal View History

2017-07-25 12:19:11 -04:00
/*
* 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 <http://www.gnu.org/licenses/>.
*/
#ifndef STORAGE
#define STORAGE
#include <vector>
#include <iterator>
2018-02-26 17:20:42 -05:00
#include <cmath>
2017-07-25 12:19:11 -04:00
//#include <unordered_set>
#include <gsl/gsl_spline.h>
2018-02-26 18:38:03 -05:00
#include "catima/build_config.h"
2017-07-25 12:19:11 -04:00
#include "catima/constants.h"
2018-02-26 17:20:42 -05:00
#include "catima/structures.h"
#include "catima/config.h"
#ifdef BUILTIN_SPLINE
#include "catima/spline.h"
#endif
2017-07-25 12:19:11 -04:00
namespace catima{
enum interpolation_t {cspline, linear};
template<int N>
struct EnergyTable{
EnergyTable(double logmin, double logmax):values(),step(0.0),num(N){
step = (logmax-logmin)/(N - 1.0);
for(auto i=0;i<N;i++){
values[i]=exp(M_LN10*(logmin + ((double)i)*step));
}
}
double operator()(int i)const{return values[i];}
double values[N];
double step;
2017-07-27 05:39:44 -04:00
double* begin(){return values;}
double* end(){return &values[num-1];}
std::size_t num;
};
extern EnergyTable<max_datapoints> energy_table;
2017-07-25 12:19:11 -04:00
template<int N>
int EnergyTable_index(const EnergyTable<N> &table, double val){
if(val<table.values[0] || val>table.values[table.num-1])return -1;
2018-02-26 17:20:42 -05:00
double lxval = (log(val/table.values[0])/M_LN10);
int i = (int)std::floor(lxval/table.step);
2017-07-25 12:19:11 -04:00
return i;
}
template<int N>
double EnergyTable_interpolate(const EnergyTable<N> &table, double xval, double *y){
double r;
2017-07-26 13:25:45 -04:00
if(xval<table.values[0] || xval>table.values[table.num-1])return 0.0;
if(xval==table.values[table.num-1])return y[table.num-1];
2018-02-26 17:20:42 -05:00
double lxval = (log(xval/table.values[0])/M_LN10);
int i = (int)std::floor(lxval/table.step);
double linstep = table.values[i+1] - table.values[i];
2017-07-25 12:19:11 -04:00
double x = 1.0 - ((xval - table.values[i])/linstep);
r = (x*y[i]) + ((1-x)*y[i+1]);
return r;
}
2017-07-25 12:19:11 -04:00
/*
template<int N>
struct EnergyTableLinear{
constexpr EnergyTableLinear():values(),num(N){
for(auto i=0;i<N;i++){
values[i]=exp(M_LN10*(logEmin + ((double)i)*(logEmax-logEmin)/(N - 1.0)));
}
}
double operator()(int i)const{return values[i];}
double values[N];
std::size_t num;
};
*/
2018-04-12 19:12:45 -04:00
// return vector with lineary spaced elements from a to b, num is number of elements
inline std::vector<double> linspace_vector(double a, double b, unsigned int num){
std::vector<double> res;
if(num>=2 && a<b){
res.resize(num);
double step = (b-a)/(num-1);
for(unsigned int i=0;i<(num-1);i++){
res[i]=a+(i*step);
}
res[num-1] = b;
}
return res;
}
2017-07-25 12:19:11 -04:00
class DataPoint{
public:
Projectile p;
Material m;
Config config;
std::vector<double> range;
std::vector<double> range_straggling;
std::vector<double> angular_variance;
DataPoint(){};
2018-01-18 13:20:42 -05:00
DataPoint(const Projectile _p, const Material _m,const Config &_c=default_config):p(_p),m(_m),config(_c){};
2017-07-25 12:19:11 -04:00
~DataPoint();
friend bool operator==(const DataPoint &a, const DataPoint &b);
};
class Data{
public:
Data();
~Data();
2018-01-18 13:20:42 -05:00
void Add(const Projectile &p, const Material &t, const Config &c=default_config);
2017-07-25 12:19:11 -04:00
int GetN() const {return storage.size();};
2017-10-17 10:39:04 -04:00
void Reset(){storage.clear();storage.resize(max_storage_data);index=storage.begin();};
2018-01-18 13:20:42 -05:00
DataPoint& Get(const Projectile &p, const Material &t, const Config &c=default_config);
2017-10-18 19:36:54 -04:00
DataPoint& Get(unsigned int i){return storage[i];};
2017-07-25 12:19:11 -04:00
int get_index() {return std::distance(storage.begin(),index);}
private:
std::vector<DataPoint> storage;
std::vector<DataPoint>::iterator index;
};
/// Interpolation class, to store interpolated values
2018-02-26 17:20:42 -05:00
class InterpolatorGSL{
2017-07-25 12:19:11 -04:00
public:
2018-02-26 17:20:42 -05:00
InterpolatorGSL(const double *x, const double *y, int num,interpolation_t type=cspline);
InterpolatorGSL(const std::vector<double>& x, const std::vector<double>& y,interpolation_t type=cspline);
~InterpolatorGSL();
2017-07-25 12:19:11 -04:00
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;
};
2018-02-26 17:20:42 -05:00
#ifdef BUILTIN_SPLINE
class Interpolator2{
public:
Interpolator2(const double *x, const double *y, int num);
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;
spline ss;
};
#endif
2017-07-25 12:19:11 -04:00
extern Data _storage;
2018-01-18 13:20:42 -05:00
inline DataPoint& get_data(const Projectile &p, const Material &t, const Config &c=default_config){
2017-07-25 12:19:11 -04:00
return _storage.Get(p, t, c);
}
bool operator==(const DataPoint &a, const DataPoint &b);
2018-02-26 17:20:42 -05:00
using InterpolatorLinear = InterpolatorGSL;
using Interpolator = InterpolatorGSL;
2017-07-25 12:19:11 -04:00
}
#endif