82 double const lambda_min = first->lambda;
83 double const lambda_max = (last - 1)->lambda;
85 if (lambda < lambda_min || lambda > lambda_max)
return 0;
87 L2QE
const*
const p(std::lower_bound(first, last, lambda, less_than));
89 if (p == first)
return p->qe;
92 L2QE
const*
const q = p - 1;
93 return (lambda - q->lambda)*(p->qe - q->qe)/(p->lambda - q->lambda) + q->qe;