
(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 17 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 (* (/ x (+ y x)) (/ (/ y (+ 1.0 (+ y x))) (+ y x))))
assert(x < y);
double code(double x, double y) {
return (x / (y + x)) * ((y / (1.0 + (y + 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 = (x / (y + x)) * ((y / (1.0d0 + (y + x))) / (y + x))
end function
assert x < y;
public static double code(double x, double y) {
return (x / (y + x)) * ((y / (1.0 + (y + x))) / (y + x));
}
[x, y] = sort([x, y]) def code(x, y): return (x / (y + x)) * ((y / (1.0 + (y + x))) / (y + x))
x, y = sort([x, y]) function code(x, y) return Float64(Float64(x / Float64(y + x)) * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = (x / (y + x)) * ((y / (1.0 + (y + x))) / (y + x));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{x}{y + x} \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}
\end{array}
Initial program 68.2%
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%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ (* 1.0 x) (* (+ (+ y x) 1.0) (+ y x)))) (t_1 (+ 1.0 (+ y x))))
(if (<= y 2.3e-190)
(* 1.0 (/ (/ y t_1) (+ y x)))
(if (<= y 1.5e-176)
t_0
(if (<= y 102000000.0)
(/ (* x y) (* (+ y x) (* t_1 (+ y x))))
(if (<= y 1e+140) t_0 (* (/ x (+ y x)) (pow y -1.0))))))))assert(x < y);
double code(double x, double y) {
double t_0 = (1.0 * x) / (((y + x) + 1.0) * (y + x));
double t_1 = 1.0 + (y + x);
double tmp;
if (y <= 2.3e-190) {
tmp = 1.0 * ((y / t_1) / (y + x));
} else if (y <= 1.5e-176) {
tmp = t_0;
} else if (y <= 102000000.0) {
tmp = (x * y) / ((y + x) * (t_1 * (y + x)));
} else if (y <= 1e+140) {
tmp = t_0;
} else {
tmp = (x / (y + x)) * pow(y, -1.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) :: t_1
real(8) :: tmp
t_0 = (1.0d0 * x) / (((y + x) + 1.0d0) * (y + x))
t_1 = 1.0d0 + (y + x)
if (y <= 2.3d-190) then
tmp = 1.0d0 * ((y / t_1) / (y + x))
else if (y <= 1.5d-176) then
tmp = t_0
else if (y <= 102000000.0d0) then
tmp = (x * y) / ((y + x) * (t_1 * (y + x)))
else if (y <= 1d+140) then
tmp = t_0
else
tmp = (x / (y + x)) * (y ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = (1.0 * x) / (((y + x) + 1.0) * (y + x));
double t_1 = 1.0 + (y + x);
double tmp;
if (y <= 2.3e-190) {
tmp = 1.0 * ((y / t_1) / (y + x));
} else if (y <= 1.5e-176) {
tmp = t_0;
} else if (y <= 102000000.0) {
tmp = (x * y) / ((y + x) * (t_1 * (y + x)));
} else if (y <= 1e+140) {
tmp = t_0;
} else {
tmp = (x / (y + x)) * Math.pow(y, -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = (1.0 * x) / (((y + x) + 1.0) * (y + x)) t_1 = 1.0 + (y + x) tmp = 0 if y <= 2.3e-190: tmp = 1.0 * ((y / t_1) / (y + x)) elif y <= 1.5e-176: tmp = t_0 elif y <= 102000000.0: tmp = (x * y) / ((y + x) * (t_1 * (y + x))) elif y <= 1e+140: tmp = t_0 else: tmp = (x / (y + x)) * math.pow(y, -1.0) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(Float64(1.0 * x) / Float64(Float64(Float64(y + x) + 1.0) * Float64(y + x))) t_1 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= 2.3e-190) tmp = Float64(1.0 * Float64(Float64(y / t_1) / Float64(y + x))); elseif (y <= 1.5e-176) tmp = t_0; elseif (y <= 102000000.0) tmp = Float64(Float64(x * y) / Float64(Float64(y + x) * Float64(t_1 * Float64(y + x)))); elseif (y <= 1e+140) tmp = t_0; else tmp = Float64(Float64(x / Float64(y + x)) * (y ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = (1.0 * x) / (((y + x) + 1.0) * (y + x));
t_1 = 1.0 + (y + x);
tmp = 0.0;
if (y <= 2.3e-190)
tmp = 1.0 * ((y / t_1) / (y + x));
elseif (y <= 1.5e-176)
tmp = t_0;
elseif (y <= 102000000.0)
tmp = (x * y) / ((y + x) * (t_1 * (y + x)));
elseif (y <= 1e+140)
tmp = t_0;
else
tmp = (x / (y + x)) * (y ^ -1.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[(N[(1.0 * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 2.3e-190], N[(1.0 * N[(N[(y / t$95$1), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.5e-176], t$95$0, If[LessEqual[y, 102000000.0], N[(N[(x * y), $MachinePrecision] / N[(N[(y + x), $MachinePrecision] * N[(t$95$1 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1e+140], t$95$0, N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{1 \cdot x}{\left(\left(y + x\right) + 1\right) \cdot \left(y + x\right)}\\
t_1 := 1 + \left(y + x\right)\\
\mathbf{if}\;y \leq 2.3 \cdot 10^{-190}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_1}}{y + x}\\
\mathbf{elif}\;y \leq 1.5 \cdot 10^{-176}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq 102000000:\\
\;\;\;\;\frac{x \cdot y}{\left(y + x\right) \cdot \left(t\_1 \cdot \left(y + x\right)\right)}\\
\mathbf{elif}\;y \leq 10^{+140}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < 2.29999999999999992e-190Initial program 62.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%
Taylor expanded in x around inf
Applied rewrites57.9%
if 2.29999999999999992e-190 < y < 1.5e-176 or 1.02e8 < y < 1.00000000000000006e140Initial program 69.4%
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.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.5
Applied rewrites99.5%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6494.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6494.5
Applied rewrites94.5%
Taylor expanded in x around 0
Applied rewrites89.0%
if 1.5e-176 < y < 1.02e8Initial program 97.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6497.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.0
Applied rewrites97.0%
if 1.00000000000000006e140 < y Initial program 57.7%
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-/.f6491.4
Applied rewrites91.4%
Final simplification72.3%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ (* 1.0 x) (* (+ (+ y x) 1.0) (+ y x)))))
(if (<= y 2.3e-190)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= y 1.5e-176)
t_0
(if (<= y 102000000.0)
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0)))
(if (<= y 1e+140) t_0 (* (/ x (+ y x)) (pow y -1.0))))))))assert(x < y);
double code(double x, double y) {
double t_0 = (1.0 * x) / (((y + x) + 1.0) * (y + x));
double tmp;
if (y <= 2.3e-190) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 1.5e-176) {
tmp = t_0;
} else if (y <= 102000000.0) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else if (y <= 1e+140) {
tmp = t_0;
} else {
tmp = (x / (y + x)) * pow(y, -1.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 = (1.0d0 * x) / (((y + x) + 1.0d0) * (y + x))
if (y <= 2.3d-190) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (y <= 1.5d-176) then
tmp = t_0
else if (y <= 102000000.0d0) then
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
else if (y <= 1d+140) then
tmp = t_0
else
tmp = (x / (y + x)) * (y ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = (1.0 * x) / (((y + x) + 1.0) * (y + x));
double tmp;
if (y <= 2.3e-190) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 1.5e-176) {
tmp = t_0;
} else if (y <= 102000000.0) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else if (y <= 1e+140) {
tmp = t_0;
} else {
tmp = (x / (y + x)) * Math.pow(y, -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = (1.0 * x) / (((y + x) + 1.0) * (y + x)) tmp = 0 if y <= 2.3e-190: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif y <= 1.5e-176: tmp = t_0 elif y <= 102000000.0: tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)) elif y <= 1e+140: tmp = t_0 else: tmp = (x / (y + x)) * math.pow(y, -1.0) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(Float64(1.0 * x) / Float64(Float64(Float64(y + x) + 1.0) * Float64(y + x))) tmp = 0.0 if (y <= 2.3e-190) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (y <= 1.5e-176) tmp = t_0; elseif (y <= 102000000.0) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))); elseif (y <= 1e+140) tmp = t_0; else tmp = Float64(Float64(x / Float64(y + x)) * (y ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = (1.0 * x) / (((y + x) + 1.0) * (y + x));
tmp = 0.0;
if (y <= 2.3e-190)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (y <= 1.5e-176)
tmp = t_0;
elseif (y <= 102000000.0)
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
elseif (y <= 1e+140)
tmp = t_0;
else
tmp = (x / (y + x)) * (y ^ -1.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[(N[(1.0 * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 2.3e-190], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.5e-176], t$95$0, If[LessEqual[y, 102000000.0], 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], If[LessEqual[y, 1e+140], t$95$0, N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{1 \cdot x}{\left(\left(y + x\right) + 1\right) \cdot \left(y + x\right)}\\
\mathbf{if}\;y \leq 2.3 \cdot 10^{-190}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;y \leq 1.5 \cdot 10^{-176}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq 102000000:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}\\
\mathbf{elif}\;y \leq 10^{+140}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < 2.29999999999999992e-190Initial program 62.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%
Taylor expanded in x around inf
Applied rewrites57.9%
if 2.29999999999999992e-190 < y < 1.5e-176 or 1.02e8 < y < 1.00000000000000006e140Initial program 69.4%
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.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.5
Applied rewrites99.5%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6494.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6494.5
Applied rewrites94.5%
Taylor expanded in x around 0
Applied rewrites89.0%
if 1.5e-176 < y < 1.02e8Initial program 97.0%
if 1.00000000000000006e140 < y Initial program 57.7%
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-/.f6491.4
Applied rewrites91.4%
Final simplification72.3%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y -3.1e+27)
(* 1.0 (/ (/ y (+ y x)) (+ y x)))
(if (<= y 2.3e-190)
(/ y (fma x x x))
(if (<= y 1e+140)
(/ (* 1.0 x) (* (+ (+ y x) 1.0) (+ y x)))
(* (/ x (+ y x)) (pow y -1.0))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -3.1e+27) {
tmp = 1.0 * ((y / (y + x)) / (y + x));
} else if (y <= 2.3e-190) {
tmp = y / fma(x, x, x);
} else if (y <= 1e+140) {
tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x));
} else {
tmp = (x / (y + x)) * pow(y, -1.0);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -3.1e+27) tmp = Float64(1.0 * Float64(Float64(y / Float64(y + x)) / Float64(y + x))); elseif (y <= 2.3e-190) tmp = Float64(y / fma(x, x, x)); elseif (y <= 1e+140) tmp = Float64(Float64(1.0 * x) / Float64(Float64(Float64(y + x) + 1.0) * Float64(y + x))); else tmp = Float64(Float64(x / Float64(y + 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_] := If[LessEqual[y, -3.1e+27], N[(1.0 * N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.3e-190], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1e+140], N[(N[(1.0 * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.1 \cdot 10^{+27}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{y + x}}{y + x}\\
\mathbf{elif}\;y \leq 2.3 \cdot 10^{-190}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 10^{+140}:\\
\;\;\;\;\frac{1 \cdot x}{\left(\left(y + x\right) + 1\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < -3.09999999999999996e27Initial program 46.3%
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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Taylor expanded in x around inf
Applied rewrites29.0%
if -3.09999999999999996e27 < y < 2.29999999999999992e-190Initial program 73.9%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6477.1
Applied rewrites77.1%
if 2.29999999999999992e-190 < y < 1.00000000000000006e140Initial program 83.7%
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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6497.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.2
Applied rewrites97.2%
Taylor expanded in x around 0
Applied rewrites69.0%
if 1.00000000000000006e140 < y Initial program 57.7%
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-/.f6491.4
Applied rewrites91.4%
Final simplification65.3%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y -3.2e+27)
(/ (/ y x) x)
(if (<= y 2.3e-190)
(/ y (fma x x x))
(if (<= y 1e+140)
(/ (* 1.0 x) (* (+ (+ y x) 1.0) (+ y x)))
(* (/ x (+ y x)) (pow y -1.0))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -3.2e+27) {
tmp = (y / x) / x;
} else if (y <= 2.3e-190) {
tmp = y / fma(x, x, x);
} else if (y <= 1e+140) {
tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x));
} else {
tmp = (x / (y + x)) * pow(y, -1.0);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -3.2e+27) tmp = Float64(Float64(y / x) / x); elseif (y <= 2.3e-190) tmp = Float64(y / fma(x, x, x)); elseif (y <= 1e+140) tmp = Float64(Float64(1.0 * x) / Float64(Float64(Float64(y + x) + 1.0) * Float64(y + x))); else tmp = Float64(Float64(x / Float64(y + 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_] := If[LessEqual[y, -3.2e+27], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 2.3e-190], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1e+140], N[(N[(1.0 * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.2 \cdot 10^{+27}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 2.3 \cdot 10^{-190}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 10^{+140}:\\
\;\;\;\;\frac{1 \cdot x}{\left(\left(y + x\right) + 1\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < -3.20000000000000015e27Initial program 46.3%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6425.6
Applied rewrites25.6%
if -3.20000000000000015e27 < y < 2.29999999999999992e-190Initial program 73.9%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6477.1
Applied rewrites77.1%
if 2.29999999999999992e-190 < y < 1.00000000000000006e140Initial program 83.7%
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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6497.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.2
Applied rewrites97.2%
Taylor expanded in x around 0
Applied rewrites69.0%
if 1.00000000000000006e140 < y Initial program 57.7%
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-/.f6491.4
Applied rewrites91.4%
Final simplification64.5%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y 2.3e-190)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= y 1e+140)
(/ (* 1.0 x) (* (+ (+ y x) 1.0) (+ y x)))
(* (/ x (+ y x)) (pow y -1.0)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 2.3e-190) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 1e+140) {
tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x));
} else {
tmp = (x / (y + x)) * pow(y, -1.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) :: tmp
if (y <= 2.3d-190) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (y <= 1d+140) then
tmp = (1.0d0 * x) / (((y + x) + 1.0d0) * (y + x))
else
tmp = (x / (y + x)) * (y ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 2.3e-190) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 1e+140) {
tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x));
} else {
tmp = (x / (y + x)) * Math.pow(y, -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 2.3e-190: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif y <= 1e+140: tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x)) else: tmp = (x / (y + x)) * math.pow(y, -1.0) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 2.3e-190) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (y <= 1e+140) tmp = Float64(Float64(1.0 * x) / Float64(Float64(Float64(y + x) + 1.0) * Float64(y + x))); else tmp = Float64(Float64(x / Float64(y + x)) * (y ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 2.3e-190)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (y <= 1e+140)
tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x));
else
tmp = (x / (y + x)) * (y ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 2.3e-190], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1e+140], N[(N[(1.0 * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.3 \cdot 10^{-190}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;y \leq 10^{+140}:\\
\;\;\;\;\frac{1 \cdot x}{\left(\left(y + x\right) + 1\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < 2.29999999999999992e-190Initial program 62.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%
Taylor expanded in x around inf
Applied rewrites57.9%
if 2.29999999999999992e-190 < y < 1.00000000000000006e140Initial program 83.7%
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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6497.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.2
Applied rewrites97.2%
Taylor expanded in x around 0
Applied rewrites69.0%
if 1.00000000000000006e140 < y Initial program 57.7%
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-/.f6491.4
Applied rewrites91.4%
Final simplification65.4%
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 2.3e-190)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= y 1.5e-176)
(/ (* 1.0 x) (* (+ (+ y x) 1.0) (+ y x)))
(if (<= y 5.2e+14)
(/ (* x y) (* (+ y x) (* t_0 (+ y x))))
(* (/ x y) (/ (/ y (+ y x)) (+ y x))))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= 2.3e-190) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 1.5e-176) {
tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x));
} else if (y <= 5.2e+14) {
tmp = (x * y) / ((y + x) * (t_0 * (y + x)));
} else {
tmp = (x / y) * ((y / (y + x)) / (y + 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 (y <= 2.3d-190) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (y <= 1.5d-176) then
tmp = (1.0d0 * x) / (((y + x) + 1.0d0) * (y + x))
else if (y <= 5.2d+14) then
tmp = (x * y) / ((y + x) * (t_0 * (y + x)))
else
tmp = (x / y) * ((y / (y + x)) / (y + 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 (y <= 2.3e-190) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 1.5e-176) {
tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x));
} else if (y <= 5.2e+14) {
tmp = (x * y) / ((y + x) * (t_0 * (y + x)));
} else {
tmp = (x / y) * ((y / (y + x)) / (y + x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if y <= 2.3e-190: tmp = 1.0 * ((y / t_0) / (y + x)) elif y <= 1.5e-176: tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x)) elif y <= 5.2e+14: tmp = (x * y) / ((y + x) * (t_0 * (y + x))) else: tmp = (x / y) * ((y / (y + x)) / (y + x)) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= 2.3e-190) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (y <= 1.5e-176) tmp = Float64(Float64(1.0 * x) / Float64(Float64(Float64(y + x) + 1.0) * Float64(y + x))); elseif (y <= 5.2e+14) tmp = Float64(Float64(x * y) / Float64(Float64(y + x) * Float64(t_0 * Float64(y + x)))); else tmp = Float64(Float64(x / y) * Float64(Float64(y / Float64(y + x)) / Float64(y + 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 (y <= 2.3e-190)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (y <= 1.5e-176)
tmp = (1.0 * x) / (((y + x) + 1.0) * (y + x));
elseif (y <= 5.2e+14)
tmp = (x * y) / ((y + x) * (t_0 * (y + x)));
else
tmp = (x / y) * ((y / (y + x)) / (y + 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[y, 2.3e-190], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.5e-176], N[(N[(1.0 * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 5.2e+14], N[(N[(x * y), $MachinePrecision] / N[(N[(y + x), $MachinePrecision] * N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $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 2.3 \cdot 10^{-190}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;y \leq 1.5 \cdot 10^{-176}:\\
\;\;\;\;\frac{1 \cdot x}{\left(\left(y + x\right) + 1\right) \cdot \left(y + x\right)}\\
\mathbf{elif}\;y \leq 5.2 \cdot 10^{+14}:\\
\;\;\;\;\frac{x \cdot y}{\left(y + x\right) \cdot \left(t\_0 \cdot \left(y + x\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y} \cdot \frac{\frac{y}{y + x}}{y + x}\\
\end{array}
\end{array}
if y < 2.29999999999999992e-190Initial program 62.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%
Taylor expanded in x around inf
Applied rewrites57.9%
if 2.29999999999999992e-190 < y < 1.5e-176Initial program 24.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%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.2
Applied rewrites99.2%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6499.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.2
Applied rewrites99.2%
Taylor expanded in x around 0
Applied rewrites75.5%
if 1.5e-176 < y < 5.2e14Initial program 97.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f6497.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6497.2
Applied rewrites97.2%
if 5.2e14 < y Initial program 64.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.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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Taylor expanded in y around inf
lower-/.f6492.1
Applied rewrites92.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ y (+ y x))))
(if (<= y 1.85e+126)
(/ (* t_0 x) (* (+ (+ y x) 1.0) (+ y x)))
(* (/ x y) (/ t_0 (+ y x))))))assert(x < y);
double code(double x, double y) {
double t_0 = y / (y + x);
double tmp;
if (y <= 1.85e+126) {
tmp = (t_0 * x) / (((y + x) + 1.0) * (y + x));
} else {
tmp = (x / y) * (t_0 / (y + 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 = y / (y + x)
if (y <= 1.85d+126) then
tmp = (t_0 * x) / (((y + x) + 1.0d0) * (y + x))
else
tmp = (x / y) * (t_0 / (y + x))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = y / (y + x);
double tmp;
if (y <= 1.85e+126) {
tmp = (t_0 * x) / (((y + x) + 1.0) * (y + x));
} else {
tmp = (x / y) * (t_0 / (y + x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = y / (y + x) tmp = 0 if y <= 1.85e+126: tmp = (t_0 * x) / (((y + x) + 1.0) * (y + x)) else: tmp = (x / y) * (t_0 / (y + x)) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(y / Float64(y + x)) tmp = 0.0 if (y <= 1.85e+126) tmp = Float64(Float64(t_0 * x) / Float64(Float64(Float64(y + x) + 1.0) * Float64(y + x))); else tmp = Float64(Float64(x / y) * Float64(t_0 / Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = y / (y + x);
tmp = 0.0;
if (y <= 1.85e+126)
tmp = (t_0 * x) / (((y + x) + 1.0) * (y + x));
else
tmp = (x / y) * (t_0 / (y + 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[(y / N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 1.85e+126], N[(N[(t$95$0 * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] + 1.0), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * N[(t$95$0 / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{y}{y + x}\\
\mathbf{if}\;y \leq 1.85 \cdot 10^{+126}:\\
\;\;\;\;\frac{t\_0 \cdot x}{\left(\left(y + x\right) + 1\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y} \cdot \frac{t\_0}{y + x}\\
\end{array}
\end{array}
if y < 1.8499999999999999e126Initial program 69.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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-timesN/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lower-*.f6495.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6495.7
Applied rewrites95.7%
if 1.8499999999999999e126 < y Initial program 58.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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
Taylor expanded in y around inf
lower-/.f6494.9
Applied rewrites94.9%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ y (+ y x))))
(if (<= y 1.85e+126)
(* t_0 (/ x (* (+ 1.0 (+ y x)) (+ y x))))
(* (/ x y) (/ t_0 (+ y x))))))assert(x < y);
double code(double x, double y) {
double t_0 = y / (y + x);
double tmp;
if (y <= 1.85e+126) {
tmp = t_0 * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / y) * (t_0 / (y + 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 = y / (y + x)
if (y <= 1.85d+126) then
tmp = t_0 * (x / ((1.0d0 + (y + x)) * (y + x)))
else
tmp = (x / y) * (t_0 / (y + x))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = y / (y + x);
double tmp;
if (y <= 1.85e+126) {
tmp = t_0 * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / y) * (t_0 / (y + x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = y / (y + x) tmp = 0 if y <= 1.85e+126: tmp = t_0 * (x / ((1.0 + (y + x)) * (y + x))) else: tmp = (x / y) * (t_0 / (y + x)) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(y / Float64(y + x)) tmp = 0.0 if (y <= 1.85e+126) tmp = Float64(t_0 * Float64(x / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x)))); else tmp = Float64(Float64(x / y) * Float64(t_0 / Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = y / (y + x);
tmp = 0.0;
if (y <= 1.85e+126)
tmp = t_0 * (x / ((1.0 + (y + x)) * (y + x)));
else
tmp = (x / y) * (t_0 / (y + 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[(y / N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 1.85e+126], N[(t$95$0 * N[(x / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * N[(t$95$0 / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{y}{y + x}\\
\mathbf{if}\;y \leq 1.85 \cdot 10^{+126}:\\
\;\;\;\;t\_0 \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y} \cdot \frac{t\_0}{y + x}\\
\end{array}
\end{array}
if y < 1.8499999999999999e126Initial program 69.8%
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-*.f6495.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6495.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6495.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6495.7
Applied rewrites95.7%
if 1.8499999999999999e126 < y Initial program 58.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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
Taylor expanded in y around inf
lower-/.f6494.9
Applied rewrites94.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (* (/ x (+ 1.0 (+ y x))) (/ (/ y (+ y x)) (+ y x))))
assert(x < y);
double code(double x, double y) {
return (x / (1.0 + (y + x))) * ((y / (y + 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 = (x / (1.0d0 + (y + x))) * ((y / (y + x)) / (y + x))
end function
assert x < y;
public static double code(double x, double y) {
return (x / (1.0 + (y + x))) * ((y / (y + x)) / (y + x));
}
[x, y] = sort([x, y]) def code(x, y): return (x / (1.0 + (y + x))) * ((y / (y + x)) / (y + x))
x, y = sort([x, y]) function code(x, y) return Float64(Float64(x / Float64(1.0 + Float64(y + x))) * Float64(Float64(y / Float64(y + x)) / Float64(y + x))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = (x / (1.0 + (y + x))) * ((y / (y + x)) / (y + x));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(x / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{x}{1 + \left(y + x\right)} \cdot \frac{\frac{y}{y + x}}{y + x}
\end{array}
Initial program 68.2%
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
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
*-commutativeN/A
associate-/r*N/A
times-fracN/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y -3.2e+27)
(/ (/ y x) x)
(if (<= y 1.95e-31)
(/ y (fma x x x))
(if (<= y 2e+39) (/ x (fma y y y)) (/ (/ x y) y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -3.2e+27) {
tmp = (y / x) / x;
} else if (y <= 1.95e-31) {
tmp = y / fma(x, x, x);
} else if (y <= 2e+39) {
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 (y <= -3.2e+27) tmp = Float64(Float64(y / x) / x); elseif (y <= 1.95e-31) tmp = Float64(y / fma(x, x, x)); elseif (y <= 2e+39) 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[y, -3.2e+27], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 1.95e-31], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2e+39], 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}\;y \leq -3.2 \cdot 10^{+27}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 1.95 \cdot 10^{-31}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 2 \cdot 10^{+39}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < -3.20000000000000015e27Initial program 46.3%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6425.6
Applied rewrites25.6%
if -3.20000000000000015e27 < y < 1.9500000000000001e-31Initial program 78.3%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6476.4
Applied rewrites76.4%
if 1.9500000000000001e-31 < y < 1.99999999999999988e39Initial program 88.5%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6460.0
Applied rewrites60.0%
if 1.99999999999999988e39 < y Initial program 63.1%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6487.9
Applied rewrites87.9%
Final simplification65.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y -3.2e+27) (/ (/ y x) x) (if (<= y 1.95e-31) (/ y (fma x x x)) (/ (/ x (+ 1.0 y)) y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -3.2e+27) {
tmp = (y / x) / x;
} else if (y <= 1.95e-31) {
tmp = y / fma(x, x, x);
} else {
tmp = (x / (1.0 + y)) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -3.2e+27) tmp = Float64(Float64(y / x) / x); elseif (y <= 1.95e-31) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(Float64(x / Float64(1.0 + 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[y, -3.2e+27], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 1.95e-31], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.2 \cdot 10^{+27}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 1.95 \cdot 10^{-31}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{y}\\
\end{array}
\end{array}
if y < -3.20000000000000015e27Initial program 46.3%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6425.6
Applied rewrites25.6%
if -3.20000000000000015e27 < y < 1.9500000000000001e-31Initial program 78.3%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6476.4
Applied rewrites76.4%
if 1.9500000000000001e-31 < y Initial program 69.0%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6478.6
Applied rewrites78.6%
Applied rewrites81.4%
Final simplification65.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 1.95e-31) (/ y (fma x x x)) (if (<= y 2e+39) (/ x (fma y y y)) (/ (/ x y) y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1.95e-31) {
tmp = y / fma(x, x, x);
} else if (y <= 2e+39) {
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 (y <= 1.95e-31) tmp = Float64(y / fma(x, x, x)); elseif (y <= 2e+39) 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[y, 1.95e-31], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2e+39], 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}\;y \leq 1.95 \cdot 10^{-31}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 2 \cdot 10^{+39}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < 1.9500000000000001e-31Initial program 67.8%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6459.3
Applied rewrites59.3%
if 1.9500000000000001e-31 < y < 1.99999999999999988e39Initial program 88.5%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6460.0
Applied rewrites60.0%
if 1.99999999999999988e39 < y Initial program 63.1%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6487.9
Applied rewrites87.9%
Final simplification65.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 1.95e-31) (/ y (fma x x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1.95e-31) {
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 (y <= 1.95e-31) 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[y, 1.95e-31], 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}\;y \leq 1.95 \cdot 10^{-31}:\\
\;\;\;\;\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 y < 1.9500000000000001e-31Initial program 67.8%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6459.3
Applied rewrites59.3%
if 1.9500000000000001e-31 < y Initial program 69.0%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6478.6
Applied rewrites78.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 -1.1e+19) (/ y (* x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.1e+19) {
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.1e+19) 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.1e+19], 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.1 \cdot 10^{+19}:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -1.1e19Initial program 47.2%
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 x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6472.5
Applied rewrites72.5%
if -1.1e19 < 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.f6459.4
Applied rewrites59.4%
Final simplification62.5%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.1e+19) (/ y (* x x)) (/ x (* y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.1e+19) {
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.1d+19)) 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.1e+19) {
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.1e+19: 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.1e+19) 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.1e+19)
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.1e+19], 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.1 \cdot 10^{+19}:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if x < -1.1e19Initial program 47.2%
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 x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6472.5
Applied rewrites72.5%
if -1.1e19 < x Initial program 74.7%
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 inf
lower-/.f64N/A
unpow2N/A
lower-*.f6443.7
Applied rewrites43.7%
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 68.2%
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 inf
lower-/.f64N/A
unpow2N/A
lower-*.f6440.1
Applied rewrites40.1%
(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 2024339
(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))))