Lines Matching refs:max
140 v = res.max();
143 res.setMax(std::max(a,b));
164 double t0=i->min(), t1=i->max(), lo=0., hi=0.;
179 hi = std::max(a*(1-t0)+b*t0+hi*t0*(1-t0),a*(1-t1)+b*t1+hi*t1*(1-t1));
246 // int idx_max=std::max(idxa,idxb);
281 if (bs.max()>0 && idxa<(int)levels.size())
282 ta_hi=a+(levels.at(idxa )-fa)/bs.max();
293 if (bs.max()>0 && idxb>0)
294 tb_lo=b+(levels.at(idxb-1)-fb)/bs.max();
299 t1=std::max(tb_hi,tb_lo);
366 return I.max()<J.max();
369 //find the first interval whose max is >= x
379 if ( result.back().max() + tol >= sets[i].min() ){
393 f wont enter c before a + (f(a)-c.max())/m
395 From this we conclude nothing happens before a'=a+min((f(a)-c.max())/m,(C.min()-f(a))/M).
444 ta_hi = a + ( levels[idxa].max() - fa)/bs.max();
454 ta_lo = a + ( levels[idxa-1].max() - fa)/bs.min();
460 ta_hi = a + ( levels[idxa].min() - fa)/bs.max();
468 tb_lo = b + ( levels[idxb].min() - fb ) / bs.max();
469 tb_hi = b + ( levels[idxb].max() - fb ) / bs.min();
473 solsets[idxb].push_back( Interval( std::max( tb_lo, tb_hi ), b) );
479 tb_lo = b + ( levels[idxb-1].max() - fb)/bs.max();
492 if ( bs.max() > 0 && idxb > 0 )
493 tb_lo = b + ( levels[idxb-1].max() - fb ) / bs.max();
498 double t1=std::max(tb_hi,tb_lo);
507 unsigned idxmax = std::max(idxa, idxb);
521 t0 = std::min( std::max( t0, a + tol ), b );
522 t1 = std::max( std::min( t1, b - tol ), a );
572 if(!bs || bs->min() > 0 || bs->max() < 0)