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

[sequence] Fix Sequence::sumBetweenBounds

Browse Source
This commit is contained in:
Émilie Feral
2019-11-13 15:06:14 +01:00
committed by LeaNumworks
parent 90b3e52c0c
commit 269f479c29
2 changed files with 37 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
apps/sequence/test/sequence.cpp
View File

@@ -5,8 +5,10 @@
#include <cmath>
#include "../sequence_store.h"
#include "../sequence_context.h"
#include "../../shared/poincare_helpers.h"
using namespace Poincare;
using namespace Shared;
namespace Sequence {
@@ -48,6 +50,19 @@ void check_sequences_defined_by(double result[MaxNumberOfSequences][10], Sequenc
store.removeAll();
}
void check_sum_of_sequence_between_bounds(double result, double start, double end, Sequence::Type type, const char * definition, const char * condition1, const char * condition2) {
Shared::GlobalContext globalContext;
SequenceStore store;
SequenceContext sequenceContext(&globalContext, &store);
Sequence * seq = addSequence(&store, type, definition, condition1, condition2);
double sum = PoincareHelpers::ApproximateToScalar<double>(seq->sumBetweenBounds(start, end, &sequenceContext), &globalContext);
quiz_assert(std::fabs(sum - result) < 0.00000001);
store.removeAll();
}
QUIZ_CASE(sequence_evaluation) {
Sequence::Type types[MaxNumberOfSequences] = {Sequence::Type::Explicit, Sequence::Type::Explicit, Sequence::Type::Explicit};
const char * definitions[MaxNumberOfSequences] = {nullptr, nullptr, nullptr};
@@ -323,4 +338,10 @@ QUIZ_CASE(sequence_evaluation) {
check_sequences_defined_by(results28, types, definitions, conditions1, conditions2);
}
QUIZ_CASE(sequence_sum_evaluation) {
check_sum_of_sequence_between_bounds(33.0, 3.0, 8.0, Sequence::Type::Explicit, "n", nullptr, nullptr);
check_sum_of_sequence_between_bounds(70.0, 2.0, 8.0, Sequence::Type::SingleRecurrence, "u(n)+2", "0", nullptr);
check_sum_of_sequence_between_bounds(92.0, 2.0, 7.0, Sequence::Type::DoubleRecurrence, "u(n)+u(n+1)+2", "0", "0");
}
}