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 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287
|
/* 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; only
version 2 of the License.
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.
*/
// Local
#include "RecalcManager.h"
#include "Cell.h"
#include "CellStorage.h"
#include "DependencyManager.h"
#include "Formula.h"
#include "FormulaStorage.h"
#include "Map.h"
#include "Sheet.h"
#include "Region.h"
#include "Value.h"
#include "ValueFormatter.h"
#include "DocBase.h"
#include "ElapsedTime_p.h"
#include <KoUpdater.h>
#include <QHash>
#include <QMap>
using namespace Calligra::Sheets;
class Q_DECL_HIDDEN RecalcManager::Private
{
public:
/**
* Finds all cells in region and their dependents, that need recalculation.
*
* \see RecalcManager::regionChanged
*/
void cellsToCalculate(const Region& region);
/**
* Finds all cells in \p sheet , that have got a formula and hence need
* recalculation.
* If \p sheet is zero, all cells in the Map a returned.
*
* \see RecalcManager::recalcMap
* \see RecalcManager::recalcSheet
*/
void cellsToCalculate(Sheet* sheet = 0);
/**
* Helper function for cellsToCalculate(const Region&) and cellsToCalculate(Sheet*).
*/
void cellsToCalculate(const Region& region, QSet<Cell>& cells) const;
/*
* Stores cells ordered by 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
*/
QMap<int, Cell> cells;
const Map* map;
bool active;
};
void RecalcManager::Private::cellsToCalculate(const Region& region)
{
if (region.isEmpty())
return;
// retrieve the cell depths
QMap<Cell, int> depths = map->dependencyManager()->depths();
// create the cell map ordered by depth
QSet<Cell> cells;
cellsToCalculate(region, cells);
const QSet<Cell>::ConstIterator end(cells.end());
for (QSet<Cell>::ConstIterator it(cells.begin()); it != end; ++it) {
if ((*it).sheet()->isAutoCalculationEnabled())
this->cells.insertMulti(depths[*it], *it);
}
}
void RecalcManager::Private::cellsToCalculate(Sheet* sheet)
{
// retrieve the cell depths
QMap<Cell, int> depths = map->dependencyManager()->depths();
// NOTE Stefan: It's necessary, that the cells are filled in row-wise;
// beginning with the top left; ending with the bottom right.
// This ensures, that the value storage is processed the same
// way, which boosts performance (using PointStorage) for an
// empty storage (on loading). For an already filled value
// storage, the speed gain is not that sensible.
Cell cell;
if (!sheet) { // map recalculation
for (int s = 0; s < map->count(); ++s) {
sheet = map->sheet(s);
for (int c = 0; c < sheet->formulaStorage()->count(); ++c) {
cell = Cell(sheet, sheet->formulaStorage()->col(c), sheet->formulaStorage()->row(c));
cells.insertMulti(depths[cell], cell);
}
}
} else { // sheet recalculation
for (int c = 0; c < sheet->formulaStorage()->count(); ++c) {
cell = Cell(sheet, sheet->formulaStorage()->col(c), sheet->formulaStorage()->row(c));
cells.insertMulti(depths[cell], cell);
}
}
}
void RecalcManager::Private::cellsToCalculate(const Region& region, QSet<Cell>& cells) const
{
Region::ConstIterator end(region.constEnd());
for (Region::ConstIterator it(region.constBegin()); it != end; ++it) {
const QRect range = (*it)->rect();
const Sheet* sheet = (*it)->sheet();
for (int col = range.left(); col <= range.right(); ++col) {
for (int row = range.top(); row <= range.bottom(); ++row) {
Cell cell(sheet, col, row);
// Even empty cells may act as value
// providers and need to be processed.
// check for already processed cells
if (cells.contains(cell))
continue;
// add it to the list
if (cell.isFormula())
cells.insert(cell);
// add its consumers to the list
cellsToCalculate(map->dependencyManager()->consumingRegion(cell), cells);
}
}
}
}
RecalcManager::RecalcManager(Map *const map)
: QObject(map)
, d(new Private)
{
d->map = map;
d->active = false;
}
RecalcManager::~RecalcManager()
{
delete d;
}
void RecalcManager::regionChanged(const Region& region)
{
if (d->active || region.isEmpty())
return;
d->active = true;
debugSheetsFormula << "RecalcManager::regionChanged" << region.name();
ElapsedTime et("Overall region recalculation", ElapsedTime::PrintOnlyTime);
d->cellsToCalculate(region);
recalc();
d->active = false;
}
void RecalcManager::recalcSheet(Sheet* const sheet)
{
if (d->active)
return;
d->active = true;
ElapsedTime et("Overall sheet recalculation", ElapsedTime::PrintOnlyTime);
d->cellsToCalculate(sheet);
recalc();
d->active = false;
}
void RecalcManager::recalcMap(KoUpdater *updater)
{
if (d->active)
return;
d->active = true;
ElapsedTime et("Overall map recalculation", ElapsedTime::PrintOnlyTime);
d->cellsToCalculate();
recalc(updater);
d->active = false;
}
bool RecalcManager::isActive() const
{
return d->active;
}
void RecalcManager::addSheet(Sheet *sheet)
{
// Manages also the revival of a deleted sheet.
Q_UNUSED(sheet);
// sebsauer: not recalc every time on loading - bug 284325
if (!d->map->isLoading()) {
recalcMap(); // FIXME Stefan: Implement a more elegant solution.
}
}
void RecalcManager::removeSheet(Sheet *sheet)
{
Q_UNUSED(sheet);
recalcMap(); // FIXME Stefan: Implement a more elegant solution.
}
void RecalcManager::recalc(KoUpdater *updater)
{
debugSheetsFormula << "Recalculating" << d->cells.count() << " cell(s)..";
ElapsedTime et("Recalculating cells", ElapsedTime::PrintOnlyTime);
if (updater)
updater->setProgress(0);
const QList<Cell> cells = d->cells.values();
const int cellsCount = cells.count();
for (int c = 0; c < cellsCount; ++c) {
// only recalculate, if no circular dependency occurred
if (cells.value(c).value() == Value::errorCIRCLE())
continue;
// Check for valid formula; parses the expression, if not done already.
if (!cells.value(c).formula().isValid())
continue;
const Sheet* sheet = cells.value(c).sheet();
// evaluate the formula and set the result
Value result = cells.value(c).formula().eval();
if (result.isArray() && (result.columns() > 1 || result.rows() > 1)) {
const QRect rect = cells.value(c).lockedCells();
// unlock
sheet->cellStorage()->unlockCells(rect.left(), rect.top());
for (int row = rect.top(); row <= rect.bottom(); ++row) {
for (int col = rect.left(); col <= rect.right(); ++col) {
Cell(sheet, col, row).setValue(result.element(col - rect.left(), row - rect.top()));
}
}
// relock
sheet->cellStorage()->lockCells(rect);
} else {
Cell(cells.value(c)).setValue(result);
}
if (updater)
updater->setProgress(int(qreal(c) / qreal(cellsCount) * 100.));
}
if (updater)
updater->setProgress(100);
// dump();
d->cells.clear();
}
void RecalcManager::dump() const
{
QMap<int, Cell>::ConstIterator end(d->cells.constEnd());
for (QMap<int, Cell>::ConstIterator it(d->cells.constBegin()); it != end; ++it) {
Cell cell = it.value();
QString cellName = cell.name();
while (cellName.count() < 4) cellName.prepend(' ');
debugSheetsFormula << "depth(" << cellName << " ) =" << it.key();
}
}
|