
(FPCore (x y z) :precision binary64 (/ (* x y) (* (* z z) (+ z 1.0))))
double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (x * y) / ((z * z) * (z + 1.0d0))
end function
public static double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
def code(x, y, z): return (x * y) / ((z * z) * (z + 1.0))
function code(x, y, z) return Float64(Float64(x * y) / Float64(Float64(z * z) * Float64(z + 1.0))) end
function tmp = code(x, y, z) tmp = (x * y) / ((z * z) * (z + 1.0)); end
code[x_, y_, z_] := N[(N[(x * y), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (* x y) (* (* z z) (+ z 1.0))))
double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (x * y) / ((z * z) * (z + 1.0d0))
end function
public static double code(double x, double y, double z) {
return (x * y) / ((z * z) * (z + 1.0));
}
def code(x, y, z): return (x * y) / ((z * z) * (z + 1.0))
function code(x, y, z) return Float64(Float64(x * y) / Float64(Float64(z * z) * Float64(z + 1.0))) end
function tmp = code(x, y, z) tmp = (x * y) / ((z * z) * (z + 1.0)); end
code[x_, y_, z_] := N[(N[(x * y), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)}
\end{array}
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= z -1e+20)
(/ (/ x_m z) (* (/ z y_m) z))
(if (<= z 3.3e-71)
(/ (* (/ x_m (fma z z z)) y_m) z)
(/ x_m (* (* (/ (- z -1.0) y_m) z) z)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (z <= -1e+20) {
tmp = (x_m / z) / ((z / y_m) * z);
} else if (z <= 3.3e-71) {
tmp = ((x_m / fma(z, z, z)) * y_m) / z;
} else {
tmp = x_m / ((((z - -1.0) / y_m) * z) * z);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (z <= -1e+20) tmp = Float64(Float64(x_m / z) / Float64(Float64(z / y_m) * z)); elseif (z <= 3.3e-71) tmp = Float64(Float64(Float64(x_m / fma(z, z, z)) * y_m) / z); else tmp = Float64(x_m / Float64(Float64(Float64(Float64(z - -1.0) / y_m) * z) * z)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[z, -1e+20], N[(N[(x$95$m / z), $MachinePrecision] / N[(N[(z / y$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.3e-71], N[(N[(N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision], N[(x$95$m / N[(N[(N[(N[(z - -1.0), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1 \cdot 10^{+20}:\\
\;\;\;\;\frac{\frac{x\_m}{z}}{\frac{z}{y\_m} \cdot z}\\
\mathbf{elif}\;z \leq 3.3 \cdot 10^{-71}:\\
\;\;\;\;\frac{\frac{x\_m}{\mathsf{fma}\left(z, z, z\right)} \cdot y\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{\left(\frac{z - -1}{y\_m} \cdot z\right) \cdot z}\\
\end{array}\right)
\end{array}
if z < -1e20Initial program 77.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
metadata-evalN/A
clear-numN/A
inv-powN/A
unpow-prod-downN/A
associate-/l*N/A
*-lft-identityN/A
inv-powN/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6496.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.7
Applied rewrites96.7%
Taylor expanded in z around inf
lower-/.f6496.7
Applied rewrites96.7%
if -1e20 < z < 3.3000000000000002e-71Initial program 84.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.6
Applied rewrites88.6%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6436.6
Applied rewrites36.6%
Taylor expanded in y around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6496.9
Applied rewrites96.9%
if 3.3000000000000002e-71 < z Initial program 83.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
metadata-evalN/A
clear-numN/A
inv-powN/A
unpow-prod-downN/A
associate-/l*N/A
*-lft-identityN/A
inv-powN/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6494.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6494.7
Applied rewrites94.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
associate-/l/N/A
lift-/.f64N/A
times-fracN/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-*.f64N/A
associate-/l/N/A
associate-/r*N/A
frac-2negN/A
distribute-frac-neg2N/A
lift-neg.f64N/A
lower-/.f64N/A
Applied rewrites95.8%
Applied rewrites93.9%
Final simplification95.8%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (/ (/ y_m (* z z)) z) x_m)) (t_1 (* (* z z) (- z -1.0))))
(*
x_s
(*
y_s
(if (<= t_1 -5e+36)
t_0
(if (<= t_1 0.0)
(* (/ y_m z) (/ x_m z))
(if (<= t_1 5e+37) (* (/ x_m (* (fma z z z) z)) y_m) t_0)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = ((y_m / (z * z)) / z) * x_m;
double t_1 = (z * z) * (z - -1.0);
double tmp;
if (t_1 <= -5e+36) {
tmp = t_0;
} else if (t_1 <= 0.0) {
tmp = (y_m / z) * (x_m / z);
} else if (t_1 <= 5e+37) {
tmp = (x_m / (fma(z, z, z) * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(Float64(y_m / Float64(z * z)) / z) * x_m) t_1 = Float64(Float64(z * z) * Float64(z - -1.0)) tmp = 0.0 if (t_1 <= -5e+36) tmp = t_0; elseif (t_1 <= 0.0) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); elseif (t_1 <= 5e+37) tmp = Float64(Float64(x_m / Float64(fma(z, z, z) * z)) * y_m); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] * x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] * N[(z - -1.0), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -5e+36], t$95$0, If[LessEqual[t$95$1, 0.0], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+37], N[(N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{\frac{y\_m}{z \cdot z}}{z} \cdot x\_m\\
t_1 := \left(z \cdot z\right) \cdot \left(z - -1\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+36}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+37}:\\
\;\;\;\;\frac{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -4.99999999999999977e36 or 4.99999999999999989e37 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 80.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.0
Applied rewrites88.0%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6487.7
Applied rewrites87.7%
if -4.99999999999999977e36 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0Initial program 85.5%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
if 0.0 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 4.99999999999999989e37Initial program 83.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6483.9
Applied rewrites83.9%
Taylor expanded in y around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6493.6
Applied rewrites93.6%
Final simplification91.9%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (/ y_m (* (* z z) z)) x_m)) (t_1 (* (* z z) (- z -1.0))))
(*
x_s
(*
y_s
(if (<= t_1 -5e+36)
t_0
(if (<= t_1 0.0)
(* (/ y_m z) (/ x_m z))
(if (<= t_1 5e+37) (* (/ x_m (* (fma z z z) z)) y_m) t_0)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (y_m / ((z * z) * z)) * x_m;
double t_1 = (z * z) * (z - -1.0);
double tmp;
if (t_1 <= -5e+36) {
tmp = t_0;
} else if (t_1 <= 0.0) {
tmp = (y_m / z) * (x_m / z);
} else if (t_1 <= 5e+37) {
tmp = (x_m / (fma(z, z, z) * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(y_m / Float64(Float64(z * z) * z)) * x_m) t_1 = Float64(Float64(z * z) * Float64(z - -1.0)) tmp = 0.0 if (t_1 <= -5e+36) tmp = t_0; elseif (t_1 <= 0.0) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); elseif (t_1 <= 5e+37) tmp = Float64(Float64(x_m / Float64(fma(z, z, z) * z)) * y_m); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] * N[(z - -1.0), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -5e+36], t$95$0, If[LessEqual[t$95$1, 0.0], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+37], N[(N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{y\_m}{\left(z \cdot z\right) \cdot z} \cdot x\_m\\
t_1 := \left(z \cdot z\right) \cdot \left(z - -1\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+36}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+37}:\\
\;\;\;\;\frac{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -4.99999999999999977e36 or 4.99999999999999989e37 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 80.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.0
Applied rewrites88.0%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6485.2
Applied rewrites85.2%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6484.9
Applied rewrites84.9%
if -4.99999999999999977e36 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0Initial program 85.5%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
if 0.0 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 4.99999999999999989e37Initial program 83.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6483.9
Applied rewrites83.9%
Taylor expanded in y around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6493.6
Applied rewrites93.6%
Final simplification90.4%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (* z z) (- z -1.0))))
(*
x_s
(*
y_s
(if (<= t_0 -5e+202)
(/ (* (/ y_m z) (/ x_m z)) z)
(if (<= t_0 2e-113)
(/ (* y_m (/ x_m z)) (fma z z z))
(/ x_m (* (* (/ (- z -1.0) y_m) z) z))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (z * z) * (z - -1.0);
double tmp;
if (t_0 <= -5e+202) {
tmp = ((y_m / z) * (x_m / z)) / z;
} else if (t_0 <= 2e-113) {
tmp = (y_m * (x_m / z)) / fma(z, z, z);
} else {
tmp = x_m / ((((z - -1.0) / y_m) * z) * z);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(z * z) * Float64(z - -1.0)) tmp = 0.0 if (t_0 <= -5e+202) tmp = Float64(Float64(Float64(y_m / z) * Float64(x_m / z)) / z); elseif (t_0 <= 2e-113) tmp = Float64(Float64(y_m * Float64(x_m / z)) / fma(z, z, z)); else tmp = Float64(x_m / Float64(Float64(Float64(Float64(z - -1.0) / y_m) * z) * z)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z * z), $MachinePrecision] * N[(z - -1.0), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$0, -5e+202], N[(N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$0, 2e-113], N[(N[(y$95$m * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision], N[(x$95$m / N[(N[(N[(N[(z - -1.0), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \left(z \cdot z\right) \cdot \left(z - -1\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{+202}:\\
\;\;\;\;\frac{\frac{y\_m}{z} \cdot \frac{x\_m}{z}}{z}\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-113}:\\
\;\;\;\;\frac{y\_m \cdot \frac{x\_m}{z}}{\mathsf{fma}\left(z, z, z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{\left(\frac{z - -1}{y\_m} \cdot z\right) \cdot z}\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -4.9999999999999999e202Initial program 74.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6476.3
Applied rewrites76.3%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6476.3
Applied rewrites76.3%
Taylor expanded in z around inf
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6498.0
Applied rewrites98.0%
if -4.9999999999999999e202 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 1.99999999999999996e-113Initial program 85.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6496.3
Applied rewrites96.3%
if 1.99999999999999996e-113 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 83.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
metadata-evalN/A
clear-numN/A
inv-powN/A
unpow-prod-downN/A
associate-/l*N/A
*-lft-identityN/A
inv-powN/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6494.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6494.7
Applied rewrites94.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
associate-/l/N/A
lift-/.f64N/A
times-fracN/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-*.f64N/A
associate-/l/N/A
associate-/r*N/A
frac-2negN/A
distribute-frac-neg2N/A
lift-neg.f64N/A
lower-/.f64N/A
Applied rewrites95.8%
Applied rewrites94.0%
Final simplification95.8%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (/ (* y_m x_m) (* (* z z) (- z -1.0))) 2e+62)
(* (/ (/ y_m (fma z z z)) z) x_m)
(/ (* (/ x_m (fma z z z)) y_m) z)))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if (((y_m * x_m) / ((z * z) * (z - -1.0))) <= 2e+62) {
tmp = ((y_m / fma(z, z, z)) / z) * x_m;
} else {
tmp = ((x_m / fma(z, z, z)) * y_m) / z;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(Float64(y_m * x_m) / Float64(Float64(z * z) * Float64(z - -1.0))) <= 2e+62) tmp = Float64(Float64(Float64(y_m / fma(z, z, z)) / z) * x_m); else tmp = Float64(Float64(Float64(x_m / fma(z, z, z)) * y_m) / z); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z), $MachinePrecision] * N[(z - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+62], N[(N[(N[(y$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[(N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;\frac{y\_m \cdot x\_m}{\left(z \cdot z\right) \cdot \left(z - -1\right)} \leq 2 \cdot 10^{+62}:\\
\;\;\;\;\frac{\frac{y\_m}{\mathsf{fma}\left(z, z, z\right)}}{z} \cdot x\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x\_m}{\mathsf{fma}\left(z, z, z\right)} \cdot y\_m}{z}\\
\end{array}\right)
\end{array}
if (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) < 2.00000000000000007e62Initial program 88.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6492.5
Applied rewrites92.5%
if 2.00000000000000007e62 < (/.f64 (*.f64 x y) (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))) Initial program 68.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6470.8
Applied rewrites70.8%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6436.1
Applied rewrites36.1%
Taylor expanded in y around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6488.6
Applied rewrites88.6%
Final simplification91.4%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (/ y_m (* (* z z) z)) x_m)) (t_1 (* (* z z) (- z -1.0))))
(*
x_s
(*
y_s
(if (<= t_1 -5e+36)
t_0
(if (<= t_1 0.004) (* (/ y_m z) (/ x_m z)) t_0))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (y_m / ((z * z) * z)) * x_m;
double t_1 = (z * z) * (z - -1.0);
double tmp;
if (t_1 <= -5e+36) {
tmp = t_0;
} else if (t_1 <= 0.004) {
tmp = (y_m / z) * (x_m / z);
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (y_m / ((z * z) * z)) * x_m
t_1 = (z * z) * (z - (-1.0d0))
if (t_1 <= (-5d+36)) then
tmp = t_0
else if (t_1 <= 0.004d0) then
tmp = (y_m / z) * (x_m / z)
else
tmp = t_0
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (y_m / ((z * z) * z)) * x_m;
double t_1 = (z * z) * (z - -1.0);
double tmp;
if (t_1 <= -5e+36) {
tmp = t_0;
} else if (t_1 <= 0.004) {
tmp = (y_m / z) * (x_m / z);
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = (y_m / ((z * z) * z)) * x_m t_1 = (z * z) * (z - -1.0) tmp = 0 if t_1 <= -5e+36: tmp = t_0 elif t_1 <= 0.004: tmp = (y_m / z) * (x_m / z) else: tmp = t_0 return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(y_m / Float64(Float64(z * z) * z)) * x_m) t_1 = Float64(Float64(z * z) * Float64(z - -1.0)) tmp = 0.0 if (t_1 <= -5e+36) tmp = t_0; elseif (t_1 <= 0.004) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = (y_m / ((z * z) * z)) * x_m;
t_1 = (z * z) * (z - -1.0);
tmp = 0.0;
if (t_1 <= -5e+36)
tmp = t_0;
elseif (t_1 <= 0.004)
tmp = (y_m / z) * (x_m / z);
else
tmp = t_0;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] * N[(z - -1.0), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[t$95$1, -5e+36], t$95$0, If[LessEqual[t$95$1, 0.004], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{y\_m}{\left(z \cdot z\right) \cdot z} \cdot x\_m\\
t_1 := \left(z \cdot z\right) \cdot \left(z - -1\right)\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+36}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;t\_1 \leq 0.004:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -4.99999999999999977e36 or 0.0040000000000000001 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) Initial program 80.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.2
Applied rewrites88.2%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6485.0
Applied rewrites85.0%
if -4.99999999999999977e36 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 0.0040000000000000001Initial program 84.4%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6494.2
Applied rewrites94.2%
Final simplification89.2%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 5e-291)
(* (/ y_m z) (/ x_m z))
(if (<= (* y_m x_m) 5e+111)
(/ (* y_m x_m) (* (fma z z z) z))
(/ x_m (* (/ (fma z z z) y_m) z)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * x_m) <= 5e-291) {
tmp = (y_m / z) * (x_m / z);
} else if ((y_m * x_m) <= 5e+111) {
tmp = (y_m * x_m) / (fma(z, z, z) * z);
} else {
tmp = x_m / ((fma(z, z, z) / y_m) * z);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * x_m) <= 5e-291) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); elseif (Float64(y_m * x_m) <= 5e+111) tmp = Float64(Float64(y_m * x_m) / Float64(fma(z, z, z) * z)); else tmp = Float64(x_m / Float64(Float64(fma(z, z, z) / y_m) * z)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 5e-291], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 5e+111], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(x$95$m / N[(N[(N[(z * z + z), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 5 \cdot 10^{-291}:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{elif}\;y\_m \cdot x\_m \leq 5 \cdot 10^{+111}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{\frac{\mathsf{fma}\left(z, z, z\right)}{y\_m} \cdot z}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 5.0000000000000003e-291Initial program 78.8%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.8
Applied rewrites78.8%
if 5.0000000000000003e-291 < (*.f64 x y) < 4.9999999999999997e111Initial program 99.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.7
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6499.7
Applied rewrites99.7%
if 4.9999999999999997e111 < (*.f64 x y) Initial program 72.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6489.5
Applied rewrites89.5%
Final simplification86.2%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 5e-291)
(* (/ y_m z) (/ x_m z))
(if (<= (* y_m x_m) 1e+143)
(/ (* y_m x_m) (* (fma z z z) z))
(* (/ (/ y_m (fma z z z)) z) x_m))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * x_m) <= 5e-291) {
tmp = (y_m / z) * (x_m / z);
} else if ((y_m * x_m) <= 1e+143) {
tmp = (y_m * x_m) / (fma(z, z, z) * z);
} else {
tmp = ((y_m / fma(z, z, z)) / z) * x_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * x_m) <= 5e-291) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); elseif (Float64(y_m * x_m) <= 1e+143) tmp = Float64(Float64(y_m * x_m) / Float64(fma(z, z, z) * z)); else tmp = Float64(Float64(Float64(y_m / fma(z, z, z)) / z) * x_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 5e-291], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 1e+143], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] * x$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 5 \cdot 10^{-291}:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{elif}\;y\_m \cdot x\_m \leq 10^{+143}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{y\_m}{\mathsf{fma}\left(z, z, z\right)}}{z} \cdot x\_m\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 5.0000000000000003e-291Initial program 78.8%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.8
Applied rewrites78.8%
if 5.0000000000000003e-291 < (*.f64 x y) < 1e143Initial program 99.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.7
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6499.8
Applied rewrites99.8%
if 1e143 < (*.f64 x y) Initial program 70.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.9
Applied rewrites88.9%
Final simplification86.2%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 2e+159)
(/ (* y_m (/ x_m z)) (fma z z z))
(* (/ x_m (- z -1.0)) (/ (/ y_m z) z))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * x_m) <= 2e+159) {
tmp = (y_m * (x_m / z)) / fma(z, z, z);
} else {
tmp = (x_m / (z - -1.0)) * ((y_m / z) / z);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * x_m) <= 2e+159) tmp = Float64(Float64(y_m * Float64(x_m / z)) / fma(z, z, z)); else tmp = Float64(Float64(x_m / Float64(z - -1.0)) * Float64(Float64(y_m / z) / z)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 2e+159], N[(N[(y$95$m * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / N[(z - -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 2 \cdot 10^{+159}:\\
\;\;\;\;\frac{y\_m \cdot \frac{x\_m}{z}}{\mathsf{fma}\left(z, z, z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{z - -1} \cdot \frac{\frac{y\_m}{z}}{z}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 1.9999999999999999e159Initial program 85.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6495.1
Applied rewrites95.1%
if 1.9999999999999999e159 < (*.f64 x y) Initial program 69.7%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Final simplification96.0%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (fma z z z) z)))
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 5e-291)
(* (/ y_m z) (/ x_m z))
(if (<= (* y_m x_m) 5e+100)
(/ (* y_m x_m) t_0)
(* (/ x_m t_0) y_m)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = fma(z, z, z) * z;
double tmp;
if ((y_m * x_m) <= 5e-291) {
tmp = (y_m / z) * (x_m / z);
} else if ((y_m * x_m) <= 5e+100) {
tmp = (y_m * x_m) / t_0;
} else {
tmp = (x_m / t_0) * y_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(fma(z, z, z) * z) tmp = 0.0 if (Float64(y_m * x_m) <= 5e-291) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); elseif (Float64(y_m * x_m) <= 5e+100) tmp = Float64(Float64(y_m * x_m) / t_0); else tmp = Float64(Float64(x_m / t_0) * y_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 5e-291], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 5e+100], N[(N[(y$95$m * x$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(x$95$m / t$95$0), $MachinePrecision] * y$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(z, z, z\right) \cdot z\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 5 \cdot 10^{-291}:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{elif}\;y\_m \cdot x\_m \leq 5 \cdot 10^{+100}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{t\_0} \cdot y\_m\\
\end{array}\right)
\end{array}
\end{array}
if (*.f64 x y) < 5.0000000000000003e-291Initial program 78.8%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.8
Applied rewrites78.8%
if 5.0000000000000003e-291 < (*.f64 x y) < 4.9999999999999999e100Initial program 99.8%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.8
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6499.8
Applied rewrites99.8%
if 4.9999999999999999e100 < (*.f64 x y) Initial program 73.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6474.1
Applied rewrites74.1%
Taylor expanded in y around 0
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f6485.0
Applied rewrites85.0%
Final simplification85.0%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (/ (- x_m) (* (* (/ (- z) y_m) z) z))))
(*
x_s
(*
y_s
(if (<= z -4e+64)
t_0
(if (<= z 6.5e+15) (/ (* y_m (/ x_m z)) (fma z z z)) t_0))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = -x_m / (((-z / y_m) * z) * z);
double tmp;
if (z <= -4e+64) {
tmp = t_0;
} else if (z <= 6.5e+15) {
tmp = (y_m * (x_m / z)) / fma(z, z, z);
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(-x_m) / Float64(Float64(Float64(Float64(-z) / y_m) * z) * z)) tmp = 0.0 if (z <= -4e+64) tmp = t_0; elseif (z <= 6.5e+15) tmp = Float64(Float64(y_m * Float64(x_m / z)) / fma(z, z, z)); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[((-x$95$m) / N[(N[(N[((-z) / y$95$m), $MachinePrecision] * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[z, -4e+64], t$95$0, If[LessEqual[z, 6.5e+15], N[(N[(y$95$m * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{-x\_m}{\left(\frac{-z}{y\_m} \cdot z\right) \cdot z}\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -4 \cdot 10^{+64}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;z \leq 6.5 \cdot 10^{+15}:\\
\;\;\;\;\frac{y\_m \cdot \frac{x\_m}{z}}{\mathsf{fma}\left(z, z, z\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if z < -4.00000000000000009e64 or 6.5e15 < z Initial program 78.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
metadata-evalN/A
clear-numN/A
inv-powN/A
unpow-prod-downN/A
associate-/l*N/A
*-lft-identityN/A
inv-powN/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6496.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.1
Applied rewrites96.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
associate-/l/N/A
lift-/.f64N/A
times-fracN/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-*.f64N/A
associate-/l/N/A
associate-/r*N/A
frac-2negN/A
distribute-frac-neg2N/A
lift-neg.f64N/A
lower-/.f64N/A
Applied rewrites96.8%
Applied rewrites92.4%
Taylor expanded in z around inf
mul-1-negN/A
lower-neg.f6492.4
Applied rewrites92.4%
if -4.00000000000000009e64 < z < 6.5e15Initial program 86.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6497.2
Applied rewrites97.2%
Final simplification94.9%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 1e+114)
(/ (* y_m (/ x_m z)) (fma z z z))
(/ x_m (* (* (/ (- z -1.0) y_m) z) z))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * x_m) <= 1e+114) {
tmp = (y_m * (x_m / z)) / fma(z, z, z);
} else {
tmp = x_m / ((((z - -1.0) / y_m) * z) * z);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * x_m) <= 1e+114) tmp = Float64(Float64(y_m * Float64(x_m / z)) / fma(z, z, z)); else tmp = Float64(x_m / Float64(Float64(Float64(Float64(z - -1.0) / y_m) * z) * z)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 1e+114], N[(N[(y$95$m * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision], N[(x$95$m / N[(N[(N[(N[(z - -1.0), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 10^{+114}:\\
\;\;\;\;\frac{y\_m \cdot \frac{x\_m}{z}}{\mathsf{fma}\left(z, z, z\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x\_m}{\left(\frac{z - -1}{y\_m} \cdot z\right) \cdot z}\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 1e114Initial program 85.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6495.0
Applied rewrites95.0%
if 1e114 < (*.f64 x y) Initial program 72.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
metadata-evalN/A
clear-numN/A
inv-powN/A
unpow-prod-downN/A
associate-/l*N/A
*-lft-identityN/A
inv-powN/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
associate-/l/N/A
lift-/.f64N/A
times-fracN/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft1-inN/A
lift-fma.f64N/A
lift-*.f64N/A
associate-/l/N/A
associate-/r*N/A
frac-2negN/A
distribute-frac-neg2N/A
lift-neg.f64N/A
lower-/.f64N/A
Applied rewrites98.2%
Applied rewrites93.0%
Final simplification94.6%
y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (x_s y_s x_m y_m z) :precision binary64 (* x_s (* y_s (/ (/ x_m z) (* (/ (- z -1.0) y_m) z)))))
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((x_m / z) / (((z - -1.0) / y_m) * z)));
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = x_s * (y_s * ((x_m / z) / (((z - (-1.0d0)) / y_m) * z)))
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((x_m / z) / (((z - -1.0) / y_m) * z)));
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): return x_s * (y_s * ((x_m / z) / (((z - -1.0) / y_m) * z)))
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) return Float64(x_s * Float64(y_s * Float64(Float64(x_m / z) / Float64(Float64(Float64(z - -1.0) / y_m) * z)))) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(x_s, y_s, x_m, y_m, z)
tmp = x_s * (y_s * ((x_m / z) / (((z - -1.0) / y_m) * z)));
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[(N[(x$95$m / z), $MachinePrecision] / N[(N[(N[(z - -1.0), $MachinePrecision] / y$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \frac{\frac{x\_m}{z}}{\frac{z - -1}{y\_m} \cdot z}\right)
\end{array}
Initial program 82.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
metadata-evalN/A
clear-numN/A
inv-powN/A
unpow-prod-downN/A
associate-/l*N/A
*-lft-identityN/A
inv-powN/A
clear-numN/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6496.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.1
Applied rewrites96.1%
Final simplification96.1%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(let* ((t_0 (* (/ y_m (* (* z z) z)) x_m)))
(*
x_s
(*
y_s
(if (<= z -3000000.0) t_0 (if (<= z 1.0) (* (/ x_m (* z z)) y_m) t_0))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (y_m / ((z * z) * z)) * x_m;
double tmp;
if (z <= -3000000.0) {
tmp = t_0;
} else if (z <= 1.0) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = (y_m / ((z * z) * z)) * x_m
if (z <= (-3000000.0d0)) then
tmp = t_0
else if (z <= 1.0d0) then
tmp = (x_m / (z * z)) * y_m
else
tmp = t_0
end if
code = x_s * (y_s * tmp)
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
double t_0 = (y_m / ((z * z) * z)) * x_m;
double tmp;
if (z <= -3000000.0) {
tmp = t_0;
} else if (z <= 1.0) {
tmp = (x_m / (z * z)) * y_m;
} else {
tmp = t_0;
}
return x_s * (y_s * tmp);
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): t_0 = (y_m / ((z * z) * z)) * x_m tmp = 0 if z <= -3000000.0: tmp = t_0 elif z <= 1.0: tmp = (x_m / (z * z)) * y_m else: tmp = t_0 return x_s * (y_s * tmp)
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) t_0 = Float64(Float64(y_m / Float64(Float64(z * z) * z)) * x_m) tmp = 0.0 if (z <= -3000000.0) tmp = t_0; elseif (z <= 1.0) tmp = Float64(Float64(x_m / Float64(z * z)) * y_m); else tmp = t_0; end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
t_0 = (y_m / ((z * z) * z)) * x_m;
tmp = 0.0;
if (z <= -3000000.0)
tmp = t_0;
elseif (z <= 1.0)
tmp = (x_m / (z * z)) * y_m;
else
tmp = t_0;
end
tmp_2 = x_s * (y_s * tmp);
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, N[(x$95$s * N[(y$95$s * If[LessEqual[z, -3000000.0], t$95$0, If[LessEqual[z, 1.0], N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
\begin{array}{l}
t_0 := \frac{y\_m}{\left(z \cdot z\right) \cdot z} \cdot x\_m\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -3000000:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;z \leq 1:\\
\;\;\;\;\frac{x\_m}{z \cdot z} \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}\right)
\end{array}
\end{array}
if z < -3e6 or 1 < z Initial program 80.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6488.2
Applied rewrites88.2%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in z around inf
unpow2N/A
lower-*.f6485.0
Applied rewrites85.0%
if -3e6 < z < 1Initial program 84.4%
Taylor expanded in z around 0
unpow2N/A
lower-*.f6481.2
Applied rewrites81.2%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6486.2
Applied rewrites86.2%
Final simplification85.5%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* y_m x_m) 5e-291)
(* (/ y_m z) (/ x_m z))
(* (/ y_m (* (fma z z z) z)) x_m)))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * x_m) <= 5e-291) {
tmp = (y_m / z) * (x_m / z);
} else {
tmp = (y_m / (fma(z, z, z) * z)) * x_m;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * x_m) <= 5e-291) tmp = Float64(Float64(y_m / z) * Float64(x_m / z)); else tmp = Float64(Float64(y_m / Float64(fma(z, z, z) * z)) * x_m); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * x$95$m), $MachinePrecision], 5e-291], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot x\_m \leq 5 \cdot 10^{-291}:\\
\;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{y\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z} \cdot x\_m\\
\end{array}\right)
\end{array}
if (*.f64 x y) < 5.0000000000000003e-291Initial program 78.8%
Taylor expanded in z around 0
unpow2N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.8
Applied rewrites78.8%
if 5.0000000000000003e-291 < (*.f64 x y) Initial program 87.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft1-inN/A
lower-fma.f6490.9
Applied rewrites90.9%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6489.2
Applied rewrites89.2%
Final simplification83.5%
y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (x_s y_s x_m y_m z) :precision binary64 (* x_s (* y_s (* (/ x_m (* z z)) y_m))))
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((x_m / (z * z)) * y_m));
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = x_s * (y_s * ((x_m / (z * z)) * y_m))
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * ((x_m / (z * z)) * y_m));
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): return x_s * (y_s * ((x_m / (z * z)) * y_m))
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) return Float64(x_s * Float64(y_s * Float64(Float64(x_m / Float64(z * z)) * y_m))) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(x_s, y_s, x_m, y_m, z)
tmp = x_s * (y_s * ((x_m / (z * z)) * y_m));
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \left(\frac{x\_m}{z \cdot z} \cdot y\_m\right)\right)
\end{array}
Initial program 82.5%
Taylor expanded in z around 0
unpow2N/A
lower-*.f6470.0
Applied rewrites70.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6476.0
Applied rewrites76.0%
Final simplification76.0%
(FPCore (x y z) :precision binary64 (if (< z 249.6182814532307) (/ (* y (/ x z)) (+ z (* z z))) (/ (* (/ (/ y z) (+ 1.0 z)) x) z)))
double code(double x, double y, double z) {
double tmp;
if (z < 249.6182814532307) {
tmp = (y * (x / z)) / (z + (z * z));
} else {
tmp = (((y / z) / (1.0 + z)) * x) / z;
}
return tmp;
}
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 < 249.6182814532307d0) then
tmp = (y * (x / z)) / (z + (z * z))
else
tmp = (((y / z) / (1.0d0 + z)) * x) / z
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double tmp;
if (z < 249.6182814532307) {
tmp = (y * (x / z)) / (z + (z * z));
} else {
tmp = (((y / z) / (1.0 + z)) * x) / z;
}
return tmp;
}
def code(x, y, z): tmp = 0 if z < 249.6182814532307: tmp = (y * (x / z)) / (z + (z * z)) else: tmp = (((y / z) / (1.0 + z)) * x) / z return tmp
function code(x, y, z) tmp = 0.0 if (z < 249.6182814532307) tmp = Float64(Float64(y * Float64(x / z)) / Float64(z + Float64(z * z))); else tmp = Float64(Float64(Float64(Float64(y / z) / Float64(1.0 + z)) * x) / z); end return tmp end
function tmp_2 = code(x, y, z) tmp = 0.0; if (z < 249.6182814532307) tmp = (y * (x / z)) / (z + (z * z)); else tmp = (((y / z) / (1.0 + z)) * x) / z; end tmp_2 = tmp; end
code[x_, y_, z_] := If[Less[z, 249.6182814532307], N[(N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision] / N[(z + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y / z), $MachinePrecision] / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z < 249.6182814532307:\\
\;\;\;\;\frac{y \cdot \frac{x}{z}}{z + z \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{y}{z}}{1 + z} \cdot x}{z}\\
\end{array}
\end{array}
herbie shell --seed 2024268
(FPCore (x y z)
:name "Statistics.Distribution.Beta:$cvariance from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< z 2496182814532307/10000000000000) (/ (* y (/ x z)) (+ z (* z z))) (/ (* (/ (/ y z) (+ 1 z)) x) z)))
(/ (* x y) (* (* z z) (+ z 1.0))))