package apronext
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Module Apronext.IntervalextSource
APRON Intervals on scalars
val of_scalar : Apron.Scalar.t -> Apron.Scalar.t -> tBuild an interval from a lower and an upper bound
val of_infsup : Apron.Scalar.t -> Apron.Scalar.t -> tdepreciated
val of_mpq : Mpq.t -> Mpq.t -> tval of_mpqf : Mpqf.t -> Mpqf.t -> tval of_int : int -> int -> tval of_frac : int -> int -> int -> int -> tval of_float : float -> float -> tval of_mpfr : Mpfr.t -> Mpfr.t -> tCreate an interval from resp. two
- multi-precision rationals
Mpq.t - multi-precision rationals
Mpqf.t - integers
- fractions
x/yandz/w - machine floats
- Mpfr floats
val is_top : t -> boolDoes the interval represent the universe ([-oo,+oo]) ?
val is_bottom : t -> boolDoes the interval contain no value ([a,b] with a>b) ?
Non Total Comparison: 0: equality -1: i1 included in i2 +1: i2 included in i1 -2: i1.inf less than or equal to i2.inf +2: i1.inf greater than i2.inf
val is_zero : t -> boolIs the interval equal to 0,0 ?
val equal_int : t -> int -> boolIs the interval equal to i,i ?
val top : tval bottom : tTop and bottom intervals (using DOUBLE coefficients)
val set_infsup : t -> Apron.Scalar.t -> Apron.Scalar.t -> unitFill the interval with the given lower and upper bouunds
val set_top : t -> unitval set_bottom : t -> unitFill the interval with top (resp. bottom) value
val print : Format.formatter -> t -> unitPrint an interval, under the format [inf,sup]
Extensions
join a b computes the smallest interval c such that is_leq a c && is_leq b c
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page