
(FPCore (x y) :precision binary64 (/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))
double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
end function
public static double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
def code(x, y): return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0))
function code(x, y) return Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) end
function tmp = code(x, y) tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)); end
code[x_, y_] := N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 21 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))
double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
end function
public static double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
def code(x, y): return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0))
function code(x, y) return Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) end
function tmp = code(x, y) tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)); end
code[x_, y_] := N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}
\end{array}
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ (* (/ y (+ (+ x y) 1.0)) (/ x (+ x y))) (+ x y)))
assert(x < y);
double code(double x, double y) {
return ((y / ((x + y) + 1.0)) * (x / (x + y))) / (x + y);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = ((y / ((x + y) + 1.0d0)) * (x / (x + y))) / (x + y)
end function
assert x < y;
public static double code(double x, double y) {
return ((y / ((x + y) + 1.0)) * (x / (x + y))) / (x + y);
}
[x, y] = sort([x, y]) def code(x, y): return ((y / ((x + y) + 1.0)) * (x / (x + y))) / (x + y)
x, y = sort([x, y]) function code(x, y) return Float64(Float64(Float64(y / Float64(Float64(x + y) + 1.0)) * Float64(x / Float64(x + y))) / Float64(x + y)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = ((y / ((x + y) + 1.0)) * (x / (x + y))) / (x + y);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(N[(y / N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] * N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{y}{\left(x + y\right) + 1} \cdot \frac{x}{x + y}}{x + y}
\end{array}
Initial program 65.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.9%
Final simplification99.9%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ (+ x y) 1.0)) (t_1 (/ y t_0)))
(if (<= x -1.9e+154)
(/ t_1 (fma 2.0 y x))
(if (<= x 2.7e-139)
(* (/ x (* t_0 (+ x y))) (/ y (+ x y)))
(/ t_1 (* (/ y x) (+ x y)))))))assert(x < y);
double code(double x, double y) {
double t_0 = (x + y) + 1.0;
double t_1 = y / t_0;
double tmp;
if (x <= -1.9e+154) {
tmp = t_1 / fma(2.0, y, x);
} else if (x <= 2.7e-139) {
tmp = (x / (t_0 * (x + y))) * (y / (x + y));
} else {
tmp = t_1 / ((y / x) * (x + y));
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(Float64(x + y) + 1.0) t_1 = Float64(y / t_0) tmp = 0.0 if (x <= -1.9e+154) tmp = Float64(t_1 / fma(2.0, y, x)); elseif (x <= 2.7e-139) tmp = Float64(Float64(x / Float64(t_0 * Float64(x + y))) * Float64(y / Float64(x + y))); else tmp = Float64(t_1 / Float64(Float64(y / x) * Float64(x + y))); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$1 = N[(y / t$95$0), $MachinePrecision]}, If[LessEqual[x, -1.9e+154], N[(t$95$1 / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.7e-139], N[(N[(x / N[(t$95$0 * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(y / N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / N[(N[(y / x), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \left(x + y\right) + 1\\
t_1 := \frac{y}{t\_0}\\
\mathbf{if}\;x \leq -1.9 \cdot 10^{+154}:\\
\;\;\;\;\frac{t\_1}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;x \leq 2.7 \cdot 10^{-139}:\\
\;\;\;\;\frac{x}{t\_0 \cdot \left(x + y\right)} \cdot \frac{y}{x + y}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_1}{\frac{y}{x} \cdot \left(x + y\right)}\\
\end{array}
\end{array}
if x < -1.8999999999999999e154Initial program 54.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
Applied rewrites99.2%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6481.6
Applied rewrites81.6%
if -1.8999999999999999e154 < x < 2.6999999999999998e-139Initial program 69.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6496.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6496.4
Applied rewrites96.4%
if 2.6999999999999998e-139 < x Initial program 65.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
Applied rewrites99.0%
Taylor expanded in y around inf
lower-/.f6439.5
Applied rewrites39.5%
Final simplification70.5%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ x (+ x y))) (t_1 (+ (+ x y) 1.0)))
(if (<= y -5.8e-81)
(/ (/ y t_1) (fma 2.0 y x))
(if (<= y 2.8e-23)
(* (/ y (* (+ x 1.0) (+ x y))) t_0)
(if (<= y 7.1e+75)
(/ (* x y) (* (* (+ x y) (+ x y)) t_1))
(/ (* 1.0 t_0) (+ x y)))))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (x + y);
double t_1 = (x + y) + 1.0;
double tmp;
if (y <= -5.8e-81) {
tmp = (y / t_1) / fma(2.0, y, x);
} else if (y <= 2.8e-23) {
tmp = (y / ((x + 1.0) * (x + y))) * t_0;
} else if (y <= 7.1e+75) {
tmp = (x * y) / (((x + y) * (x + y)) * t_1);
} else {
tmp = (1.0 * t_0) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(x + y)) t_1 = Float64(Float64(x + y) + 1.0) tmp = 0.0 if (y <= -5.8e-81) tmp = Float64(Float64(y / t_1) / fma(2.0, y, x)); elseif (y <= 2.8e-23) tmp = Float64(Float64(y / Float64(Float64(x + 1.0) * Float64(x + y))) * t_0); elseif (y <= 7.1e+75) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * t_1)); else tmp = Float64(Float64(1.0 * t_0) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[y, -5.8e-81], N[(N[(y / t$95$1), $MachinePrecision] / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.8e-23], N[(N[(y / N[(N[(x + 1.0), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[y, 7.1e+75], N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 * t$95$0), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{x + y}\\
t_1 := \left(x + y\right) + 1\\
\mathbf{if}\;y \leq -5.8 \cdot 10^{-81}:\\
\;\;\;\;\frac{\frac{y}{t\_1}}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;y \leq 2.8 \cdot 10^{-23}:\\
\;\;\;\;\frac{y}{\left(x + 1\right) \cdot \left(x + y\right)} \cdot t\_0\\
\mathbf{elif}\;y \leq 7.1 \cdot 10^{+75}:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot t\_0}{x + y}\\
\end{array}
\end{array}
if y < -5.79999999999999978e-81Initial program 55.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
Applied rewrites97.9%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6439.0
Applied rewrites39.0%
if -5.79999999999999978e-81 < y < 2.7999999999999997e-23Initial program 72.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64100.0
lift-+.f64N/A
+-commutativeN/A
Applied rewrites100.0%
Taylor expanded in y around 0
+-commutativeN/A
lower-+.f64100.0
Applied rewrites100.0%
if 2.7999999999999997e-23 < y < 7.09999999999999982e75Initial program 95.2%
if 7.09999999999999982e75 < y Initial program 54.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
Applied rewrites80.7%
Final simplification76.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ (+ x y) 1.0)))
(if (<= x -8.5e+139)
(/ (/ y t_0) (fma 2.0 y x))
(if (<= x -1.06e+70)
(* 1.0 (/ y (* t_0 (+ x y))))
(if (<= x -2.7e-143)
(/ (* x y) (* (* (+ x y) (+ x y)) t_0))
(/ (/ x (+ 1.0 y)) (+ x y)))))))assert(x < y);
double code(double x, double y) {
double t_0 = (x + y) + 1.0;
double tmp;
if (x <= -8.5e+139) {
tmp = (y / t_0) / fma(2.0, y, x);
} else if (x <= -1.06e+70) {
tmp = 1.0 * (y / (t_0 * (x + y)));
} else if (x <= -2.7e-143) {
tmp = (x * y) / (((x + y) * (x + y)) * t_0);
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(Float64(x + y) + 1.0) tmp = 0.0 if (x <= -8.5e+139) tmp = Float64(Float64(y / t_0) / fma(2.0, y, x)); elseif (x <= -1.06e+70) tmp = Float64(1.0 * Float64(y / Float64(t_0 * Float64(x + y)))); elseif (x <= -2.7e-143) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * t_0)); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[x, -8.5e+139], N[(N[(y / t$95$0), $MachinePrecision] / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.06e+70], N[(1.0 * N[(y / N[(t$95$0 * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -2.7e-143], N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \left(x + y\right) + 1\\
\mathbf{if}\;x \leq -8.5 \cdot 10^{+139}:\\
\;\;\;\;\frac{\frac{y}{t\_0}}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;x \leq -1.06 \cdot 10^{+70}:\\
\;\;\;\;1 \cdot \frac{y}{t\_0 \cdot \left(x + y\right)}\\
\mathbf{elif}\;x \leq -2.7 \cdot 10^{-143}:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -8.5e139Initial program 49.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
Applied rewrites99.2%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6478.9
Applied rewrites78.9%
if -8.5e139 < x < -1.06e70Initial program 50.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6476.6
lift-+.f64N/A
+-commutativeN/A
Applied rewrites76.6%
Taylor expanded in y around 0
Applied rewrites76.6%
if -1.06e70 < x < -2.70000000000000009e-143Initial program 90.4%
if -2.70000000000000009e-143 < x Initial program 65.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6459.0
Applied rewrites59.0%
Final simplification66.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ (+ x y) 1.0)))
(if (<= y -5.8e-81)
(/ (/ y t_0) (fma 2.0 y x))
(if (<= y 1.6e+154)
(* (/ x (* t_0 (+ x y))) (/ y (+ x y)))
(/ (* 1.0 (/ x (+ x y))) (+ x y))))))assert(x < y);
double code(double x, double y) {
double t_0 = (x + y) + 1.0;
double tmp;
if (y <= -5.8e-81) {
tmp = (y / t_0) / fma(2.0, y, x);
} else if (y <= 1.6e+154) {
tmp = (x / (t_0 * (x + y))) * (y / (x + y));
} else {
tmp = (1.0 * (x / (x + y))) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(Float64(x + y) + 1.0) tmp = 0.0 if (y <= -5.8e-81) tmp = Float64(Float64(y / t_0) / fma(2.0, y, x)); elseif (y <= 1.6e+154) tmp = Float64(Float64(x / Float64(t_0 * Float64(x + y))) * Float64(y / Float64(x + y))); else tmp = Float64(Float64(1.0 * Float64(x / Float64(x + y))) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[y, -5.8e-81], N[(N[(y / t$95$0), $MachinePrecision] / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.6e+154], N[(N[(x / N[(t$95$0 * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(y / N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 * N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \left(x + y\right) + 1\\
\mathbf{if}\;y \leq -5.8 \cdot 10^{-81}:\\
\;\;\;\;\frac{\frac{y}{t\_0}}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;y \leq 1.6 \cdot 10^{+154}:\\
\;\;\;\;\frac{x}{t\_0 \cdot \left(x + y\right)} \cdot \frac{y}{x + y}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot \frac{x}{x + y}}{x + y}\\
\end{array}
\end{array}
if y < -5.79999999999999978e-81Initial program 55.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
Applied rewrites97.9%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6439.0
Applied rewrites39.0%
if -5.79999999999999978e-81 < y < 1.6e154Initial program 75.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6497.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.9
Applied rewrites97.9%
if 1.6e154 < y Initial program 48.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
Applied rewrites85.7%
Final simplification77.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ x (+ x y))) (t_1 (+ (+ x y) 1.0)))
(if (<= y -5.8e-81)
(/ (/ y t_1) (fma 2.0 y x))
(if (<= y 1.6e+154)
(* (/ y (* t_1 (+ x y))) t_0)
(/ (* 1.0 t_0) (+ x y))))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (x + y);
double t_1 = (x + y) + 1.0;
double tmp;
if (y <= -5.8e-81) {
tmp = (y / t_1) / fma(2.0, y, x);
} else if (y <= 1.6e+154) {
tmp = (y / (t_1 * (x + y))) * t_0;
} else {
tmp = (1.0 * t_0) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(x + y)) t_1 = Float64(Float64(x + y) + 1.0) tmp = 0.0 if (y <= -5.8e-81) tmp = Float64(Float64(y / t_1) / fma(2.0, y, x)); elseif (y <= 1.6e+154) tmp = Float64(Float64(y / Float64(t_1 * Float64(x + y))) * t_0); else tmp = Float64(Float64(1.0 * t_0) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[y, -5.8e-81], N[(N[(y / t$95$1), $MachinePrecision] / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.6e+154], N[(N[(y / N[(t$95$1 * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[(1.0 * t$95$0), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{x + y}\\
t_1 := \left(x + y\right) + 1\\
\mathbf{if}\;y \leq -5.8 \cdot 10^{-81}:\\
\;\;\;\;\frac{\frac{y}{t\_1}}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;y \leq 1.6 \cdot 10^{+154}:\\
\;\;\;\;\frac{y}{t\_1 \cdot \left(x + y\right)} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1 \cdot t\_0}{x + y}\\
\end{array}
\end{array}
if y < -5.79999999999999978e-81Initial program 55.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
Applied rewrites97.9%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6439.0
Applied rewrites39.0%
if -5.79999999999999978e-81 < y < 1.6e154Initial program 75.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6497.8
lift-+.f64N/A
+-commutativeN/A
Applied rewrites97.8%
if 1.6e154 < y Initial program 48.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
Applied rewrites85.7%
Final simplification77.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ (/ y (+ (+ x y) 1.0)) (fma (+ 2.0 (/ y x)) y x)))
assert(x < y);
double code(double x, double y) {
return (y / ((x + y) + 1.0)) / fma((2.0 + (y / x)), y, x);
}
x, y = sort([x, y]) function code(x, y) return Float64(Float64(y / Float64(Float64(x + y) + 1.0)) / fma(Float64(2.0 + Float64(y / x)), y, x)) end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(y / N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + N[(y / x), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{y}{\left(x + y\right) + 1}}{\mathsf{fma}\left(2 + \frac{y}{x}, y, x\right)}
\end{array}
Initial program 65.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
Applied rewrites99.1%
Taylor expanded in y around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6499.1
Applied rewrites99.1%
Final simplification99.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -6e+136)
(/ (/ y x) (+ x y))
(if (<= x -5.2e-88)
(* (/ y (* (fma x x x) x)) x)
(if (<= x 1.32e-42) (/ x (fma y y y)) (/ (/ x y) (+ x y))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -6e+136) {
tmp = (y / x) / (x + y);
} else if (x <= -5.2e-88) {
tmp = (y / (fma(x, x, x) * x)) * x;
} else if (x <= 1.32e-42) {
tmp = x / fma(y, y, y);
} else {
tmp = (x / y) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -6e+136) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= -5.2e-88) tmp = Float64(Float64(y / Float64(fma(x, x, x) * x)) * x); elseif (x <= 1.32e-42) tmp = Float64(x / fma(y, y, y)); else tmp = Float64(Float64(x / y) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -6e+136], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.2e-88], N[(N[(y / N[(N[(x * x + x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[x, 1.32e-42], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -6 \cdot 10^{+136}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq -5.2 \cdot 10^{-88}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right) \cdot x} \cdot x\\
\mathbf{elif}\;x \leq 1.32 \cdot 10^{-42}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{x + y}\\
\end{array}
\end{array}
if x < -5.99999999999999958e136Initial program 49.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in x around inf
lower-/.f6477.3
Applied rewrites77.3%
if -5.99999999999999958e136 < x < -5.20000000000000027e-88Initial program 79.7%
Taylor expanded in y around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6457.5
Applied rewrites57.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6464.7
Applied rewrites64.7%
if -5.20000000000000027e-88 < x < 1.32000000000000006e-42Initial program 73.8%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6485.9
Applied rewrites85.9%
if 1.32000000000000006e-42 < x Initial program 59.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
lower-/.f6429.8
Applied rewrites29.8%
Final simplification63.6%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -1.05e+14)
(/ (/ y x) (+ x y))
(if (<= x -5.2e-88)
(/ y (fma x x x))
(if (<= x 1.32e-42) (/ x (fma y y y)) (/ (/ x y) (+ x y))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.05e+14) {
tmp = (y / x) / (x + y);
} else if (x <= -5.2e-88) {
tmp = y / fma(x, x, x);
} else if (x <= 1.32e-42) {
tmp = x / fma(y, y, y);
} else {
tmp = (x / y) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.05e+14) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= -5.2e-88) tmp = Float64(y / fma(x, x, x)); elseif (x <= 1.32e-42) tmp = Float64(x / fma(y, y, y)); else tmp = Float64(Float64(x / y) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.05e+14], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.2e-88], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.32e-42], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.05 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq -5.2 \cdot 10^{-88}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;x \leq 1.32 \cdot 10^{-42}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{x + y}\\
\end{array}
\end{array}
if x < -1.05e14Initial program 54.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in x around inf
lower-/.f6474.7
Applied rewrites74.7%
if -1.05e14 < x < -5.20000000000000027e-88Initial program 87.9%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6457.8
Applied rewrites57.8%
if -5.20000000000000027e-88 < x < 1.32000000000000006e-42Initial program 73.8%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6485.9
Applied rewrites85.9%
if 1.32000000000000006e-42 < x Initial program 59.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
lower-/.f6429.8
Applied rewrites29.8%
Final simplification63.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -5e+67)
(/ (/ y x) x)
(if (<= x -5.2e-88)
(/ y (fma x x x))
(if (<= x 1.32e-42) (/ x (fma y y y)) (/ (/ x y) (+ x y))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -5e+67) {
tmp = (y / x) / x;
} else if (x <= -5.2e-88) {
tmp = y / fma(x, x, x);
} else if (x <= 1.32e-42) {
tmp = x / fma(y, y, y);
} else {
tmp = (x / y) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -5e+67) tmp = Float64(Float64(y / x) / x); elseif (x <= -5.2e-88) tmp = Float64(y / fma(x, x, x)); elseif (x <= 1.32e-42) tmp = Float64(x / fma(y, y, y)); else tmp = Float64(Float64(x / y) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -5e+67], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, -5.2e-88], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.32e-42], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5 \cdot 10^{+67}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;x \leq -5.2 \cdot 10^{-88}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;x \leq 1.32 \cdot 10^{-42}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{x + y}\\
\end{array}
\end{array}
if x < -4.99999999999999976e67Initial program 50.8%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
distribute-rgt1-inN/A
metadata-evalN/A
lower-fma.f6462.8
Applied rewrites62.8%
Taylor expanded in x around inf
Applied rewrites73.4%
if -4.99999999999999976e67 < x < -5.20000000000000027e-88Initial program 90.2%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.9
Applied rewrites62.9%
if -5.20000000000000027e-88 < x < 1.32000000000000006e-42Initial program 73.8%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6485.9
Applied rewrites85.9%
if 1.32000000000000006e-42 < x Initial program 59.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around inf
lower-/.f6429.8
Applied rewrites29.8%
Final simplification63.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ (+ x y) 1.0)))
(if (<= x -8.5e+139)
(/ (/ y t_0) (fma 2.0 y x))
(if (<= x -3.8e-116)
(* 1.0 (/ y (* t_0 (+ x y))))
(/ (/ x (+ 1.0 y)) (+ x y))))))assert(x < y);
double code(double x, double y) {
double t_0 = (x + y) + 1.0;
double tmp;
if (x <= -8.5e+139) {
tmp = (y / t_0) / fma(2.0, y, x);
} else if (x <= -3.8e-116) {
tmp = 1.0 * (y / (t_0 * (x + y)));
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(Float64(x + y) + 1.0) tmp = 0.0 if (x <= -8.5e+139) tmp = Float64(Float64(y / t_0) / fma(2.0, y, x)); elseif (x <= -3.8e-116) tmp = Float64(1.0 * Float64(y / Float64(t_0 * Float64(x + y)))); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[x, -8.5e+139], N[(N[(y / t$95$0), $MachinePrecision] / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.8e-116], N[(1.0 * N[(y / N[(t$95$0 * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \left(x + y\right) + 1\\
\mathbf{if}\;x \leq -8.5 \cdot 10^{+139}:\\
\;\;\;\;\frac{\frac{y}{t\_0}}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;x \leq -3.8 \cdot 10^{-116}:\\
\;\;\;\;1 \cdot \frac{y}{t\_0 \cdot \left(x + y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -8.5e139Initial program 49.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
clear-numN/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f64N/A
Applied rewrites99.2%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6478.9
Applied rewrites78.9%
if -8.5e139 < x < -3.8000000000000001e-116Initial program 79.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6494.2
lift-+.f64N/A
+-commutativeN/A
Applied rewrites94.2%
Taylor expanded in y around 0
Applied rewrites73.0%
if -3.8000000000000001e-116 < x Initial program 66.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6459.6
Applied rewrites59.6%
Final simplification64.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -7.8e+147)
(/ (/ y x) (+ x y))
(if (<= x -3.8e-116)
(* 1.0 (/ y (* (+ (+ x y) 1.0) (+ x y))))
(/ (/ x (+ 1.0 y)) (+ x y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -7.8e+147) {
tmp = (y / x) / (x + y);
} else if (x <= -3.8e-116) {
tmp = 1.0 * (y / (((x + y) + 1.0) * (x + y)));
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-7.8d+147)) then
tmp = (y / x) / (x + y)
else if (x <= (-3.8d-116)) then
tmp = 1.0d0 * (y / (((x + y) + 1.0d0) * (x + y)))
else
tmp = (x / (1.0d0 + y)) / (x + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -7.8e+147) {
tmp = (y / x) / (x + y);
} else if (x <= -3.8e-116) {
tmp = 1.0 * (y / (((x + y) + 1.0) * (x + y)));
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -7.8e+147: tmp = (y / x) / (x + y) elif x <= -3.8e-116: tmp = 1.0 * (y / (((x + y) + 1.0) * (x + y))) else: tmp = (x / (1.0 + y)) / (x + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -7.8e+147) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= -3.8e-116) tmp = Float64(1.0 * Float64(y / Float64(Float64(Float64(x + y) + 1.0) * Float64(x + y)))); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -7.8e+147)
tmp = (y / x) / (x + y);
elseif (x <= -3.8e-116)
tmp = 1.0 * (y / (((x + y) + 1.0) * (x + y)));
else
tmp = (x / (1.0 + y)) / (x + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -7.8e+147], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.8e-116], N[(1.0 * N[(y / N[(N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -7.8 \cdot 10^{+147}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq -3.8 \cdot 10^{-116}:\\
\;\;\;\;1 \cdot \frac{y}{\left(\left(x + y\right) + 1\right) \cdot \left(x + y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -7.80000000000000033e147Initial program 51.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in x around inf
lower-/.f6479.5
Applied rewrites79.5%
if -7.80000000000000033e147 < x < -3.8000000000000001e-116Initial program 75.5%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6491.9
lift-+.f64N/A
+-commutativeN/A
Applied rewrites91.9%
Taylor expanded in y around 0
Applied rewrites70.8%
if -3.8000000000000001e-116 < x Initial program 66.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6459.6
Applied rewrites59.6%
Final simplification64.4%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -5e+67)
(/ (/ y x) x)
(if (<= x -5.2e-88)
(/ y (fma x x x))
(if (<= x 1.32e-42) (/ x (fma y y y)) (/ (/ x y) y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -5e+67) {
tmp = (y / x) / x;
} else if (x <= -5.2e-88) {
tmp = y / fma(x, x, x);
} else if (x <= 1.32e-42) {
tmp = x / fma(y, y, y);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -5e+67) tmp = Float64(Float64(y / x) / x); elseif (x <= -5.2e-88) tmp = Float64(y / fma(x, x, x)); elseif (x <= 1.32e-42) tmp = Float64(x / fma(y, y, y)); else tmp = Float64(Float64(x / y) / y); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -5e+67], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, -5.2e-88], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.32e-42], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5 \cdot 10^{+67}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;x \leq -5.2 \cdot 10^{-88}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;x \leq 1.32 \cdot 10^{-42}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if x < -4.99999999999999976e67Initial program 50.8%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
distribute-rgt1-inN/A
metadata-evalN/A
lower-fma.f6462.8
Applied rewrites62.8%
Taylor expanded in x around inf
Applied rewrites73.4%
if -4.99999999999999976e67 < x < -5.20000000000000027e-88Initial program 90.2%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.9
Applied rewrites62.9%
if -5.20000000000000027e-88 < x < 1.32000000000000006e-42Initial program 73.8%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6485.9
Applied rewrites85.9%
if 1.32000000000000006e-42 < x Initial program 59.3%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6426.3
Applied rewrites26.3%
Applied rewrites29.0%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -6e+136)
(/ (/ y x) (+ x y))
(if (<= x -5.2e-88)
(* (/ y (* (fma x x x) x)) x)
(/ (/ x (+ 1.0 y)) (+ x y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -6e+136) {
tmp = (y / x) / (x + y);
} else if (x <= -5.2e-88) {
tmp = (y / (fma(x, x, x) * x)) * x;
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -6e+136) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= -5.2e-88) tmp = Float64(Float64(y / Float64(fma(x, x, x) * x)) * x); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -6e+136], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.2e-88], N[(N[(y / N[(N[(x * x + x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -6 \cdot 10^{+136}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq -5.2 \cdot 10^{-88}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right) \cdot x} \cdot x\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -5.99999999999999958e136Initial program 49.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in x around inf
lower-/.f6477.3
Applied rewrites77.3%
if -5.99999999999999958e136 < x < -5.20000000000000027e-88Initial program 79.7%
Taylor expanded in y around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6457.5
Applied rewrites57.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6464.7
Applied rewrites64.7%
if -5.20000000000000027e-88 < x Initial program 67.2%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6460.2
Applied rewrites60.2%
Final simplification63.6%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ x (* y y))))
(if (<= x -42000000.0)
(/ y (* x x))
(if (<= x -3.4e-180) t_0 (if (<= x 4.8e-137) (/ x y) t_0)))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (y * y);
double tmp;
if (x <= -42000000.0) {
tmp = y / (x * x);
} else if (x <= -3.4e-180) {
tmp = t_0;
} else if (x <= 4.8e-137) {
tmp = x / y;
} else {
tmp = t_0;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = x / (y * y)
if (x <= (-42000000.0d0)) then
tmp = y / (x * x)
else if (x <= (-3.4d-180)) then
tmp = t_0
else if (x <= 4.8d-137) then
tmp = x / y
else
tmp = t_0
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = x / (y * y);
double tmp;
if (x <= -42000000.0) {
tmp = y / (x * x);
} else if (x <= -3.4e-180) {
tmp = t_0;
} else if (x <= 4.8e-137) {
tmp = x / y;
} else {
tmp = t_0;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y * y) tmp = 0 if x <= -42000000.0: tmp = y / (x * x) elif x <= -3.4e-180: tmp = t_0 elif x <= 4.8e-137: tmp = x / y else: tmp = t_0 return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y * y)) tmp = 0.0 if (x <= -42000000.0) tmp = Float64(y / Float64(x * x)); elseif (x <= -3.4e-180) tmp = t_0; elseif (x <= 4.8e-137) tmp = Float64(x / y); else tmp = t_0; end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = x / (y * y);
tmp = 0.0;
if (x <= -42000000.0)
tmp = y / (x * x);
elseif (x <= -3.4e-180)
tmp = t_0;
elseif (x <= 4.8e-137)
tmp = x / y;
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -42000000.0], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.4e-180], t$95$0, If[LessEqual[x, 4.8e-137], N[(x / y), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y \cdot y}\\
\mathbf{if}\;x \leq -42000000:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{elif}\;x \leq -3.4 \cdot 10^{-180}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;x \leq 4.8 \cdot 10^{-137}:\\
\;\;\;\;\frac{x}{y}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if x < -4.2e7Initial program 55.8%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6471.1
Applied rewrites71.1%
if -4.2e7 < x < -3.39999999999999981e-180 or 4.8000000000000001e-137 < x Initial program 70.8%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6438.7
Applied rewrites38.7%
if -3.39999999999999981e-180 < x < 4.8000000000000001e-137Initial program 63.5%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6488.4
Applied rewrites88.4%
Taylor expanded in y around 0
Applied rewrites77.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.7e-94) (/ (/ y (+ x 1.0)) (+ x y)) (/ (/ x (+ 1.0 y)) (+ x y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.7e-94) {
tmp = (y / (x + 1.0)) / (x + y);
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-1.7d-94)) then
tmp = (y / (x + 1.0d0)) / (x + y)
else
tmp = (x / (1.0d0 + y)) / (x + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -1.7e-94) {
tmp = (y / (x + 1.0)) / (x + y);
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -1.7e-94: tmp = (y / (x + 1.0)) / (x + y) else: tmp = (x / (1.0 + y)) / (x + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.7e-94) tmp = Float64(Float64(y / Float64(x + 1.0)) / Float64(x + y)); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -1.7e-94)
tmp = (y / (x + 1.0)) / (x + y);
else
tmp = (x / (1.0 + y)) / (x + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.7e-94], N[(N[(y / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.7 \cdot 10^{-94}:\\
\;\;\;\;\frac{\frac{y}{x + 1}}{x + y}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -1.6999999999999999e-94Initial program 62.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
lower-+.f6470.2
Applied rewrites70.2%
if -1.6999999999999999e-94 < x Initial program 67.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
associate-*r/N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6460.0
Applied rewrites60.0%
Final simplification62.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -5e+67) (/ (/ y x) x) (if (<= x -5.2e-88) (/ y (fma x x x)) (/ x (fma y y y)))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -5e+67) {
tmp = (y / x) / x;
} else if (x <= -5.2e-88) {
tmp = y / fma(x, x, x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -5e+67) tmp = Float64(Float64(y / x) / x); elseif (x <= -5.2e-88) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -5e+67], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, -5.2e-88], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5 \cdot 10^{+67}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;x \leq -5.2 \cdot 10^{-88}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -4.99999999999999976e67Initial program 50.8%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
distribute-rgt1-inN/A
metadata-evalN/A
lower-fma.f6462.8
Applied rewrites62.8%
Taylor expanded in x around inf
Applied rewrites73.4%
if -4.99999999999999976e67 < x < -5.20000000000000027e-88Initial program 90.2%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.9
Applied rewrites62.9%
if -5.20000000000000027e-88 < x Initial program 67.2%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6458.7
Applied rewrites58.7%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (let* ((t_0 (/ x (* y y)))) (if (<= y -3.8e-12) t_0 (if (<= y 1.0) (/ x y) t_0))))
assert(x < y);
double code(double x, double y) {
double t_0 = x / (y * y);
double tmp;
if (y <= -3.8e-12) {
tmp = t_0;
} else if (y <= 1.0) {
tmp = x / y;
} else {
tmp = t_0;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = x / (y * y)
if (y <= (-3.8d-12)) then
tmp = t_0
else if (y <= 1.0d0) then
tmp = x / y
else
tmp = t_0
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = x / (y * y);
double tmp;
if (y <= -3.8e-12) {
tmp = t_0;
} else if (y <= 1.0) {
tmp = x / y;
} else {
tmp = t_0;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y * y) tmp = 0 if y <= -3.8e-12: tmp = t_0 elif y <= 1.0: tmp = x / y else: tmp = t_0 return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y * y)) tmp = 0.0 if (y <= -3.8e-12) tmp = t_0; elseif (y <= 1.0) tmp = Float64(x / y); else tmp = t_0; end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = x / (y * y);
tmp = 0.0;
if (y <= -3.8e-12)
tmp = t_0;
elseif (y <= 1.0)
tmp = x / y;
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -3.8e-12], t$95$0, If[LessEqual[y, 1.0], N[(x / y), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y \cdot y}\\
\mathbf{if}\;y \leq -3.8 \cdot 10^{-12}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq 1:\\
\;\;\;\;\frac{x}{y}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if y < -3.79999999999999996e-12 or 1 < y Initial program 56.5%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6460.8
Applied rewrites60.8%
if -3.79999999999999996e-12 < y < 1Initial program 76.3%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6431.3
Applied rewrites31.3%
Taylor expanded in y around 0
Applied rewrites31.1%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -5.2e-88) (/ y (fma x x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -5.2e-88) {
tmp = y / fma(x, x, x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -5.2e-88) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -5.2e-88], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5.2 \cdot 10^{-88}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -5.20000000000000027e-88Initial program 61.6%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6468.6
Applied rewrites68.6%
if -5.20000000000000027e-88 < x Initial program 67.2%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6458.7
Applied rewrites58.7%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -42000000.0) (/ y (* x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -42000000.0) {
tmp = y / (x * x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -42000000.0) tmp = Float64(y / Float64(x * x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -42000000.0], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -42000000:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -4.2e7Initial program 55.8%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6471.1
Applied rewrites71.1%
if -4.2e7 < x Initial program 68.5%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6458.2
Applied rewrites58.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ x y))
assert(x < y);
double code(double x, double y) {
return x / y;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x / y
end function
assert x < y;
public static double code(double x, double y) {
return x / y;
}
[x, y] = sort([x, y]) def code(x, y): return x / y
x, y = sort([x, y]) function code(x, y) return Float64(x / y) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = x / y;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(x / y), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{x}{y}
\end{array}
Initial program 65.6%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6448.6
Applied rewrites48.6%
Taylor expanded in y around 0
Applied rewrites26.4%
(FPCore (x y) :precision binary64 (/ (/ (/ x (+ (+ y 1.0) x)) (+ y x)) (/ 1.0 (/ y (+ y x)))))
double code(double x, double y) {
return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = ((x / ((y + 1.0d0) + x)) / (y + x)) / (1.0d0 / (y / (y + x)))
end function
public static double code(double x, double y) {
return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)));
}
def code(x, y): return ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x)))
function code(x, y) return Float64(Float64(Float64(x / Float64(Float64(y + 1.0) + x)) / Float64(y + x)) / Float64(1.0 / Float64(y / Float64(y + x)))) end
function tmp = code(x, y) tmp = ((x / ((y + 1.0) + x)) / (y + x)) / (1.0 / (y / (y + x))); end
code[x_, y_] := N[(N[(N[(x / N[(N[(y + 1.0), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 / N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{\frac{x}{\left(y + 1\right) + x}}{y + x}}{\frac{1}{\frac{y}{y + x}}}
\end{array}
herbie shell --seed 2024277
(FPCore (x y)
:name "Numeric.SpecFunctions:incompleteBetaApprox from math-functions-0.1.5.2, A"
:precision binary64
:alt
(! :herbie-platform default (/ (/ (/ x (+ (+ y 1) x)) (+ y x)) (/ 1 (/ y (+ y x)))))
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))