minx = find_xy_value(g, getx, mindouble);
maxx = find_xy_value(g, getx, maxdouble);
miny = find_xy_value(g, gety, mindouble);
+
+ /*
+ * Start graphs at zero, unless we have a value below. Otherwise
+ * it's hard to visually compare the read and write graph, since
+ * the lowest valued one will be the floor of the graph view.
+ */
+ if (miny > 0)
+ miny = 0;
+
maxy = find_xy_value(g, gety, maxdouble);
if (fabs(maxx - minx) < 1e-20 || fabs(maxy - miny) < 1e-20) {
return (x >= first_x && x <= last_x) && (y >= first_y && y <= last_y);
}
+/*
+ * Allowable difference to show tooltip
+ */
+#define TOOLTIP_XDIFF 10
+#define TOOLTIP_YDIFF 10
+
static int xy_match(struct xyvalue *xy, int x, int y)
{
int xdiff = abs(xy->gx - x);
int ydiff = abs(xy->gy - y);
- return xdiff <= 20 && ydiff <= 10;
+ return xdiff <= TOOLTIP_XDIFF && ydiff <= TOOLTIP_YDIFF;
}
const char *graph_find_tooltip(struct graph *g, int x, int y)
for (i = g->labels; i; i = i->next) {
for (j = i->values; j; j = j->next) {
struct xyvalue *xy = j->value;
-
- if (xy_match(xy, x - g->xoffset, y))
+ int graphx = x - g->xoffset;
+
+ /*
+ * Return match if close enough. Take advantage
+ * of the X axis being monotonically increasing,
+ * so we can break out if we exceed it.
+ */
+ if (xy_match(xy, graphx, y))
return j->tooltip;
+ else if (xy->gx - graphx > TOOLTIP_XDIFF)
+ break;
}
}