An initial work on a dependency tree for formulas #2155
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The tree can mark formulas as dirty, if some precedent (direct/transitive) cell is changed.
The chosen data structure is an R-tree. R-tree seems to be the only reasonable structure (other than the variant R*-tree) for orthogonal range searching for overlapping ranges, most other are point vs range or "variants" of the main algorithm that is intended for other things (e.g. kd-tree).
R-tree has an implementation in form of
RBush
library. It isn't strongly named and won't be, will need to make a fork or abandon strong naming.This is only initial work, will need to be improved to deal with