6663b6c9
 adorian
projet complet av...
|
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
|
#include "left_integral_calculation.h"
#include <assert.h>
#include <ion.h>
#include <cmath>
namespace Probability {
LeftIntegralCalculation::LeftIntegralCalculation() :
Calculation(),
m_upperBound(0.0),
m_result(0.0)
{
compute(0);
}
Calculation::Type LeftIntegralCalculation::type() {
return Type::LeftIntegral;
}
int LeftIntegralCalculation::numberOfParameters() {
return 2;
}
I18n::Message LeftIntegralCalculation::legendForParameterAtIndex(int index) {
assert(index >= 0 && index < 2);
if (index == 0) {
return I18n::Message::LeftIntegralFirstLegend;
}
return I18n::Message::LeftIntegralSecondLegend;
}
void LeftIntegralCalculation::setParameterAtIndex(double f, int index) {
assert(index >= 0 && index < 2);
if (index == 0) {
m_upperBound = f;
}
if (index == 1) {
m_result = f;
}
compute(index);
}
double LeftIntegralCalculation::parameterAtIndex(int index) {
assert(index >= 0 && index < 2);
if (index == 0) {
return m_upperBound;
}
return m_result;
}
double LeftIntegralCalculation::upperBound() {
return m_upperBound;
}
void LeftIntegralCalculation::compute(int indexKnownElement) {
if (m_law == nullptr) {
return;
}
if (indexKnownElement == 0) {
m_result = m_law->cumulativeDistributiveFunctionAtAbscissa(m_upperBound);
} else {
m_upperBound = m_law->cumulativeDistributiveInverseForProbability(&m_result);
}
}
}
|