Files
Upsilon/poincare/test/addition.cpp
2019-04-12 15:16:51 +02:00

93 lines
4.4 KiB
C++
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
#include <quiz.h>
#include <poincare/expression.h>
#include <poincare/rational.h>
#include <poincare/addition.h>
#include <apps/shared/global_context.h>
#include <ion.h>
#include <assert.h>
#include "helper.h"
#include "./tree/helpers.h"
using namespace Poincare;
static inline void assert_approximation_equals(const Expression i, float f) {
Shared::GlobalContext c;
quiz_assert(i.approximateToScalar<float>(c, Cartesian, Degree) == f);
}
static inline void assert_parsed_expression_is_equal_to(const char * exp, Expression e) {
Expression result = Expression::Parse(exp);
quiz_assert(!result.isUninitialized());
quiz_assert(result.isIdenticalTo(e));
}
QUIZ_CASE(poincare_addition_cast_does_not_copy) {
Rational i1 = Rational::Builder(1);
Rational i2 = Rational::Builder(2);
Addition j = Addition::Builder(i1, i2);
Expression k = j;
quiz_assert(k.identifier() == (static_cast<Addition&>(k)).identifier());
quiz_assert(i1.identifier() == (static_cast<Expression&>(i1)).identifier());
quiz_assert(k.identifier() == (static_cast<Expression&>(k)).identifier());
}
QUIZ_CASE(poincare_addition_without_parsing) {
Rational i1 = Rational::Builder(1);
Rational i2 = Rational::Builder(2);
Addition j = Addition::Builder(i1, i2);
assert_approximation_equals(j, 3.0f);
}
QUIZ_CASE(poincare_addition_parsing) {
Rational i1 = Rational::Builder(1);
Rational i2 = Rational::Builder(2);
Addition j1 = Addition::Builder(i1, i2);
assert_parsed_expression_is_equal_to("1+2", j1);
}
QUIZ_CASE(poincare_addition_evaluate) {
assert_parsed_expression_evaluates_to<float>("1+2", "3");
assert_parsed_expression_evaluates_to<float>("𝐢", "𝐢");
assert_parsed_expression_evaluates_to<float>("𝐢+𝐢", "2×𝐢");
assert_parsed_expression_evaluates_to<double>("2+𝐢+4+𝐢", "6+2×𝐢");
#if MATRICES_ARE_DEFINED
assert_parsed_expression_evaluates_to<float>("[[1,2][3,4][5,6]]+3", "[[4,5][6,7][8,9]]");
assert_parsed_expression_evaluates_to<double>("[[1,2+𝐢][3,4][5,6]]+3+𝐢", "[[4+𝐢,5+2×𝐢][6+𝐢,7+𝐢][8+𝐢,9+𝐢]]");
assert_parsed_expression_evaluates_to<float>("3+[[1,2][3,4][5,6]]", "[[4,5][6,7][8,9]]");
assert_parsed_expression_evaluates_to<double>("3+𝐢+[[1,2+𝐢][3,4][5,6]]", "[[4+𝐢,5+2×𝐢][6+𝐢,7+𝐢][8+𝐢,9+𝐢]]");
assert_parsed_expression_evaluates_to<float>("[[1,2][3,4][5,6]]+[[1,2][3,4][5,6]]", "[[2,4][6,8][10,12]]");
assert_parsed_expression_evaluates_to<double>("[[1,2+𝐢][3,4][5,6]]+[[1,2+𝐢][3,4][5,6]]", "[[2,4+2×𝐢][6,8][10,12]]");
#endif
}
QUIZ_CASE(poincare_addition_simplify) {
assert_parsed_expression_simplify_to("1+x", "x+1");
assert_parsed_expression_simplify_to("1/2+1/3+1/4+1/5+1/6+1/7", "223/140");
assert_parsed_expression_simplify_to("1+x+4-i-2x", "-i-x+5");
assert_parsed_expression_simplify_to("2+1", "3");
assert_parsed_expression_simplify_to("1+2", "3");
assert_parsed_expression_simplify_to("1+2+3+4+5+6+7", "28");
assert_parsed_expression_simplify_to("(0+0)", "0");
assert_parsed_expression_simplify_to("2+A", "A+2");
assert_parsed_expression_simplify_to("1+2+3+4+5+A+6+7", "A+28");
assert_parsed_expression_simplify_to("1+A+2+B+3", "A+B+6");
assert_parsed_expression_simplify_to("-2+6", "4");
assert_parsed_expression_simplify_to("-2-6", "-8");
assert_parsed_expression_simplify_to("-A", "-A");
assert_parsed_expression_simplify_to("A-A", "0");
assert_parsed_expression_simplify_to("-5π+3π", "-2×π");
assert_parsed_expression_simplify_to("1-3+A-5+2A-4A", "-A-7");
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("2+13cos(2)-23cos(2)", "-10×cos(2)+2");
assert_parsed_expression_simplify_to("1+1+ln(2)+(5+3×2)/9-4/7+1/98", "(882×ln(2)+2347)/882");
assert_parsed_expression_simplify_to("1+2+0+cos(2)", "cos(2)+3");
assert_parsed_expression_simplify_to("A-A+2cos(2)+B-B-cos(2)", "cos(2)");
assert_parsed_expression_simplify_to("x+3+π+2×x", "3×x+π+3");
assert_parsed_expression_simplify_to("1/(x+1)+1/(π+2)", "(x+π+3)/(π×x+2×x+π+2)");
assert_parsed_expression_simplify_to("1/x^2+1/(x^2×π)", "(π+1)/(π×x^2)");
assert_parsed_expression_simplify_to("1/x^2+1/(x^3×π)", "×x+1)/(π×x^3)");
assert_parsed_expression_simplify_to("4x/x^2+3π/(x^3×π)", "(4×x^2+3)/x^3");
assert_parsed_expression_simplify_to("3^(1/2)+2^(-2×3^(1/2)×^π)/2", "(2×2^(2×√(3)×^π)×√(3)+1)/(2×2^(2×√(3)×^π))");
}