mirror of
https://github.com/UpsilonNumworks/Upsilon.git
synced 2026-01-19 00:37:25 +01:00
Before: Opposite(Opposite(Rational(1))) misleadingly created the expression "-1"; now, Opposite::Builder(Opposite::Builder(Rational(1))) creates "--1"
110 lines
4.8 KiB
C++
110 lines
4.8 KiB
C++
#include <poincare/prediction_interval.h>
|
|
#include <poincare/matrix.h>
|
|
#include <poincare/addition.h>
|
|
#include <poincare/multiplication.h>
|
|
#include <poincare/power.h>
|
|
#include <poincare/undefined.h>
|
|
#include <poincare/division.h>
|
|
#include <poincare/layout_helper.h>
|
|
#include <poincare/serialization_helper.h>
|
|
extern "C" {
|
|
#include <assert.h>
|
|
}
|
|
#include <cmath>
|
|
|
|
namespace Poincare {
|
|
|
|
constexpr Expression::FunctionHelper PredictionInterval::s_functionHelper;
|
|
|
|
int PredictionIntervalNode::numberOfChildren() const { return PredictionInterval::s_functionHelper.numberOfChildren(); }
|
|
|
|
Layout PredictionIntervalNode::createLayout(Preferences::PrintFloatMode floatDisplayMode, int numberOfSignificantDigits) const {
|
|
return LayoutHelper::Prefix(PredictionInterval(this), floatDisplayMode, numberOfSignificantDigits, PredictionInterval::s_functionHelper.name());
|
|
}
|
|
|
|
int PredictionIntervalNode::serialize(char * buffer, int bufferSize, Preferences::PrintFloatMode floatDisplayMode, int numberOfSignificantDigits) const {
|
|
return SerializationHelper::Prefix(this, buffer, bufferSize, floatDisplayMode, numberOfSignificantDigits, PredictionInterval::s_functionHelper.name());
|
|
}
|
|
|
|
|
|
Expression PredictionIntervalNode::shallowReduce(Context & context, Preferences::ComplexFormat complexFormat, Preferences::AngleUnit angleUnit, ReductionTarget target) {
|
|
return PredictionInterval(this).shallowReduce(context, complexFormat, angleUnit, target);
|
|
}
|
|
|
|
template<typename T>
|
|
Evaluation<T> PredictionIntervalNode::templatedApproximate(Context& context, Preferences::ComplexFormat complexFormat, Preferences::AngleUnit angleUnit) const {
|
|
Evaluation<T> pInput = childAtIndex(0)->approximate(T(), context, complexFormat, angleUnit);
|
|
Evaluation<T> nInput = childAtIndex(1)->approximate(T(), context, complexFormat, angleUnit);
|
|
T p = static_cast<Complex<T> &>(pInput).toScalar();
|
|
T n = static_cast<Complex<T> &>(nInput).toScalar();
|
|
if (std::isnan(p) || std::isnan(n) || n != (int)n || n < 0 || p < 0 || p > 1) {
|
|
return Complex<T>::Undefined();
|
|
}
|
|
std::complex<T> operands[2];
|
|
operands[0] = std::complex<T>(p - 1.96*std::sqrt(p*(1.0-p))/std::sqrt(n));
|
|
operands[1] = std::complex<T>(p + 1.96*std::sqrt(p*(1.0-p))/std::sqrt(n));
|
|
return MatrixComplex<T>(operands, 1, 2);
|
|
}
|
|
|
|
Expression PredictionInterval::shallowReduce(Context & context, Preferences::ComplexFormat complexFormat, Preferences::AngleUnit angleUnit, ExpressionNode::ReductionTarget target) {
|
|
{
|
|
Expression e = Expression::defaultShallowReduce();
|
|
if (e.isUndefined()) {
|
|
return e;
|
|
}
|
|
}
|
|
Expression c0 = childAtIndex(0);
|
|
Expression c1 = childAtIndex(1);
|
|
#if MATRIX_EXACT_REDUCING
|
|
if (c0.type() == ExpressionNode::Type::Matrix || c1.type() == ExpressionNode::Type::Matrix) {
|
|
return Undefined();
|
|
}
|
|
#endif
|
|
if (c0.type() == ExpressionNode::Type::Rational) {
|
|
Rational r0 = static_cast<Rational &>(c0);
|
|
if (r0.sign() == ExpressionNode::Sign::Negative || Integer::NaturalOrder(r0.unsignedIntegerNumerator(), r0.integerDenominator()) > 0) {
|
|
Expression result = Undefined();
|
|
replaceWithInPlace(result);
|
|
return result;
|
|
}
|
|
}
|
|
if (c1.type() == ExpressionNode::Type::Rational) {
|
|
Rational r1 = static_cast<Rational &>(c1);
|
|
if (!r1.integerDenominator().isOne() || r1.sign() == ExpressionNode::Sign::Negative) {
|
|
Expression result = Undefined();
|
|
replaceWithInPlace(result);
|
|
return result;
|
|
}
|
|
}
|
|
if (c0.type() != ExpressionNode::Type::Rational || c1.type() != ExpressionNode::Type::Rational) {
|
|
return *this;
|
|
}
|
|
Rational r0 = static_cast<Rational &>(c0);
|
|
Rational r1 = static_cast<Rational &>(c1);
|
|
if (!r1.integerDenominator().isOne() || r1.sign() == ExpressionNode::Sign::Negative || r0.sign() == ExpressionNode::Sign::Negative || Integer::NaturalOrder(r0.unsignedIntegerNumerator(), r0.integerDenominator()) > 0) {
|
|
Expression result = Undefined();
|
|
replaceWithInPlace(result);
|
|
return result;
|
|
}
|
|
/* [r0-1.96*sqrt(r0*(1-r0)/r1), r0+1.96*sqrt(r0*(1-r0)/r1)]*/
|
|
// Compute numerator = r0*(1-r0)
|
|
Integer factorNumerator = Integer::Subtraction(r0.integerDenominator(), r0.unsignedIntegerNumerator());
|
|
Integer factorDenominator = r0.integerDenominator();
|
|
Rational numerator = Rational::Multiplication(r0, Rational(factorNumerator, factorDenominator));
|
|
if (numerator.numeratorOrDenominatorIsInfinity()) {
|
|
return *this;
|
|
}
|
|
// Compute sqr = sqrt(r0*(1-r0)/r1)
|
|
Expression sqr = Power::Builder(Division::Builder(numerator, r1), Rational(1, 2));
|
|
Expression m = Multiplication::Builder(Rational(196, 100), sqr);
|
|
Matrix matrix = Matrix::Builder();
|
|
matrix.addChildAtIndexInPlace(Addition::Builder(r0.clone(), Multiplication::Builder(Rational(-1), m.clone())), 0, 0);
|
|
matrix.addChildAtIndexInPlace(Addition::Builder(r0.clone(), m), 1, 1);
|
|
matrix.setDimensions(1, 2);
|
|
replaceWithInPlace(matrix);
|
|
matrix.deepReduceChildren(context, complexFormat, angleUnit, target);
|
|
return matrix;
|
|
}
|
|
|
|
}
|