476
476
// Recursion. We need the whole dependency tree of the changed region.
477
477
// An infinite loop is prevented by the check above.
478
478
QHash<Sheet*, RTree<Cell>*>::ConstIterator cit = consumers.constFind(cell.sheet());
481
483
const QList<Cell> consumers = cit.value()->contains(cell.cellPosition());
482
484
foreach (const Cell &c, consumers) {
483
485
generateDepths(c, computedDepths);