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 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888
|
// $Id: Graph.cc 2641 2007-09-02 21:31:02Z flaterco $
/* Graph Abstract superclass for all graphs.
Copyright (C) 1998 David Flater.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "common.hh"
#include "Graph.hh"
#include "Skycal.hh"
// Margin left at top and bottom of tide graphs when scaling tides;
// how much "water" at lowest tide; how much "sky" at highest tide.
// This is a scaling factor for the graph height.
const double Graph::vertGraphMargin (0.0673);
// In drawing of line graphs, slope at which to abandon the thick line
// drawing algorithm.
static const double slopeLimit (5.0);
Graph::Graph (unsigned xSize, unsigned ySize, GraphStyle style):
_style(style),
_xSize(xSize),
_ySize(ySize) {}
Graph::~Graph() {}
static void findNextSunEvent (TideEventsIterator &it,
TideEventsOrganizer &organizer,
Timestamp now,
Timestamp endTime,
Timestamp &nextSunEventTime_out) {
while (it != organizer.end()) {
TideEvent &te = it->second;
if (te.eventTime > now &&
(te.eventType == TideEvent::sunrise ||
te.eventType == TideEvent::sunset)) {
nextSunEventTime_out = te.eventTime;
return;
}
++it;
}
nextSunEventTime_out = endTime + Global::day;
}
const double Graph::linterp (double lo, double hi, double saturation) const {
return lo + saturation * (hi - lo);
}
const unsigned char Graph::linterp (unsigned char lo,
unsigned char hi,
double saturation) const {
return (unsigned char) linterp ((double)lo, (double)hi, saturation);
}
const unsigned short Graph::linterp (unsigned short lo,
unsigned short hi,
double saturation) const {
return (unsigned short) linterp ((double)lo, (double)hi, saturation);
}
// Translate a tide depth to a y-coordinate.
#define xlate(y) linterp (ymax, \
ymin, \
(((y) - valmin) / (valmax - valmin)))
void Graph::checkDepth (double ymax,
double ymin,
double valmax,
double valmin,
unsigned lineStep,
int &minDepth_out,
int &maxDepth_out) const {
minDepth_out=INT_MAX;
maxDepth_out=INT_MIN;
int depth;
const double valmax10(valmax*10), valmin10(valmin*10);
double ytide;
for (depth = 0; depth <= valmax10; depth += lineStep) {
ytide = xlate(0.1*depth);
// Leave room for 3 lines of text at top, 3 lines of text plus
// tick marks at bottom.
if (ytide - fontHeight()/2 - depthLineVerticalMargin() <=
(fontHeight()+fontVerticalMargin()) * 3)
break;
if (ytide + fontHeight()/2 + depthLineVerticalMargin() >=
_ySize - (fontHeight()+fontVerticalMargin()) * 3 - hourTickLen())
continue;
maxDepth_out = depth;
if (depth < minDepth_out) // In case one loop is never executed.
minDepth_out = depth;
}
for (depth = -lineStep; depth >= valmin10; depth -= lineStep) {
ytide = xlate(0.1*depth);
// Leave room for 3 lines of text at top, 3 lines of text plus
// tick marks at bottom.
if (ytide - fontHeight()/2 - depthLineVerticalMargin() <=
(fontHeight()+fontVerticalMargin()) * 3)
continue;
if (ytide + fontHeight()/2 + depthLineVerticalMargin() >=
_ySize - (fontHeight()+fontVerticalMargin()) * 3 - hourTickLen())
break;
minDepth_out = depth;
if (depth > maxDepth_out) // In case one loop is never executed.
maxDepth_out = depth;
}
}
void Graph::drawDepth (double ymax,
double ymin,
double valmax,
double valmin,
unsigned lineStep,
unsigned labelWidth,
int minDepth,
int maxDepth) {
for (int depth=minDepth; depth<=maxDepth; depth+=lineStep)
drawHorizontalLine (labelWidth,
_xSize-1,
xlate(0.1*depth),
Colors::foreground);
}
void Graph::drawFunkyLine (double prevytide,
double ytide,
double nextytide,
int x,
Colors::Colorchoice c) {
double dy, yleft, yright;
double slw (Global::settings["lw"].d);
// The fix for line slope breaks down when the slope gets nasty, so
// switch to a more conservative strategy when that happens. Line
// width becomes 1 no matter what.
#define dohalfline(yy) { \
double lw; \
if (fabs(dy) < slopeLimit) \
lw = (1.0 + (M_SQRT2 - 1.0) * fabs(dy)) * slw / 2.0; \
else \
lw = (fabs(dy) + slw) / 2.0; \
if (dy < 0.0) \
lw = -lw; \
yy = ytide - lw; \
}
dy = ytide - prevytide;
dohalfline (yleft);
dy = ytide - nextytide;
dohalfline (yright);
// Fix degenerate cases.
if (ytide > yleft && ytide > yright) {
if (yleft > yright)
yleft = ytide + slw / 2.0;
else
yright = ytide + slw / 2.0;
} else if (ytide < yleft && ytide < yright) {
if (yleft < yright)
yleft = ytide - slw / 2.0;
else
yright = ytide - slw / 2.0;
}
drawVerticalLine (x, yleft, yright, c);
}
void Graph::clearGraph (Timestamp startTime,
Timestamp endTime,
Interval increment,
Station *station,
TideEventsOrganizer &organizer) {
assert (station);
// True if event mask is set to suppress sunrises *or* sunsets
bool ns (Global::settings["em"].s.contains("s"));
// Clear the graph by laying down a background of days and nights.
bool sunIsUp = true;
if (!(station->coordinates.isNull()) && !ns)
sunIsUp = Skycal::sunIsUp (startTime, station->coordinates);
Timestamp loopTime (startTime);
Timestamp nextSunEventTime;
TideEventsIterator it (organizer.begin());
findNextSunEvent (it, organizer, loopTime, endTime, nextSunEventTime);
for (unsigned x=0; x<_xSize; ++x, loopTime += increment) {
if (loopTime >= nextSunEventTime && !ns) {
findNextSunEvent (it, organizer, loopTime, endTime, nextSunEventTime);
assert (loopTime < nextSunEventTime);
if (it != organizer.end()) {
switch (it->second.eventType) {
case TideEvent::sunrise:
sunIsUp = false;
break;
case TideEvent::sunset:
sunIsUp = true;
break;
default:
assert (false);
}
} else
sunIsUp = !sunIsUp;
}
Colors::Colorchoice c = (sunIsUp ? Colors::daytime : Colors::nighttime);
drawVerticalLine (x, 0, _ySize-1, c);
}
}
void Graph::drawX (int x, double y) {
drawVerticalLine (x, y-4, y+4, Colors::foreground);
drawHorizontalLine (x-4, x+4, y, Colors::foreground);
}
static void makeDepthLabel (int depth,
unsigned lineStep,
const Dstr &unitsDesc,
Dstr &text_out) {
text_out = "";
if (depth < 0) {
text_out += '-';
depth = -depth;
}
text_out += depth / 10;
if (lineStep < 10) {
text_out += '.';
text_out += depth % 10;
}
text_out += ' ';
text_out += unitsDesc;
}
void Graph::figureLabels (double ymax,
double ymin,
double valmax,
double valmin,
const Dstr &unitsDesc,
unsigned &lineStep_out,
unsigned &labelWidth_out,
unsigned &labelRight_out,
int &minDepth_out,
int &maxDepth_out) const {
assert (valmin < valmax);
const double yzulu (xlate(0));
// Tortured logic to figure the increment for depth lines. We want
// nice increments like 2, 5, 10, not random numbers.
if (Global::settings["gt"].c == 'y')
lineStep_out = 1;
else
lineStep_out = 10;
{
unsigned prevStep (lineStep_out), prevMult (10);
while (yzulu - xlate(0.1*lineStep_out) <
fontHeight() + fontVerticalMargin()) {
switch (prevMult) {
case 10:
prevMult = 2;
lineStep_out = prevStep * prevMult;
break;
case 2:
prevMult = 5;
lineStep_out = prevStep * prevMult;
break;
case 5:
prevMult = 10;
prevStep = lineStep_out = prevStep * prevMult;
break;
default:
assert (false);
}
}
}
// More figuring.
checkDepth (ymax, ymin, valmax, valmin, lineStep_out, minDepth_out,
maxDepth_out);
labelWidth_out = labelRight_out = 0;
if (minDepth_out <= maxDepth_out) {
{
Dstr minLabel;
makeDepthLabel (minDepth_out, lineStep_out, unitsDesc, minLabel);
labelWidth_out = stringWidth(minLabel);
}{
Dstr maxLabel;
makeDepthLabel (maxDepth_out, lineStep_out, unitsDesc, maxLabel);
unsigned maxLabelWidth (stringWidth(maxLabel));
if (maxLabelWidth > labelWidth_out)
labelWidth_out = maxLabelWidth;
}
labelRight_out = labelWidth_out + depthLabelLeftMargin();
labelWidth_out = labelRight_out + depthLabelRightMargin();
}
// Otherwise, there are no depth lines, but labelWidth (0) will be
// used for extra lines and the now (+) mark.
}
// Blurbs push and shove their neighbors until everyone has room.
static const bool iterateEventBlurbCollisions (
SafeVector<Graph::EventBlurb> &blurbs) {
bool collision (false);
for (unsigned long i=1; i<blurbs.size(); ++i) {
Graph::EventBlurb &prev (blurbs[i-1]);
Graph::EventBlurb &cur (blurbs[i]);
if (prev.x > cur.x) // Try to keep them in order at least.
std::swap (prev.x, cur.x);
int collisionWidth ((prev.x + prev.deltaRight) -
(cur.x + cur.deltaLeft) + 1);
if (collisionWidth > 0) {
collision = true;
int leftAdjust (-collisionWidth / 2);
int rightAdjust (collisionWidth + leftAdjust);
prev.x += leftAdjust;
cur.x += rightAdjust;
}
}
return collision;
}
// With no iteration limit, this would converge eventually. There is
// a first event and a last event, and those boundary events would
// eventually be pushed far enough out into the void to make room for
// everyone. However, the distance that events could migrate from
// their original locations would be unbounded. The optimal iteration
// limit to maintain some semblance of order is anybody's guess. Even
// when it fails, the end result is better than what we started with.
static void fixEventBlurbCollisions (SafeVector<Graph::EventBlurb> &blurbs) {
for (unsigned i=0; i<20 && iterateEventBlurbCollisions(blurbs); ++i);
}
void Graph::drawBlurbs (int topLine, SafeVector<EventBlurb> &blurbs) {
fixEventBlurbCollisions (blurbs);
for (SafeVector<EventBlurb>::iterator blurbit = blurbs.begin();
blurbit != blurbs.end();
++blurbit)
labelEvent (topLine, *blurbit);
}
void Graph::drawTides (Station *station,
Timestamp nominalStartTime,
Angle *angle) {
assert (station);
assert (station->aspect > 0.0);
// Figure constants.
const double ymin (vertGraphMargin * (double)_ySize);
const double ymax ((double)_ySize - ymin);
const double valmin (station->minLevel().val());
const double valmax (station->maxLevel().val());
assert (valmin < valmax);
unsigned lineStep, labelWidth, labelRight;
int minDepth, maxDepth;
const Dstr unitsDesc (Units::shortName (station->predictUnits()));
figureLabels (ymax, ymin, valmax, valmin, unitsDesc, lineStep, labelWidth,
labelRight, minDepth, maxDepth);
char tl (Global::settings["tl"].c);
char nf (Global::settings["nf"].c);
char el (Global::settings["el"].c);
Interval increment (std::max ((interval_rep_t)1,
Global::intervalround (Global::aspectMagicNumber /
(double)_ySize /
(aspectFudgeFactor() * station->aspect))));
Timestamp startTime (nominalStartTime -
increment * startPosition(labelWidth));
Timestamp endTime (startTime + increment * _xSize);
Timestamp currentTime ((time_t)time(NULL));
// First get a list of the relevant tide events. Need some extra on
// either side since text pertaining to events occurring beyond the
// margins can still be visible. We also need to make sure
// *something* shows up so that extendRange can work below.
TideEventsOrganizer organizer;
Interval delta;
for (delta = Global::day; organizer.empty(); delta *= 2U)
station->predictTideEvents (startTime - delta, endTime + delta, organizer);
// Need at least one following max and min for clock mode.
TideEvent nextMax, nextMin;
if (_style == clock) {
bool doneMax = false, doneMin = false;
delta = Global::day;
while (!(doneMax && doneMin)) {
TideEventsIterator it = organizer.upper_bound(currentTime);
while (it != organizer.end() && !(doneMax && doneMin)) {
TideEvent &te = it->second;
if (!doneMax && te.eventType == TideEvent::max) {
doneMax = true;
nextMax = te;
} else if (!doneMin && te.eventType == TideEvent::min) {
doneMin = true;
nextMin = te;
}
++it;
}
if (!(doneMax && doneMin)) {
station->extendRange (organizer, Station::forward, delta);
delta *= 2U;
}
}
// Need a max/min pair bracketing current time for tide clock icon
// angle kludge.
if (angle) {
TideEvent nextMaxOrMin;
if (nextMax.eventTime < nextMin.eventTime)
nextMaxOrMin = nextMax;
else
nextMaxOrMin = nextMin;
TideEvent previousMaxOrMin;
{
bool done = false;
delta = Global::day;
while (!done) {
TideEventsIterator it = organizer.upper_bound(currentTime);
assert (it != organizer.end());
while (it != organizer.begin() && !done)
if ((--it)->second.isMaxMinEvent()) {
done = true;
previousMaxOrMin = it->second;
}
if (!done) {
station->extendRange (organizer, Station::backward, delta);
delta *= 2U;
}
}
}
// This could blow up on pathological subordinate stations.
// Better to let it slide. (The clock will do something weird
// but won't die.)
// assert (previousMaxOrMin.eventType != nextMaxOrMin.eventType);
assert (previousMaxOrMin.eventTime <= currentTime &&
nextMaxOrMin.eventTime > currentTime);
assert (previousMaxOrMin.isMaxMinEvent());
assert (nextMaxOrMin.isMaxMinEvent());
double temp ((currentTime - previousMaxOrMin.eventTime) /
(nextMaxOrMin.eventTime - previousMaxOrMin.eventTime));
temp *= 180.0;
if (previousMaxOrMin.eventType == TideEvent::min)
temp += 180.0;
(*angle) = Angle (Units::degrees, temp);
}
}
clearGraph (startTime, endTime, increment, station, organizer);
// Draw depth lines now?
if (tl == 'n')
drawDepth (ymax, ymin, valmax, valmin, lineStep, labelWidth, minDepth,
maxDepth);
// Prepare to draw the actual tides.
double prevval, prevytide;
double val (station->predictTideLevel(startTime-increment).val());
double ytide = xlate(val);
const double yzulu (xlate(0));
double nextval (station->predictTideLevel(startTime).val());
double nextytide (xlate (nextval));
Timestamp loopt;
int x;
startPixelCache();
// loopt is actually 1 step ahead of x.
for (x=0, loopt=startTime+increment;
x<(int)_xSize;
++x, loopt += increment) {
prevval = val;
prevytide = ytide;
val = nextval;
ytide = nextytide;
nextval = station->predictTideLevel(loopt).val();
nextytide = xlate(nextval);
// Coloration is determined from the predicted heights, not from
// the eventTypes of surrounding tide events. Ideally the two
// would never disagree, but for pathological sub stations they
// can.
if (station->isCurrent) {
Colors::Colorchoice c = (val > 0.0 ? Colors::flood : Colors::ebb);
if (nf == 'n')
drawVerticalLine (x, yzulu, ytide, c);
else
drawFunkyLine (prevytide, ytide, nextytide, x, c);
} else {
Colors::Colorchoice c = (prevval < val ? Colors::flood : Colors::ebb);
if (nf == 'n')
drawVerticalLine (x, _ySize, ytide, c);
else
drawFunkyLine (prevytide, ytide, nextytide, x, c);
}
#ifdef blendingTest
NullablePredictionValue firstYear, secondYear;
station->tideLevelBlendValues (loopt-increment, firstYear, secondYear);
if (!firstYear.isNull())
setPixel (x, (int)xlate(firstYear.val()), Colors::mark);
if (!secondYear.isNull())
setPixel (x, (int)xlate(secondYear.val()), Colors::msl);
#endif
}
stopPixelCache();
// Draw depth lines later?
if (tl != 'n')
drawDepth (ymax, ymin, valmax, valmin, lineStep, labelWidth, minDepth,
maxDepth);
// Height axis.
for (int depth = minDepth; depth <= maxDepth; depth += lineStep) {
Dstr dlabel;
makeDepthLabel (depth, lineStep, unitsDesc, dlabel);
double adj = 0.0;
if (fontHeight() > 1)
adj = (double)(fontHeight()) / 2.0;
rightJustifyString (labelRight, xlate(0.1*depth)-adj, dlabel);
}
// Relatively straightforward logic to figure the increment for the
// time axis. We stop at 1 day.
unsigned timeStep = 1;
unsigned doubleOughtWidth = stringWidth("00");
if ((Global::hour * timeStep) / increment < doubleOughtWidth)
timeStep = 2;
if ((Global::hour * timeStep) / increment < doubleOughtWidth)
timeStep = 3;
if ((Global::hour * timeStep) / increment < doubleOughtWidth)
timeStep = 4;
if ((Global::hour * timeStep) / increment < doubleOughtWidth)
timeStep = 6;
if ((Global::hour * timeStep) / increment < doubleOughtWidth)
timeStep = 12;
if ((Global::hour * timeStep) / increment < doubleOughtWidth)
timeStep = 24;
// Do time axis.
const Timestamp timeAxisStopTime (endTime + Global::hour * timeStep);
loopt = startTime;
for (loopt.floorHour(station->timezone);
loopt < timeAxisStopTime;
loopt.nextHour(station->timezone)) {
if (loopt.tmStruct(station->timezone).tm_hour % timeStep == 0) {
x = Global::iround ((loopt - startTime) / increment);
drawHourTick (x, Colors::foreground);
Dstr ts;
loopt.printHour (ts, station->timezone);
labelHourTick (x, ts);
}
}
/* Make tick marks for day boundaries thicker. */
/* They are not guaranteed to coincide with hour transitions! */
loopt = startTime;
for (loopt.floorDay(station->timezone);
loopt < timeAxisStopTime;
loopt.nextDay(station->timezone)) {
x = Global::iround ((loopt - startTime) / increment);
drawHourTick (x-1, Colors::foreground);
drawHourTick (x, Colors::foreground);
drawHourTick (x+1, Colors::foreground);
}
if (_style == clock) {
// Write current time
Dstr ts;
currentTime.printTime (ts, station->timezone);
centerStringOnLine (_xSize/2, 0, ts);
// Write next max
centerStringOnLine (_xSize/2, 1, nextMax.longDescription());
nextMax.eventTime.printTime (ts, station->timezone);
centerStringOnLine (_xSize/2, 2, ts);
// Write next min
centerStringOnLine (_xSize/2, -3, nextMin.longDescription());
nextMin.eventTime.printTime (ts, station->timezone);
centerStringOnLine (_xSize/2, -2, ts);
} else {
drawTitleLine (station->name);
// Put timestamps for timestampable events.
#ifdef DumbTideClockDemo
Timestamp firstMaxMinTime;
#endif
SafeVector<EventBlurb> topBlurbs, bottomBlurbs;
EventBlurb tempBlurb;
for (TideEventsIterator it = organizer.begin();
it != organizer.end();
++it) {
TideEvent &te = it->second;
#ifdef DumbTideClockDemo
if (firstMaxMinTime.isNull() &&
te.eventTime >= startTime &&
te.isMaxMinEvent())
firstMaxMinTime = te.eventTime;
#endif
tempBlurb.x = Global::iround ((te.eventTime - startTime) / increment);
switch (te.eventType) {
case TideEvent::max:
case TideEvent::min:
te.eventTime.printDate (tempBlurb.line1, station->timezone);
te.eventTime.printTime (tempBlurb.line2, station->timezone);
measureBlurb (tempBlurb);
topBlurbs.push_back (tempBlurb);
break;
case TideEvent::moonrise:
case TideEvent::moonset:
case TideEvent::slackrise:
case TideEvent::slackfall:
case TideEvent::markrise:
case TideEvent::markfall:
case TideEvent::newmoon:
case TideEvent::firstquarter:
case TideEvent::fullmoon:
case TideEvent::lastquarter:
drawHourTick (tempBlurb.x, Colors::mark);
te.eventTime.printTime (tempBlurb.line2, station->timezone);
tempBlurb.line1 = te.longDescription();
if (!isBanner())
if (stringWidth(tempBlurb.line1) > stringWidth(tempBlurb.line2))
tempBlurb.line1 = te.shortDescription();
measureBlurb (tempBlurb);
bottomBlurbs.push_back (tempBlurb);
break;
default:
break;
}
}
drawBlurbs (1, topBlurbs);
drawBlurbs (-3, bottomBlurbs);
#ifdef DumbTideClockDemo
if (!firstMaxMinTime.isNull()) {
for (loopt = firstMaxMinTime;
loopt < endTime;
loopt += Global::halfCycle) {
x = (int) round ((loopt - startTime) / increment);
drawVerticalLine (x, (int)_ySize-1, 0, Colors::msl);
}
}
#endif
}
// Extra lines.
if (!station->markLevel.isNull()) {
ytide = xlate(station->markLevel.val());
drawHorizontalLine (labelWidth, _xSize-1, ytide, Colors::mark);
}
if (el != 'n') {
drawHorizontalLine (labelWidth, _xSize-1, yzulu, Colors::datum);
ytide = (ymax + ymin) / 2.0;
drawHorizontalLine (labelWidth, _xSize-1, ytide, Colors::msl);
}
// X marks the current time.
if (currentTime >= startTime && currentTime < endTime) {
x = Global::iround ((currentTime - startTime) / increment);
ytide = xlate(station->predictTideLevel(currentTime).val());
drawX (x, ytide);
}
}
void Graph::drawHorizontalLine (int xlo,
int xhi,
double y,
Colors::Colorchoice c) {
drawHorizontalLine (xlo, xhi, Global::iround(y), c);
}
void Graph::drawString (int x, double y, const Dstr &s) {
drawString (x, Global::iround(y), s);
}
void Graph::centerString (int x, int y, const Dstr &s) {
drawString (x-(int)stringWidth(s)/2, y, s);
}
// This must agree with whatever centerString does about odd numbers.
// However, it doesn't hurt to fudge by an even number to create a
// margin on both sides.
void Graph::measureBlurb (EventBlurb &blurb) const {
int width (std::max (stringWidth (blurb.line1), stringWidth (blurb.line2))
+ blurbMargin());
blurb.deltaLeft = -width / 2;
blurb.deltaRight = width + blurb.deltaLeft - 1;
}
const int Graph::blurbMargin() const {
return 2;
}
void Graph::rightJustifyString (int x, double y, const Dstr &s) {
drawString (x-(int)stringWidth(s), y, s);
}
void Graph::centerStringOnLine (int x, int line, const Dstr &s) {
int y;
if (line >= 0)
y = line * (fontHeight()+fontVerticalMargin());
else
y = _ySize+(fontHeight()+fontVerticalMargin())*line-hourTickLen();
centerString (x, y, s);
}
const unsigned Graph::fontVerticalMargin() const {
return 0;
}
const unsigned Graph::depthLabelLeftMargin() const {
return 2;
}
const unsigned Graph::depthLabelRightMargin() const {
return 2;
}
const unsigned Graph::depthLineVerticalMargin() const {
return 2;
}
const unsigned Graph::hourTickLen() const {
return 8;
}
const double Graph::aspectFudgeFactor() const {
return 1.0;
}
const unsigned Graph::startPosition (unsigned labelWidth) const {
return labelWidth + 8;
}
void Graph::setPixel (int x,
int y,
Colors::Colorchoice c,
double saturation) {
assert (c < (int)Colors::numColors);
if (saturation >= 0.5)
setPixel (x, y, c);
}
void Graph::drawHourTick (int x, Colors::Colorchoice c) {
drawVerticalLine (x, (int)_ySize-1, (int)_ySize-hourTickLen(), c);
}
void Graph::drawVerticalLine (int x, int y1, int y2, Colors::Colorchoice c) {
int ylo, yhi;
if (y1 < y2) {
ylo = y1; yhi = y2;
} else {
ylo = y2; yhi = y1;
}
for (int i=ylo; i<=yhi; ++i)
setPixel (x, i, c);
}
void Graph::drawVerticalLine (int x,
double y1,
double y2,
Colors::Colorchoice c) {
double ylo, yhi;
if (y1 < y2) {
ylo = y1; yhi = y2;
} else {
ylo = y2; yhi = y1;
}
int ylo2 ((int) ceil (ylo));
int yhi2 ((int) floor (yhi));
if (ylo2 < yhi2)
drawVerticalLine (x, ylo2, yhi2-1, c);
// What if they both fall within the same pixel: ylo2 > yhi2
if (ylo2 > yhi2) {
assert (yhi2 == ylo2 - 1);
double saturation (yhi - ylo);
setPixel (x, yhi2, c, saturation);
} else {
// The normal case.
if (ylo < (double)ylo2) {
double saturation ((double)ylo2 - ylo);
setPixel (x, ylo2-1, c, saturation);
}
if (yhi > (double)yhi2) {
double saturation (yhi - (double)yhi2);
setPixel (x, yhi2, c, saturation);
}
}
}
void Graph::drawHorizontalLine (int xlo,
int xhi,
int y,
Colors::Colorchoice c) {
for (int i=xlo; i<=xhi; ++i)
setPixel (i, y, c);
}
void Graph::labelHourTick (int x, const Dstr &label) {
centerStringOnLine (x, -1, label);
}
void Graph::drawTitleLine (const Dstr &title) {
centerStringOnLine (_xSize/2, 0, title);
}
void Graph::labelEvent (int topLine, const EventBlurb &blurb) {
// This needs to get overridden in Banner.
centerStringOnLine (blurb.x, topLine, blurb.line1);
centerStringOnLine (blurb.x, topLine+1, blurb.line2);
}
const bool Graph::isBanner() const {
return false;
}
void Graph::startPixelCache() {
}
void Graph::stopPixelCache() {
}
// Cleanup2006 LongMethod(drawTides) Done
|