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

[poincare] Sequence: reorder condition (optimization)

Browse Source
This commit is contained in:
Émilie Feral
2020-11-04 12:20:07 +01:00
parent a7b55776d6
commit c7711b74c2
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
poincare/src/sequence.cpp
View File

@@ -63,7 +63,7 @@ Evaluation<double> SequenceNode::approximate(DoublePrecision p, ApproximationCon
template<typename T>
Evaluation<T> SequenceNode::templatedApproximate(ApproximationContext approximationContext) const {
if (childAtIndex(0)->approximate((T)1, approximationContext).isUndefined() || approximationContext.withinReduce()) {
if (approximationContext.withinReduce() || childAtIndex(0)->approximate((T)1, approximationContext).isUndefined()) {
/* If we're inside a reducing routine, we want to escape the sequence
* approximation. Indeed, in order to know that the sequence is well defined
* (especially for self-referencing or inter-dependently defined sequences),