
(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 16 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 64.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
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 (<= x -1.35e+154)
(/ (/ y x) (+ x y))
(if (<= x -3.4e-16)
(* y (/ t_0 (* (+ 1.0 (+ y x)) (+ y x))))
(if (<= x 1.85e-156)
(* (/ y (* (+ 1.0 y) (+ y x))) t_0)
(/ (/ x (+ 1.0 y)) (+ x y)))))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (y + x);
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= -3.4e-16) {
tmp = y * (t_0 / ((1.0 + (y + x)) * (y + x)));
} else if (x <= 1.85e-156) {
tmp = (y / ((1.0 + y) * (y + x))) * t_0;
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = x / (y + x)
if (x <= (-1.35d+154)) then
tmp = (y / x) / (x + y)
else if (x <= (-3.4d-16)) then
tmp = y * (t_0 / ((1.0d0 + (y + x)) * (y + x)))
else if (x <= 1.85d-156) then
tmp = (y / ((1.0d0 + y) * (y + x))) * t_0
else
tmp = (x / (1.0d0 + y)) / (x + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = x / (y + x);
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= -3.4e-16) {
tmp = y * (t_0 / ((1.0 + (y + x)) * (y + x)));
} else if (x <= 1.85e-156) {
tmp = (y / ((1.0 + y) * (y + x))) * t_0;
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y + x) tmp = 0 if x <= -1.35e+154: tmp = (y / x) / (x + y) elif x <= -3.4e-16: tmp = y * (t_0 / ((1.0 + (y + x)) * (y + x))) elif x <= 1.85e-156: tmp = (y / ((1.0 + y) * (y + x))) * t_0 else: tmp = (x / (1.0 + y)) / (x + y) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y + x)) tmp = 0.0 if (x <= -1.35e+154) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= -3.4e-16) tmp = Float64(y * Float64(t_0 / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x)))); elseif (x <= 1.85e-156) tmp = Float64(Float64(y / Float64(Float64(1.0 + y) * Float64(y + x))) * t_0); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = x / (y + x);
tmp = 0.0;
if (x <= -1.35e+154)
tmp = (y / x) / (x + y);
elseif (x <= -3.4e-16)
tmp = y * (t_0 / ((1.0 + (y + x)) * (y + x)));
elseif (x <= 1.85e-156)
tmp = (y / ((1.0 + y) * (y + x))) * t_0;
else
tmp = (x / (1.0 + y)) / (x + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.35e+154], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.4e-16], N[(y * N[(t$95$0 / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.85e-156], N[(N[(y / N[(N[(1.0 + y), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y + x}\\
\mathbf{if}\;x \leq -1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq -3.4 \cdot 10^{-16}:\\
\;\;\;\;y \cdot \frac{t\_0}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{elif}\;x \leq 1.85 \cdot 10^{-156}:\\
\;\;\;\;\frac{y}{\left(1 + y\right) \cdot \left(y + x\right)} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -1.35000000000000003e154Initial program 55.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-/.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Applied rewrites100.0%
lift-/.f64N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites83.6%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites100.0%
Taylor expanded in x around inf
lower-/.f6493.8
Applied rewrites93.8%
if -1.35000000000000003e154 < x < -3.4e-16Initial program 64.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
associate-/r*N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6484.2
Applied rewrites84.2%
if -3.4e-16 < x < 1.85e-156Initial program 65.5%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
Applied rewrites99.8%
Taylor expanded in x around 0
lower-+.f6499.8
Applied rewrites99.8%
if 1.85e-156 < x Initial program 66.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.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
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites88.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites99.7%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6434.2
Applied rewrites34.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -1.35e+154)
(/ (/ y x) (+ x y))
(if (<= x 5.4e+36)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) (/ x (+ y x)))
(/ (* (/ x y) (/ (- y (fma 3.0 x 1.0)) y)) y))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= 5.4e+36) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * (x / (y + x));
} else {
tmp = ((x / y) * ((y - fma(3.0, x, 1.0)) / y)) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.35e+154) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= 5.4e+36) tmp = Float64(Float64(y / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))) * Float64(x / Float64(y + x))); else tmp = Float64(Float64(Float64(x / y) * Float64(Float64(y - fma(3.0, x, 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[x, -1.35e+154], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5.4e+36], N[(N[(y / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * N[(N[(y - N[(3.0 * x + 1.0), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq 5.4 \cdot 10^{+36}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \frac{x}{y + x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y} \cdot \frac{y - \mathsf{fma}\left(3, x, 1\right)}{y}}{y}\\
\end{array}
\end{array}
if x < -1.35000000000000003e154Initial program 55.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-/.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Applied rewrites100.0%
lift-/.f64N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites83.6%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites100.0%
Taylor expanded in x around inf
lower-/.f6493.8
Applied rewrites93.8%
if -1.35000000000000003e154 < x < 5.4000000000000002e36Initial program 69.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.1
lift-+.f64N/A
+-commutativeN/A
Applied rewrites98.1%
if 5.4000000000000002e36 < x Initial program 54.0%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites23.9%
Taylor expanded in y around 0
Applied rewrites24.0%
Final simplification83.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -1.35e+154)
(/ (/ y x) (+ x y))
(if (<= x 5.4e+36)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) (/ x (+ y x)))
(/ (* (/ 1.0 (+ 1.0 (+ x y))) x) (+ x y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= 5.4e+36) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * (x / (y + x));
} else {
tmp = ((1.0 / (1.0 + (x + y))) * x) / (x + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-1.35d+154)) then
tmp = (y / x) / (x + y)
else if (x <= 5.4d+36) then
tmp = (y / ((1.0d0 + (y + x)) * (y + x))) * (x / (y + x))
else
tmp = ((1.0d0 / (1.0d0 + (x + y))) * x) / (x + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= 5.4e+36) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * (x / (y + x));
} else {
tmp = ((1.0 / (1.0 + (x + y))) * x) / (x + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -1.35e+154: tmp = (y / x) / (x + y) elif x <= 5.4e+36: tmp = (y / ((1.0 + (y + x)) * (y + x))) * (x / (y + x)) else: tmp = ((1.0 / (1.0 + (x + y))) * x) / (x + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.35e+154) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= 5.4e+36) tmp = Float64(Float64(y / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))) * Float64(x / Float64(y + x))); else tmp = Float64(Float64(Float64(1.0 / Float64(1.0 + Float64(x + y))) * x) / Float64(x + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -1.35e+154)
tmp = (y / x) / (x + y);
elseif (x <= 5.4e+36)
tmp = (y / ((1.0 + (y + x)) * (y + x))) * (x / (y + x));
else
tmp = ((1.0 / (1.0 + (x + y))) * x) / (x + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.35e+154], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5.4e+36], N[(N[(y / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[(1.0 + N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq 5.4 \cdot 10^{+36}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot \frac{x}{y + x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{1 + \left(x + y\right)} \cdot x}{x + y}\\
\end{array}
\end{array}
if x < -1.35000000000000003e154Initial program 55.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-/.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Applied rewrites100.0%
lift-/.f64N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites83.6%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites100.0%
Taylor expanded in x around inf
lower-/.f6493.8
Applied rewrites93.8%
if -1.35000000000000003e154 < x < 5.4000000000000002e36Initial program 69.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.1
lift-+.f64N/A
+-commutativeN/A
Applied rewrites98.1%
if 5.4000000000000002e36 < x Initial program 54.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.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
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites81.1%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites99.7%
Taylor expanded in x around 0
Applied rewrites27.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -1.45e+20)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= x 1.85e-156)
(* (/ y (* (+ 1.0 y) (+ y x))) (/ x (+ y x)))
(/ (/ x (+ 1.0 y)) (+ x y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.45e+20) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= 1.85e-156) {
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-1.45d+20)) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (x <= 1.85d-156) then
tmp = (y / ((1.0d0 + y) * (y + x))) * (x / (y + x))
else
tmp = (x / (1.0d0 + y)) / (x + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -1.45e+20) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= 1.85e-156) {
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -1.45e+20: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif x <= 1.85e-156: tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x)) else: tmp = (x / (1.0 + y)) / (x + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.45e+20) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (x <= 1.85e-156) tmp = Float64(Float64(y / Float64(Float64(1.0 + y) * Float64(y + x))) * Float64(x / Float64(y + x))); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -1.45e+20)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (x <= 1.85e-156)
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
else
tmp = (x / (1.0 + y)) / (x + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.45e+20], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.85e-156], N[(N[(y / N[(N[(1.0 + y), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.45 \cdot 10^{+20}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;x \leq 1.85 \cdot 10^{-156}:\\
\;\;\;\;\frac{y}{\left(1 + y\right) \cdot \left(y + x\right)} \cdot \frac{x}{y + x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -1.45e20Initial program 56.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.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 inf
Applied rewrites80.6%
if -1.45e20 < x < 1.85e-156Initial program 67.1%
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-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
Applied rewrites99.8%
Taylor expanded in x around 0
lower-+.f6498.0
Applied rewrites98.0%
if 1.85e-156 < x Initial program 66.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.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
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites88.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites99.7%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6434.2
Applied rewrites34.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -1.35e+154)
(/ (/ y x) (+ x y))
(if (<= x -3e-228)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) 1.0)
(/ (/ x (+ 1.0 y)) (+ x y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= -3e-228) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-1.35d+154)) then
tmp = (y / x) / (x + y)
else if (x <= (-3d-228)) then
tmp = (y / ((1.0d0 + (y + x)) * (y + x))) * 1.0d0
else
tmp = (x / (1.0d0 + y)) / (x + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= -3e-228) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -1.35e+154: tmp = (y / x) / (x + y) elif x <= -3e-228: tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0 else: tmp = (x / (1.0 + y)) / (x + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.35e+154) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= -3e-228) tmp = Float64(Float64(y / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))) * 1.0); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -1.35e+154)
tmp = (y / x) / (x + y);
elseif (x <= -3e-228)
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
else
tmp = (x / (1.0 + y)) / (x + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.35e+154], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3e-228], N[(N[(y / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq -3 \cdot 10^{-228}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -1.35000000000000003e154Initial program 55.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-/.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Applied rewrites100.0%
lift-/.f64N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites83.6%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites100.0%
Taylor expanded in x around inf
lower-/.f6493.8
Applied rewrites93.8%
if -1.35000000000000003e154 < x < -3e-228Initial program 72.0%
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.3
lift-+.f64N/A
+-commutativeN/A
Applied rewrites96.3%
Taylor expanded in x around inf
Applied rewrites60.0%
if -3e-228 < x Initial program 62.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-/.f64N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites93.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites99.8%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6455.7
Applied rewrites55.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -1.35e+154)
(/ (/ y x) (+ x y))
(if (<= x -3e-228)
(* y (/ 1.0 (* (+ 1.0 (+ x y)) (+ x y))))
(/ (/ x (+ 1.0 y)) (+ x y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= -3e-228) {
tmp = y * (1.0 / ((1.0 + (x + y)) * (x + y)));
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-1.35d+154)) then
tmp = (y / x) / (x + y)
else if (x <= (-3d-228)) then
tmp = y * (1.0d0 / ((1.0d0 + (x + y)) * (x + y)))
else
tmp = (x / (1.0d0 + y)) / (x + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= -3e-228) {
tmp = y * (1.0 / ((1.0 + (x + y)) * (x + y)));
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -1.35e+154: tmp = (y / x) / (x + y) elif x <= -3e-228: tmp = y * (1.0 / ((1.0 + (x + y)) * (x + y))) else: tmp = (x / (1.0 + y)) / (x + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.35e+154) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= -3e-228) tmp = Float64(y * Float64(1.0 / Float64(Float64(1.0 + Float64(x + y)) * Float64(x + y)))); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -1.35e+154)
tmp = (y / x) / (x + y);
elseif (x <= -3e-228)
tmp = y * (1.0 / ((1.0 + (x + y)) * (x + y)));
else
tmp = (x / (1.0 + y)) / (x + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.35e+154], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3e-228], N[(y * N[(1.0 / N[(N[(1.0 + N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq -3 \cdot 10^{-228}:\\
\;\;\;\;y \cdot \frac{1}{\left(1 + \left(x + y\right)\right) \cdot \left(x + y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -1.35000000000000003e154Initial program 55.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-/.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Applied rewrites100.0%
lift-/.f64N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites83.6%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites100.0%
Taylor expanded in x around inf
lower-/.f6493.8
Applied rewrites93.8%
if -1.35000000000000003e154 < x < -3e-228Initial program 72.0%
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.3
lift-+.f64N/A
+-commutativeN/A
Applied rewrites96.3%
Taylor expanded in x around inf
Applied rewrites60.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6459.9
lift-+.f64N/A
+-commutativeN/A
lift-+.f6459.9
lift-+.f64N/A
+-commutativeN/A
lift-+.f6459.9
Applied rewrites59.9%
if -3e-228 < x Initial program 62.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-/.f64N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites93.0%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites99.8%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6455.7
Applied rewrites55.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y -4.2e-28)
(/ (/ y x) (+ x y))
(if (<= y 7.6e-182)
(/ y (fma x x x))
(if (<= y 2.15e+196) (/ x (+ (* y y) y)) (/ (/ x y) y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -4.2e-28) {
tmp = (y / x) / (x + y);
} else if (y <= 7.6e-182) {
tmp = y / fma(x, x, x);
} else if (y <= 2.15e+196) {
tmp = x / ((y * y) + y);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -4.2e-28) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (y <= 7.6e-182) tmp = Float64(y / fma(x, x, x)); elseif (y <= 2.15e+196) tmp = Float64(x / Float64(Float64(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, -4.2e-28], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 7.6e-182], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.15e+196], N[(x / N[(N[(y * y), $MachinePrecision] + 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 -4.2 \cdot 10^{-28}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;y \leq 7.6 \cdot 10^{-182}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 2.15 \cdot 10^{+196}:\\
\;\;\;\;\frac{x}{y \cdot y + y}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < -4.20000000000000013e-28Initial program 63.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.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
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites86.7%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites99.7%
Taylor expanded in x around inf
lower-/.f6435.4
Applied rewrites35.4%
if -4.20000000000000013e-28 < y < 7.6000000000000006e-182Initial program 63.0%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6478.2
Applied rewrites78.2%
if 7.6000000000000006e-182 < y < 2.15000000000000006e196Initial program 69.3%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6454.4
Applied rewrites54.4%
Applied rewrites54.4%
if 2.15000000000000006e196 < y Initial program 54.5%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6483.1
Applied rewrites83.1%
Final simplification59.6%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y -4.2e-28)
(/ (/ y x) x)
(if (<= y 7.6e-182)
(/ y (fma x x x))
(if (<= y 2.15e+196) (/ x (+ (* y y) y)) (/ (/ x y) y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= -4.2e-28) {
tmp = (y / x) / x;
} else if (y <= 7.6e-182) {
tmp = y / fma(x, x, x);
} else if (y <= 2.15e+196) {
tmp = x / ((y * y) + y);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= -4.2e-28) tmp = Float64(Float64(y / x) / x); elseif (y <= 7.6e-182) tmp = Float64(y / fma(x, x, x)); elseif (y <= 2.15e+196) tmp = Float64(x / Float64(Float64(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, -4.2e-28], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 7.6e-182], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.15e+196], N[(x / N[(N[(y * y), $MachinePrecision] + 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 -4.2 \cdot 10^{-28}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;y \leq 7.6 \cdot 10^{-182}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 2.15 \cdot 10^{+196}:\\
\;\;\;\;\frac{x}{y \cdot y + y}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < -4.20000000000000013e-28Initial program 63.2%
Taylor expanded in x around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6434.9
Applied rewrites34.9%
if -4.20000000000000013e-28 < y < 7.6000000000000006e-182Initial program 63.0%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6478.2
Applied rewrites78.2%
if 7.6000000000000006e-182 < y < 2.15000000000000006e196Initial program 69.3%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6454.4
Applied rewrites54.4%
Applied rewrites54.4%
if 2.15000000000000006e196 < y Initial program 54.5%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6483.1
Applied rewrites83.1%
Final simplification59.4%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -1.35e+154)
(/ (/ y x) (+ x y))
(if (<= x -6.5e-143)
(* (/ y (* (+ 1.0 x) (+ y x))) 1.0)
(/ (/ x (+ 1.0 y)) (+ x y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= -6.5e-143) {
tmp = (y / ((1.0 + x) * (y + x))) * 1.0;
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-1.35d+154)) then
tmp = (y / x) / (x + y)
else if (x <= (-6.5d-143)) then
tmp = (y / ((1.0d0 + x) * (y + x))) * 1.0d0
else
tmp = (x / (1.0d0 + y)) / (x + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -1.35e+154) {
tmp = (y / x) / (x + y);
} else if (x <= -6.5e-143) {
tmp = (y / ((1.0 + x) * (y + x))) * 1.0;
} else {
tmp = (x / (1.0 + y)) / (x + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -1.35e+154: tmp = (y / x) / (x + y) elif x <= -6.5e-143: tmp = (y / ((1.0 + x) * (y + x))) * 1.0 else: tmp = (x / (1.0 + y)) / (x + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.35e+154) tmp = Float64(Float64(y / x) / Float64(x + y)); elseif (x <= -6.5e-143) tmp = Float64(Float64(y / Float64(Float64(1.0 + x) * Float64(y + x))) * 1.0); else tmp = Float64(Float64(x / Float64(1.0 + y)) / Float64(x + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -1.35e+154)
tmp = (y / x) / (x + y);
elseif (x <= -6.5e-143)
tmp = (y / ((1.0 + x) * (y + x))) * 1.0;
else
tmp = (x / (1.0 + y)) / (x + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.35e+154], N[(N[(y / x), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -6.5e-143], N[(N[(y / N[(N[(1.0 + x), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / N[(x + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{y}{x}}{x + y}\\
\mathbf{elif}\;x \leq -6.5 \cdot 10^{-143}:\\
\;\;\;\;\frac{y}{\left(1 + x\right) \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{x + y}\\
\end{array}
\end{array}
if x < -1.35000000000000003e154Initial program 55.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-/.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Applied rewrites100.0%
lift-/.f64N/A
lift-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites83.6%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites100.0%
Taylor expanded in x around inf
lower-/.f6493.8
Applied rewrites93.8%
if -1.35000000000000003e154 < x < -6.4999999999999999e-143Initial program 73.4%
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-/.f6495.0
lift-+.f64N/A
+-commutativeN/A
Applied rewrites95.0%
Taylor expanded in x around inf
Applied rewrites65.9%
Taylor expanded in y around 0
lower-+.f6454.0
Applied rewrites54.0%
if -6.4999999999999999e-143 < x Initial program 63.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.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
+-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
*-lft-identityN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites93.9%
lift-*.f64N/A
lift-*.f64N/A
lift-/.f64N/A
/-rgt-identityN/A
lift-/.f64N/A
lift-/.f64N/A
associate-*r/N/A
Applied rewrites99.8%
Taylor expanded in x around 0
lower-/.f64N/A
lower-+.f6459.5
Applied rewrites59.5%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 7.6e-182) (/ y (fma x x x)) (if (<= y 2.15e+196) (/ x (+ (* y y) y)) (/ (/ x y) y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 7.6e-182) {
tmp = y / fma(x, x, x);
} else if (y <= 2.15e+196) {
tmp = x / ((y * y) + y);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 7.6e-182) tmp = Float64(y / fma(x, x, x)); elseif (y <= 2.15e+196) tmp = Float64(x / Float64(Float64(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, 7.6e-182], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.15e+196], N[(x / N[(N[(y * y), $MachinePrecision] + 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 7.6 \cdot 10^{-182}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 2.15 \cdot 10^{+196}:\\
\;\;\;\;\frac{x}{y \cdot y + y}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < 7.6000000000000006e-182Initial program 63.1%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6456.0
Applied rewrites56.0%
if 7.6000000000000006e-182 < y < 2.15000000000000006e196Initial program 69.3%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6454.4
Applied rewrites54.4%
Applied rewrites54.4%
if 2.15000000000000006e196 < y Initial program 54.5%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6483.1
Applied rewrites83.1%
Final simplification57.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 7.6e-182) (/ y (fma x x x)) (/ x (+ (* y y) y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 7.6e-182) {
tmp = y / fma(x, x, x);
} else {
tmp = x / ((y * y) + y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 7.6e-182) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(x / Float64(Float64(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, 7.6e-182], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(N[(y * y), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 7.6 \cdot 10^{-182}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y + y}\\
\end{array}
\end{array}
if y < 7.6000000000000006e-182Initial program 63.1%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6456.0
Applied rewrites56.0%
if 7.6000000000000006e-182 < y Initial program 65.9%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6459.2
Applied rewrites59.2%
Applied rewrites59.2%
Final simplification57.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 7.6e-182) (/ y (fma x x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 7.6e-182) {
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 <= 7.6e-182) 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, 7.6e-182], 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 7.6 \cdot 10^{-182}:\\
\;\;\;\;\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.6000000000000006e-182Initial program 63.1%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6456.0
Applied rewrites56.0%
if 7.6000000000000006e-182 < y Initial program 65.9%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6459.2
Applied rewrites59.2%
Final simplification57.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.45e+20) (/ y (* x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.45e+20) {
tmp = y / (x * x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.45e+20) tmp = Float64(y / Float64(x * x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.45e+20], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.45 \cdot 10^{+20}:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -1.45e20Initial program 56.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.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 inf
lower-/.f64N/A
unpow2N/A
lower-*.f6473.7
Applied rewrites73.7%
if -1.45e20 < x Initial program 66.9%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6457.4
Applied rewrites57.4%
Final simplification61.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.45e+20) (/ y (* x x)) (/ x (* y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.45e+20) {
tmp = y / (x * x);
} else {
tmp = x / (y * y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-1.45d+20)) then
tmp = y / (x * x)
else
tmp = x / (y * y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -1.45e+20) {
tmp = y / (x * x);
} else {
tmp = x / (y * y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -1.45e+20: tmp = y / (x * x) else: tmp = x / (y * y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.45e+20) tmp = Float64(y / Float64(x * x)); else tmp = Float64(x / Float64(y * y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -1.45e+20)
tmp = y / (x * x);
else
tmp = x / (y * y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.45e+20], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.45 \cdot 10^{+20}:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if x < -1.45e20Initial program 56.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.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 inf
lower-/.f64N/A
unpow2N/A
lower-*.f6473.7
Applied rewrites73.7%
if -1.45e20 < x Initial program 66.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 y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6438.0
Applied rewrites38.0%
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 64.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6433.2
Applied rewrites33.2%
(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 2024326
(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))))