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
160
161
162
163
164
165
166
167
168
169
|
/* This file is part of the KDE project
Copyright 2006-2007 Stefan Nikolaus <stefan.nikolaus@kdemail.net>
Copyright 2004 Tomas Mecir <mecirt@gmail.com>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#ifndef KSPREAD_DEPENDENCY_MANAGER_P
#define KSPREAD_DEPENDENCY_MANAGER_P
// Local
#include "DependencyManager.h"
#include <QHash>
#include <QList>
#include "Cell.h"
#include "Region.h"
#include "RTree.h"
namespace Calligra
{
namespace Sheets
{
class Formula;
class Map;
class Sheet;
class Q_DECL_HIDDEN DependencyManager::Private
{
public:
/**
* Clears internal structures.
*/
void reset();
/**
* Generates the dependencies of \p cell .
* First, it removes the old providing region. Then, the new providing
* region is computed. Finally, adds \p cell as consumer and the new
* providing region to the data structures.
* \see removeDependencies
* \see computeDependencies
*/
void generateDependencies(const Cell& cell, const Formula& formula);
/**
* Computes the reference depth.
* Depth means the maximum depth of all cells this cell depends on plus one,
* while a cell, which do not refer to other cells, has a depth
* of zero.
*
* Examples:
* \li A1: '=1.0'
* \li A2: '=A1+A1'
* \li A3: '=A1+A1+A2'
*
* \li depth(A1) = 0
* \li depth(A2) = 1
* \li depth(A3) = 2
*/
int computeDepth(Cell cell) const;
/**
* Used in the recalculation events for changed regions.
* Determines the reference depth for each position in \p region .
*
* \see computeDepth
* \see generateDepths(Cell cell)
*/
void generateDepths(const Region& region);
/**
* Generates the depth of cell and all of its consumers.
* Calls itself recursively for the cell's consuming cells.
*/
void generateDepths(Cell cell, QSet<Cell>& computedDepths);
/**
* Returns the region, that consumes the value of \p cell.
* \see DependencyManager::consumingRegion(const Cell&)
* \return region consuming \p cell 's value
*/
Region consumingRegion(const Cell& cell) const;
void namedAreaModified(const QString& name);
/**
* Removes all dependencies of \p cell .
*/
void removeDependencies(const Cell& cell);
/**
* Removes the depths of \p cell and all its consumers.
*/
void removeDepths(const Cell& cell);
/**
* Computes and stores the dependencies.
*
* Parses \p formula and adds each contained reference to a
* cell, a cell range or a named area to the providing regions
* of \p cell.
* Additionally, the opposite direction is also stored:
* Each consumed region, i.e. each reference, points to \p cell.
*
* The \p formula has to belong to \p cell. It would have been
* possible to look it up from \p cell, but is passed separately
* for performance reasons.
* Do not call this method for a \p cell not containing a \p formula.
*/
void computeDependencies(const Cell& cell, const Formula& formula);
enum Direction { Forward, Backward };
/**
* Removes the circular dependency flag from \p region and all their dependencies.
*/
void removeCircularDependencyFlags(const Region& region, Direction direction);
/**
* For debugging/testing purposes.
*/
void dump() const;
const Map* map;
// stores providing regions ordered by their consuming cell locations
// use QMap rather then QHash cause it's faster for our use-case
QMap<Cell, Region> providers;
// stores consuming cell locations ordered by their providing regions
QHash<Sheet*, RTree<Cell>*> consumers;
// stores consuming cell locations ordered by their providing named area
// (in addition to the general storage of the consuming cell locations)
QHash<QString, QList<Cell> > namedAreaConsumers;
/*
* Stores cells with its reference depth.
* Depth means the maximum depth of all cells this cell depends on plus one,
* while a cell which has a formula without cell references has a depth
* of zero.
*
* Examples:
* \li A1: '=1.0'
* \li A2: '=A1+A1'
* \li A3: '=A1+A1+A2'
*
* \li depth(A1) = 0
* \li depth(A2) = 1
* \li depth(A3) = 2
*/
// use QMap rather then QHash cause it's faster for our use-case
QMap<Cell, int> depths;
};
} // namespace Sheets
} // namespace Calligra
#endif // KSPREAD_DEPENDENCY_MANAGER_P
|
