
(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 19 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 68.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%
Final simplification99.9%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= y 3.3e-165)
(/ (/ y t_0) (fma 2.0 y x))
(if (<= y 9e-106)
(/ (* 1.0 x) (* t_0 (+ y x)))
(if (<= y 5.5e+40)
(/ (* y x) (* (* (+ y x) (+ y x)) t_0))
(* (/ 1.0 y) (/ x (+ y x))))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= 3.3e-165) {
tmp = (y / t_0) / fma(2.0, y, x);
} else if (y <= 9e-106) {
tmp = (1.0 * x) / (t_0 * (y + x));
} else if (y <= 5.5e+40) {
tmp = (y * x) / (((y + x) * (y + x)) * t_0);
} else {
tmp = (1.0 / 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 <= 3.3e-165) tmp = Float64(Float64(y / t_0) / fma(2.0, y, x)); elseif (y <= 9e-106) tmp = Float64(Float64(1.0 * x) / Float64(t_0 * Float64(y + x))); elseif (y <= 5.5e+40) tmp = Float64(Float64(y * x) / Float64(Float64(Float64(y + x) * Float64(y + x)) * t_0)); else tmp = Float64(Float64(1.0 / y) * Float64(x / Float64(y + x))); 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, 3.3e-165], N[(N[(y / t$95$0), $MachinePrecision] / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9e-106], N[(N[(1.0 * x), $MachinePrecision] / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 5.5e+40], N[(N[(y * x), $MachinePrecision] / N[(N[(N[(y + x), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * N[(x / 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 3.3 \cdot 10^{-165}:\\
\;\;\;\;\frac{\frac{y}{t\_0}}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;y \leq 9 \cdot 10^{-106}:\\
\;\;\;\;\frac{1 \cdot x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{elif}\;y \leq 5.5 \cdot 10^{+40}:\\
\;\;\;\;\frac{y \cdot x}{\left(\left(y + x\right) \cdot \left(y + x\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if y < 3.2999999999999998e-165Initial program 69.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.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
lift-/.f64N/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6459.0
Applied rewrites59.0%
if 3.2999999999999998e-165 < y < 8.99999999999999911e-106Initial program 61.1%
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-*.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 x around 0
Applied rewrites71.9%
if 8.99999999999999911e-106 < y < 5.49999999999999974e40Initial program 96.2%
if 5.49999999999999974e40 < y Initial program 53.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.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-/.f6484.4
Applied rewrites84.4%
Final simplification69.3%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ x (+ y x))))
(if (<= y 5e-140)
(* (/ (/ y (+ 1.0 x)) (+ y x)) t_0)
(if (<= y 2.5e+159)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) t_0)
(* (/ 1.0 y) t_0)))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (y + x);
double tmp;
if (y <= 5e-140) {
tmp = ((y / (1.0 + x)) / (y + x)) * t_0;
} else if (y <= 2.5e+159) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
} else {
tmp = (1.0 / y) * t_0;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = x / (y + x)
if (y <= 5d-140) then
tmp = ((y / (1.0d0 + x)) / (y + x)) * t_0
else if (y <= 2.5d+159) then
tmp = (y / ((1.0d0 + (y + x)) * (y + x))) * t_0
else
tmp = (1.0d0 / y) * t_0
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = x / (y + x);
double tmp;
if (y <= 5e-140) {
tmp = ((y / (1.0 + x)) / (y + x)) * t_0;
} else if (y <= 2.5e+159) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
} else {
tmp = (1.0 / y) * t_0;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y + x) tmp = 0 if y <= 5e-140: tmp = ((y / (1.0 + x)) / (y + x)) * t_0 elif y <= 2.5e+159: tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0 else: tmp = (1.0 / y) * t_0 return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y + x)) tmp = 0.0 if (y <= 5e-140) tmp = Float64(Float64(Float64(y / Float64(1.0 + x)) / Float64(y + x)) * t_0); elseif (y <= 2.5e+159) tmp = Float64(Float64(y / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))) * t_0); else tmp = Float64(Float64(1.0 / y) * t_0); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = x / (y + x);
tmp = 0.0;
if (y <= 5e-140)
tmp = ((y / (1.0 + x)) / (y + x)) * t_0;
elseif (y <= 2.5e+159)
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
else
tmp = (1.0 / y) * t_0;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 5e-140], N[(N[(N[(y / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[y, 2.5e+159], N[(N[(y / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y + x}\\
\mathbf{if}\;y \leq 5 \cdot 10^{-140}:\\
\;\;\;\;\frac{\frac{y}{1 + x}}{y + x} \cdot t\_0\\
\mathbf{elif}\;y \leq 2.5 \cdot 10^{+159}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot t\_0\\
\end{array}
\end{array}
if y < 5.00000000000000015e-140Initial program 68.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 0
lower-+.f6482.4
Applied rewrites82.4%
if 5.00000000000000015e-140 < y < 2.50000000000000002e159Initial program 77.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6496.7
lift-+.f64N/A
+-commutativeN/A
Applied rewrites96.7%
if 2.50000000000000002e159 < y Initial 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.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.1
Applied rewrites91.1%
Final simplification86.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y -2e+76)
(/ (/ y x) x)
(if (<= y 2.5e+159)
(/ (* (/ y (+ y x)) x) (* (+ 1.0 (+ y x)) (+ y x)))
(* (/ 1.0 y) (/ x (+ y x))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -2e+76) {
tmp = (y / x) / x;
} else if (y <= 2.5e+159) {
tmp = ((y / (y + x)) * x) / ((1.0 + (y + x)) * (y + x));
} else {
tmp = (1.0 / 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) :: tmp
if (y <= (-2d+76)) then
tmp = (y / x) / x
else if (y <= 2.5d+159) then
tmp = ((y / (y + x)) * x) / ((1.0d0 + (y + x)) * (y + x))
else
tmp = (1.0d0 / y) * (x / (y + x))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= -2e+76) {
tmp = (y / x) / x;
} else if (y <= 2.5e+159) {
tmp = ((y / (y + x)) * x) / ((1.0 + (y + x)) * (y + x));
} else {
tmp = (1.0 / y) * (x / (y + x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= -2e+76: tmp = (y / x) / x elif y <= 2.5e+159: tmp = ((y / (y + x)) * x) / ((1.0 + (y + x)) * (y + x)) else: tmp = (1.0 / y) * (x / (y + x)) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -2e+76) tmp = Float64(Float64(y / x) / x); elseif (y <= 2.5e+159) tmp = Float64(Float64(Float64(y / Float64(y + x)) * x) / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))); else tmp = Float64(Float64(1.0 / y) * Float64(x / Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= -2e+76)
tmp = (y / x) / x;
elseif (y <= 2.5e+159)
tmp = ((y / (y + x)) * x) / ((1.0 + (y + x)) * (y + x));
else
tmp = (1.0 / 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_] := If[LessEqual[y, -2e+76], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 2.5e+159], N[(N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2 \cdot 10^{+76}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 2.5 \cdot 10^{+159}:\\
\;\;\;\;\frac{\frac{y}{y + x} \cdot x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if y < -2.0000000000000001e76Initial program 65.1%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6411.6
Applied rewrites11.6%
Applied rewrites14.7%
if -2.0000000000000001e76 < y < 2.50000000000000002e159Initial program 72.3%
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-*.f6498.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6498.9
Applied rewrites98.9%
if 2.50000000000000002e159 < y Initial 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.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.1
Applied rewrites91.1%
Final simplification85.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (/ x (+ y x))))
(if (<= y -2e+76)
(/ (/ y x) x)
(if (<= y 2.5e+159)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) t_0)
(* (/ 1.0 y) t_0)))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (y + x);
double tmp;
if (y <= -2e+76) {
tmp = (y / x) / x;
} else if (y <= 2.5e+159) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
} else {
tmp = (1.0 / y) * t_0;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = x / (y + x)
if (y <= (-2d+76)) then
tmp = (y / x) / x
else if (y <= 2.5d+159) then
tmp = (y / ((1.0d0 + (y + x)) * (y + x))) * t_0
else
tmp = (1.0d0 / y) * t_0
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = x / (y + x);
double tmp;
if (y <= -2e+76) {
tmp = (y / x) / x;
} else if (y <= 2.5e+159) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
} else {
tmp = (1.0 / y) * t_0;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y + x) tmp = 0 if y <= -2e+76: tmp = (y / x) / x elif y <= 2.5e+159: tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0 else: tmp = (1.0 / y) * t_0 return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y + x)) tmp = 0.0 if (y <= -2e+76) tmp = Float64(Float64(y / x) / x); elseif (y <= 2.5e+159) tmp = Float64(Float64(y / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))) * t_0); else tmp = Float64(Float64(1.0 / y) * t_0); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = x / (y + x);
tmp = 0.0;
if (y <= -2e+76)
tmp = (y / x) / x;
elseif (y <= 2.5e+159)
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
else
tmp = (1.0 / y) * t_0;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2e+76], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 2.5e+159], N[(N[(y / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y + x}\\
\mathbf{if}\;y \leq -2 \cdot 10^{+76}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 2.5 \cdot 10^{+159}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot t\_0\\
\end{array}
\end{array}
if y < -2.0000000000000001e76Initial program 65.1%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6411.6
Applied rewrites11.6%
Applied rewrites14.7%
if -2.0000000000000001e76 < y < 2.50000000000000002e159Initial program 72.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6498.9
lift-+.f64N/A
+-commutativeN/A
Applied rewrites98.9%
if 2.50000000000000002e159 < y Initial 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.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.1
Applied rewrites91.1%
Final simplification85.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y -1.4e+76)
(/ (/ y x) x)
(if (<= y 3.6e+15)
(/ y (* (+ (+ 1.0 y) x) (fma (+ 2.0 (/ y x)) y x)))
(* (/ 1.0 y) (/ x (+ y x))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -1.4e+76) {
tmp = (y / x) / x;
} else if (y <= 3.6e+15) {
tmp = y / (((1.0 + y) + x) * fma((2.0 + (y / x)), y, x));
} else {
tmp = (1.0 / y) * (x / (y + x));
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -1.4e+76) tmp = Float64(Float64(y / x) / x); elseif (y <= 3.6e+15) tmp = Float64(y / Float64(Float64(Float64(1.0 + y) + x) * fma(Float64(2.0 + Float64(y / x)), y, x))); else tmp = Float64(Float64(1.0 / y) * Float64(x / Float64(y + x))); 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.4e+76], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 3.6e+15], N[(y / N[(N[(N[(1.0 + y), $MachinePrecision] + x), $MachinePrecision] * N[(N[(2.0 + N[(y / x), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.4 \cdot 10^{+76}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 3.6 \cdot 10^{+15}:\\
\;\;\;\;\frac{y}{\left(\left(1 + y\right) + x\right) \cdot \mathsf{fma}\left(2 + \frac{y}{x}, y, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if y < -1.3999999999999999e76Initial program 65.1%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6411.6
Applied rewrites11.6%
Applied rewrites14.7%
if -1.3999999999999999e76 < y < 3.6e15Initial program 73.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%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Taylor expanded in y around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-*.f6499.1
lift-+.f64N/A
lift-+.f64N/A
associate-+r+N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites99.1%
if 3.6e15 < y Initial program 56.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.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-/.f6482.2
Applied rewrites82.2%
Final simplification82.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -5800.0)
(/ (/ y (+ 1.0 (+ y x))) (fma 2.0 y x))
(if (<= x 1.32e-45)
(/ (* (/ y (+ y x)) x) (* (+ 1.0 y) (+ y x)))
(* (/ 1.0 y) (/ x (+ y x))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -5800.0) {
tmp = (y / (1.0 + (y + x))) / fma(2.0, y, x);
} else if (x <= 1.32e-45) {
tmp = ((y / (y + x)) * x) / ((1.0 + y) * (y + x));
} else {
tmp = (1.0 / y) * (x / (y + x));
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -5800.0) tmp = Float64(Float64(y / Float64(1.0 + Float64(y + x))) / fma(2.0, y, x)); elseif (x <= 1.32e-45) tmp = Float64(Float64(Float64(y / Float64(y + x)) * x) / Float64(Float64(1.0 + y) * Float64(y + x))); else tmp = Float64(Float64(1.0 / y) * Float64(x / Float64(y + x))); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -5800.0], N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.32e-45], N[(N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / N[(N[(1.0 + y), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5800:\\
\;\;\;\;\frac{\frac{y}{1 + \left(y + x\right)}}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;x \leq 1.32 \cdot 10^{-45}:\\
\;\;\;\;\frac{\frac{y}{y + x} \cdot x}{\left(1 + y\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if x < -5800Initial program 63.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.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
lift-/.f64N/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6477.5
Applied rewrites77.5%
if -5800 < x < 1.32000000000000005e-45Initial program 68.5%
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-*.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 x around 0
lower-+.f6499.9
Applied rewrites99.9%
if 1.32000000000000005e-45 < x Initial program 71.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-/.f6431.7
Applied rewrites31.7%
Final simplification74.0%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ (/ y (+ 1.0 (+ y x))) (fma (+ 2.0 (/ y x)) y x)))
assert(x < y);
double code(double x, double y) {
return (y / (1.0 + (y + x))) / fma((2.0 + (y / x)), y, x);
}
x, y = sort([x, y]) function code(x, y) return Float64(Float64(y / Float64(1.0 + Float64(y + x))) / fma(Float64(2.0 + Float64(y / x)), y, x)) end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + N[(y / x), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{y}{1 + \left(y + x\right)}}{\mathsf{fma}\left(2 + \frac{y}{x}, y, x\right)}
\end{array}
Initial program 68.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%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Taylor expanded in y around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6499.7
Applied rewrites99.7%
Final simplification99.7%
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 3.3e-165)
(/ (/ y t_0) (fma 2.0 y x))
(if (<= y 1.3e+93)
(/ (* 1.0 x) (* t_0 (+ y x)))
(* (/ 1.0 y) (/ x (+ y x)))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= 3.3e-165) {
tmp = (y / t_0) / fma(2.0, y, x);
} else if (y <= 1.3e+93) {
tmp = (1.0 * x) / (t_0 * (y + x));
} else {
tmp = (1.0 / 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 <= 3.3e-165) tmp = Float64(Float64(y / t_0) / fma(2.0, y, x)); elseif (y <= 1.3e+93) tmp = Float64(Float64(1.0 * x) / Float64(t_0 * Float64(y + x))); else tmp = Float64(Float64(1.0 / y) * Float64(x / Float64(y + x))); 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, 3.3e-165], N[(N[(y / t$95$0), $MachinePrecision] / N[(2.0 * y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.3e+93], N[(N[(1.0 * x), $MachinePrecision] / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * N[(x / 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 3.3 \cdot 10^{-165}:\\
\;\;\;\;\frac{\frac{y}{t\_0}}{\mathsf{fma}\left(2, y, x\right)}\\
\mathbf{elif}\;y \leq 1.3 \cdot 10^{+93}:\\
\;\;\;\;\frac{1 \cdot x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if y < 3.2999999999999998e-165Initial program 69.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.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
lift-/.f64N/A
frac-timesN/A
lift-/.f64N/A
clear-numN/A
div-invN/A
clear-numN/A
lift-/.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
Taylor expanded in y around 0
+-commutativeN/A
lower-fma.f6459.0
Applied rewrites59.0%
if 3.2999999999999998e-165 < y < 1.3e93Initial program 85.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-*.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 0
Applied rewrites72.1%
if 1.3e93 < y Initial program 46.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%
Taylor expanded in y around inf
lower-/.f6484.7
Applied rewrites84.7%
Final simplification66.3%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y 3.3e-165)
(/ (/ y (+ 1.0 x)) x)
(if (<= y 1.3e+93)
(/ (* 1.0 x) (* (+ 1.0 (+ y x)) (+ y x)))
(* (/ 1.0 y) (/ x (+ y x))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 3.3e-165) {
tmp = (y / (1.0 + x)) / x;
} else if (y <= 1.3e+93) {
tmp = (1.0 * x) / ((1.0 + (y + x)) * (y + x));
} else {
tmp = (1.0 / 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) :: tmp
if (y <= 3.3d-165) then
tmp = (y / (1.0d0 + x)) / x
else if (y <= 1.3d+93) then
tmp = (1.0d0 * x) / ((1.0d0 + (y + x)) * (y + x))
else
tmp = (1.0d0 / y) * (x / (y + x))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 3.3e-165) {
tmp = (y / (1.0 + x)) / x;
} else if (y <= 1.3e+93) {
tmp = (1.0 * x) / ((1.0 + (y + x)) * (y + x));
} else {
tmp = (1.0 / y) * (x / (y + x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 3.3e-165: tmp = (y / (1.0 + x)) / x elif y <= 1.3e+93: tmp = (1.0 * x) / ((1.0 + (y + x)) * (y + x)) else: tmp = (1.0 / y) * (x / (y + x)) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 3.3e-165) tmp = Float64(Float64(y / Float64(1.0 + x)) / x); elseif (y <= 1.3e+93) tmp = Float64(Float64(1.0 * x) / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))); else tmp = Float64(Float64(1.0 / y) * Float64(x / Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 3.3e-165)
tmp = (y / (1.0 + x)) / x;
elseif (y <= 1.3e+93)
tmp = (1.0 * x) / ((1.0 + (y + x)) * (y + x));
else
tmp = (1.0 / 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_] := If[LessEqual[y, 3.3e-165], N[(N[(y / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 1.3e+93], N[(N[(1.0 * x), $MachinePrecision] / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 3.3 \cdot 10^{-165}:\\
\;\;\;\;\frac{\frac{y}{1 + x}}{x}\\
\mathbf{elif}\;y \leq 1.3 \cdot 10^{+93}:\\
\;\;\;\;\frac{1 \cdot x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if y < 3.2999999999999998e-165Initial program 69.1%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6457.5
Applied rewrites57.5%
Applied rewrites58.2%
if 3.2999999999999998e-165 < y < 1.3e93Initial program 85.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-*.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 0
Applied rewrites72.1%
if 1.3e93 < y Initial program 46.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%
Taylor expanded in y around inf
lower-/.f6484.7
Applied rewrites84.7%
Final simplification65.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 780000000.0) (/ (/ y (+ 1.0 x)) x) (* (/ 1.0 y) (/ x (+ y x)))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 780000000.0) {
tmp = (y / (1.0 + x)) / x;
} else {
tmp = (1.0 / 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) :: tmp
if (y <= 780000000.0d0) then
tmp = (y / (1.0d0 + x)) / x
else
tmp = (1.0d0 / y) * (x / (y + x))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 780000000.0) {
tmp = (y / (1.0 + x)) / x;
} else {
tmp = (1.0 / y) * (x / (y + x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 780000000.0: tmp = (y / (1.0 + x)) / x else: tmp = (1.0 / y) * (x / (y + x)) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 780000000.0) tmp = Float64(Float64(y / Float64(1.0 + x)) / x); else tmp = Float64(Float64(1.0 / y) * Float64(x / Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 780000000.0)
tmp = (y / (1.0 + x)) / x;
else
tmp = (1.0 / 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_] := If[LessEqual[y, 780000000.0], N[(N[(y / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], N[(N[(1.0 / y), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 780000000:\\
\;\;\;\;\frac{\frac{y}{1 + x}}{x}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if y < 7.8e8Initial program 71.4%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6460.0
Applied rewrites60.0%
Applied rewrites60.6%
if 7.8e8 < y Initial program 58.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-/.f6481.1
Applied rewrites81.1%
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 (/ y (* x x))))
(if (<= y -9.2e-220)
t_0
(if (<= y 6e-79) (/ y x) (if (<= y 780000000.0) t_0 (/ x (* y y)))))))assert(x < y);
double code(double x, double y) {
double t_0 = y / (x * x);
double tmp;
if (y <= -9.2e-220) {
tmp = t_0;
} else if (y <= 6e-79) {
tmp = y / x;
} else if (y <= 780000000.0) {
tmp = t_0;
} 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) :: t_0
real(8) :: tmp
t_0 = y / (x * x)
if (y <= (-9.2d-220)) then
tmp = t_0
else if (y <= 6d-79) then
tmp = y / x
else if (y <= 780000000.0d0) then
tmp = t_0
else
tmp = x / (y * y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = y / (x * x);
double tmp;
if (y <= -9.2e-220) {
tmp = t_0;
} else if (y <= 6e-79) {
tmp = y / x;
} else if (y <= 780000000.0) {
tmp = t_0;
} else {
tmp = x / (y * y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = y / (x * x) tmp = 0 if y <= -9.2e-220: tmp = t_0 elif y <= 6e-79: tmp = y / x elif y <= 780000000.0: tmp = t_0 else: tmp = x / (y * y) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(y / Float64(x * x)) tmp = 0.0 if (y <= -9.2e-220) tmp = t_0; elseif (y <= 6e-79) tmp = Float64(y / x); elseif (y <= 780000000.0) tmp = t_0; else tmp = Float64(x / Float64(y * y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = y / (x * x);
tmp = 0.0;
if (y <= -9.2e-220)
tmp = t_0;
elseif (y <= 6e-79)
tmp = y / x;
elseif (y <= 780000000.0)
tmp = t_0;
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_] := Block[{t$95$0 = N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -9.2e-220], t$95$0, If[LessEqual[y, 6e-79], N[(y / x), $MachinePrecision], If[LessEqual[y, 780000000.0], t$95$0, N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{y}{x \cdot x}\\
\mathbf{if}\;y \leq -9.2 \cdot 10^{-220}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq 6 \cdot 10^{-79}:\\
\;\;\;\;\frac{y}{x}\\
\mathbf{elif}\;y \leq 780000000:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if y < -9.19999999999999922e-220 or 5.99999999999999999e-79 < y < 7.8e8Initial program 78.4%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6447.0
Applied rewrites47.0%
if -9.19999999999999922e-220 < y < 5.99999999999999999e-79Initial program 58.4%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6479.2
Applied rewrites79.2%
Taylor expanded in x around 0
Applied rewrites65.3%
if 7.8e8 < y Initial program 58.0%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6475.3
Applied rewrites75.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y -2.25e+64) (/ (/ y x) x) (if (<= y 780000000.0) (/ y (fma x x x)) (/ (/ x y) y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -2.25e+64) {
tmp = (y / x) / x;
} else if (y <= 780000000.0) {
tmp = y / fma(x, x, x);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -2.25e+64) tmp = Float64(Float64(y / x) / x); elseif (y <= 780000000.0) tmp = Float64(y / fma(x, x, x)); 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, -2.25e+64], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 780000000.0], N[(y / N[(x * x + x), $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 -2.25 \cdot 10^{+64}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 780000000:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < -2.24999999999999987e64Initial program 64.4%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6413.5
Applied rewrites13.5%
Applied rewrites16.4%
if -2.24999999999999987e64 < y < 7.8e8Initial program 73.4%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6472.8
Applied rewrites72.8%
if 7.8e8 < y Initial program 58.0%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6475.3
Applied rewrites75.3%
Applied rewrites80.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 780000000.0) (/ (/ y (+ 1.0 x)) x) (/ (/ x y) y)))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 780000000.0) {
tmp = (y / (1.0 + 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 (y <= 780000000.0d0) then
tmp = (y / (1.0d0 + 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 (y <= 780000000.0) {
tmp = (y / (1.0 + x)) / x;
} else {
tmp = (x / y) / y;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 780000000.0: tmp = (y / (1.0 + x)) / x else: tmp = (x / y) / y return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 780000000.0) tmp = Float64(Float64(y / Float64(1.0 + x)) / x); else tmp = Float64(Float64(x / y) / y); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 780000000.0)
tmp = (y / (1.0 + 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[y, 780000000.0], N[(N[(y / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 780000000:\\
\;\;\;\;\frac{\frac{y}{1 + x}}{x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < 7.8e8Initial program 71.4%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6460.0
Applied rewrites60.0%
Applied rewrites60.6%
if 7.8e8 < y Initial program 58.0%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6475.3
Applied rewrites75.3%
Applied rewrites80.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.2) (/ y (* x x)) (if (<= x -2.7e-103) (/ y x) (/ x (fma y y y)))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.2) {
tmp = y / (x * x);
} else if (x <= -2.7e-103) {
tmp = y / 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.2) tmp = Float64(y / Float64(x * x)); elseif (x <= -2.7e-103) tmp = Float64(y / 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.2], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -2.7e-103], N[(y / x), $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.2:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{elif}\;x \leq -2.7 \cdot 10^{-103}:\\
\;\;\;\;\frac{y}{x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -1.19999999999999996Initial program 63.3%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6476.3
Applied rewrites76.3%
if -1.19999999999999996 < x < -2.7000000000000001e-103Initial program 83.1%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6443.3
Applied rewrites43.3%
Taylor expanded in x around 0
Applied rewrites43.3%
if -2.7000000000000001e-103 < x Initial program 68.2%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6457.9
Applied rewrites57.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 780000000.0) (/ y (fma x x x)) (/ (/ x y) y)))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 780000000.0) {
tmp = y / fma(x, x, x);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 780000000.0) tmp = Float64(y / fma(x, x, x)); 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, 780000000.0], N[(y / N[(x * x + x), $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 780000000:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < 7.8e8Initial program 71.4%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6460.0
Applied rewrites60.0%
if 7.8e8 < y Initial program 58.0%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6475.3
Applied rewrites75.3%
Applied rewrites80.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 750000000.0) (/ y (fma x x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 750000000.0) {
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 <= 750000000.0) 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, 750000000.0], 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 750000000:\\
\;\;\;\;\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 < 7.5e8Initial program 71.4%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6460.0
Applied rewrites60.0%
if 7.5e8 < y Initial program 58.0%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6475.8
Applied rewrites75.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 3.9e-26) (/ y x) (/ x (* y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 3.9e-26) {
tmp = y / 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 (y <= 3.9d-26) then
tmp = y / 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 (y <= 3.9e-26) {
tmp = y / x;
} else {
tmp = x / (y * y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 3.9e-26: tmp = y / x else: tmp = x / (y * y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 3.9e-26) tmp = Float64(y / 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 (y <= 3.9e-26)
tmp = y / 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[y, 3.9e-26], N[(y / x), $MachinePrecision], N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 3.9 \cdot 10^{-26}:\\
\;\;\;\;\frac{y}{x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if y < 3.89999999999999986e-26Initial program 71.2%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6459.4
Applied rewrites59.4%
Taylor expanded in x around 0
Applied rewrites33.0%
if 3.89999999999999986e-26 < y Initial program 59.7%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6470.3
Applied rewrites70.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ y x))
assert(x < y);
double code(double x, double y) {
return 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 / x
end function
assert x < y;
public static double code(double x, double y) {
return y / x;
}
[x, y] = sort([x, y]) def code(x, y): return y / x
x, y = sort([x, y]) function code(x, y) return Float64(y / x) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = y / x;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(y / x), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{y}{x}
\end{array}
Initial program 68.0%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6451.0
Applied rewrites51.0%
Taylor expanded in x around 0
Applied rewrites24.6%
(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 2024294
(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))))