Lines Matching defs:level
271 //first times when a level (higher or lower) can be reached from a or b.
399 If f(a) or f(b) belongs to some 'level' C, then use the same argument to find a' or b' such
401 level before or after some time, allowing us to restrict the search a little more.
431 //first times when a level (higher or lower) can be reached from a or b.
432 double ta_hi; // f remains below next level for t<ta_hi
433 double ta_lo; // f remains above prev level for t<ta_lo
434 double tb_hi; // f remains below next level for t>tb_hi
435 double tb_lo; // f remains above next level for t>tb_lo
440 //--- if f(a) belongs to a level.-------
442 //find the first time when we may exit this level.
450 //--- if f(b) does not belong to a level.-------
465 //--- if f(b) belongs to a level.-------
467 //find the first time from b when we may exit this level.
475 //--- if f(b) does not belong to a level.-------
508 //push [t0,t1] into all crossed level. Cheat to avoid overlapping intervals on different levels?
520 //To make sure we finally exit the level jump at least by tol:
547 std::vector<Interval> level_set (SBasis const &f, double level, double vtol, double a, double b, double tol){
548 Interval fat_level( level - vtol, level + vtol );
551 std::vector<Interval> level_set (SBasis const &f, Interval const &level, double a, double b, double tol){
552 std::vector<Interval> levels(1,level);