36 #define G_CONSTRUCT "GOptimizerPar::GOptimizerPar(std::string&, double&,"\
38 #define G_MIN "GOptimizerPar::min(double&)"
39 #define G_MAX "GOptimizerPar::max(double&)"
40 #define G_FACTOR_VALUE "GOptimizerPar::factor_value(double&)"
41 #define G_FACTOR_MIN "GOptimizerPar::factor_min(double&)"
42 #define G_FACTOR_MAX "GOptimizerPar::factor_max(double&)"
43 #define G_SCALE "GOptimizerPar::scale(double&)"
122 const double& factor,
127 std::string msg =
"Specified a parameter scale factor of 0.\n"
128 "Parameters need a non-zero scale factor.";
318 std::string msg =
"Specified minimum parameter value "+
355 std::string msg =
"Specified maximum parameter value "+
394 std::string msg =
"Specified value factor "+
gammalib::str(value)+
395 " is smaller than the minimum boundary "+
403 std::string msg =
"Specified value factor "+
gammalib::str(value)+
404 " is larger than the maximum boundary "+
433 std::string msg =
"Specified minimum factor "+
gammalib::str(min)+
434 " is larger than the value factor "+
464 std::string msg =
"Specified maximum factor "+
gammalib::str(max)+
465 " is smaller than the value factor "+
517 std::string msg =
"Specified parameter scale factor of 0.\n"
518 "Parameters need a non-zero scale factor.";
621 result.append(
" "+
m_unit);
625 result.append(
" (free");
628 result.append(
" (fixed");
636 result.append(
",gradient)");
const double & factor_error(void) const
Return parameter factor error.
GOptimizerPar * clone(void) const
Clone parameter.
const double & factor_gradient(void) const
Return parameter factor gradient.
bool has_factor_max(void) const
Signal if parameter has maximum factor boundary.
const std::string & name(void) const
Return parameter name.
double gradient(void) const
Return parameter gradient.
bool m_free
Parameter is free.
void factor_range(const double &min, const double &max)
Set minimum and maximum parameter boundary factors.
GOptimizerPar(void)
Void constructor.
bool has_factor_min(void) const
Signal if parameter has minimum factor boundary.
double max(void) const
Return parameter maximum boundary.
double m_factor_min
Parameter minimum factor value.
bool m_has_grad
Parameter has analytic gradient.
double min(const GVector &vector)
Computes minimum vector element.
std::string m_unit
Parameter unit.
double min(void) const
Return parameter minimum boundary.
const double & scale(void) const
Return parameter scale.
double m_scale
Parameter scaling (true = factor * scale)
const double & factor_max(void) const
Return parameter maximum factor boundary.
void autoscale(void)
Autoscale parameter.
GOptimizerPar & operator=(const GOptimizerPar &par)
Assignment operator.
double m_factor_value
Parameter factor value.
void clear(void)
Clear parameter.
double m_factor_error
Uncertainty in parameter factor value.
std::string m_name
Parameter name.
double m_factor_max
Parameter maximum factor value.
bool has_max(void) const
Signal if parameter has maximum boundary.
double max(const GVector &vector)
Computes maximum vector element.
void free_members(void)
Delete class members.
const double & factor_min(void) const
Return parameter minimum factor boundary.
void init_members(void)
Initialise class members.
double value(void) const
Return parameter value.
bool has_min(void) const
Signal if parameter has minimum boundary.
Exception handler interface definition.
Optimizer parameter class interface definition.
bool m_has_factor_max
Parameter has maximum factor boundary.
double error(void) const
Return parameter error.
double m_factor_gradient
Function factor gradient.
std::string parformat(const std::string &s, const int &indent=0)
Convert string in parameter format.
void copy_members(const GOptimizerPar &par)
Copy class members.
bool m_has_factor_min
Parameter has minimum factor boundary.
std::string print(const GChatter &chatter=NORMAL) const
Print parameter information.
const double & factor_value(void) const
Return parameter factor value.
std::string str(const unsigned short int &value)
Convert unsigned short integer value into string.
virtual ~GOptimizerPar(void)
Destructor.
Optimizer parameter class.