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 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803
|
// *****************************************************************************
// * This file is part of the FreeFileSync project. It is distributed under *
// * GNU General Public License: https://www.gnu.org/licenses/gpl-3.0 *
// * Copyright (C) Zenju (zenju AT freefilesync DOT org) - All Rights Reserved *
// *****************************************************************************
#include "graph.h"
#include <cassert>
#include <algorithm>
//#include <numeric>
#include <zen/basic_math.h>
#include <zen/scope_guard.h>
//#include <zen/perf.h>
using namespace zen;
//todo: support zoom via mouse wheel?
namespace zen
{
wxDEFINE_EVENT(EVENT_GRAPH_SELECTION, GraphSelectEvent);
}
double zen::nextNiceNumber(double blockSize) //round to next number which is a convenient to read block size
{
if (blockSize <= 0)
return 0;
const double k = std::floor(std::log10(blockSize));
const double e = std::pow(10, k);
if (numeric::isNull(e))
return 0;
const double a = blockSize / e; //blockSize = a * 10^k with a in [1, 10)
assert(1 <= a && a < 10);
//have a look at leading two digits: "nice" numbers start with 1, 2, 2.5 and 5
const double steps[] = {1, 2, 2.5, 5, 10};
return e * numeric::roundToGrid(a, std::begin(steps), std::end(steps));
}
namespace
{
wxColor getDefaultColor(size_t pos)
{
switch (pos % 10)
{
//*INDENT-OFF*
case 0: return { 0, 69, 134}; //blue
case 1: return {255, 66, 14}; //red
case 2: return {255, 211, 32}; //yellow
case 3: return { 87, 157, 28}; //green
case 4: return {126, 0, 33}; //royal
case 5: return {131, 202, 255}; //light blue
case 6: return { 49, 64, 4}; //dark green
case 7: return {174, 207, 0}; //light green
case 8: return { 75, 31, 111}; //purple
case 9: return {255, 149, 14}; //orange
//*INDENT-ON*
}
assert(false);
return *wxBLACK;
}
class ConvertCoord //convert between screen and input data coordinates
{
public:
ConvertCoord(double valMin, double valMax, size_t screenSize) :
min_(valMin),
scaleToReal_(screenSize == 0 ? 0 : (valMax - valMin) / screenSize),
scaleToScr_(numeric::isNull((valMax - valMin)) ? 0 : screenSize / (valMax - valMin)),
outOfBoundsLow_ (-1 * scaleToReal_ + valMin),
outOfBoundsHigh_((screenSize + 1) * scaleToReal_ + valMin) { if (outOfBoundsLow_ > outOfBoundsHigh_) std::swap(outOfBoundsLow_, outOfBoundsHigh_); }
double screenToReal(double screenPos) const //map [0, screenSize] -> [valMin, valMax]
{
return screenPos * scaleToReal_ + min_;
}
double realToScreen(double realPos) const //return screen position in pixel (but with double precision!)
{
return (realPos - min_) * scaleToScr_;
}
int realToScreenRound(double realPos) const //returns -1 and screenSize + 1 if out of bounds!
{
//catch large double values: if double is larger than what int can represent => undefined behavior!
realPos = std::clamp(realPos, outOfBoundsLow_, outOfBoundsHigh_);
return std::round(realToScreen(realPos));
}
private:
const double min_;
const double scaleToReal_;
const double scaleToScr_;
double outOfBoundsLow_;
double outOfBoundsHigh_;
};
//enlarge value range to display to a multiple of a "useful" block size
//returns block cound
int widenRange(double& valMin, double& valMax, //in/out
int graphAreaSize, //in pixel
int optimalBlockSizePx, //
const LabelFormatter& labelFmt)
{
if (graphAreaSize <= 0) return 0;
const double minValRangePerBlock = (valMax - valMin) / graphAreaSize;
const double proposedValRangePerBlock = (valMax - valMin) * optimalBlockSizePx / graphAreaSize;
double valRangePerBlock = labelFmt.getOptimalBlockSize(proposedValRangePerBlock);
assert(numeric::isNull(proposedValRangePerBlock) || valRangePerBlock > minValRangePerBlock);
if (numeric::isNull(valRangePerBlock)) //valMin == valMax or strange "optimal block size"
return 1;
//don't allow sub-pixel blocks! => avoid erroneously high GDI render work load!
if (valRangePerBlock < minValRangePerBlock)
valRangePerBlock = std::ceil(minValRangePerBlock / valRangePerBlock) * valRangePerBlock;
double blockMin = std::floor(valMin / valRangePerBlock); //store as double, not int: truncation possible, e.g. if valRangePerBlock == 1
double blockMax = std::ceil (valMax / valRangePerBlock); //
int blockCount = std::round(blockMax - blockMin);
assert(blockCount >= 0);
//handle valMin == valMax == integer
if (blockCount <= 0)
{
++blockMax;
blockCount = 1;
}
valMin = blockMin * valRangePerBlock;
valMax = blockMax * valRangePerBlock;
return blockCount;
}
void drawXLabel(wxDC& dc, double xMin, double xMax, int blockCount, const ConvertCoord& cvrtX, const wxRect& graphArea, const wxRect& labelArea, const LabelFormatter& labelFmt)
{
assert(graphArea.width == labelArea.width && graphArea.x == labelArea.x);
if (blockCount <= 0)
return;
const double valRangePerBlock = (xMax - xMin) / blockCount;
for (int i = 1; i < blockCount; ++i)
{
const double valX = xMin + i * valRangePerBlock; //step over raw data, not graph area pixels, to not lose precision
const int x = graphArea.x + cvrtX.realToScreenRound(valX);
//draw grey vertical lines
clearArea(dc, {x - dipToWxsize(1) / 2, graphArea.y, dipToWxsize(1), graphArea.height}, wxColor(192, 192, 192)); //light grey => not accessible! but no big deal...
//draw x axis labels
const wxString label = labelFmt.formatText(valX, valRangePerBlock);
const wxSize labelExtent = dc.GetMultiLineTextExtent(label);
dc.DrawText(label, wxPoint(x - labelExtent.GetWidth() / 2, labelArea.y + (labelArea.height - labelExtent.GetHeight()) / 2)); //center
}
}
void drawYLabel(wxDC& dc, double yMin, double yMax, int blockCount, const ConvertCoord& cvrtY, const wxRect& graphArea, const wxRect& labelArea, const LabelFormatter& labelFmt)
{
assert(graphArea.height == labelArea.height && graphArea.y == labelArea.y);
if (blockCount <= 0)
return;
const double valRangePerBlock = (yMax - yMin) / blockCount;
for (int i = 1; i < blockCount; ++i)
{
//draw grey horizontal lines
const double valY = yMin + i * valRangePerBlock; //step over raw data, not graph area pixels, to not lose precision
const int y = graphArea.y + cvrtY.realToScreenRound(valY);
clearArea(dc, {graphArea.x, y - dipToWxsize(1) / 2, graphArea.width, dipToWxsize(1)}, wxColor(192, 192, 192)); //light grey => not accessible! but no big deal...
//draw y axis labels
const wxString label = labelFmt.formatText(valY, valRangePerBlock);
const wxSize labelExtent = dc.GetMultiLineTextExtent(label);
dc.DrawText(label, wxPoint(labelArea.x + (labelArea.width - labelExtent.GetWidth()) / 2, y - labelExtent.GetHeight() / 2)); //center
}
}
void drawCornerText(wxDC& dc, const wxRect& graphArea, const wxString& txt, GraphCorner pos, const wxColor& colorText, const wxColor& colorBack)
{
if (txt.empty()) return;
const wxSize border(dipToWxsize(5), dipToWxsize(2));
//it looks like wxDC::GetMultiLineTextExtent() precisely returns width, but too large a height: maybe they consider "text row height"?
const wxSize boxExtent = dc.GetMultiLineTextExtent(txt) + 2 * border;
wxPoint drawPos = graphArea.GetTopLeft();
switch (pos)
{
case GraphCorner::topL:
break;
case GraphCorner::topR:
drawPos.x += graphArea.width - boxExtent.GetWidth();
break;
case GraphCorner::bottomL:
drawPos.y += graphArea.height - boxExtent.GetHeight();
break;
case GraphCorner::bottomR:
drawPos.x += graphArea.width - boxExtent.GetWidth();
drawPos.y += graphArea.height - boxExtent.GetHeight();
break;
}
//add text shadow to improve readability:
wxDCTextColourChanger textColor(dc, colorBack);
dc.DrawText(txt, drawPos + border + wxSize(1, 1) /*better without dipToWxsize()?*/);
textColor.Set(colorText);
dc.DrawText(txt, drawPos + border);
}
//calculate intersection of polygon with half-plane
template <class Function, class Function2>
void cutPoints(std::vector<CurvePoint>& curvePoints, std::vector<unsigned char>& oobMarker, Function isInside, Function2 getIntersection, bool doPolygonCut)
{
assert(curvePoints.size() == oobMarker.size());
if (curvePoints.size() != oobMarker.size() || curvePoints.empty()) return;
auto isMarkedOob = [&](size_t index) { return oobMarker[index] != 0; }; //test if point is start of an OOB line
std::vector<CurvePoint> curvePointsTmp;
std::vector<unsigned char> oobMarkerTmp;
curvePointsTmp.reserve(curvePoints.size()); //allocating memory for these containers is one
oobMarkerTmp .reserve(oobMarker .size()); //of the more expensive operations of Graph2D!
auto savePoint = [&](const CurvePoint& pt, bool markedOob) { curvePointsTmp.push_back(pt); oobMarkerTmp.push_back(markedOob); };
bool pointInside = isInside(curvePoints[0]);
if (pointInside)
savePoint(curvePoints[0], isMarkedOob(0));
for (size_t index = 1; index < curvePoints.size(); ++index)
{
if (isInside(curvePoints[index]) != pointInside)
{
pointInside = !pointInside;
const CurvePoint is = getIntersection(curvePoints[index - 1], curvePoints[index]); //getIntersection returns "to" when delta is zero
savePoint(is, !pointInside || isMarkedOob(index - 1));
}
if (pointInside)
savePoint(curvePoints[index], isMarkedOob(index));
}
//make sure the output polygon area is correctly shaped if either begin or end points are cut
if (doPolygonCut) //note: impacts min/max height-calculations!
if (curvePoints.size() >= 3)
if (isInside(curvePoints.front()) != pointInside)
{
assert(!oobMarkerTmp.empty());
oobMarkerTmp.back() = true;
const CurvePoint is = getIntersection(curvePoints.back(), curvePoints.front());
savePoint(is, true);
}
curvePointsTmp.swap(curvePoints);
oobMarkerTmp .swap(oobMarker);
}
struct GetIntersectionX
{
explicit GetIntersectionX(double x) : x_(x) {}
CurvePoint operator()(const CurvePoint& from, const CurvePoint& to) const
{
const double deltaX = to.x - from.x;
const double deltaY = to.y - from.y;
return numeric::isNull(deltaX) ? to : CurvePoint{x_, from.y + (x_ - from.x) / deltaX * deltaY};
}
private:
const double x_;
};
struct GetIntersectionY
{
explicit GetIntersectionY(double y) : y_(y) {}
CurvePoint operator()(const CurvePoint& from, const CurvePoint& to) const
{
const double deltaX = to.x - from.x;
const double deltaY = to.y - from.y;
return numeric::isNull(deltaY) ? to : CurvePoint{from.x + (y_ - from.y) / deltaY * deltaX, y_};
}
private:
const double y_;
};
void cutPointsOutsideX(std::vector<CurvePoint>& curvePoints, std::vector<unsigned char>& oobMarker, double minX, double maxX, bool doPolygonCut)
{
cutPoints(curvePoints, oobMarker, [&](const CurvePoint& pt) { return pt.x >= minX; }, GetIntersectionX(minX), doPolygonCut);
cutPoints(curvePoints, oobMarker, [&](const CurvePoint& pt) { return pt.x <= maxX; }, GetIntersectionX(maxX), doPolygonCut);
}
void cutPointsOutsideY(std::vector<CurvePoint>& curvePoints, std::vector<unsigned char>& oobMarker, double minY, double maxY, bool doPolygonCut)
{
cutPoints(curvePoints, oobMarker, [&](const CurvePoint& pt) { return pt.y >= minY; }, GetIntersectionY(minY), doPolygonCut);
cutPoints(curvePoints, oobMarker, [&](const CurvePoint& pt) { return pt.y <= maxY; }, GetIntersectionY(maxY), doPolygonCut);
}
}
std::vector<CurvePoint> ContinuousCurveData::getPoints(double minX, double maxX, const wxSize& areaSizePx) const
{
std::vector<CurvePoint> points;
const int pixelWidth = areaSizePx.GetWidth();
if (pixelWidth <= 1) return points;
const ConvertCoord cvrtX(minX, maxX, pixelWidth - 1); //map [minX, maxX] to [0, pixelWidth - 1]
const std::pair<double, double> rangeX = getRangeX();
const double screenLow = cvrtX.realToScreen(std::max(rangeX.first, minX)); //=> xLow >= 0
const double screenHigh = cvrtX.realToScreen(std::min(rangeX.second, maxX)); //=> xHigh <= pixelWidth - 1
//if double is larger than what int can represent => undefined behavior!
//=> convert to int *after* checking value range!
if (screenLow <= screenHigh)
{
const int posFrom = std::ceil (screenLow ); //do not step outside [minX, maxX] in loop below!
const int posTo = std::floor(screenHigh); //
//conversion from std::floor/std::ceil double return value to int is loss-free for full value range of 32-bit int! tested successfully on MSVC
for (int i = posFrom; i <= posTo; ++i)
{
const double x = cvrtX.screenToReal(i);
points.emplace_back(CurvePoint{x, getValue(x)});
}
}
return points;
}
std::vector<CurvePoint> SparseCurveData::getPoints(double minX, double maxX, const wxSize& areaSizePx) const
{
std::vector<CurvePoint> points;
const int pixelWidth = areaSizePx.GetWidth();
if (pixelWidth <= 1) return points;
const ConvertCoord cvrtX(minX, maxX, pixelWidth - 1); //map [minX, maxX] to [0, pixelWidth - 1]
const std::pair<double, double> rangeX = getRangeX();
auto addPoint = [&](const CurvePoint& pt)
{
if (!points.empty())
{
if (pt.x <= points.back().x) //allow ascending x-positions only! algorithm below may cause double-insertion after empty x-ranges!
return;
if (addSteps_)
if (pt.y != points.back().y)
points.emplace_back(CurvePoint{pt.x, points.back().y}); //[!] aliasing parameter not yet supported via emplace_back: VS bug! => make copy
}
points.push_back(pt);
};
const int posFrom = cvrtX.realToScreenRound(std::max(rangeX.first, minX));
const int posTo = cvrtX.realToScreenRound(std::min(rangeX.second, maxX));
for (int i = posFrom; i <= posTo; ++i)
{
const double x = cvrtX.screenToReal(i);
std::optional<CurvePoint> ptLe = getLessEq(x);
std::optional<CurvePoint> ptGe = getGreaterEq(x);
//both non-existent and invalid return values are mapped to out of expected range: => check on posLe/posGe NOT ptLe/ptGe in the following!
const int posLe = ptLe ? cvrtX.realToScreenRound(ptLe->x) : i + 1;
const int posGe = ptGe ? cvrtX.realToScreenRound(ptGe->x) : i - 1;
assert(!ptLe || posLe <= i); //check for invalid return values
assert(!ptGe || posGe >= i); //
/* Breakdown of all combinations of posLe, posGe and expected action (n >= 1)
Note: For every empty x-range of at least one pixel, both next and previous points must be saved to keep the interpolating line stable!!!
posLe | posGe | action
+-------+-------+--------
| none | none | break
| i | none | save ptLe; break
| i - n | none | break;
+-------+-------+--------
| none | i | save ptGe; continue
| i | i | save one of ptLe, ptGe; continue
| i - n | i | save ptGe; continue
+-------+-------+--------
| none | i + n | save ptGe; jump to position posGe + 1
| i | i + n | save ptLe; if n == 1: continue; else: save ptGe; jump to position posGe + 1
| i - n | i + n | save ptLe, ptGe; jump to position posGe + 1
+-------+-------+-------- */
if (posGe < i)
{
if (posLe == i)
addPoint(*ptLe);
break;
}
else if (posGe == i) //test if point would be mapped to pixel x-position i
{
if (posLe == i) //
addPoint(x - ptLe->x < ptGe->x - x ? *ptLe : *ptGe);
else
addPoint(*ptGe);
}
else
{
if (posLe <= i)
addPoint(*ptLe);
if (posLe != i || posGe > i + 1)
{
addPoint(*ptGe);
i = posGe; //skip sparse area: +1 will be added by for-loop!
}
}
}
return points;
}
Graph2D::Graph2D(wxWindow* parent,
wxWindowID winid,
const wxPoint& pos,
const wxSize& size,
long style,
const wxString& name) : wxPanel(parent, winid, pos, size, style, name)
{
Bind(wxEVT_PAINT, [this](wxPaintEvent& event) { onPaintEvent(event); });
Bind(wxEVT_SIZE, [this](wxSizeEvent& event) { Refresh(); event.Skip(); });
Bind(wxEVT_ERASE_BACKGROUND, [](wxEraseEvent& event) {}); //https://wiki.wxwidgets.org/Flicker-Free_Drawing
//SetDoubleBuffered(true); slow as hell!
SetBackgroundStyle(wxBG_STYLE_PAINT);
Bind(wxEVT_LEFT_DOWN, [this](wxMouseEvent& event) { onMouseLeftDown(event); });
Bind(wxEVT_MOTION, [this](wxMouseEvent& event) { onMouseMovement(event); });
Bind(wxEVT_LEFT_UP, [this](wxMouseEvent& event) { onMouseLeftUp (event); });
Bind(wxEVT_MOUSE_CAPTURE_LOST, [this](wxMouseCaptureLostEvent& event) { onMouseCaptureLost(event); });
}
void Graph2D::onPaintEvent(wxPaintEvent& event)
{
//wxAutoBufferedPaintDC dc(this); -> this one happily fucks up for RTL layout by not drawing the first column (x = 0)!
BufferedPaintDC dc(*this, doubleBuffer_);
render(dc);
}
void Graph2D::onMouseLeftDown(wxMouseEvent& event)
{
activeSel_ = std::make_unique<MouseSelection>(*this, event.GetPosition());
if (!event.ControlDown())
oldSel_.clear();
Refresh();
}
void Graph2D::onMouseMovement(wxMouseEvent& event)
{
if (activeSel_.get())
{
activeSel_->refCurrentPos() = event.GetPosition(); //corresponding activeSel->refSelection() is updated in Graph2D::render()
Refresh();
}
}
void Graph2D::onMouseLeftUp(wxMouseEvent& event)
{
if (activeSel_.get())
{
if (activeSel_->getStartPos() != activeSel_->refCurrentPos()) //if it's just a single mouse click: discard selection
{
GetEventHandler()->AddPendingEvent(GraphSelectEvent(activeSel_->refSelection()));
oldSel_.push_back(activeSel_->refSelection()); //commit selection
}
activeSel_.reset();
Refresh();
}
}
void Graph2D::onMouseCaptureLost(wxMouseCaptureLostEvent& event)
{
activeSel_.reset();
Refresh();
}
void Graph2D::addCurve(const SharedRef<CurveData>& data, const CurveAttributes& ca)
{
CurveAttributes newAttr = ca;
if (newAttr.autoColor)
newAttr.setColor(getDefaultColor(curves_.size()));
curves_.emplace_back(data, newAttr);
Refresh();
}
void Graph2D::render(wxDC& dc) const
{
//set label font right at the start so that it is considered by wxDC::GetTextExtent() below!
dc.SetFont(GetFont());
dc.SetTextForeground(wxSystemSettings::GetColour(wxSYS_COLOUR_WINDOWTEXT));
const wxRect clientRect = GetClientRect(); //DON'T use wxDC::GetSize()! DC may be larger than visible area!
clearArea(dc, clientRect, GetBackgroundColour() /*user-configurable!*/);
//wxPanel::GetClassDefaultAttributes().colBg :
//wxSystemSettings::GetColour(wxSYS_COLOUR_BTNFACE);
const int xLabelHeight = attr_.xLabelHeight ? *attr_.xLabelHeight : GetCharHeight() + dipToWxsize(2) /*margin*/;
const int yLabelWidth = attr_.yLabelWidth ? *attr_.yLabelWidth : dc.GetTextExtent(L"1.23457e+07").x;
/* -----------------------
| | x-label |
-----------------------
|y-label | graph area |
|---------------------- */
wxRect graphArea = clientRect;
int xLabelPosY = clientRect.y;
int yLabelPosX = clientRect.x;
switch (attr_.xLabelpos)
{
case XLabelPos::none:
break;
case XLabelPos::top:
graphArea.y += xLabelHeight;
graphArea.height -= xLabelHeight;
break;
case XLabelPos::bottom:
xLabelPosY += clientRect.height - xLabelHeight;
graphArea.height -= xLabelHeight;
break;
}
switch (attr_.yLabelpos)
{
case YLabelPos::none:
break;
case YLabelPos::left:
graphArea.x += yLabelWidth;
graphArea.width -= yLabelWidth;
break;
case YLabelPos::right:
yLabelPosX += clientRect.width - yLabelWidth;
graphArea.width -= yLabelWidth;
break;
}
assert(attr_.xLabelpos == XLabelPos::none || attr_.labelFmtX);
assert(attr_.yLabelpos == YLabelPos::none || attr_.labelFmtY);
//paint graph background (excluding label area)
drawFilledRectangle(dc, graphArea, attr_.colorBack, getBorderColor(), dipToWxsize(1));
graphArea.Deflate(dipToWxsize(1));
//set label areas respecting graph area border!
const wxRect xLabelArea(graphArea.x, xLabelPosY, graphArea.width, xLabelHeight);
const wxRect yLabelArea(yLabelPosX, graphArea.y, yLabelWidth, graphArea.height);
//detect x value range
double minX = attr_.minX ? *attr_.minX : std::numeric_limits<double>::infinity(); //automatic: ensure values are initialized by first curve
double maxX = attr_.maxX ? *attr_.maxX : -std::numeric_limits<double>::infinity(); //
for (const auto& [curve, attrib] : curves_)
{
const std::pair<double, double> rangeX = curve.ref().getRangeX();
assert(rangeX.first <= rangeX.second + 1.0e-9);
//GCC fucks up badly when comparing two *binary identical* doubles and finds "begin > end" with diff of 1e-18
if (!attr_.minX)
minX = std::min(minX, rangeX.first);
if (!attr_.maxX)
maxX = std::max(maxX, rangeX.second);
}
if (minX <= maxX && maxX - minX < std::numeric_limits<double>::infinity()) //valid x-range
{
const wxSize minimalBlockSizePx = dc.GetTextExtent(L"00");
int blockCountX = 0;
//enlarge minX, maxX to a multiple of a "useful" block size
if (attr_.xLabelpos != XLabelPos::none && attr_.labelFmtX.get())
blockCountX = widenRange(minX, maxX, //in/out
graphArea.width,
minimalBlockSizePx.GetWidth() * 7,
*attr_.labelFmtX);
//get raw values + detect y value range
double minY = attr_.minY ? *attr_.minY : std::numeric_limits<double>::infinity(); //automatic: ensure values are initialized by first curve
double maxY = attr_.maxY ? *attr_.maxY : -std::numeric_limits<double>::infinity(); //
std::vector<std::vector<CurvePoint>> curvePoints(curves_.size());
std::vector<std::vector<unsigned char>> oobMarker (curves_.size()); //effectively a std::vector<bool> marking points that start an out-of-bounds line
for (size_t index = 0; index < curves_.size(); ++index)
{
const CurveData& curve = curves_ [index].first.ref();
std::vector<CurvePoint>& points = curvePoints[index];
auto& marker = oobMarker [index];
points = curve.getPoints(minX, maxX, graphArea.GetSize());
marker.resize(points.size()); //default value: false
if (!points.empty())
{
//cut points outside visible x-range now in order to calculate height of visible line fragments only!
const bool doPolygonCut = curves_[index].second.fillMode == CurveFillMode::polygon; //impacts auto minY/maxY!!
cutPointsOutsideX(points, marker, minX, maxX, doPolygonCut);
if (!attr_.minY || !attr_.maxY)
{
const auto& [itMin, itMax] = std::minmax_element(points.begin(), points.end(), [](const CurvePoint& lhs, const CurvePoint& rhs) { return lhs.y < rhs.y; });
if (!attr_.minY)
minY = std::min(minY, itMin->y);
if (!attr_.maxY)
maxY = std::max(maxY, itMax->y);
}
}
}
if (minY <= maxY) //valid y-range
{
int blockCountY = 0;
//enlarge minY, maxY to a multiple of a "useful" block size
if (attr_.yLabelpos != YLabelPos::none && attr_.labelFmtY.get())
blockCountY = widenRange(minY, maxY, //in/out
graphArea.height,
minimalBlockSizePx.GetHeight() * 3,
*attr_.labelFmtY);
if (graphArea.width <= 1 || graphArea.height <= 1)
return;
const ConvertCoord cvrtX(minX, maxX, graphArea.width - 1); //map [minX, maxX] to [0, pixelWidth - 1]
const ConvertCoord cvrtY(maxY, minY, graphArea.height - 1); //map [minY, maxY] to [pixelHeight - 1, 0]
//calculate curve coordinates on graph area
std::vector<std::vector<wxPoint>> drawPoints(curves_.size());
for (size_t index = 0; index < curves_.size(); ++index)
{
auto& cp = curvePoints[index];
//add two artificial points to fill the curve area towards x-axis => do this before cutPointsOutsideY() to handle curve leaving upper bound
if (curves_[index].second.fillMode == CurveFillMode::curve)
if (!cp.empty())
{
cp.emplace_back(CurvePoint{cp.back ().x, minY}); //add lower right and left corners
cp.emplace_back(CurvePoint{cp.front().x, minY}); //[!] aliasing parameter not yet supported via emplace_back: VS bug! => make copy
oobMarker[index].back() = true;
oobMarker[index].push_back(true);
oobMarker[index].push_back(true);
}
//cut points outside visible y-range before calculating pixels:
//1. realToScreenRound() deforms out-of-range values!
//2. pixels that are grossly out of range can be a severe performance problem when drawing on the DC (Windows)
const bool doPolygonCut = curves_[index].second.fillMode != CurveFillMode::none;
cutPointsOutsideY(cp, oobMarker[index], minY, maxY, doPolygonCut);
auto& dp = drawPoints[index];
for (const CurvePoint& pt : cp)
dp.push_back(wxSize(cvrtX.realToScreenRound(pt.x),
cvrtY.realToScreenRound(pt.y)) + graphArea.GetTopLeft());
}
//update active mouse selection
if (activeSel_)
{
wxPoint screenFrom = activeSel_->getStartPos() - graphArea.GetTopLeft(); //make relative to graphArea
wxPoint screenTo = activeSel_->refCurrentPos() - graphArea.GetTopLeft();
//normalize positions:
screenFrom.x = std::clamp(screenFrom.x, 0, graphArea.width - 1);
screenFrom.y = std::clamp(screenFrom.y, 0, graphArea.height - 1);
screenTo .x = std::clamp(screenTo .x, 0, graphArea.width - 1);
screenTo .y = std::clamp(screenTo .y, 0, graphArea.height - 1);
//save current selection as "double" coordinates
activeSel_->refSelection().from = CurvePoint{cvrtX.screenToReal(screenFrom.x),
cvrtY.screenToReal(screenFrom.y)};
activeSel_->refSelection().to = CurvePoint{cvrtX.screenToReal(screenTo.x),
cvrtY.screenToReal(screenTo.y)};
}
//#################### begin drawing ####################
//1. draw colored area under curves
for (auto it = curves_.begin(); it != curves_.end(); ++it)
if (it->second.fillMode != CurveFillMode::none)
if (const std::vector<wxPoint>& points = drawPoints[it - curves_.begin()];
points.size() >= 3)
{
//wxDC::DrawPolygon() draws *transparent* border if wxTRANSPARENT_PEN is used!
//unlike wxDC::DrawRectangle() which widens inner area instead!
dc.SetPen ({it->second.fillColor, 1 /*[!] width*/});
dc.SetBrush(it->second.fillColor);
dc.DrawPolygon(static_cast<int>(points.size()), points.data());
}
//2. draw all currently set mouse selections (including active selection)
std::vector<SelectionBlock> allSelections = oldSel_;
if (activeSel_)
allSelections.push_back(activeSel_->refSelection());
if (!allSelections.empty())
{
const wxColor innerCol(168, 202, 236); //light blue
const wxColor borderCol(51, 153, 255); //dark blue
//alpha channel not supported on wxMSW, so draw selection before curves
for (const SelectionBlock& sel : allSelections)
{
//harmonize with active mouse selection above
int screenFromX = cvrtX.realToScreenRound(sel.from.x);
int screenFromY = cvrtY.realToScreenRound(sel.from.y);
int screenToX = cvrtX.realToScreenRound(sel.to.x);
int screenToY = cvrtY.realToScreenRound(sel.to.y);
if (screenFromX > screenToX) std::swap(screenFromX, screenToX);
if (screenFromY > screenToY) std::swap(screenFromY, screenToY);
const wxRect rectSel{graphArea.GetTopLeft() + wxSize(screenFromX,
screenFromY),
wxSize(screenToX - screenFromX + 1, //mouse selection is symmetric
screenToY - screenFromY + 1)}; //and *not* a half-open range!
switch (attr_.mouseSelMode)
{
case GraphSelMode::none:
break;
case GraphSelMode::rect:
drawFilledRectangle(dc, rectSel, innerCol, borderCol, dipToWxsize(1));
break;
case GraphSelMode::x:
drawFilledRectangle(dc, {rectSel.x, graphArea.y, rectSel.width, graphArea.height}, innerCol, borderCol, dipToWxsize(1));
break;
case GraphSelMode::y:
drawFilledRectangle(dc, {graphArea.x, rectSel.y, graphArea.width, rectSel.height}, innerCol, borderCol, dipToWxsize(1));
break;
}
}
}
//3. draw labels and background grid
if (attr_.labelFmtX) drawXLabel(dc, minX, maxX, blockCountX, cvrtX, graphArea, xLabelArea, *attr_.labelFmtX);
if (attr_.labelFmtY) drawYLabel(dc, minY, maxY, blockCountY, cvrtY, graphArea, yLabelArea, *attr_.labelFmtY);
//4. finally draw curves
{
dc.SetClippingRegion(graphArea); //prevent thick curves from drawing slightly outside
ZEN_ON_SCOPE_EXIT(dc.DestroyClippingRegion());
for (auto it = curves_.begin(); it != curves_.end(); ++it)
{
dc.SetPen({it->second.color, it->second.lineWidth});
const size_t index = it - curves_.begin();
const std::vector<wxPoint>& points = drawPoints[index];
const auto& marker = oobMarker [index];
assert(points.size() == marker.size());
//draw all parts of the curve except for the out-of-bounds fragments
size_t drawIndexFirst = 0;
while (drawIndexFirst < points.size())
{
size_t drawIndexLast = std::find(marker.begin() + drawIndexFirst, marker.end(), static_cast<char>(true)) - marker.begin();
if (drawIndexLast < points.size()) ++drawIndexLast;
const int pointCount = static_cast<int>(drawIndexLast - drawIndexFirst);
if (pointCount > 0)
{
if (pointCount >= 2) //on macOS wxWidgets has a nasty assert on this
dc.DrawLines(pointCount, &points[drawIndexFirst]);
dc.DrawPoint(points[drawIndexLast - 1]); //wxDC::DrawLines() doesn't draw last pixel
}
drawIndexFirst = std::find(marker.begin() + drawIndexLast, marker.end(), static_cast<char>(false)) - marker.begin();
}
}
}
//5. draw corner texts
for (const auto& [cornerPos, text] : attr_.cornerTexts)
drawCornerText(dc, graphArea, text, cornerPos, attr_.colorText, attr_.colorBack);
}
}
}
|