aboutsummaryrefslogtreecommitdiffstats
path: root/stats/scatterseries.cpp
diff options
context:
space:
mode:
authorGravatar Berthold Stoeger <bstoeger@mail.tuwien.ac.at>2021-02-01 23:17:04 +0100
committerGravatar Dirk Hohndel <dirk@hohndel.org>2021-02-13 13:02:54 -0800
commitd63d4cd3c357a4294e4810ad320acf519b37882d (patch)
tree3659929714d26a32cca8b2501a609ef2a6b55be2 /stats/scatterseries.cpp
parente38b78b2aa787e3d1de97fb737601dc30a7fad6b (diff)
downloadsubsurface-d63d4cd3c357a4294e4810ad320acf519b37882d.tar.gz
statistics: implement rectangle selection in scatter plot
Allow the user to select regions of the scatter plot using a rectangular selection. When shift is pressed, do an incremental selection. Unfortunately, the list-selection code is so slow that this becomes unusable for a large number of selected dives. Signed-off-by: Berthold Stoeger <bstoeger@mail.tuwien.ac.at>
Diffstat (limited to 'stats/scatterseries.cpp')
-rw-r--r--stats/scatterseries.cpp49
1 files changed, 48 insertions, 1 deletions
diff --git a/stats/scatterseries.cpp b/stats/scatterseries.cpp
index fe9889d33..63fdaae1b 100644
--- a/stats/scatterseries.cpp
+++ b/stats/scatterseries.cpp
@@ -78,7 +78,25 @@ std::vector<int> ScatterSeries::getItemsUnderMouse(const QPointF &point) const
return res;
}
-void ScatterSeries::selectItemsUnderMouse(const QPointF &point, bool shiftPressed)
+std::vector<int> ScatterSeries::getItemsInRect(const QRectF &rect) const
+{
+ std::vector<int> res;
+
+ auto low = std::lower_bound(items.begin(), items.end(), rect.left(),
+ [] (const Item &item, double x) { return item.item->getRect().right() < x; });
+ auto high = std::upper_bound(low, items.end(), rect.right(),
+ [] (double x, const Item &item) { return x < item.item->getRect().left(); });
+ // Hopefully that narrows it down enough. For discrete scatter plots, we could also partition
+ // by equal x and do a binary search in these partitions. But that's probably not worth it.
+ res.reserve(high - low);
+ for (auto it = low; it < high; ++it) {
+ if (it->item->inRect(rect))
+ res.push_back(it - items.begin());
+ }
+ return res;
+}
+
+bool ScatterSeries::selectItemsUnderMouse(const QPointF &point, bool shiftPressed)
{
std::vector<struct dive *> selected;
std::vector<int> indices = getItemsUnderMouse(point);
@@ -87,6 +105,7 @@ void ScatterSeries::selectItemsUnderMouse(const QPointF &point, bool shiftPresse
// When shift is pressed, add the items under the mouse to the selection
// or, if all items under the mouse are selected, remove them.
selected = getDiveSelection();
+ selected.reserve(indices.size() + selected.size());
bool allSelected = std::all_of(indices.begin(), indices.end(),
[this] (int idx) { return items[idx].d->selected; });
if (allSelected) {
@@ -108,11 +127,39 @@ void ScatterSeries::selectItemsUnderMouse(const QPointF &point, bool shiftPresse
}
}
} else {
+ selected.reserve(indices.size());
for(int idx: indices)
selected.push_back(items[idx].d);
}
setSelection(selected, selected.empty() ? nullptr : selected.front());
+ return !indices.empty();
+}
+
+bool ScatterSeries::supportsLassoSelection() const
+{
+ return true;
+}
+
+void ScatterSeries::selectItemsInRect(const QRectF &rect, bool shiftPressed, const std::vector<dive *> &oldSelection)
+{
+ std::vector<struct dive *> selected;
+ std::vector<int> indices = getItemsInRect(rect);
+ selected.reserve(oldSelection.size() + indices.size());
+
+ if (shiftPressed) {
+ selected = oldSelection;
+ // Ouch - this primitive merging of the selections grows with O(n^2). Fix this.
+ for (int idx: indices) {
+ if (std::find(selected.begin(), selected.end(), items[idx].d) == selected.end())
+ selected.push_back(items[idx].d);
+ }
+ } else {
+ for (int idx: indices)
+ selected.push_back(items[idx].d);
+ }
+
+ setSelection(selected, selected.empty() ? nullptr : selected.front());
}
static QString dataInfo(const StatsVariable &var, const dive *d)