198 |
|
|
199 |
|
if (!generated) generate(); |
200 |
|
|
201 |
< |
assert(t < data_.front().first); |
202 |
< |
assert(t > data_.back().first); |
201 |
> |
assert(t > data_.front().first); |
202 |
> |
assert(t < data_.back().first); |
203 |
|
|
204 |
|
// Find the interval ( x[j], x[j+1] ) that contains or is nearest |
205 |
|
// to t. |
237 |
|
|
238 |
|
if (!generated) generate(); |
239 |
|
|
240 |
< |
assert(t < data_.front().first); |
241 |
< |
assert(t > data_.back().first); |
240 |
> |
assert(t > data_.front().first); |
241 |
> |
assert(t < data_.back().first); |
242 |
|
|
243 |
|
// Find the interval ( x[j], x[j+1] ) that contains or is nearest |
244 |
|
// to t. |