mirror of
https://github.com/UpsilonNumworks/Upsilon.git
synced 2026-03-19 05:40:38 +01:00
54 lines
2.2 KiB
C++
54 lines
2.2 KiB
C++
#include <poincare/sum.h>
|
|
#include <poincare/addition.h>
|
|
#include <poincare/sum_layout.h>
|
|
#include <poincare/layout_helper.h>
|
|
#include <poincare/serialization_helper.h>
|
|
extern "C" {
|
|
#include <assert.h>
|
|
#include <stdlib.h>
|
|
}
|
|
#include <cmath>
|
|
|
|
namespace Poincare {
|
|
|
|
constexpr Expression::FunctionHelper Sum::s_functionHelper;
|
|
|
|
Layout SumNode::createSumAndProductLayout(Layout argumentLayout, Layout symbolLayout, Layout subscriptLayout, Layout superscriptLayout) const {
|
|
return SumLayout::Builder(argumentLayout, symbolLayout, subscriptLayout, superscriptLayout);
|
|
}
|
|
|
|
int SumNode::serialize(char * buffer, int bufferSize, Preferences::PrintFloatMode floatDisplayMode, int numberOfSignificantDigits) const {
|
|
return SerializationHelper::Prefix(this, buffer, bufferSize, floatDisplayMode, numberOfSignificantDigits, Sum::s_functionHelper.name());
|
|
}
|
|
|
|
template<typename T>
|
|
Evaluation<T> SumNode::templatedApproximateWithNextTerm(Evaluation<T> a, Evaluation<T> b, Preferences::ComplexFormat complexFormat) const {
|
|
if (a.type() == EvaluationNode<T>::Type::Complex && b.type() == EvaluationNode<T>::Type::Complex) {
|
|
Complex<T> c = static_cast<Complex<T>&>(a);
|
|
Complex<T> d = static_cast<Complex<T>&>(b);
|
|
return Complex<T>::Builder(c.stdComplex()+d.stdComplex());
|
|
}
|
|
if (a.type() == EvaluationNode<T>::Type::Complex) {
|
|
Complex<T> c = static_cast<Complex<T> &>(a);
|
|
assert(b.type() == EvaluationNode<T>::Type::MatrixComplex);
|
|
MatrixComplex<T> m = static_cast<MatrixComplex<T> &>(b);
|
|
return AdditionNode::computeOnComplexAndMatrix(c.stdComplex(), m, complexFormat);
|
|
}
|
|
assert(a.type() == EvaluationNode<T>::Type::MatrixComplex);
|
|
assert(b.type() == EvaluationNode<T>::Type::MatrixComplex);
|
|
MatrixComplex<T> m = static_cast<MatrixComplex<T>&>(a);
|
|
MatrixComplex<T> n = static_cast<MatrixComplex<T>&>(b);
|
|
return AdditionNode::computeOnMatrices<T>(m, n, complexFormat);
|
|
}
|
|
|
|
Expression Sum::UntypedBuilder(Expression children) {
|
|
assert(children.type() == ExpressionNode::Type::Matrix);
|
|
if (children.childAtIndex(1).type() != ExpressionNode::Type::Symbol) {
|
|
// Second parameter must be a Symbol.
|
|
return Expression();
|
|
}
|
|
return Builder(children.childAtIndex(0), children.childAtIndex(1).convert<Symbol>(), children.childAtIndex(2), children.childAtIndex(3));
|
|
}
|
|
|
|
}
|