
(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 15 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 (+ 1.0 (+ y x))) (+ y x)) (/ x (+ y x))))
assert(x < y);
double code(double x, double y) {
return ((y / (1.0 + (y + x))) / (y + x)) * (x / (y + x));
}
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 / (1.0d0 + (y + x))) / (y + x)) * (x / (y + x))
end function
assert x < y;
public static double code(double x, double y) {
return ((y / (1.0 + (y + x))) / (y + x)) * (x / (y + x));
}
[x, y] = sort([x, y]) def code(x, y): return ((y / (1.0 + (y + x))) / (y + x)) * (x / (y + x))
x, y = sort([x, y]) function code(x, y) return Float64(Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x)) * Float64(x / Float64(y + x))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = ((y / (1.0 + (y + x))) / (y + x)) * (x / (y + x));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{y}{1 + \left(y + x\right)}}{y + x} \cdot \frac{x}{y + x}
\end{array}
Initial program 70.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Final simplification99.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))) (t_1 (/ (/ y t_0) (+ y x))))
(if (<= y -6e+93)
(* 1.0 t_1)
(if (<= y 1.45e+125)
(/ (* (/ y (+ y x)) x) (* t_0 (+ y x)))
(* (/ x y) t_1)))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double t_1 = (y / t_0) / (y + x);
double tmp;
if (y <= -6e+93) {
tmp = 1.0 * t_1;
} else if (y <= 1.45e+125) {
tmp = ((y / (y + x)) * x) / (t_0 * (y + x));
} else {
tmp = (x / y) * t_1;
}
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) :: t_1
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
t_1 = (y / t_0) / (y + x)
if (y <= (-6d+93)) then
tmp = 1.0d0 * t_1
else if (y <= 1.45d+125) then
tmp = ((y / (y + x)) * x) / (t_0 * (y + x))
else
tmp = (x / y) * t_1
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double t_1 = (y / t_0) / (y + x);
double tmp;
if (y <= -6e+93) {
tmp = 1.0 * t_1;
} else if (y <= 1.45e+125) {
tmp = ((y / (y + x)) * x) / (t_0 * (y + x));
} else {
tmp = (x / y) * t_1;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) t_1 = (y / t_0) / (y + x) tmp = 0 if y <= -6e+93: tmp = 1.0 * t_1 elif y <= 1.45e+125: tmp = ((y / (y + x)) * x) / (t_0 * (y + x)) else: tmp = (x / y) * t_1 return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) t_1 = Float64(Float64(y / t_0) / Float64(y + x)) tmp = 0.0 if (y <= -6e+93) tmp = Float64(1.0 * t_1); elseif (y <= 1.45e+125) tmp = Float64(Float64(Float64(y / Float64(y + x)) * x) / Float64(t_0 * Float64(y + x))); else tmp = Float64(Float64(x / y) * t_1); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
t_1 = (y / t_0) / (y + x);
tmp = 0.0;
if (y <= -6e+93)
tmp = 1.0 * t_1;
elseif (y <= 1.45e+125)
tmp = ((y / (y + x)) * x) / (t_0 * (y + x));
else
tmp = (x / y) * t_1;
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[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -6e+93], N[(1.0 * t$95$1), $MachinePrecision], If[LessEqual[y, 1.45e+125], N[(N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
t_1 := \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{if}\;y \leq -6 \cdot 10^{+93}:\\
\;\;\;\;1 \cdot t\_1\\
\mathbf{elif}\;y \leq 1.45 \cdot 10^{+125}:\\
\;\;\;\;\frac{\frac{y}{y + x} \cdot x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y} \cdot t\_1\\
\end{array}
\end{array}
if y < -5.99999999999999957e93Initial program 46.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
Applied rewrites99.6%
Taylor expanded in y around 0
Applied rewrites24.7%
if -5.99999999999999957e93 < y < 1.44999999999999997e125Initial program 79.7%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/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.44999999999999997e125 < y Initial program 61.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around inf
lower-/.f6497.1
Applied rewrites97.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= y -6e+93)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= y 3.8e+170)
(/ (* (/ y (+ y x)) x) (* t_0 (+ y x)))
(/ (/ x (+ y x)) (+ (fma 2.0 x y) 1.0))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= -6e+93) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 3.8e+170) {
tmp = ((y / (y + x)) * x) / (t_0 * (y + x));
} else {
tmp = (x / (y + x)) / (fma(2.0, x, y) + 1.0);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= -6e+93) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (y <= 3.8e+170) tmp = Float64(Float64(Float64(y / Float64(y + x)) * x) / Float64(t_0 * Float64(y + x))); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(fma(2.0, x, y) + 1.0)); 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[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -6e+93], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.8e+170], N[(N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 * x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;y \leq -6 \cdot 10^{+93}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;y \leq 3.8 \cdot 10^{+170}:\\
\;\;\;\;\frac{\frac{y}{y + x} \cdot x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{\mathsf{fma}\left(2, x, y\right) + 1}\\
\end{array}
\end{array}
if y < -5.99999999999999957e93Initial program 46.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
Applied rewrites99.6%
Taylor expanded in y around 0
Applied rewrites24.7%
if -5.99999999999999957e93 < y < 3.7999999999999998e170Initial program 78.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6497.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.4
Applied rewrites97.4%
if 3.7999999999999998e170 < y Initial program 63.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64100.0
Applied rewrites100.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f64100.0
Applied rewrites100.0%
Taylor expanded in y around inf
Applied rewrites100.0%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= y -6e+93)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= y 3.8e+170)
(* (/ x (* t_0 (+ y x))) (/ y (+ y x)))
(/ (/ x (+ y x)) (+ (fma 2.0 x y) 1.0))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= -6e+93) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 3.8e+170) {
tmp = (x / (t_0 * (y + x))) * (y / (y + x));
} else {
tmp = (x / (y + x)) / (fma(2.0, x, y) + 1.0);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= -6e+93) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (y <= 3.8e+170) tmp = Float64(Float64(x / Float64(t_0 * Float64(y + x))) * Float64(y / Float64(y + x))); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(fma(2.0, x, y) + 1.0)); 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[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -6e+93], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.8e+170], N[(N[(x / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 * x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;y \leq -6 \cdot 10^{+93}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;y \leq 3.8 \cdot 10^{+170}:\\
\;\;\;\;\frac{x}{t\_0 \cdot \left(y + x\right)} \cdot \frac{y}{y + x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{\mathsf{fma}\left(2, x, y\right) + 1}\\
\end{array}
\end{array}
if y < -5.99999999999999957e93Initial program 46.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
Applied rewrites99.6%
Taylor expanded in y around 0
Applied rewrites24.7%
if -5.99999999999999957e93 < y < 3.7999999999999998e170Initial program 78.4%
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.3
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.3
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.3
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.3
Applied rewrites97.3%
if 3.7999999999999998e170 < y Initial program 63.5%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64100.0
Applied rewrites100.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f64100.0
Applied rewrites100.0%
Taylor expanded in y around inf
Applied rewrites100.0%
Final simplification83.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= x -5.5e+96)
(/ 1.0 (* (/ (+ y x) y) t_0))
(if (<= x -3.7e-131)
(/ (* y x) (* (* (+ y x) (+ y x)) t_0))
(/ (/ x (+ y x)) (+ 1.0 y))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -5.5e+96) {
tmp = 1.0 / (((y + x) / y) * t_0);
} else if (x <= -3.7e-131) {
tmp = (y * x) / (((y + x) * (y + x)) * t_0);
} else {
tmp = (x / (y + x)) / (1.0 + 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) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (x <= (-5.5d+96)) then
tmp = 1.0d0 / (((y + x) / y) * t_0)
else if (x <= (-3.7d-131)) then
tmp = (y * x) / (((y + x) * (y + x)) * t_0)
else
tmp = (x / (y + x)) / (1.0d0 + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -5.5e+96) {
tmp = 1.0 / (((y + x) / y) * t_0);
} else if (x <= -3.7e-131) {
tmp = (y * x) / (((y + x) * (y + x)) * t_0);
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if x <= -5.5e+96: tmp = 1.0 / (((y + x) / y) * t_0) elif x <= -3.7e-131: tmp = (y * x) / (((y + x) * (y + x)) * t_0) else: tmp = (x / (y + x)) / (1.0 + y) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (x <= -5.5e+96) tmp = Float64(1.0 / Float64(Float64(Float64(y + x) / y) * t_0)); elseif (x <= -3.7e-131) tmp = Float64(Float64(y * x) / Float64(Float64(Float64(y + x) * Float64(y + x)) * t_0)); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(1.0 + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (x <= -5.5e+96)
tmp = 1.0 / (((y + x) / y) * t_0);
elseif (x <= -3.7e-131)
tmp = (y * x) / (((y + x) * (y + x)) * t_0);
else
tmp = (x / (y + x)) / (1.0 + y);
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[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -5.5e+96], N[(1.0 / N[(N[(N[(y + x), $MachinePrecision] / y), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.7e-131], N[(N[(y * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 + y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;x \leq -5.5 \cdot 10^{+96}:\\
\;\;\;\;\frac{1}{\frac{y + x}{y} \cdot t\_0}\\
\mathbf{elif}\;x \leq -3.7 \cdot 10^{-131}:\\
\;\;\;\;\frac{y \cdot x}{\left(\left(y + x\right) \cdot \left(y + x\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 + y}\\
\end{array}
\end{array}
if x < -5.5000000000000002e96Initial program 47.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites77.7%
if -5.5000000000000002e96 < x < -3.7000000000000002e-131Initial program 83.1%
if -3.7000000000000002e-131 < x Initial program 72.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6458.6
Applied rewrites58.6%
Final simplification65.9%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= x -4e+108)
(* 1.0 (/ (/ y t_0) (+ y x)))
(* (/ (/ y (+ y x)) (* t_0 (+ y x))) x))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -4e+108) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else {
tmp = ((y / (y + x)) / (t_0 * (y + x))) * x;
}
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 = 1.0d0 + (y + x)
if (x <= (-4d+108)) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else
tmp = ((y / (y + x)) / (t_0 * (y + x))) * x
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -4e+108) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else {
tmp = ((y / (y + x)) / (t_0 * (y + x))) * x;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if x <= -4e+108: tmp = 1.0 * ((y / t_0) / (y + x)) else: tmp = ((y / (y + x)) / (t_0 * (y + x))) * x return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (x <= -4e+108) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); else tmp = Float64(Float64(Float64(y / Float64(y + x)) / Float64(t_0 * Float64(y + x))) * x); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (x <= -4e+108)
tmp = 1.0 * ((y / t_0) / (y + x));
else
tmp = ((y / (y + x)) / (t_0 * (y + x))) * x;
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[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -4e+108], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;x \leq -4 \cdot 10^{+108}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{y}{y + x}}{t\_0 \cdot \left(y + x\right)} \cdot x\\
\end{array}
\end{array}
if x < -4.0000000000000001e108Initial program 51.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in y around 0
Applied rewrites83.2%
if -4.0000000000000001e108 < x Initial program 74.0%
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
lower-fma.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6474.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6474.1
Applied rewrites74.1%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft-outN/A
lift-+.f64N/A
associate-*r*N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
associate-/l/N/A
Applied rewrites92.2%
Final simplification90.9%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= x -4.8e+168)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= x -4.6e-131)
(/ (* 1.0 y) (* t_0 (+ y x)))
(/ (/ x (+ y x)) (+ 1.0 y))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -4.8e+168) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (x <= -4.6e-131) {
tmp = (1.0 * y) / (t_0 * (y + x));
} else {
tmp = (x / (y + x)) / (1.0 + 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) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (x <= (-4.8d+168)) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (x <= (-4.6d-131)) then
tmp = (1.0d0 * y) / (t_0 * (y + x))
else
tmp = (x / (y + x)) / (1.0d0 + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -4.8e+168) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (x <= -4.6e-131) {
tmp = (1.0 * y) / (t_0 * (y + x));
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if x <= -4.8e+168: tmp = 1.0 * ((y / t_0) / (y + x)) elif x <= -4.6e-131: tmp = (1.0 * y) / (t_0 * (y + x)) else: tmp = (x / (y + x)) / (1.0 + y) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (x <= -4.8e+168) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (x <= -4.6e-131) tmp = Float64(Float64(1.0 * y) / Float64(t_0 * Float64(y + x))); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(1.0 + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (x <= -4.8e+168)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (x <= -4.6e-131)
tmp = (1.0 * y) / (t_0 * (y + x));
else
tmp = (x / (y + x)) / (1.0 + y);
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[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -4.8e+168], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -4.6e-131], N[(N[(1.0 * y), $MachinePrecision] / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 + y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;x \leq -4.8 \cdot 10^{+168}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;x \leq -4.6 \cdot 10^{-131}:\\
\;\;\;\;\frac{1 \cdot y}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 + y}\\
\end{array}
\end{array}
if x < -4.80000000000000019e168Initial program 60.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites93.2%
if -4.80000000000000019e168 < x < -4.60000000000000044e-131Initial program 68.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
Applied rewrites99.6%
Taylor expanded in y around 0
Applied rewrites47.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6470.4
Applied rewrites70.4%
if -4.60000000000000044e-131 < x Initial program 72.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6458.6
Applied rewrites58.6%
Final simplification64.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -4.8e+168)
(* (/ (/ y x) (+ y x)) 1.0)
(if (<= x -4.6e-131)
(/ (* 1.0 y) (* (+ 1.0 (+ y x)) (+ y x)))
(/ (/ x (+ y x)) (+ 1.0 y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -4.8e+168) {
tmp = ((y / x) / (y + x)) * 1.0;
} else if (x <= -4.6e-131) {
tmp = (1.0 * y) / ((1.0 + (y + x)) * (y + x));
} else {
tmp = (x / (y + x)) / (1.0 + 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 <= (-4.8d+168)) then
tmp = ((y / x) / (y + x)) * 1.0d0
else if (x <= (-4.6d-131)) then
tmp = (1.0d0 * y) / ((1.0d0 + (y + x)) * (y + x))
else
tmp = (x / (y + x)) / (1.0d0 + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -4.8e+168) {
tmp = ((y / x) / (y + x)) * 1.0;
} else if (x <= -4.6e-131) {
tmp = (1.0 * y) / ((1.0 + (y + x)) * (y + x));
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -4.8e+168: tmp = ((y / x) / (y + x)) * 1.0 elif x <= -4.6e-131: tmp = (1.0 * y) / ((1.0 + (y + x)) * (y + x)) else: tmp = (x / (y + x)) / (1.0 + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -4.8e+168) tmp = Float64(Float64(Float64(y / x) / Float64(y + x)) * 1.0); elseif (x <= -4.6e-131) tmp = Float64(Float64(1.0 * y) / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(1.0 + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -4.8e+168)
tmp = ((y / x) / (y + x)) * 1.0;
elseif (x <= -4.6e-131)
tmp = (1.0 * y) / ((1.0 + (y + x)) * (y + x));
else
tmp = (x / (y + x)) / (1.0 + 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, -4.8e+168], N[(N[(N[(y / x), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], If[LessEqual[x, -4.6e-131], N[(N[(1.0 * y), $MachinePrecision] / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4.8 \cdot 10^{+168}:\\
\;\;\;\;\frac{\frac{y}{x}}{y + x} \cdot 1\\
\mathbf{elif}\;x \leq -4.6 \cdot 10^{-131}:\\
\;\;\;\;\frac{1 \cdot y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 + y}\\
\end{array}
\end{array}
if x < -4.80000000000000019e168Initial program 60.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites93.2%
Taylor expanded in x around inf
lower-/.f6492.9
Applied rewrites92.9%
if -4.80000000000000019e168 < x < -4.60000000000000044e-131Initial program 68.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.6
Applied rewrites99.6%
Taylor expanded in y around 0
Applied rewrites47.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6470.4
Applied rewrites70.4%
if -4.60000000000000044e-131 < x Initial program 72.9%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6458.6
Applied rewrites58.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 -4.8e+168) (* (/ (/ y x) (+ y x)) 1.0) (if (<= x -2.35e-68) (/ y (fma x x x)) (/ (/ x (+ y x)) (+ 1.0 y)))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -4.8e+168) {
tmp = ((y / x) / (y + x)) * 1.0;
} else if (x <= -2.35e-68) {
tmp = y / fma(x, x, x);
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -4.8e+168) tmp = Float64(Float64(Float64(y / x) / Float64(y + x)) * 1.0); elseif (x <= -2.35e-68) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(1.0 + 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, -4.8e+168], N[(N[(N[(y / x), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], If[LessEqual[x, -2.35e-68], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4.8 \cdot 10^{+168}:\\
\;\;\;\;\frac{\frac{y}{x}}{y + x} \cdot 1\\
\mathbf{elif}\;x \leq -2.35 \cdot 10^{-68}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 + y}\\
\end{array}
\end{array}
if x < -4.80000000000000019e168Initial program 60.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites93.2%
Taylor expanded in x around inf
lower-/.f6492.9
Applied rewrites92.9%
if -4.80000000000000019e168 < x < -2.34999999999999994e-68Initial program 67.8%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6454.9
Applied rewrites54.9%
if -2.34999999999999994e-68 < x Initial program 72.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6458.9
Applied rewrites58.9%
Final simplification61.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.9e+169) (/ (/ y x) x) (if (<= x -2.35e-68) (/ y (fma x x x)) (/ (/ x (+ y x)) (+ 1.0 y)))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.9e+169) {
tmp = (y / x) / x;
} else if (x <= -2.35e-68) {
tmp = y / fma(x, x, x);
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.9e+169) tmp = Float64(Float64(y / x) / x); elseif (x <= -2.35e-68) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(1.0 + 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.9e+169], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, -2.35e-68], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.9 \cdot 10^{+169}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;x \leq -2.35 \cdot 10^{-68}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 + y}\\
\end{array}
\end{array}
if x < -1.89999999999999996e169Initial program 60.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6481.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6481.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6481.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6481.4
Applied rewrites81.4%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6481.4
Applied rewrites81.4%
Applied rewrites92.8%
if -1.89999999999999996e169 < x < -2.34999999999999994e-68Initial program 67.8%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6454.9
Applied rewrites54.9%
if -2.34999999999999994e-68 < x Initial program 72.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6458.9
Applied rewrites58.9%
Final simplification61.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.9e+169) (/ (/ y x) x) (if (<= x -2.35e-68) (/ y (fma x x x)) (/ x (fma y y y)))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.9e+169) {
tmp = (y / x) / x;
} else if (x <= -2.35e-68) {
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 <= -1.9e+169) tmp = Float64(Float64(y / x) / x); elseif (x <= -2.35e-68) 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, -1.9e+169], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, -2.35e-68], 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 -1.9 \cdot 10^{+169}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;x \leq -2.35 \cdot 10^{-68}:\\
\;\;\;\;\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 < -1.89999999999999996e169Initial program 60.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6481.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6481.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6481.4
lift-+.f64N/A
+-commutativeN/A
lower-+.f6481.4
Applied rewrites81.4%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6481.4
Applied rewrites81.4%
Applied rewrites92.8%
if -1.89999999999999996e169 < x < -2.34999999999999994e-68Initial program 67.8%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6454.9
Applied rewrites54.9%
if -2.34999999999999994e-68 < x Initial program 72.8%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6457.2
Applied rewrites57.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -2.35e-68) (/ y (fma x x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -2.35e-68) {
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 <= -2.35e-68) 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, -2.35e-68], 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 -2.35 \cdot 10^{-68}:\\
\;\;\;\;\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 < -2.34999999999999994e-68Initial program 65.4%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6463.9
Applied rewrites63.9%
if -2.34999999999999994e-68 < x Initial program 72.8%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6457.2
Applied rewrites57.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.45e+14) (/ y (* x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.45e+14) {
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 <= -1.45e+14) 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, -1.45e+14], 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 -1.45 \cdot 10^{+14}:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -1.45e14Initial program 56.2%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6469.6
Applied rewrites69.6%
if -1.45e14 < x Initial program 74.7%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6456.8
Applied rewrites56.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.45e+14) (/ y (* x x)) (/ x (* y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.45e+14) {
tmp = y / (x * x);
} else {
tmp = x / (y * 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.45d+14)) then
tmp = y / (x * x)
else
tmp = x / (y * y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -1.45e+14) {
tmp = y / (x * x);
} else {
tmp = x / (y * y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -1.45e+14: tmp = y / (x * x) else: tmp = x / (y * y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.45e+14) tmp = Float64(y / Float64(x * x)); else tmp = Float64(x / Float64(y * y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -1.45e+14)
tmp = y / (x * x);
else
tmp = x / (y * 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.45e+14], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.45 \cdot 10^{+14}:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if x < -1.45e14Initial program 56.2%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6469.6
Applied rewrites69.6%
if -1.45e14 < x Initial program 74.7%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6441.8
Applied rewrites41.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ x (* y y)))
assert(x < y);
double code(double x, double y) {
return x / (y * 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 * y)
end function
assert x < y;
public static double code(double x, double y) {
return x / (y * y);
}
[x, y] = sort([x, y]) def code(x, y): return x / (y * y)
x, y = sort([x, y]) function code(x, y) return Float64(x / Float64(y * y)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = x / (y * y);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{x}{y \cdot y}
\end{array}
Initial program 70.6%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6438.5
Applied rewrites38.5%
(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 2024248
(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))))