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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef INCLUDED_RECURSIONHELPER_HXX
#define INCLUDED_RECURSIONHELPER_HXX
#include "formularesult.hxx"
#include <list>
#include <stack>
#include <tools/solar.h>
class ScFormulaCell;
struct ScFormulaRecursionEntry
{
ScFormulaCell* pCell;
BOOL bOldRunning;
ScFormulaResult aPreviousResult;
ScFormulaRecursionEntry( ScFormulaCell* p, BOOL bR,
const ScFormulaResult & rRes ) :
pCell(p), bOldRunning(bR), aPreviousResult( rRes)
{
}
};
typedef ::std::list< ScFormulaRecursionEntry > ScFormulaRecursionList;
class ScRecursionHelper
{
typedef ::std::stack< ScFormulaCell* > ScRecursionInIterationStack;
ScFormulaRecursionList aRecursionFormulas;
ScFormulaRecursionList::iterator aInsertPos;
ScFormulaRecursionList::iterator aLastIterationStart;
ScRecursionInIterationStack aRecursionInIterationStack;
USHORT nRecursionCount;
USHORT nIteration;
bool bInRecursionReturn;
bool bDoingRecursion;
bool bInIterationReturn;
bool bConverging;
void Init()
{
nRecursionCount = 0;
bInRecursionReturn = bDoingRecursion = bInIterationReturn = false;
aInsertPos = GetEnd();
ResetIteration();
}
void ResetIteration()
{
aLastIterationStart = GetEnd();
nIteration = 0;
bConverging = false;
}
public:
ScRecursionHelper() { Init(); }
USHORT GetRecursionCount() const { return nRecursionCount; }
void IncRecursionCount() { ++nRecursionCount; }
void DecRecursionCount() { --nRecursionCount; }
/// A pure recursion return, no iteration.
bool IsInRecursionReturn() const { return bInRecursionReturn &&
!bInIterationReturn; }
void SetInRecursionReturn( bool b )
{
// Do not use IsInRecursionReturn() here, it decouples iteration.
if (b && !bInRecursionReturn)
aInsertPos = aRecursionFormulas.begin();
bInRecursionReturn = b;
}
bool IsDoingRecursion() const { return bDoingRecursion; }
void SetDoingRecursion( bool b ) { bDoingRecursion = b; }
void Insert( ScFormulaCell* p, BOOL bOldRunning,
const ScFormulaResult & rRes )
{
aRecursionFormulas.insert( aInsertPos, ScFormulaRecursionEntry( p,
bOldRunning, rRes));
}
ScFormulaRecursionList::iterator GetStart()
{
return aRecursionFormulas.begin();
}
ScFormulaRecursionList::iterator GetEnd()
{
return aRecursionFormulas.end();
}
bool IsInIterationReturn() const { return bInIterationReturn; }
void SetInIterationReturn( bool b )
{
// An iteration return is always coupled to a recursion return.
SetInRecursionReturn( b);
bInIterationReturn = b;
}
bool IsDoingIteration() const { return nIteration > 0; }
USHORT GetIteration() const { return nIteration; }
bool & GetConvergingReference() { return bConverging; }
void StartIteration()
{
SetInIterationReturn( false);
nIteration = 1;
bConverging = false;
aLastIterationStart = GetIterationStart();
}
void ResumeIteration()
{
SetInIterationReturn( false);
aLastIterationStart = GetIterationStart();
}
void IncIteration() { ++nIteration; }
void EndIteration()
{
aRecursionFormulas.erase( GetIterationStart(), GetIterationEnd());
ResetIteration();
}
ScFormulaRecursionList::iterator GetLastIterationStart() { return aLastIterationStart; }
ScFormulaRecursionList::iterator GetIterationStart() { return GetStart(); }
ScFormulaRecursionList::iterator GetIterationEnd() { return GetEnd(); }
/** Any return, recursion or iteration, iteration is always coupled with
recursion. */
bool IsInReturn() const { return bInRecursionReturn; }
const ScFormulaRecursionList& GetList() const { return aRecursionFormulas; }
ScFormulaRecursionList& GetList() { return aRecursionFormulas; }
ScRecursionInIterationStack& GetRecursionInIterationStack() { return aRecursionInIterationStack; }
void Clear()
{
aRecursionFormulas.clear();
while (!aRecursionInIterationStack.empty())
aRecursionInIterationStack.pop();
Init();
}
};
#endif // INCLUDED_RECURSIONHELPER_HXX
|
