mirror of
https://github.com/UpsilonNumworks/Upsilon.git
synced 2026-03-26 01:00:50 +01:00
a multiplication nested inside a multiplication without reducing it Change-Id: I2e8174a3714e90e6ecc4edbed0e17e434921e269
59 lines
3.3 KiB
C++
59 lines
3.3 KiB
C++
#include <quiz.h>
|
|
#include <poincare.h>
|
|
#include <ion.h>
|
|
#include <assert.h>
|
|
#include "helper.h"
|
|
|
|
using namespace Poincare;
|
|
|
|
QUIZ_CASE(poincare_addition_evaluate) {
|
|
Complex<float> a[1] = {Complex<float>::Float(3.0f)};
|
|
assert_parsed_expression_evaluates_to("1+2", a);
|
|
|
|
Complex<double> b[1] = {Complex<double>::Cartesian(6.0, 2.0)};
|
|
assert_parsed_expression_evaluates_to("2+I+4+I", b);
|
|
|
|
#if MATRICES_ARE_DEFINED
|
|
Complex<float> c[6] = {Complex<float>::Float(4.0f), Complex<float>::Float(5.0f), Complex<float>::Float(6.0f), Complex<float>::Float(7.0f), Complex<float>::Float(8.0f), Complex<float>::Float(9.0f)};
|
|
assert_parsed_expression_evaluates_to("[[1,2][3,4][5,6]]+3", c, 3, 2);
|
|
|
|
Complex<double> d[6] = {Complex<double>::Cartesian(4.0, 1.0), Complex<double>::Cartesian(5.0, 2.0), Complex<double>::Cartesian(6.0, 1.0), Complex<double>::Cartesian(7.0, 1.0), Complex<double>::Cartesian(8.0, 1.0), Complex<double>::Cartesian(9.0, 1.0)};
|
|
assert_parsed_expression_evaluates_to("[[1,2+I][3,4][5,6]]+3+I", d, 3, 2);
|
|
|
|
assert_parsed_expression_evaluates_to("3+[[1,2][3,4][5,6]]", c, 3, 2);
|
|
|
|
assert_parsed_expression_evaluates_to("3+I+[[1,2+I][3,4][5,6]]", d, 3, 2);
|
|
|
|
Complex<float> e[6] = {Complex<float>::Float(2.0f), Complex<float>::Float(4.0f), Complex<float>::Float(6.0f), Complex<float>::Float(8.0f), Complex<float>::Float(10.0f), Complex<float>::Float(12.0f)};
|
|
assert_parsed_expression_evaluates_to("[[1,2][3,4][5,6]]+[[1,2][3,4][5,6]]", e, 3, 2);
|
|
|
|
Complex<double> f[6] = {Complex<double>::Cartesian(2.0, 0.0), Complex<double>::Cartesian(4.0, 2.0), Complex<double>::Cartesian(6.0, 0.0), Complex<double>::Cartesian(8.0, 0.0), Complex<double>::Cartesian(10.0, 0.0), Complex<double>::Cartesian(12.0, 0.0)};
|
|
assert_parsed_expression_evaluates_to("[[1,2+I][3,4][5,6]]+[[1,2+I][3,4][5,6]]", f, 3, 2);
|
|
#endif
|
|
}
|
|
|
|
QUIZ_CASE(poincare_addition_simplify) {
|
|
assert_parsed_expression_simplify_to("2+1", "3");
|
|
assert_parsed_expression_simplify_to("2+A", "2+A");
|
|
assert_parsed_expression_simplify_to("1+2+3+4+5+6+7", "28");
|
|
assert_parsed_expression_simplify_to("1+2+3+4+5+A+6+7", "28+A");
|
|
assert_parsed_expression_simplify_to("(0+0)", "0");
|
|
assert_parsed_expression_simplify_to("2+13cos(2)-23cos(2)", "2-10*cos(2)");
|
|
assert_parsed_expression_simplify_to("1+1+ln(2)+(5+3*2)/9-4/7+1/98", "(2347+882*ln(2))/882");
|
|
assert_parsed_expression_simplify_to("1+2+0+cos(2)", "3+cos(2)");
|
|
assert_parsed_expression_simplify_to("-5P+3P", "-2*P");
|
|
assert_parsed_expression_simplify_to("1-3+A-5+2A-4A", "(-7)-A");
|
|
assert_parsed_expression_simplify_to("1+2", "3");
|
|
assert_parsed_expression_simplify_to("A-A", "0");
|
|
assert_parsed_expression_simplify_to("A-A+2cos(2)+B-B-cos(2)", "cos(2)");
|
|
assert_parsed_expression_simplify_to("1+A+2+B+3", "6+A+B");
|
|
assert_parsed_expression_simplify_to("-A", "-A");
|
|
assert_parsed_expression_simplify_to("1/(x+1)+1/(P+2)", "(3+x+P)/(2+2*x+P+x*P)");
|
|
assert_parsed_expression_simplify_to("1/x^2+1/(x^2*P)", "(1+P)/(x^2*P)");
|
|
assert_parsed_expression_simplify_to("1/x^2+1/(x^3*P)", "(1+x*P)/(x^3*P)");
|
|
assert_parsed_expression_simplify_to("4x/x^2+3P/(x^3*P)", "(3+4*x^2)/x^3");
|
|
assert_parsed_expression_simplify_to("A+B-A-B", "0");
|
|
assert_parsed_expression_simplify_to("A+B+(-1)*A+(-1)*B", "0");
|
|
assert_parsed_expression_simplify_to("3^(1/2)+2^(-2*3^(1/2)*X^P)/2", "(1+2*2^(2*R(3)*X^P)*R(3))/(2*2^(2*R(3)*X^P))");
|
|
}
|