
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* y (+ 1.0 (* z z))) 5e+307) (/ (/ 1.0 (+ y (* z (* y z)))) x) (/ (/ (/ 1.0 y) (* z x)) z)))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((y * (1.0 + (z * z))) <= 5e+307) {
tmp = (1.0 / (y + (z * (y * z)))) / x;
} else {
tmp = ((1.0 / y) / (z * x)) / z;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((y * (1.0d0 + (z * z))) <= 5d+307) then
tmp = (1.0d0 / (y + (z * (y * z)))) / x
else
tmp = ((1.0d0 / y) / (z * x)) / z
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((y * (1.0 + (z * z))) <= 5e+307) {
tmp = (1.0 / (y + (z * (y * z)))) / x;
} else {
tmp = ((1.0 / y) / (z * x)) / z;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (y * (1.0 + (z * z))) <= 5e+307: tmp = (1.0 / (y + (z * (y * z)))) / x else: tmp = ((1.0 / y) / (z * x)) / z return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(y * Float64(1.0 + Float64(z * z))) <= 5e+307) tmp = Float64(Float64(1.0 / Float64(y + Float64(z * Float64(y * z)))) / x); else tmp = Float64(Float64(Float64(1.0 / y) / Float64(z * x)) / z); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((y * (1.0 + (z * z))) <= 5e+307)
tmp = (1.0 / (y + (z * (y * z)))) / x;
else
tmp = ((1.0 / y) / (z * x)) / z;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+307], N[(N[(1.0 / N[(y + N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], N[(N[(N[(1.0 / y), $MachinePrecision] / N[(z * x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot \left(1 + z \cdot z\right) \leq 5 \cdot 10^{+307}:\\
\;\;\;\;\frac{\frac{1}{y + z \cdot \left(y \cdot z\right)}}{x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{y}}{z \cdot x}}{z}\\
\end{array}
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < 5e307Initial program 96.1%
associate-/r*95.7%
+-commutative95.7%
fma-def95.7%
Simplified95.7%
Taylor expanded in x around 0 93.5%
associate-*r*95.7%
*-commutative95.7%
associate-*r*95.0%
associate-/r*95.0%
unpow295.0%
fma-udef95.0%
associate-/r*96.3%
associate-/l/96.1%
fma-udef96.1%
distribute-lft-in96.1%
*-rgt-identity96.1%
fma-def96.1%
fma-def96.1%
*-commutative96.1%
associate-*r*98.4%
fma-udef98.4%
Simplified98.4%
fma-udef98.4%
Applied egg-rr98.4%
if 5e307 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 76.2%
associate-/r*76.2%
+-commutative76.2%
fma-def76.2%
Simplified76.2%
fma-udef76.2%
+-commutative76.2%
associate-/r*76.2%
associate-/r*81.1%
div-inv81.1%
+-commutative81.1%
fma-udef81.1%
Applied egg-rr81.1%
Taylor expanded in z around inf 81.1%
unpow281.1%
Simplified81.1%
un-div-inv81.1%
associate-/l/81.1%
associate-/l/80.5%
*-commutative80.5%
associate-*l*80.8%
associate-*r*94.8%
associate-/l/95.3%
*-commutative95.3%
associate-/r*99.9%
Applied egg-rr99.9%
Final simplification98.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.5) (* (/ (/ 1.0 x) y) (- 1.0 (* z z))) (/ (/ (/ 1.0 y) (* z x)) z)))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = ((1.0 / x) / y) * (1.0 - (z * z));
} else {
tmp = ((1.0 / y) / (z * x)) / z;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 0.5d0) then
tmp = ((1.0d0 / x) / y) * (1.0d0 - (z * z))
else
tmp = ((1.0d0 / y) / (z * x)) / z
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = ((1.0 / x) / y) * (1.0 - (z * z));
} else {
tmp = ((1.0 / y) / (z * x)) / z;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 0.5: tmp = ((1.0 / x) / y) * (1.0 - (z * z)) else: tmp = ((1.0 / y) / (z * x)) / z return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 0.5) tmp = Float64(Float64(Float64(1.0 / x) / y) * Float64(1.0 - Float64(z * z))); else tmp = Float64(Float64(Float64(1.0 / y) / Float64(z * x)) / z); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 0.5)
tmp = ((1.0 / x) / y) * (1.0 - (z * z));
else
tmp = ((1.0 / y) / (z * x)) / z;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision] * N[(1.0 - N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / y), $MachinePrecision] / N[(z * x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.5:\\
\;\;\;\;\frac{\frac{1}{x}}{y} \cdot \left(1 - z \cdot z\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{y}}{z \cdot x}}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 0.5Initial program 99.7%
associate-/r*99.1%
+-commutative99.1%
fma-def99.1%
Simplified99.1%
fma-udef99.1%
+-commutative99.1%
associate-/r*99.7%
associate-/r*99.7%
div-inv99.7%
+-commutative99.7%
fma-udef99.7%
Applied egg-rr99.7%
Taylor expanded in z around 0 99.1%
mul-1-neg99.1%
unsub-neg99.1%
unpow299.1%
Simplified99.1%
if 0.5 < (*.f64 z z) Initial program 83.9%
associate-/r*83.9%
+-commutative83.9%
fma-def83.9%
Simplified83.9%
fma-udef83.9%
+-commutative83.9%
associate-/r*83.9%
associate-/r*83.8%
div-inv83.8%
+-commutative83.8%
fma-udef83.8%
Applied egg-rr83.8%
Taylor expanded in z around inf 83.3%
unpow283.3%
Simplified83.3%
un-div-inv83.3%
associate-/l/83.4%
associate-/l/83.6%
*-commutative83.6%
associate-*l*80.9%
associate-*r*90.5%
associate-/l/90.7%
*-commutative90.7%
associate-/r*97.5%
Applied egg-rr97.5%
Final simplification98.5%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 2e+21) (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))) (/ (/ (/ 1.0 y) (* z x)) z)))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+21) {
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
} else {
tmp = ((1.0 / y) / (z * x)) / z;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 2d+21) then
tmp = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
else
tmp = ((1.0d0 / y) / (z * x)) / z
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e+21) {
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
} else {
tmp = ((1.0 / y) / (z * x)) / z;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 2e+21: tmp = (1.0 / x) / (y * (1.0 + (z * z))) else: tmp = ((1.0 / y) / (z * x)) / z return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e+21) tmp = Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))); else tmp = Float64(Float64(Float64(1.0 / y) / Float64(z * x)) / z); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 2e+21)
tmp = (1.0 / x) / (y * (1.0 + (z * z)));
else
tmp = ((1.0 / y) / (z * x)) / z;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 2e+21], N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / y), $MachinePrecision] / N[(z * x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+21}:\\
\;\;\;\;\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{y}}{z \cdot x}}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 2e21Initial program 99.7%
if 2e21 < (*.f64 z z) Initial program 83.6%
associate-/r*83.6%
+-commutative83.6%
fma-def83.6%
Simplified83.6%
fma-udef83.6%
+-commutative83.6%
associate-/r*83.6%
associate-/r*83.5%
div-inv83.5%
+-commutative83.5%
fma-udef83.5%
Applied egg-rr83.5%
Taylor expanded in z around inf 83.5%
unpow283.5%
Simplified83.5%
un-div-inv83.5%
associate-/l/83.5%
associate-/l/83.7%
*-commutative83.7%
associate-*l*81.0%
associate-*r*90.8%
associate-/l/90.9%
*-commutative90.9%
associate-/r*98.0%
Applied egg-rr98.0%
Final simplification99.0%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 1.0) (/ (/ 1.0 x) y) (/ 1.0 (* x (* y (* z z))))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1.0) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (y * (z * z)));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 1.0d0) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (x * (y * (z * z)))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1.0) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (y * (z * z)));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 1.0: tmp = (1.0 / x) / y else: tmp = 1.0 / (x * (y * (z * z))) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 1.0) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(x * Float64(y * Float64(z * z)))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 1.0)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (x * (y * (z * z)));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1.0], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(x * N[(y * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 1:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot \left(y \cdot \left(z \cdot z\right)\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 1Initial program 99.7%
associate-/r*99.1%
+-commutative99.1%
fma-def99.1%
Simplified99.1%
Taylor expanded in z around 0 98.3%
associate-/l/98.9%
add-cube-cbrt97.6%
pow397.5%
associate-/l/97.2%
*-commutative97.2%
cbrt-div97.0%
metadata-eval97.0%
*-commutative97.0%
Applied egg-rr97.0%
metadata-eval97.0%
cbrt-div97.2%
rem-cube-cbrt98.3%
*-commutative98.3%
associate-/r*98.9%
Applied egg-rr98.9%
if 1 < (*.f64 z z) Initial program 83.9%
associate-/r*83.9%
+-commutative83.9%
fma-def83.9%
Simplified83.9%
Taylor expanded in z around inf 83.5%
unpow283.5%
Simplified83.5%
Final simplification92.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.5) (/ (/ 1.0 x) y) (/ 1.0 (* (* z (* y z)) x))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / ((z * (y * z)) * x);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 0.5d0) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / ((z * (y * z)) * x)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / ((z * (y * z)) * x);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 0.5: tmp = (1.0 / x) / y else: tmp = 1.0 / ((z * (y * z)) * x) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 0.5) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(Float64(z * Float64(y * z)) * x)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 0.5)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / ((z * (y * z)) * x);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.5:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(z \cdot \left(y \cdot z\right)\right) \cdot x}\\
\end{array}
\end{array}
if (*.f64 z z) < 0.5Initial program 99.7%
associate-/r*99.1%
+-commutative99.1%
fma-def99.1%
Simplified99.1%
Taylor expanded in z around 0 98.3%
associate-/l/98.9%
add-cube-cbrt97.6%
pow397.5%
associate-/l/97.2%
*-commutative97.2%
cbrt-div97.0%
metadata-eval97.0%
*-commutative97.0%
Applied egg-rr97.0%
metadata-eval97.0%
cbrt-div97.2%
rem-cube-cbrt98.3%
*-commutative98.3%
associate-/r*98.9%
Applied egg-rr98.9%
if 0.5 < (*.f64 z z) Initial program 83.9%
associate-/r*83.9%
+-commutative83.9%
fma-def83.9%
Simplified83.9%
Taylor expanded in z around inf 83.5%
unpow283.5%
*-commutative83.5%
associate-*r*92.3%
Simplified92.3%
Final simplification96.1%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.5) (/ (/ 1.0 x) y) (/ 1.0 (* y (* z (* z x))))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (y * (z * (z * x)));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 0.5d0) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (y * (z * (z * x)))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (y * (z * (z * x)));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 0.5: tmp = (1.0 / x) / y else: tmp = 1.0 / (y * (z * (z * x))) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 0.5) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(y * Float64(z * Float64(z * x)))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 0.5)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (y * (z * (z * x)));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(y * N[(z * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.5:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y \cdot \left(z \cdot \left(z \cdot x\right)\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 0.5Initial program 99.7%
associate-/r*99.1%
+-commutative99.1%
fma-def99.1%
Simplified99.1%
Taylor expanded in z around 0 98.3%
associate-/l/98.9%
add-cube-cbrt97.6%
pow397.5%
associate-/l/97.2%
*-commutative97.2%
cbrt-div97.0%
metadata-eval97.0%
*-commutative97.0%
Applied egg-rr97.0%
metadata-eval97.0%
cbrt-div97.2%
rem-cube-cbrt98.3%
*-commutative98.3%
associate-/r*98.9%
Applied egg-rr98.9%
if 0.5 < (*.f64 z z) Initial program 83.9%
associate-/r*83.9%
+-commutative83.9%
fma-def83.9%
Simplified83.9%
associate-/r*83.9%
*-un-lft-identity83.9%
fma-udef83.9%
+-commutative83.9%
add-sqr-sqrt45.1%
times-frac45.0%
*-commutative45.0%
sqrt-prod45.1%
hypot-1-def45.1%
*-commutative45.1%
sqrt-prod47.0%
hypot-1-def53.9%
Applied egg-rr53.9%
associate-*l/53.9%
*-lft-identity53.9%
*-commutative53.9%
associate-/r*53.9%
associate-/r*53.9%
associate-/l/53.9%
rem-square-sqrt98.0%
associate-/r*96.1%
associate-/l/96.0%
*-commutative96.0%
Simplified96.0%
Taylor expanded in z around inf 80.9%
unpow280.9%
associate-*r*90.5%
Simplified90.5%
Final simplification95.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.5) (/ (/ 1.0 x) y) (/ 1.0 (* z (* (* y z) x)))))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (z * ((y * z) * x));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 0.5d0) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (z * ((y * z) * x))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (z * ((y * z) * x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 0.5: tmp = (1.0 / x) / y else: tmp = 1.0 / (z * ((y * z) * x)) return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 0.5) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(z * Float64(Float64(y * z) * x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 0.5)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (z * ((y * z) * x));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(z * N[(N[(y * z), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.5:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(\left(y \cdot z\right) \cdot x\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 0.5Initial program 99.7%
associate-/r*99.1%
+-commutative99.1%
fma-def99.1%
Simplified99.1%
Taylor expanded in z around 0 98.3%
associate-/l/98.9%
add-cube-cbrt97.6%
pow397.5%
associate-/l/97.2%
*-commutative97.2%
cbrt-div97.0%
metadata-eval97.0%
*-commutative97.0%
Applied egg-rr97.0%
metadata-eval97.0%
cbrt-div97.2%
rem-cube-cbrt98.3%
*-commutative98.3%
associate-/r*98.9%
Applied egg-rr98.9%
if 0.5 < (*.f64 z z) Initial program 83.9%
associate-/r*83.9%
+-commutative83.9%
fma-def83.9%
Simplified83.9%
Taylor expanded in z around inf 80.9%
*-commutative80.9%
unpow280.9%
associate-*r*83.6%
associate-*l*88.1%
*-commutative88.1%
associate-*l*95.7%
*-commutative95.7%
Simplified95.7%
Final simplification97.5%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 0.5) (/ (/ 1.0 x) y) (/ (/ (/ 1.0 y) (* z x)) z)))
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = (1.0 / x) / y;
} else {
tmp = ((1.0 / y) / (z * x)) / z;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if ((z * z) <= 0.5d0) then
tmp = (1.0d0 / x) / y
else
tmp = ((1.0d0 / y) / (z * x)) / z
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 0.5) {
tmp = (1.0 / x) / y;
} else {
tmp = ((1.0 / y) / (z * x)) / z;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 0.5: tmp = (1.0 / x) / y else: tmp = ((1.0 / y) / (z * x)) / z return tmp
x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 0.5) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(Float64(Float64(1.0 / y) / Float64(z * x)) / z); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 0.5)
tmp = (1.0 / x) / y;
else
tmp = ((1.0 / y) / (z * x)) / z;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 0.5], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(N[(N[(1.0 / y), $MachinePrecision] / N[(z * x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 0.5:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{y}}{z \cdot x}}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 0.5Initial program 99.7%
associate-/r*99.1%
+-commutative99.1%
fma-def99.1%
Simplified99.1%
Taylor expanded in z around 0 98.3%
associate-/l/98.9%
add-cube-cbrt97.6%
pow397.5%
associate-/l/97.2%
*-commutative97.2%
cbrt-div97.0%
metadata-eval97.0%
*-commutative97.0%
Applied egg-rr97.0%
metadata-eval97.0%
cbrt-div97.2%
rem-cube-cbrt98.3%
*-commutative98.3%
associate-/r*98.9%
Applied egg-rr98.9%
if 0.5 < (*.f64 z z) Initial program 83.9%
associate-/r*83.9%
+-commutative83.9%
fma-def83.9%
Simplified83.9%
fma-udef83.9%
+-commutative83.9%
associate-/r*83.9%
associate-/r*83.8%
div-inv83.8%
+-commutative83.8%
fma-udef83.8%
Applied egg-rr83.8%
Taylor expanded in z around inf 83.3%
unpow283.3%
Simplified83.3%
un-div-inv83.3%
associate-/l/83.4%
associate-/l/83.6%
*-commutative83.6%
associate-*l*80.9%
associate-*r*90.5%
associate-/l/90.7%
*-commutative90.7%
associate-/r*97.5%
Applied egg-rr97.5%
Final simplification98.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (/ 1.0 (* y x)))
assert(x < y);
double code(double x, double y, double z) {
return 1.0 / (y * x);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 1.0d0 / (y * x)
end function
assert x < y;
public static double code(double x, double y, double z) {
return 1.0 / (y * x);
}
[x, y] = sort([x, y]) def code(x, y, z): return 1.0 / (y * x)
x, y = sort([x, y]) function code(x, y, z) return Float64(1.0 / Float64(y * x)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
tmp = 1.0 / (y * x);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(1.0 / N[(y * x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{1}{y \cdot x}
\end{array}
Initial program 92.9%
associate-/r*92.6%
+-commutative92.6%
fma-def92.6%
Simplified92.6%
Taylor expanded in z around 0 65.8%
Final simplification65.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (/ (/ 1.0 x) y))
assert(x < y);
double code(double x, double y, double z) {
return (1.0 / x) / y;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / y
end function
assert x < y;
public static double code(double x, double y, double z) {
return (1.0 / x) / y;
}
[x, y] = sort([x, y]) def code(x, y, z): return (1.0 / x) / y
x, y = sort([x, y]) function code(x, y, z) return Float64(Float64(1.0 / x) / y) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
tmp = (1.0 / x) / y;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{1}{x}}{y}
\end{array}
Initial program 92.9%
associate-/r*92.6%
+-commutative92.6%
fma-def92.6%
Simplified92.6%
Taylor expanded in z around 0 65.8%
associate-/l/65.8%
add-cube-cbrt65.0%
pow365.0%
associate-/l/65.2%
*-commutative65.2%
cbrt-div65.0%
metadata-eval65.0%
*-commutative65.0%
Applied egg-rr65.0%
metadata-eval65.0%
cbrt-div65.2%
rem-cube-cbrt65.8%
*-commutative65.8%
associate-/r*65.8%
Applied egg-rr65.8%
Final simplification65.8%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (+ 1.0 (* z z))) (t_1 (* y t_0)) (t_2 (/ (/ 1.0 y) (* t_0 x))))
(if (< t_1 (- INFINITY))
t_2
(if (< t_1 8.680743250567252e+305) (/ (/ 1.0 x) (* t_0 y)) t_2))))
double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -((double) INFINITY)) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
public static double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -Double.POSITIVE_INFINITY) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z): t_0 = 1.0 + (z * z) t_1 = y * t_0 t_2 = (1.0 / y) / (t_0 * x) tmp = 0 if t_1 < -math.inf: tmp = t_2 elif t_1 < 8.680743250567252e+305: tmp = (1.0 / x) / (t_0 * y) else: tmp = t_2 return tmp
function code(x, y, z) t_0 = Float64(1.0 + Float64(z * z)) t_1 = Float64(y * t_0) t_2 = Float64(Float64(1.0 / y) / Float64(t_0 * x)) tmp = 0.0 if (t_1 < Float64(-Inf)) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = Float64(Float64(1.0 / x) / Float64(t_0 * y)); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z) t_0 = 1.0 + (z * z); t_1 = y * t_0; t_2 = (1.0 / y) / (t_0 * x); tmp = 0.0; if (t_1 < -Inf) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = (1.0 / x) / (t_0 * y); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(y * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 / y), $MachinePrecision] / N[(t$95$0 * x), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$1, (-Infinity)], t$95$2, If[Less[t$95$1, 8.680743250567252e+305], N[(N[(1.0 / x), $MachinePrecision] / N[(t$95$0 * y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 1 + z \cdot z\\
t_1 := y \cdot t_0\\
t_2 := \frac{\frac{1}{y}}{t_0 \cdot x}\\
\mathbf{if}\;t_1 < -\infty:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t_1 < 8.680743250567252 \cdot 10^{+305}:\\
\;\;\;\;\frac{\frac{1}{x}}{t_0 \cdot y}\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
herbie shell --seed 2023181
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:herbie-target
(if (< (* y (+ 1.0 (* z z))) (- INFINITY)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x)) (if (< (* y (+ 1.0 (* z z))) 8.680743250567252e+305) (/ (/ 1.0 x) (* (+ 1.0 (* z z)) y)) (/ (/ 1.0 y) (* (+ 1.0 (* z z)) x))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))