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

[poincare] Fix tests with Expression::recursivelyMatches cleaning

Browse Source
This commit is contained in:
Émilie Feral
2019-05-03 12:03:16 +02:00
parent e49b803649
commit 97511ff1ac
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
poincare/test/user_variable.cpp
View File

@@ -185,7 +185,7 @@ QUIZ_CASE(poincare_user_variable_properties) {
Shared::GlobalContext context;
assert_parsed_expression_evaluates_to<double>("[[1]]→a", "[[1]]");
quiz_assert(Poincare::Expression::IsMatrix(Symbol::Builder('a'), context));
quiz_assert(Symbol::Builder('a').recursivelyMatches(Expression::IsMatrix, context));
assert_parsed_expression_evaluates_to<double>("1.2→b", "1.2");
quiz_assert(Symbol::Builder('b').recursivelyMatches(Expression::IsApproximate, context, true));
@@ -195,7 +195,7 @@ QUIZ_CASE(poincare_user_variable_properties) {
* TODO: use parse_and_simplify when matrix are simplified. */
assert_parsed_expression_evaluates_to<double>("[[x]]→f(x)", "[[undef]]");
quiz_assert(Poincare::Expression::IsMatrix(Function::Builder("f", 1, Symbol::Builder('x')), context));
quiz_assert(Function::Builder("f", 1, Symbol::Builder('x')).recursivelyMatches(Poincare::Expression::IsMatrix, context));
assert_parsed_expression_evaluates_to<double>("0.2*x→g(x)", "undef");
quiz_assert(Function::Builder("g", 1, Rational::Builder(2)).recursivelyMatches(Expression::IsApproximate, context, true));