
(FPCore (lo hi x) :precision binary64 (/ (- x lo) (- hi lo)))
double code(double lo, double hi, double x) {
return (x - lo) / (hi - lo);
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
code = (x - lo) / (hi - lo)
end function
public static double code(double lo, double hi, double x) {
return (x - lo) / (hi - lo);
}
def code(lo, hi, x): return (x - lo) / (hi - lo)
function code(lo, hi, x) return Float64(Float64(x - lo) / Float64(hi - lo)) end
function tmp = code(lo, hi, x) tmp = (x - lo) / (hi - lo); end
code[lo_, hi_, x_] := N[(N[(x - lo), $MachinePrecision] / N[(hi - lo), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x - lo}{hi - lo}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (lo hi x) :precision binary64 (/ (- x lo) (- hi lo)))
double code(double lo, double hi, double x) {
return (x - lo) / (hi - lo);
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
code = (x - lo) / (hi - lo)
end function
public static double code(double lo, double hi, double x) {
return (x - lo) / (hi - lo);
}
def code(lo, hi, x): return (x - lo) / (hi - lo)
function code(lo, hi, x) return Float64(Float64(x - lo) / Float64(hi - lo)) end
function tmp = code(lo, hi, x) tmp = (x - lo) / (hi - lo); end
code[lo_, hi_, x_] := N[(N[(x - lo), $MachinePrecision] / N[(hi - lo), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x - lo}{hi - lo}
\end{array}
(FPCore (lo hi x) :precision binary64 (+ (exp (log1p (* (/ hi lo) (/ (- hi x) lo)))) -1.0))
double code(double lo, double hi, double x) {
return exp(log1p(((hi / lo) * ((hi - x) / lo)))) + -1.0;
}
public static double code(double lo, double hi, double x) {
return Math.exp(Math.log1p(((hi / lo) * ((hi - x) / lo)))) + -1.0;
}
def code(lo, hi, x): return math.exp(math.log1p(((hi / lo) * ((hi - x) / lo)))) + -1.0
function code(lo, hi, x) return Float64(exp(log1p(Float64(Float64(hi / lo) * Float64(Float64(hi - x) / lo)))) + -1.0) end
code[lo_, hi_, x_] := N[(N[Exp[N[Log[1 + N[(N[(hi / lo), $MachinePrecision] * N[(N[(hi - x), $MachinePrecision] / lo), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] + -1.0), $MachinePrecision]
\begin{array}{l}
\\
e^{\mathsf{log1p}\left(\frac{hi}{lo} \cdot \frac{hi - x}{lo}\right)} + -1
\end{array}
Initial program 3.1%
Taylor expanded in lo around inf 0.0%
associate--l+0.0%
+-commutative0.0%
associate--l+0.0%
distribute-lft-out--0.0%
div-sub0.0%
mul-1-neg0.0%
sub-neg0.0%
unpow20.0%
times-frac19.0%
distribute-lft-out--19.0%
associate-*r/19.0%
fma-neg19.0%
Simplified19.0%
add-cbrt-cube19.0%
pow319.0%
+-commutative19.0%
Applied egg-rr19.0%
Taylor expanded in lo around 0 0.0%
unpow20.0%
times-frac19.7%
Simplified19.7%
expm1-log1p-u19.7%
expm1-udef19.7%
Applied egg-rr19.7%
Final simplification19.7%
(FPCore (lo hi x) :precision binary64 (* (/ hi lo) (/ (- hi x) lo)))
double code(double lo, double hi, double x) {
return (hi / lo) * ((hi - x) / lo);
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
code = (hi / lo) * ((hi - x) / lo)
end function
public static double code(double lo, double hi, double x) {
return (hi / lo) * ((hi - x) / lo);
}
def code(lo, hi, x): return (hi / lo) * ((hi - x) / lo)
function code(lo, hi, x) return Float64(Float64(hi / lo) * Float64(Float64(hi - x) / lo)) end
function tmp = code(lo, hi, x) tmp = (hi / lo) * ((hi - x) / lo); end
code[lo_, hi_, x_] := N[(N[(hi / lo), $MachinePrecision] * N[(N[(hi - x), $MachinePrecision] / lo), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{hi}{lo} \cdot \frac{hi - x}{lo}
\end{array}
Initial program 3.1%
Taylor expanded in lo around inf 0.0%
associate--l+0.0%
+-commutative0.0%
associate--l+0.0%
distribute-lft-out--0.0%
div-sub0.0%
mul-1-neg0.0%
sub-neg0.0%
unpow20.0%
times-frac19.0%
distribute-lft-out--19.0%
associate-*r/19.0%
fma-neg19.0%
Simplified19.0%
add-cbrt-cube19.0%
pow319.0%
+-commutative19.0%
Applied egg-rr19.0%
Taylor expanded in lo around 0 0.0%
unpow20.0%
times-frac19.7%
Simplified19.7%
Final simplification19.7%
(FPCore (lo hi x) :precision binary64 (/ (- lo) hi))
double code(double lo, double hi, double x) {
return -lo / hi;
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
code = -lo / hi
end function
public static double code(double lo, double hi, double x) {
return -lo / hi;
}
def code(lo, hi, x): return -lo / hi
function code(lo, hi, x) return Float64(Float64(-lo) / hi) end
function tmp = code(lo, hi, x) tmp = -lo / hi; end
code[lo_, hi_, x_] := N[((-lo) / hi), $MachinePrecision]
\begin{array}{l}
\\
\frac{-lo}{hi}
\end{array}
Initial program 3.1%
Taylor expanded in hi around inf 18.7%
Taylor expanded in x around 0 18.8%
associate-*r/18.8%
neg-mul-118.8%
Simplified18.8%
Final simplification18.8%
(FPCore (lo hi x) :precision binary64 1.0)
double code(double lo, double hi, double x) {
return 1.0;
}
real(8) function code(lo, hi, x)
real(8), intent (in) :: lo
real(8), intent (in) :: hi
real(8), intent (in) :: x
code = 1.0d0
end function
public static double code(double lo, double hi, double x) {
return 1.0;
}
def code(lo, hi, x): return 1.0
function code(lo, hi, x) return 1.0 end
function tmp = code(lo, hi, x) tmp = 1.0; end
code[lo_, hi_, x_] := 1.0
\begin{array}{l}
\\
1
\end{array}
Initial program 3.1%
Taylor expanded in lo around inf 18.7%
Final simplification18.7%
herbie shell --seed 2023275
(FPCore (lo hi x)
:name "xlohi (overflows)"
:precision binary64
:pre (and (< lo -1e+308) (> hi 1e+308))
(/ (- x lo) (- hi lo)))