Lines Matching defs:lower
180 combine_dark_factoids i lower upper
495 we just need to check that the maximum of the lower bounds is less
496 than or equal to the minimum of the lower bounds. If it is then
498 false, combining the maximum lower and the minimum upper constraint.
508 fun assign_factoid (df, acc as (upper, lower)) = let
513 NONE => (SOME (fc, d), lower)
514 | SOME (c', d') => if fc < c' then (SOME (fc, d), lower) else acc
516 case lower of
518 | SOME (c', d') => if ~fc > c' then (SOME (~fc,d), lower) else acc
520 val (upper, lower) = dbfold assign_factoid (NONE,NONE) ptree
522 case (upper, lower) of
541 (i.e., with upper or lower bounds only).
620 upper bounds or all of its lower bounds. This function returns
744 fun categorise ((f, _), (acc as (lower, upper))) = let
755 NONE => (lower, SOME c)
756 | SOME c' => if c < c' then (lower, SOME c) else acc
759 | GREATER => let (* lower *)
762 case lower of
767 val (lower, upper) = dbfold categorise (NONE, NONE) ptree
769 val _ = valOf lower <= valOf upper orelse raise Fail "urk in extend map"
771 mlibPatricia.add i (valOf lower) vmap
805 one in all of its lower-bound or upper-bound occurrences),
812 eliminated into upper and lower bound sets.
815 upper x lower