
(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 7 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 (+ (/ (/ (- hi x) lo) (- 1.0 (/ hi lo))) 1.0))
double code(double lo, double hi, double x) {
return (((hi - x) / lo) / (1.0 - (hi / lo))) + 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 = (((hi - x) / lo) / (1.0d0 - (hi / lo))) + 1.0d0
end function
public static double code(double lo, double hi, double x) {
return (((hi - x) / lo) / (1.0 - (hi / lo))) + 1.0;
}
def code(lo, hi, x): return (((hi - x) / lo) / (1.0 - (hi / lo))) + 1.0
function code(lo, hi, x) return Float64(Float64(Float64(Float64(hi - x) / lo) / Float64(1.0 - Float64(hi / lo))) + 1.0) end
function tmp = code(lo, hi, x) tmp = (((hi - x) / lo) / (1.0 - (hi / lo))) + 1.0; end
code[lo_, hi_, x_] := N[(N[(N[(N[(hi - x), $MachinePrecision] / lo), $MachinePrecision] / N[(1.0 - N[(hi / lo), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{hi - x}{lo}}{1 - \frac{hi}{lo}} + 1
\end{array}
Initial program 3.1%
Taylor expanded in lo around inf
Simplified18.9%
clear-numN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6418.9%
Applied egg-rr18.9%
*-commutativeN/A
distribute-rgt-inN/A
associate-/r/N/A
/-rgt-identityN/A
associate-*l/N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
flip-+N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr99.4%
Taylor expanded in hi around 0
+-commutativeN/A
mul-1-negN/A
sub-negN/A
div-subN/A
/-lowering-/.f64N/A
--lowering--.f6499.4%
Simplified99.4%
Final simplification99.4%
(FPCore (lo hi x) :precision binary64 (/ 1.0 (+ (/ (- x hi) lo) 1.0)))
double code(double lo, double hi, double x) {
return 1.0 / (((x - hi) / lo) + 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 / (((x - hi) / lo) + 1.0d0)
end function
public static double code(double lo, double hi, double x) {
return 1.0 / (((x - hi) / lo) + 1.0);
}
def code(lo, hi, x): return 1.0 / (((x - hi) / lo) + 1.0)
function code(lo, hi, x) return Float64(1.0 / Float64(Float64(Float64(x - hi) / lo) + 1.0)) end
function tmp = code(lo, hi, x) tmp = 1.0 / (((x - hi) / lo) + 1.0); end
code[lo_, hi_, x_] := N[(1.0 / N[(N[(N[(x - hi), $MachinePrecision] / lo), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{x - hi}{lo} + 1}
\end{array}
Initial program 3.1%
Taylor expanded in lo around inf
Simplified18.9%
flip-+N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
--lowering--.f64N/A
Applied egg-rr18.9%
Taylor expanded in lo around -inf
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
--lowering--.f6498.5%
Simplified98.5%
Final simplification98.5%
(FPCore (lo hi x) :precision binary64 (* hi (/ (/ hi lo) lo)))
double code(double lo, double hi, double x) {
return hi * ((hi / lo) / 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 * ((hi / lo) / lo)
end function
public static double code(double lo, double hi, double x) {
return hi * ((hi / lo) / lo);
}
def code(lo, hi, x): return hi * ((hi / lo) / lo)
function code(lo, hi, x) return Float64(hi * Float64(Float64(hi / lo) / lo)) end
function tmp = code(lo, hi, x) tmp = hi * ((hi / lo) / lo); end
code[lo_, hi_, x_] := N[(hi * N[(N[(hi / lo), $MachinePrecision] / lo), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
hi \cdot \frac{\frac{hi}{lo}}{lo}
\end{array}
Initial program 3.1%
Taylor expanded in lo around inf
Simplified18.9%
clear-numN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6418.9%
Applied egg-rr18.9%
*-commutativeN/A
distribute-rgt-inN/A
associate-/r/N/A
/-rgt-identityN/A
associate-*l/N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
flip-+N/A
associate-*r/N/A
/-lowering-/.f64N/A
Applied egg-rr99.4%
Taylor expanded in hi around inf
unpow2N/A
associate-*r/N/A
*-lowering-*.f64N/A
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6419.6%
Simplified19.6%
(FPCore (lo hi x) :precision binary64 (/ (- x lo) hi))
double code(double lo, double hi, double x) {
return (x - 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 = (x - lo) / hi
end function
public static double code(double lo, double hi, double x) {
return (x - lo) / hi;
}
def code(lo, hi, x): return (x - lo) / hi
function code(lo, hi, x) return Float64(Float64(x - lo) / hi) end
function tmp = code(lo, hi, x) tmp = (x - lo) / hi; end
code[lo_, hi_, x_] := N[(N[(x - lo), $MachinePrecision] / hi), $MachinePrecision]
\begin{array}{l}
\\
\frac{x - lo}{hi}
\end{array}
Initial program 3.1%
Taylor expanded in hi around inf
/-lowering-/.f64N/A
--lowering--.f6418.8%
Simplified18.8%
(FPCore (lo hi x) :precision binary64 (- 0.0 (/ lo hi)))
double code(double lo, double hi, double x) {
return 0.0 - (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 = 0.0d0 - (lo / hi)
end function
public static double code(double lo, double hi, double x) {
return 0.0 - (lo / hi);
}
def code(lo, hi, x): return 0.0 - (lo / hi)
function code(lo, hi, x) return Float64(0.0 - Float64(lo / hi)) end
function tmp = code(lo, hi, x) tmp = 0.0 - (lo / hi); end
code[lo_, hi_, x_] := N[(0.0 - N[(lo / hi), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
0 - \frac{lo}{hi}
\end{array}
Initial program 3.1%
Taylor expanded in hi around inf
/-lowering-/.f64N/A
--lowering--.f6418.8%
Simplified18.8%
Taylor expanded in x around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f6418.8%
Simplified18.8%
Final simplification18.8%
(FPCore (lo hi x) :precision binary64 (- 1.0 (/ x lo)))
double code(double lo, double hi, double x) {
return 1.0 - (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 = 1.0d0 - (x / lo)
end function
public static double code(double lo, double hi, double x) {
return 1.0 - (x / lo);
}
def code(lo, hi, x): return 1.0 - (x / lo)
function code(lo, hi, x) return Float64(1.0 - Float64(x / lo)) end
function tmp = code(lo, hi, x) tmp = 1.0 - (x / lo); end
code[lo_, hi_, x_] := N[(1.0 - N[(x / lo), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
1 - \frac{x}{lo}
\end{array}
Initial program 3.1%
Taylor expanded in hi around 0
mul-1-negN/A
neg-sub0N/A
div-subN/A
sub-negN/A
*-inversesN/A
metadata-evalN/A
+-commutativeN/A
associate--r+N/A
metadata-evalN/A
--lowering--.f64N/A
/-lowering-/.f6418.7%
Simplified18.7%
(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
Simplified18.7%
herbie shell --seed 2024161
(FPCore (lo hi x)
:name "xlohi (overflows)"
:precision binary64
:pre (and (< lo -1e+308) (> hi 1e+308))
(/ (- x lo) (- hi lo)))