
(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 12 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: z should be positive before calling this function 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+302) (/ (/ 1.0 x) (fma (* y z) z y)) (/ (/ 1.0 (hypot 1.0 z)) (* y (* z x)))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((y * (1.0 + (z * z))) <= 5e+302) {
tmp = (1.0 / x) / fma((y * z), z, y);
} else {
tmp = (1.0 / hypot(1.0, z)) / (y * (z * x));
}
return tmp;
}
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(y * Float64(1.0 + Float64(z * z))) <= 5e+302) tmp = Float64(Float64(1.0 / x) / fma(Float64(y * z), z, y)); else tmp = Float64(Float64(1.0 / hypot(1.0, z)) / Float64(y * Float64(z * x))); end return tmp end
NOTE: z should be positive before calling this function 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+302], N[(N[(1.0 / x), $MachinePrecision] / N[(N[(y * z), $MachinePrecision] * z + y), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[Sqrt[1.0 ^ 2 + z ^ 2], $MachinePrecision]), $MachinePrecision] / N[(y * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot \left(1 + z \cdot z\right) \leq 5 \cdot 10^{+302}:\\
\;\;\;\;\frac{\frac{1}{x}}{\mathsf{fma}\left(y \cdot z, z, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\mathsf{hypot}\left(1, z\right)}}{y \cdot \left(z \cdot x\right)}\\
\end{array}
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < 5e302Initial program 93.4%
distribute-lft-in93.4%
*-rgt-identity93.4%
+-commutative93.4%
associate-*r*95.6%
fma-def95.6%
Applied egg-rr95.6%
if 5e302 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 64.0%
associate-/r*64.0%
*-commutative64.0%
sqr-neg64.0%
+-commutative64.0%
distribute-lft1-in64.0%
*-commutative64.0%
fma-def64.0%
sqr-neg64.0%
Simplified64.0%
*-commutative64.0%
fma-udef64.0%
*-rgt-identity64.0%
distribute-lft-in64.0%
+-commutative64.0%
/-rgt-identity64.0%
clear-num64.0%
div-inv64.0%
+-commutative64.0%
fma-udef64.0%
*-commutative64.0%
associate-/l*74.3%
add-sqr-sqrt74.3%
associate-/r*74.3%
associate-/l*74.3%
fma-udef74.3%
+-commutative74.3%
hypot-1-def74.3%
*-commutative74.3%
associate-/r*74.3%
fma-udef74.3%
+-commutative74.3%
hypot-1-def93.0%
Applied egg-rr93.0%
associate-/r/92.9%
associate-/r*92.9%
Simplified92.9%
Taylor expanded in z around inf 78.6%
expm1-log1p-u78.4%
expm1-udef66.5%
*-commutative66.5%
associate-/r*66.5%
associate-*r*63.9%
*-commutative63.9%
Applied egg-rr63.9%
expm1-def74.3%
expm1-log1p74.4%
*-commutative74.4%
*-commutative74.4%
associate-*l*78.8%
Simplified78.8%
Final simplification92.7%
NOTE: z should be positive before calling this function 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+302) (/ (/ 1.0 x) (fma (* y z) z y)) (/ 1.0 (* y (* z (* z x))))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((y * (1.0 + (z * z))) <= 5e+302) {
tmp = (1.0 / x) / fma((y * z), z, y);
} else {
tmp = 1.0 / (y * (z * (z * x)));
}
return tmp;
}
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(y * Float64(1.0 + Float64(z * z))) <= 5e+302) tmp = Float64(Float64(1.0 / x) / fma(Float64(y * z), z, y)); else tmp = Float64(1.0 / Float64(y * Float64(z * Float64(z * x)))); end return tmp end
NOTE: z should be positive before calling this function 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+302], N[(N[(1.0 / x), $MachinePrecision] / N[(N[(y * z), $MachinePrecision] * z + y), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(y * N[(z * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot \left(1 + z \cdot z\right) \leq 5 \cdot 10^{+302}:\\
\;\;\;\;\frac{\frac{1}{x}}{\mathsf{fma}\left(y \cdot z, z, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y \cdot \left(z \cdot \left(z \cdot x\right)\right)}\\
\end{array}
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < 5e302Initial program 93.4%
distribute-lft-in93.4%
*-rgt-identity93.4%
+-commutative93.4%
associate-*r*95.6%
fma-def95.6%
Applied egg-rr95.6%
if 5e302 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 64.0%
associate-/r*64.0%
*-commutative64.0%
sqr-neg64.0%
+-commutative64.0%
distribute-lft1-in64.0%
*-commutative64.0%
fma-def64.0%
sqr-neg64.0%
Simplified64.0%
Taylor expanded in z around inf 64.0%
*-commutative64.0%
unpow264.0%
associate-*l*74.5%
associate-*l*91.2%
Simplified91.2%
Final simplification94.9%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 1e+111) (/ 1.0 (* y (* x (fma z z 1.0)))) (* (/ (/ 1.0 x) (* y z)) (/ 1.0 z))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e+111) {
tmp = 1.0 / (y * (x * fma(z, z, 1.0)));
} else {
tmp = ((1.0 / x) / (y * z)) * (1.0 / z);
}
return tmp;
}
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 1e+111) tmp = Float64(1.0 / Float64(y * Float64(x * fma(z, z, 1.0)))); else tmp = Float64(Float64(Float64(1.0 / x) / Float64(y * z)) * Float64(1.0 / z)); end return tmp end
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e+111], N[(1.0 / N[(y * N[(x * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / x), $MachinePrecision] / N[(y * z), $MachinePrecision]), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{+111}:\\
\;\;\;\;\frac{1}{y \cdot \left(x \cdot \mathsf{fma}\left(z, z, 1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x}}{y \cdot z} \cdot \frac{1}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 9.99999999999999957e110Initial program 99.0%
associate-/r*98.9%
*-commutative98.9%
sqr-neg98.9%
+-commutative98.9%
distribute-lft1-in98.9%
*-commutative98.9%
fma-def98.9%
sqr-neg98.9%
Simplified98.9%
fma-udef98.9%
+-commutative98.9%
*-commutative98.9%
distribute-rgt1-in98.9%
fma-udef98.9%
add-sqr-sqrt98.9%
associate-*l*99.0%
fma-udef99.0%
+-commutative99.0%
hypot-1-def99.0%
fma-udef99.0%
+-commutative99.0%
hypot-1-def99.0%
Applied egg-rr99.0%
Taylor expanded in x around 0 98.9%
associate-*r*99.0%
unpow299.0%
*-commutative99.0%
*-commutative99.0%
associate-*r*98.9%
*-commutative98.9%
associate-*l*98.9%
+-commutative98.9%
fma-def98.9%
Simplified98.9%
if 9.99999999999999957e110 < (*.f64 z z) Initial program 75.3%
associate-/r*75.3%
*-commutative75.3%
sqr-neg75.3%
+-commutative75.3%
distribute-lft1-in75.3%
*-commutative75.3%
fma-def75.3%
sqr-neg75.3%
Simplified75.3%
fma-udef75.3%
+-commutative75.3%
*-commutative75.3%
distribute-rgt1-in75.3%
fma-udef75.3%
add-sqr-sqrt75.3%
associate-*l*75.3%
fma-udef75.3%
+-commutative75.3%
hypot-1-def75.3%
fma-udef75.3%
+-commutative75.3%
hypot-1-def85.8%
Applied egg-rr85.8%
Taylor expanded in z around inf 75.3%
associate-/r*75.3%
unpow275.3%
associate-*r*85.8%
Simplified85.8%
associate-/r*94.9%
div-inv94.8%
Applied egg-rr94.8%
Final simplification97.1%
NOTE: z should be positive before calling this function
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0 (* y (+ 1.0 (* z z)))))
(if (<= t_0 (- INFINITY))
(/ (/ 1.0 x) (* z (* y z)))
(if (<= t_0 5e+302) (/ (/ 1.0 x) t_0) (/ 1.0 (* y (* z (* z x))))))))z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double t_0 = y * (1.0 + (z * z));
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = (1.0 / x) / (z * (y * z));
} else if (t_0 <= 5e+302) {
tmp = (1.0 / x) / t_0;
} else {
tmp = 1.0 / (y * (z * (z * x)));
}
return tmp;
}
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
double t_0 = y * (1.0 + (z * z));
double tmp;
if (t_0 <= -Double.POSITIVE_INFINITY) {
tmp = (1.0 / x) / (z * (y * z));
} else if (t_0 <= 5e+302) {
tmp = (1.0 / x) / t_0;
} else {
tmp = 1.0 / (y * (z * (z * x)));
}
return tmp;
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): t_0 = y * (1.0 + (z * z)) tmp = 0 if t_0 <= -math.inf: tmp = (1.0 / x) / (z * (y * z)) elif t_0 <= 5e+302: tmp = (1.0 / x) / t_0 else: tmp = 1.0 / (y * (z * (z * x))) return tmp
z = abs(z) x, y = sort([x, y]) function code(x, y, z) t_0 = Float64(y * Float64(1.0 + Float64(z * z))) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(Float64(1.0 / x) / Float64(z * Float64(y * z))); elseif (t_0 <= 5e+302) tmp = Float64(Float64(1.0 / x) / t_0); else tmp = Float64(1.0 / Float64(y * Float64(z * Float64(z * x)))); end return tmp end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
t_0 = y * (1.0 + (z * z));
tmp = 0.0;
if (t_0 <= -Inf)
tmp = (1.0 / x) / (z * (y * z));
elseif (t_0 <= 5e+302)
tmp = (1.0 / x) / t_0;
else
tmp = 1.0 / (y * (z * (z * x)));
end
tmp_2 = tmp;
end
NOTE: z should be positive before calling this function
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(1.0 / x), $MachinePrecision] / N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+302], N[(N[(1.0 / x), $MachinePrecision] / t$95$0), $MachinePrecision], N[(1.0 / N[(y * N[(z * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := y \cdot \left(1 + z \cdot z\right)\\
\mathbf{if}\;t_0 \leq -\infty:\\
\;\;\;\;\frac{\frac{1}{x}}{z \cdot \left(y \cdot z\right)}\\
\mathbf{elif}\;t_0 \leq 5 \cdot 10^{+302}:\\
\;\;\;\;\frac{\frac{1}{x}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y \cdot \left(z \cdot \left(z \cdot x\right)\right)}\\
\end{array}
\end{array}
if (*.f64 y (+.f64 1 (*.f64 z z))) < -inf.0Initial program 72.3%
associate-/r*72.3%
*-commutative72.3%
sqr-neg72.3%
+-commutative72.3%
distribute-lft1-in72.3%
*-commutative72.3%
fma-def72.3%
sqr-neg72.3%
Simplified72.3%
fma-udef72.3%
+-commutative72.3%
*-commutative72.3%
distribute-rgt1-in72.3%
fma-udef72.3%
add-sqr-sqrt72.3%
associate-*l*72.3%
fma-udef72.3%
+-commutative72.3%
hypot-1-def72.3%
fma-udef72.3%
+-commutative72.3%
hypot-1-def82.2%
Applied egg-rr82.2%
Taylor expanded in z around inf 72.3%
associate-/r*72.3%
unpow272.3%
associate-*r*82.2%
Simplified82.2%
if -inf.0 < (*.f64 y (+.f64 1 (*.f64 z z))) < 5e302Initial program 99.6%
if 5e302 < (*.f64 y (+.f64 1 (*.f64 z z))) Initial program 64.0%
associate-/r*64.0%
*-commutative64.0%
sqr-neg64.0%
+-commutative64.0%
distribute-lft1-in64.0%
*-commutative64.0%
fma-def64.0%
sqr-neg64.0%
Simplified64.0%
Taylor expanded in z around inf 64.0%
*-commutative64.0%
unpow264.0%
associate-*l*74.5%
associate-*l*91.2%
Simplified91.2%
Final simplification94.8%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 1e+111) (* (/ 1.0 (+ 1.0 (* z z))) (/ (/ 1.0 x) y)) (* (/ (/ 1.0 x) (* y z)) (/ 1.0 z))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e+111) {
tmp = (1.0 / (1.0 + (z * z))) * ((1.0 / x) / y);
} else {
tmp = ((1.0 / x) / (y * z)) * (1.0 / z);
}
return tmp;
}
NOTE: z should be positive before calling this function
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) <= 1d+111) then
tmp = (1.0d0 / (1.0d0 + (z * z))) * ((1.0d0 / x) / y)
else
tmp = ((1.0d0 / x) / (y * z)) * (1.0d0 / z)
end if
code = tmp
end function
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 1e+111) {
tmp = (1.0 / (1.0 + (z * z))) * ((1.0 / x) / y);
} else {
tmp = ((1.0 / x) / (y * z)) * (1.0 / z);
}
return tmp;
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 1e+111: tmp = (1.0 / (1.0 + (z * z))) * ((1.0 / x) / y) else: tmp = ((1.0 / x) / (y * z)) * (1.0 / z) return tmp
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 1e+111) tmp = Float64(Float64(1.0 / Float64(1.0 + Float64(z * z))) * Float64(Float64(1.0 / x) / y)); else tmp = Float64(Float64(Float64(1.0 / x) / Float64(y * z)) * Float64(1.0 / z)); end return tmp end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 1e+111)
tmp = (1.0 / (1.0 + (z * z))) * ((1.0 / x) / y);
else
tmp = ((1.0 / x) / (y * z)) * (1.0 / z);
end
tmp_2 = tmp;
end
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e+111], N[(N[(1.0 / N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / x), $MachinePrecision] / N[(y * z), $MachinePrecision]), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 10^{+111}:\\
\;\;\;\;\frac{1}{1 + z \cdot z} \cdot \frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x}}{y \cdot z} \cdot \frac{1}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 9.99999999999999957e110Initial program 99.0%
associate-/r*98.9%
*-commutative98.9%
sqr-neg98.9%
+-commutative98.9%
distribute-lft1-in98.9%
*-commutative98.9%
fma-def98.9%
sqr-neg98.9%
Simplified98.9%
fma-udef98.9%
+-commutative98.9%
*-commutative98.9%
distribute-rgt1-in98.9%
fma-udef98.9%
add-sqr-sqrt98.9%
associate-*l*99.0%
fma-udef99.0%
+-commutative99.0%
hypot-1-def99.0%
fma-udef99.0%
+-commutative99.0%
hypot-1-def99.0%
Applied egg-rr99.0%
associate-/r*99.0%
*-un-lft-identity99.0%
associate-*r*99.0%
times-frac99.0%
hypot-udef99.0%
hypot-udef99.0%
add-sqr-sqrt99.0%
metadata-eval99.0%
Applied egg-rr99.0%
if 9.99999999999999957e110 < (*.f64 z z) Initial program 75.3%
associate-/r*75.3%
*-commutative75.3%
sqr-neg75.3%
+-commutative75.3%
distribute-lft1-in75.3%
*-commutative75.3%
fma-def75.3%
sqr-neg75.3%
Simplified75.3%
fma-udef75.3%
+-commutative75.3%
*-commutative75.3%
distribute-rgt1-in75.3%
fma-udef75.3%
add-sqr-sqrt75.3%
associate-*l*75.3%
fma-udef75.3%
+-commutative75.3%
hypot-1-def75.3%
fma-udef75.3%
+-commutative75.3%
hypot-1-def85.8%
Applied egg-rr85.8%
Taylor expanded in z around inf 75.3%
associate-/r*75.3%
unpow275.3%
associate-*r*85.8%
Simplified85.8%
associate-/r*94.9%
div-inv94.8%
Applied egg-rr94.8%
Final simplification97.1%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 2e-13) (/ (- 1.0 (* z z)) (* y x)) (* (/ (/ 1.0 x) (* y z)) (/ 1.0 z))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 - (z * z)) / (y * x);
} else {
tmp = ((1.0 / x) / (y * z)) * (1.0 / z);
}
return tmp;
}
NOTE: z should be positive before calling this function
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-13) then
tmp = (1.0d0 - (z * z)) / (y * x)
else
tmp = ((1.0d0 / x) / (y * z)) * (1.0d0 / z)
end if
code = tmp
end function
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 - (z * z)) / (y * x);
} else {
tmp = ((1.0 / x) / (y * z)) * (1.0 / z);
}
return tmp;
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 2e-13: tmp = (1.0 - (z * z)) / (y * x) else: tmp = ((1.0 / x) / (y * z)) * (1.0 / z) return tmp
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e-13) tmp = Float64(Float64(1.0 - Float64(z * z)) / Float64(y * x)); else tmp = Float64(Float64(Float64(1.0 / x) / Float64(y * z)) * Float64(1.0 / z)); end return tmp end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 2e-13)
tmp = (1.0 - (z * z)) / (y * x);
else
tmp = ((1.0 / x) / (y * z)) * (1.0 / z);
end
tmp_2 = tmp;
end
NOTE: z should be positive before calling this function 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-13], N[(N[(1.0 - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / x), $MachinePrecision] / N[(y * z), $MachinePrecision]), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-13}:\\
\;\;\;\;\frac{1 - z \cdot z}{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x}}{y \cdot z} \cdot \frac{1}{z}\\
\end{array}
\end{array}
if (*.f64 z z) < 2.0000000000000001e-13Initial program 99.6%
associate-/r*99.6%
*-commutative99.6%
sqr-neg99.6%
+-commutative99.6%
distribute-lft1-in99.6%
*-commutative99.6%
fma-def99.6%
sqr-neg99.6%
Simplified99.6%
Taylor expanded in z around 0 89.8%
associate-/l/89.8%
+-commutative89.8%
mul-1-neg89.8%
unsub-neg89.8%
associate-/r*89.8%
unpow289.8%
*-commutative89.8%
div-sub99.6%
Simplified99.6%
if 2.0000000000000001e-13 < (*.f64 z z) Initial program 79.4%
associate-/r*79.4%
*-commutative79.4%
sqr-neg79.4%
+-commutative79.4%
distribute-lft1-in79.4%
*-commutative79.4%
fma-def79.4%
sqr-neg79.4%
Simplified79.4%
fma-udef79.4%
+-commutative79.4%
*-commutative79.4%
distribute-rgt1-in79.4%
fma-udef79.4%
add-sqr-sqrt79.4%
associate-*l*79.4%
fma-udef79.4%
+-commutative79.4%
hypot-1-def79.4%
fma-udef79.4%
+-commutative79.4%
hypot-1-def87.8%
Applied egg-rr87.8%
Taylor expanded in z around inf 79.4%
associate-/r*79.4%
unpow279.4%
associate-*r*87.8%
Simplified87.8%
associate-/r*94.5%
div-inv94.4%
Applied egg-rr94.4%
Final simplification96.7%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 2e-13) (/ (/ 1.0 x) y) (/ 1.0 (* x (* y (* z z))))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (y * (z * z)));
}
return tmp;
}
NOTE: z should be positive before calling this function
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-13) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (x * (y * (z * z)))
end if
code = tmp
end function
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (y * (z * z)));
}
return tmp;
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 2e-13: tmp = (1.0 / x) / y else: tmp = 1.0 / (x * (y * (z * z))) return tmp
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e-13) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(x * Float64(y * Float64(z * z)))); end return tmp end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 2e-13)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (x * (y * (z * z)));
end
tmp_2 = tmp;
end
NOTE: z should be positive before calling this function 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-13], 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}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-13}:\\
\;\;\;\;\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) < 2.0000000000000001e-13Initial program 99.6%
associate-/r*99.6%
*-commutative99.6%
sqr-neg99.6%
+-commutative99.6%
distribute-lft1-in99.6%
*-commutative99.6%
fma-def99.6%
sqr-neg99.6%
Simplified99.6%
Taylor expanded in z around 0 99.4%
*-commutative99.4%
Simplified99.4%
associate-/r*99.5%
div-inv99.3%
Applied egg-rr99.3%
associate-*l/99.5%
*-un-lft-identity99.5%
Applied egg-rr99.5%
if 2.0000000000000001e-13 < (*.f64 z z) Initial program 79.4%
associate-/r*79.4%
*-commutative79.4%
sqr-neg79.4%
+-commutative79.4%
distribute-lft1-in79.4%
*-commutative79.4%
fma-def79.4%
sqr-neg79.4%
Simplified79.4%
Taylor expanded in z around inf 79.4%
unpow279.4%
Simplified79.4%
Final simplification88.2%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 2e-13) (/ (/ 1.0 x) y) (/ 1.0 (* y (* z (* z x))))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (y * (z * (z * x)));
}
return tmp;
}
NOTE: z should be positive before calling this function
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-13) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (y * (z * (z * x)))
end if
code = tmp
end function
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (y * (z * (z * x)));
}
return tmp;
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 2e-13: tmp = (1.0 / x) / y else: tmp = 1.0 / (y * (z * (z * x))) return tmp
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e-13) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(y * Float64(z * Float64(z * x)))); end return tmp end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 2e-13)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (y * (z * (z * x)));
end
tmp_2 = tmp;
end
NOTE: z should be positive before calling this function 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-13], 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}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-13}:\\
\;\;\;\;\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) < 2.0000000000000001e-13Initial program 99.6%
associate-/r*99.6%
*-commutative99.6%
sqr-neg99.6%
+-commutative99.6%
distribute-lft1-in99.6%
*-commutative99.6%
fma-def99.6%
sqr-neg99.6%
Simplified99.6%
Taylor expanded in z around 0 99.4%
*-commutative99.4%
Simplified99.4%
associate-/r*99.5%
div-inv99.3%
Applied egg-rr99.3%
associate-*l/99.5%
*-un-lft-identity99.5%
Applied egg-rr99.5%
if 2.0000000000000001e-13 < (*.f64 z z) Initial program 79.4%
associate-/r*79.4%
*-commutative79.4%
sqr-neg79.4%
+-commutative79.4%
distribute-lft1-in79.4%
*-commutative79.4%
fma-def79.4%
sqr-neg79.4%
Simplified79.4%
Taylor expanded in z around inf 79.4%
*-commutative79.4%
unpow279.4%
associate-*l*81.4%
associate-*l*91.9%
Simplified91.9%
Final simplification95.2%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 2e-13) (/ (/ 1.0 x) y) (/ 1.0 (* (* y z) (* z x)))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / ((y * z) * (z * x));
}
return tmp;
}
NOTE: z should be positive before calling this function
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-13) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / ((y * z) * (z * x))
end if
code = tmp
end function
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / ((y * z) * (z * x));
}
return tmp;
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 2e-13: tmp = (1.0 / x) / y else: tmp = 1.0 / ((y * z) * (z * x)) return tmp
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e-13) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(Float64(y * z) * Float64(z * x))); end return tmp end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 2e-13)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / ((y * z) * (z * x));
end
tmp_2 = tmp;
end
NOTE: z should be positive before calling this function 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-13], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(N[(y * z), $MachinePrecision] * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-13}:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(y \cdot z\right) \cdot \left(z \cdot x\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 2.0000000000000001e-13Initial program 99.6%
associate-/r*99.6%
*-commutative99.6%
sqr-neg99.6%
+-commutative99.6%
distribute-lft1-in99.6%
*-commutative99.6%
fma-def99.6%
sqr-neg99.6%
Simplified99.6%
Taylor expanded in z around 0 99.4%
*-commutative99.4%
Simplified99.4%
associate-/r*99.5%
div-inv99.3%
Applied egg-rr99.3%
associate-*l/99.5%
*-un-lft-identity99.5%
Applied egg-rr99.5%
if 2.0000000000000001e-13 < (*.f64 z z) Initial program 79.4%
associate-/r*79.4%
*-commutative79.4%
sqr-neg79.4%
+-commutative79.4%
distribute-lft1-in79.4%
*-commutative79.4%
fma-def79.4%
sqr-neg79.4%
Simplified79.4%
fma-udef79.4%
+-commutative79.4%
*-commutative79.4%
distribute-rgt1-in79.4%
fma-udef79.4%
add-sqr-sqrt79.4%
associate-*l*79.4%
fma-udef79.4%
+-commutative79.4%
hypot-1-def79.4%
fma-udef79.4%
+-commutative79.4%
hypot-1-def87.8%
Applied egg-rr87.8%
Taylor expanded in z around inf 79.4%
*-commutative79.4%
unpow279.4%
associate-*r*87.8%
*-commutative87.8%
associate-*l*93.1%
*-commutative93.1%
Simplified93.1%
Final simplification95.9%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= (* z z) 2e-13) (/ (- 1.0 (* z z)) (* y x)) (/ 1.0 (* (* y z) (* z x)))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 - (z * z)) / (y * x);
} else {
tmp = 1.0 / ((y * z) * (z * x));
}
return tmp;
}
NOTE: z should be positive before calling this function
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-13) then
tmp = (1.0d0 - (z * z)) / (y * x)
else
tmp = 1.0d0 / ((y * z) * (z * x))
end if
code = tmp
end function
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if ((z * z) <= 2e-13) {
tmp = (1.0 - (z * z)) / (y * x);
} else {
tmp = 1.0 / ((y * z) * (z * x));
}
return tmp;
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if (z * z) <= 2e-13: tmp = (1.0 - (z * z)) / (y * x) else: tmp = 1.0 / ((y * z) * (z * x)) return tmp
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (Float64(z * z) <= 2e-13) tmp = Float64(Float64(1.0 - Float64(z * z)) / Float64(y * x)); else tmp = Float64(1.0 / Float64(Float64(y * z) * Float64(z * x))); end return tmp end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if ((z * z) <= 2e-13)
tmp = (1.0 - (z * z)) / (y * x);
else
tmp = 1.0 / ((y * z) * (z * x));
end
tmp_2 = tmp;
end
NOTE: z should be positive before calling this function 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-13], N[(N[(1.0 - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * x), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(y * z), $MachinePrecision] * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-13}:\\
\;\;\;\;\frac{1 - z \cdot z}{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(y \cdot z\right) \cdot \left(z \cdot x\right)}\\
\end{array}
\end{array}
if (*.f64 z z) < 2.0000000000000001e-13Initial program 99.6%
associate-/r*99.6%
*-commutative99.6%
sqr-neg99.6%
+-commutative99.6%
distribute-lft1-in99.6%
*-commutative99.6%
fma-def99.6%
sqr-neg99.6%
Simplified99.6%
Taylor expanded in z around 0 89.8%
associate-/l/89.8%
+-commutative89.8%
mul-1-neg89.8%
unsub-neg89.8%
associate-/r*89.8%
unpow289.8%
*-commutative89.8%
div-sub99.6%
Simplified99.6%
if 2.0000000000000001e-13 < (*.f64 z z) Initial program 79.4%
associate-/r*79.4%
*-commutative79.4%
sqr-neg79.4%
+-commutative79.4%
distribute-lft1-in79.4%
*-commutative79.4%
fma-def79.4%
sqr-neg79.4%
Simplified79.4%
fma-udef79.4%
+-commutative79.4%
*-commutative79.4%
distribute-rgt1-in79.4%
fma-udef79.4%
add-sqr-sqrt79.4%
associate-*l*79.4%
fma-udef79.4%
+-commutative79.4%
hypot-1-def79.4%
fma-udef79.4%
+-commutative79.4%
hypot-1-def87.8%
Applied egg-rr87.8%
Taylor expanded in z around inf 79.4%
*-commutative79.4%
unpow279.4%
associate-*r*87.8%
*-commutative87.8%
associate-*l*93.1%
*-commutative93.1%
Simplified93.1%
Final simplification96.0%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= z 2e+15) (/ (/ 1.0 x) y) (/ 1.0 (* x (* y z)))))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
double tmp;
if (z <= 2e+15) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (y * z));
}
return tmp;
}
NOTE: z should be positive before calling this function
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 <= 2d+15) then
tmp = (1.0d0 / x) / y
else
tmp = 1.0d0 / (x * (y * z))
end if
code = tmp
end function
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
double tmp;
if (z <= 2e+15) {
tmp = (1.0 / x) / y;
} else {
tmp = 1.0 / (x * (y * z));
}
return tmp;
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): tmp = 0 if z <= 2e+15: tmp = (1.0 / x) / y else: tmp = 1.0 / (x * (y * z)) return tmp
z = abs(z) x, y = sort([x, y]) function code(x, y, z) tmp = 0.0 if (z <= 2e+15) tmp = Float64(Float64(1.0 / x) / y); else tmp = Float64(1.0 / Float64(x * Float64(y * z))); end return tmp end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (z <= 2e+15)
tmp = (1.0 / x) / y;
else
tmp = 1.0 / (x * (y * z));
end
tmp_2 = tmp;
end
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[z, 2e+15], N[(N[(1.0 / x), $MachinePrecision] / y), $MachinePrecision], N[(1.0 / N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 2 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1}{x}}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot \left(y \cdot z\right)}\\
\end{array}
\end{array}
if z < 2e15Initial program 90.6%
associate-/r*90.6%
*-commutative90.6%
sqr-neg90.6%
+-commutative90.6%
distribute-lft1-in90.6%
*-commutative90.6%
fma-def90.6%
sqr-neg90.6%
Simplified90.6%
Taylor expanded in z around 0 68.3%
*-commutative68.3%
Simplified68.3%
associate-/r*68.0%
div-inv67.9%
Applied egg-rr67.9%
associate-*l/68.0%
*-un-lft-identity68.0%
Applied egg-rr68.0%
if 2e15 < z Initial program 81.9%
associate-/r*81.9%
*-commutative81.9%
sqr-neg81.9%
+-commutative81.9%
distribute-lft1-in81.9%
*-commutative81.9%
fma-def81.9%
sqr-neg81.9%
Simplified81.9%
*-commutative81.9%
fma-udef81.9%
*-rgt-identity81.9%
distribute-lft-in81.9%
+-commutative81.9%
/-rgt-identity81.9%
clear-num81.9%
div-inv81.9%
+-commutative81.9%
fma-udef81.9%
*-commutative81.9%
associate-/l*81.7%
add-sqr-sqrt81.7%
associate-/r*81.8%
associate-/l*81.8%
fma-udef81.8%
+-commutative81.8%
hypot-1-def81.8%
*-commutative81.8%
associate-/r*81.8%
fma-udef81.8%
+-commutative81.8%
hypot-1-def86.0%
Applied egg-rr86.0%
associate-/r/86.1%
associate-/r*86.1%
Simplified86.1%
Taylor expanded in z around inf 94.6%
Taylor expanded in z around 0 41.2%
Final simplification60.7%
NOTE: z should be positive before calling this function NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (/ 1.0 (* y x)))
z = abs(z);
assert(x < y);
double code(double x, double y, double z) {
return 1.0 / (y * x);
}
NOTE: z should be positive before calling this function
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
z = Math.abs(z);
assert x < y;
public static double code(double x, double y, double z) {
return 1.0 / (y * x);
}
z = abs(z) [x, y] = sort([x, y]) def code(x, y, z): return 1.0 / (y * x)
z = abs(z) x, y = sort([x, y]) function code(x, y, z) return Float64(1.0 / Float64(y * x)) end
z = abs(z)
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z)
tmp = 1.0 / (y * x);
end
NOTE: z should be positive before calling this function 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}
z = |z|\\
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{1}{y \cdot x}
\end{array}
Initial program 88.2%
associate-/r*88.2%
*-commutative88.2%
sqr-neg88.2%
+-commutative88.2%
distribute-lft1-in88.2%
*-commutative88.2%
fma-def88.2%
sqr-neg88.2%
Simplified88.2%
Taylor expanded in z around 0 56.1%
*-commutative56.1%
Simplified56.1%
Final simplification56.1%
(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 2023279
(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)))))