UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-01-19 00:37:25 +01:00
Code Issues Packages Projects Releases Wiki Activity

[poincare] Add tests on Rational operations

Browse Source
This commit is contained in:
Émilie Feral
2018-08-17 11:45:26 +02:00
parent 02e52fc6d4
commit f3bd3f39f4
1 changed files with 19 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
poincare/test/rational.cpp
View File

@@ -61,6 +61,25 @@ QUIZ_CASE(poincare_rational_properties) {
assert(!Rational(-1).isTen());
}
static inline void assert_add_to(const Rational i, const Rational j, const Rational k) {
assert(Rational::NaturalOrder(Rational::Addition(i, j), k) == 0);
}
QUIZ_CASE(poincare_rational_addition) {
assert_add_to(Rational(1,2), Rational(1), Rational(3,2));
assert_add_to(Rational("18446744073709551616","4294967296"), Rational(8,9), Rational("38654705672","9"));
assert_add_to(Rational("18446744073709551616","4294967296"), Rational(-8,9), Rational("38654705656",9));
}
static inline void assert_pow_to(const Rational i,const NaturalIntegerPointer j, ExpressionNode::Sign jSign, const Rational k) {
assert(Rational::NaturalOrder(Rational::IntegerPower(i, j, jSign), k) == 0);
}
QUIZ_CASE(poincare_rational_power) {
assert_pow_to(Rational(4,5), Rational(3).naturalIntegerPointerNumerator(), Rational(3).sign(), Rational(64,125));
assert_pow_to(Rational(4,5), Rational(-3).naturalIntegerPointerNumerator(), Rational(-3).sign(), Rational(125,64));
}
QUIZ_CASE(poincare_rational_evaluate) {
#if 0
assert_parsed_expression_evaluates_to<float>("1/3", "0.3333333");