1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
// ************************************************************************************************
//
// BornAgain: simulate and fit reflection and scattering
//
//! @file Fit/Param/RealLimits.cpp
//! @brief Implements class Limits.
//!
//! @homepage http://www.bornagainproject.org
//! @license GNU General Public License v3 or higher (see COPYING)
//! @copyright Forschungszentrum Jülich GmbH 2018
//! @authors Scientific Computing Group at MLZ (see CITATION, AUTHORS)
//
// ************************************************************************************************
#include "Fit/Param/RealLimits.h"
#include <iomanip>
#include <iostream>
#include <limits>
#include <sstream>
RealLimits::RealLimits()
: m_has_lower_limit(false)
, m_has_upper_limit(false)
, m_lower_limit(0.)
, m_upper_limit(0.)
{
}
RealLimits::RealLimits(bool has_lower_limit, bool has_upper_limit, double lower_limit,
double upper_limit)
: m_has_lower_limit(has_lower_limit)
, m_has_upper_limit(has_upper_limit)
, m_lower_limit(lower_limit)
, m_upper_limit(upper_limit)
{
}
RealLimits RealLimits::upperLimited(double bound_value)
{
return RealLimits(false, true, 0., bound_value);
}
RealLimits RealLimits::limited(double left_bound_value, double right_bound_value)
{
return RealLimits(true, true, left_bound_value, right_bound_value);
}
RealLimits RealLimits::limitless()
{
return RealLimits();
}
bool RealLimits::isInRange(double value) const
{
if (hasLowerLimit() && value < m_lower_limit)
return false;
if (hasUpperLimit() && value >= m_upper_limit)
return false;
return true;
}
double RealLimits::clamp(double value) const
{
if (m_has_lower_limit && value < m_lower_limit)
return m_lower_limit;
if (m_has_upper_limit && value > m_upper_limit)
return m_upper_limit;
return value;
}
RealLimits RealLimits::lowerLimited(double bound_value)
{
return RealLimits(true, false, bound_value, 0.);
}
RealLimits RealLimits::positive()
{
return lowerLimited(std::numeric_limits<double>::min());
}
RealLimits RealLimits::nonnegative()
{
return lowerLimited(0.);
}
std::string RealLimits::toString() const
{
std::ostringstream result;
if (isLimitless())
result << "unlimited";
else if (isPositive())
result << "positive";
else if (isNonnegative())
result << "nonnegative";
else if (isLowerLimited())
result << "lowerLimited(" << std::fixed << std::setprecision(2) << min() << ")";
else if (isUpperLimited())
result << "upperLimited(" << std::fixed << std::setprecision(2) << max() << ")";
else if (isLimited())
result << "limited(" << std::fixed << std::setprecision(2) << min() << "," << std::fixed
<< std::setprecision(2) << max() << ")";
return result.str();
}
bool RealLimits::operator==(const RealLimits& other) const
{
return (m_has_lower_limit == other.m_has_lower_limit)
&& (m_has_upper_limit == other.m_has_upper_limit)
&& (m_lower_limit == other.m_lower_limit) && (m_upper_limit == other.m_upper_limit);
}
bool RealLimits::operator!=(const RealLimits& other) const
{
return !(*this == other);
}
bool RealLimits::isLimitless() const
{
return !hasLowerLimit() && !hasUpperLimit();
}
bool RealLimits::isPositive() const
{
return hasLowerLimit() && !hasUpperLimit() && min() == std::numeric_limits<double>::min();
}
bool RealLimits::isNonnegative() const
{
return hasLowerLimit() && !hasUpperLimit() && min() == 0.0;
}
bool RealLimits::isLowerLimited() const
{
return hasLowerLimit() && !hasUpperLimit();
}
bool RealLimits::isUpperLimited() const
{
return !hasLowerLimit() && hasUpperLimit();
}
bool RealLimits::isLimited() const
{
return hasLowerLimit() && hasUpperLimit();
}
|
