const bool past_start = (inclusive ? first->when >= start : first->when > start);
/* Earliest points is in range, return it */
- if (past_start >= start && first->when < end) {
+ if (past_start && first->when < end) {
x = first->when;
y = first->value;
assert(x >= start);
assert(x < end);
- cerr << "returned something" << endl;
return true;
} else {
- cerr << "not between start and end" << endl;
return false;
}
/* No points in range */
} else {
- cerr << "no points in range" << endl;
return false;
}
}