calculation_store.cpp
3.47 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include "calculation_store.h"
#include <assert.h>
using namespace Poincare;
namespace Calculation {
CalculationStore::CalculationStore() :
m_startIndex(0)
{
}
Calculation * CalculationStore::push(const char * text, Context * context) {
Calculation * result = &m_calculations[m_startIndex];
result->setContent(text, context, ansExpression(context));
m_startIndex++;
if (m_startIndex >= k_maxNumberOfCalculations) {
m_startIndex = 0;
}
return result;
}
Calculation * CalculationStore::calculationAtIndex(int i) {
int j = 0;
Calculation * currentCalc = &m_calculations[m_startIndex];
Calculation * previousCalc = nullptr;
while (j <= i) {
if (!currentCalc++->isEmpty()) {
previousCalc = currentCalc - 1;
j++;
}
if (currentCalc >= m_calculations + k_maxNumberOfCalculations) {
currentCalc = m_calculations;
}
}
return previousCalc;
}
int CalculationStore::numberOfCalculations() {
Calculation * currentCalc= m_calculations;
int numberOfCalculations = 0;
while (currentCalc < m_calculations + k_maxNumberOfCalculations) {
if (!currentCalc++->isEmpty()) {
numberOfCalculations++;
}
}
return numberOfCalculations;
}
void CalculationStore::deleteCalculationAtIndex(int i) {
int numberOfCalc = numberOfCalculations();
assert(i >= 0 && i < numberOfCalc);
int indexFirstCalc = m_startIndex;
while (m_calculations[indexFirstCalc].isEmpty()) {
indexFirstCalc++;
if (indexFirstCalc == k_maxNumberOfCalculations) {
indexFirstCalc = 0;
}
assert(indexFirstCalc != m_startIndex);
}
int absoluteIndexCalculationI = indexFirstCalc+i;
absoluteIndexCalculationI = absoluteIndexCalculationI >= k_maxNumberOfCalculations ? absoluteIndexCalculationI - k_maxNumberOfCalculations : absoluteIndexCalculationI;
int index = absoluteIndexCalculationI;
for (int k = i; k < numberOfCalc-1; k++) {
int nextIndex = index+1 >= k_maxNumberOfCalculations ? 0 : index+1;
m_calculations[index] = m_calculations[nextIndex];
index++;
if (index == k_maxNumberOfCalculations) {
index = 0;
}
}
m_calculations[index].reset();
m_startIndex--;
if (m_startIndex == -1) {
m_startIndex = k_maxNumberOfCalculations-1;
}
}
void CalculationStore::deleteAll() {
m_startIndex = 0;
for (int i = 0; i < k_maxNumberOfCalculations; i++) {
m_calculations[i].reset();
}
}
void CalculationStore::tidy() {
for (int i = 0; i < k_maxNumberOfCalculations; i++) {
m_calculations[i].tidy();
}
}
Expression * CalculationStore::ansExpression(Context * context) {
if (numberOfCalculations() == 0) {
static Rational defaultExpression(0);
return &defaultExpression;
}
Calculation * lastCalculation = calculationAtIndex(numberOfCalculations()-1);
/* Special case: the exact output is a Store expression.
* Remark: Store expressions are always reduced but if the simplification
* process was interrupted, the exact output is identical to the input.
* To avoid turning 'ans->A' in '2->A->A' (which cannot be parsed), ans
* is replaced by the approximation output in that special case.*/
bool exactOuptutInvolvesStore = lastCalculation->exactOutput(context)->recursivelyMatches([](const Expression * e, Context & context) {
return e->type() == Expression::Type::Store;
}, *context);
if (lastCalculation->input()->isApproximate(*context) || exactOuptutInvolvesStore) {
return lastCalculation->approximateOutput(context);
}
return lastCalculation->exactOutput(context);
}
}