
(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 23 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) 1.0) x)) (/ (/ y (+ 1.0 (+ y x))) (+ y x))))
assert(x < y);
double code(double x, double y) {
return (x / (((y / x) + 1.0) * 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) + 1.0d0) * 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) + 1.0) * x)) * ((y / (1.0 + (y + x))) / (y + x));
}
[x, y] = sort([x, y]) def code(x, y): return (x / (((y / x) + 1.0) * x)) * ((y / (1.0 + (y + x))) / (y + x))
x, y = sort([x, y]) function code(x, y) return Float64(Float64(x / Float64(Float64(Float64(y / x) + 1.0) * 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) + 1.0) * 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[(N[(N[(y / x), $MachinePrecision] + 1.0), $MachinePrecision] * 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}{\left(\frac{y}{x} + 1\right) \cdot x} \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}
\end{array}
Initial program 70.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.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6499.8
Applied rewrites99.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 8.8e+156) (* (/ y (+ y x)) (/ x (* (+ 1.0 (+ y x)) (+ y x)))) (* (/ x (* (+ (/ y x) 1.0) x)) (pow y -1.0))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 8.8e+156) {
tmp = (y / (y + x)) * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / (((y / x) + 1.0) * x)) * pow(y, -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (y <= 8.8d+156) then
tmp = (y / (y + x)) * (x / ((1.0d0 + (y + x)) * (y + x)))
else
tmp = (x / (((y / x) + 1.0d0) * x)) * (y ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 8.8e+156) {
tmp = (y / (y + x)) * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / (((y / x) + 1.0) * x)) * Math.pow(y, -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 8.8e+156: tmp = (y / (y + x)) * (x / ((1.0 + (y + x)) * (y + x))) else: tmp = (x / (((y / x) + 1.0) * x)) * math.pow(y, -1.0) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 8.8e+156) tmp = Float64(Float64(y / Float64(y + x)) * Float64(x / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x)))); else tmp = Float64(Float64(x / Float64(Float64(Float64(y / x) + 1.0) * x)) * (y ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 8.8e+156)
tmp = (y / (y + x)) * (x / ((1.0 + (y + x)) * (y + x)));
else
tmp = (x / (((y / x) + 1.0) * x)) * (y ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 8.8e+156], N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(x / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(N[(N[(y / x), $MachinePrecision] + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 8.8 \cdot 10^{+156}:\\
\;\;\;\;\frac{y}{y + x} \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\left(\frac{y}{x} + 1\right) \cdot x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < 8.80000000000000016e156Initial program 70.7%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
Applied rewrites93.8%
if 8.80000000000000016e156 < y Initial program 69.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 x around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
Taylor expanded in y around inf
lower-/.f6495.1
Applied rewrites95.1%
Final simplification94.0%
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 3.5e-269)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= y 5.8e-59)
(* y (/ t_0 (* (- 1.0 (+ y x)) (+ y x))))
(if (<= y 4.4e+101)
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0)))
(* t_0 (pow y -1.0)))))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (y + x);
double tmp;
if (y <= 3.5e-269) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 5.8e-59) {
tmp = y * (t_0 / ((1.0 - (y + x)) * (y + x)));
} else if (y <= 4.4e+101) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else {
tmp = t_0 * pow(y, -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = x / (y + x)
if (y <= 3.5d-269) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (y <= 5.8d-59) then
tmp = y * (t_0 / ((1.0d0 - (y + x)) * (y + x)))
else if (y <= 4.4d+101) then
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
else
tmp = t_0 * (y ** (-1.0d0))
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 <= 3.5e-269) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 5.8e-59) {
tmp = y * (t_0 / ((1.0 - (y + x)) * (y + x)));
} else if (y <= 4.4e+101) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else {
tmp = t_0 * Math.pow(y, -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y + x) tmp = 0 if y <= 3.5e-269: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif y <= 5.8e-59: tmp = y * (t_0 / ((1.0 - (y + x)) * (y + x))) elif y <= 4.4e+101: tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)) else: tmp = t_0 * math.pow(y, -1.0) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y + x)) tmp = 0.0 if (y <= 3.5e-269) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (y <= 5.8e-59) tmp = Float64(y * Float64(t_0 / Float64(Float64(1.0 - Float64(y + x)) * Float64(y + x)))); elseif (y <= 4.4e+101) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))); else tmp = Float64(t_0 * (y ^ -1.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 <= 3.5e-269)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (y <= 5.8e-59)
tmp = y * (t_0 / ((1.0 - (y + x)) * (y + x)));
elseif (y <= 4.4e+101)
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
else
tmp = t_0 * (y ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 3.5e-269], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 5.8e-59], N[(y * N[(t$95$0 / N[(N[(1.0 - N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.4e+101], 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], N[(t$95$0 * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y + x}\\
\mathbf{if}\;y \leq 3.5 \cdot 10^{-269}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;y \leq 5.8 \cdot 10^{-59}:\\
\;\;\;\;y \cdot \frac{t\_0}{\left(1 - \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{elif}\;y \leq 4.4 \cdot 10^{+101}:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < 3.50000000000000019e-269Initial program 71.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 x around inf
Applied rewrites55.2%
if 3.50000000000000019e-269 < y < 5.80000000000000033e-59Initial program 64.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%
Applied rewrites93.9%
if 5.80000000000000033e-59 < y < 4.4000000000000001e101Initial program 83.8%
if 4.4000000000000001e101 < y Initial program 64.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-/.f6490.5
Applied rewrites90.5%
Final simplification71.5%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y 1.35e-262)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= y 2.15e-129)
(* y (/ (/ x (+ x y)) (* (+ 1.0 y) (+ x y))))
(if (<= y 4.4e+101)
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0)))
(* (/ x (+ y x)) (pow y -1.0))))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1.35e-262) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 2.15e-129) {
tmp = y * ((x / (x + y)) / ((1.0 + y) * (x + y)));
} else if (y <= 4.4e+101) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else {
tmp = (x / (y + x)) * pow(y, -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (y <= 1.35d-262) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (y <= 2.15d-129) then
tmp = y * ((x / (x + y)) / ((1.0d0 + y) * (x + y)))
else if (y <= 4.4d+101) then
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
else
tmp = (x / (y + x)) * (y ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 1.35e-262) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (y <= 2.15e-129) {
tmp = y * ((x / (x + y)) / ((1.0 + y) * (x + y)));
} else if (y <= 4.4e+101) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else {
tmp = (x / (y + x)) * Math.pow(y, -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 1.35e-262: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif y <= 2.15e-129: tmp = y * ((x / (x + y)) / ((1.0 + y) * (x + y))) elif y <= 4.4e+101: tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)) else: tmp = (x / (y + x)) * math.pow(y, -1.0) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 1.35e-262) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (y <= 2.15e-129) tmp = Float64(y * Float64(Float64(x / Float64(x + y)) / Float64(Float64(1.0 + y) * Float64(x + y)))); elseif (y <= 4.4e+101) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))); else tmp = Float64(Float64(x / Float64(y + x)) * (y ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 1.35e-262)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (y <= 2.15e-129)
tmp = y * ((x / (x + y)) / ((1.0 + y) * (x + y)));
elseif (y <= 4.4e+101)
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
else
tmp = (x / (y + x)) * (y ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 1.35e-262], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.15e-129], N[(y * N[(N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.4e+101], 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], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.35 \cdot 10^{-262}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;y \leq 2.15 \cdot 10^{-129}:\\
\;\;\;\;y \cdot \frac{\frac{x}{x + y}}{\left(1 + y\right) \cdot \left(x + y\right)}\\
\mathbf{elif}\;y \leq 4.4 \cdot 10^{+101}:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < 1.3500000000000001e-262Initial program 71.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 x around inf
Applied rewrites55.2%
if 1.3500000000000001e-262 < y < 2.1499999999999999e-129Initial program 53.9%
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.9
lift-+.f64N/A
+-commutativeN/A
Applied rewrites99.9%
Taylor expanded in x around 0
lower-+.f6493.4
Applied rewrites93.4%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6493.4
lift-+.f64N/A
+-commutativeN/A
lift-+.f6493.4
lift-+.f64N/A
+-commutativeN/A
lift-+.f6493.4
Applied rewrites93.4%
if 2.1499999999999999e-129 < y < 4.4000000000000001e101Initial program 84.2%
if 4.4000000000000001e101 < y Initial program 64.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-/.f6490.5
Applied rewrites90.5%
Final simplification71.0%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= y 2.4e-205)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= y 2.05e-129)
(* 1.0 (/ x (* t_0 (+ y x))))
(if (<= y 4.4e+101)
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0)))
(* (/ x (+ y x)) (pow y -1.0)))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= 2.4e-205) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 2.05e-129) {
tmp = 1.0 * (x / (t_0 * (y + x)));
} else if (y <= 4.4e+101) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else {
tmp = (x / (y + x)) * pow(y, -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (y <= 2.4d-205) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (y <= 2.05d-129) then
tmp = 1.0d0 * (x / (t_0 * (y + x)))
else if (y <= 4.4d+101) then
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
else
tmp = (x / (y + x)) * (y ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= 2.4e-205) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 2.05e-129) {
tmp = 1.0 * (x / (t_0 * (y + x)));
} else if (y <= 4.4e+101) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else {
tmp = (x / (y + x)) * Math.pow(y, -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if y <= 2.4e-205: tmp = 1.0 * ((y / t_0) / (y + x)) elif y <= 2.05e-129: tmp = 1.0 * (x / (t_0 * (y + x))) elif y <= 4.4e+101: tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)) else: tmp = (x / (y + x)) * math.pow(y, -1.0) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= 2.4e-205) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (y <= 2.05e-129) tmp = Float64(1.0 * Float64(x / Float64(t_0 * Float64(y + x)))); elseif (y <= 4.4e+101) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))); else tmp = Float64(Float64(x / Float64(y + x)) * (y ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (y <= 2.4e-205)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (y <= 2.05e-129)
tmp = 1.0 * (x / (t_0 * (y + x)));
elseif (y <= 4.4e+101)
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
else
tmp = (x / (y + x)) * (y ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 2.4e-205], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.05e-129], N[(1.0 * N[(x / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.4e+101], 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], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;y \leq 2.4 \cdot 10^{-205}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;y \leq 2.05 \cdot 10^{-129}:\\
\;\;\;\;1 \cdot \frac{x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{elif}\;y \leq 4.4 \cdot 10^{+101}:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < 2.4000000000000002e-205Initial program 71.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.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
Applied rewrites57.3%
if 2.4000000000000002e-205 < y < 2.05e-129Initial program 40.1%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.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%
Taylor expanded in x around 0
Applied rewrites78.2%
if 2.05e-129 < y < 4.4000000000000001e101Initial program 84.2%
if 4.4000000000000001e101 < y Initial program 64.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-/.f6490.5
Applied rewrites90.5%
Final simplification69.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 2.4e-205)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= y 8.8e+156)
(* 1.0 (/ x (* t_0 (+ y x))))
(* (/ x (+ y x)) (pow (+ 1.0 y) -1.0))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= 2.4e-205) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 8.8e+156) {
tmp = 1.0 * (x / (t_0 * (y + x)));
} else {
tmp = (x / (y + x)) * pow((1.0 + y), -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (y <= 2.4d-205) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (y <= 8.8d+156) then
tmp = 1.0d0 * (x / (t_0 * (y + x)))
else
tmp = (x / (y + x)) * ((1.0d0 + y) ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (y <= 2.4e-205) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (y <= 8.8e+156) {
tmp = 1.0 * (x / (t_0 * (y + x)));
} else {
tmp = (x / (y + x)) * Math.pow((1.0 + y), -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if y <= 2.4e-205: tmp = 1.0 * ((y / t_0) / (y + x)) elif y <= 8.8e+156: tmp = 1.0 * (x / (t_0 * (y + x))) else: tmp = (x / (y + x)) * math.pow((1.0 + y), -1.0) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (y <= 2.4e-205) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (y <= 8.8e+156) tmp = Float64(1.0 * Float64(x / Float64(t_0 * Float64(y + x)))); else tmp = Float64(Float64(x / Float64(y + x)) * (Float64(1.0 + y) ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (y <= 2.4e-205)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (y <= 8.8e+156)
tmp = 1.0 * (x / (t_0 * (y + x)));
else
tmp = (x / (y + x)) * ((1.0 + y) ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 2.4e-205], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.8e+156], N[(1.0 * N[(x / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[N[(1.0 + y), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;y \leq 2.4 \cdot 10^{-205}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;y \leq 8.8 \cdot 10^{+156}:\\
\;\;\;\;1 \cdot \frac{x}{t\_0 \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {\left(1 + y\right)}^{-1}\\
\end{array}
\end{array}
if y < 2.4000000000000002e-205Initial program 71.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.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
Applied rewrites57.3%
if 2.4000000000000002e-205 < y < 8.80000000000000016e156Initial program 68.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
Applied rewrites93.9%
Taylor expanded in x around 0
Applied rewrites70.9%
if 8.80000000000000016e156 < y Initial program 69.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 x around 0
lower-/.f64N/A
lower-+.f6495.1
Applied rewrites95.1%
Final simplification66.9%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y 2.4e-205)
(* (/ y (+ y x)) (pow (+ 1.0 x) -1.0))
(if (<= y 8.8e+156)
(* 1.0 (/ x (* (+ 1.0 (+ y x)) (+ y x))))
(* (/ x (+ y x)) (pow (+ 1.0 y) -1.0)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 2.4e-205) {
tmp = (y / (y + x)) * pow((1.0 + x), -1.0);
} else if (y <= 8.8e+156) {
tmp = 1.0 * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / (y + x)) * pow((1.0 + y), -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (y <= 2.4d-205) then
tmp = (y / (y + x)) * ((1.0d0 + x) ** (-1.0d0))
else if (y <= 8.8d+156) then
tmp = 1.0d0 * (x / ((1.0d0 + (y + x)) * (y + x)))
else
tmp = (x / (y + x)) * ((1.0d0 + y) ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 2.4e-205) {
tmp = (y / (y + x)) * Math.pow((1.0 + x), -1.0);
} else if (y <= 8.8e+156) {
tmp = 1.0 * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / (y + x)) * Math.pow((1.0 + y), -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 2.4e-205: tmp = (y / (y + x)) * math.pow((1.0 + x), -1.0) elif y <= 8.8e+156: tmp = 1.0 * (x / ((1.0 + (y + x)) * (y + x))) else: tmp = (x / (y + x)) * math.pow((1.0 + y), -1.0) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 2.4e-205) tmp = Float64(Float64(y / Float64(y + x)) * (Float64(1.0 + x) ^ -1.0)); elseif (y <= 8.8e+156) tmp = Float64(1.0 * Float64(x / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x)))); else tmp = Float64(Float64(x / Float64(y + x)) * (Float64(1.0 + y) ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 2.4e-205)
tmp = (y / (y + x)) * ((1.0 + x) ^ -1.0);
elseif (y <= 8.8e+156)
tmp = 1.0 * (x / ((1.0 + (y + x)) * (y + x)));
else
tmp = (x / (y + x)) * ((1.0 + y) ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 2.4e-205], N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[N[(1.0 + x), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.8e+156], N[(1.0 * N[(x / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[N[(1.0 + y), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.4 \cdot 10^{-205}:\\
\;\;\;\;\frac{y}{y + x} \cdot {\left(1 + x\right)}^{-1}\\
\mathbf{elif}\;y \leq 8.8 \cdot 10^{+156}:\\
\;\;\;\;1 \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {\left(1 + y\right)}^{-1}\\
\end{array}
\end{array}
if y < 2.4000000000000002e-205Initial program 71.5%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
Applied rewrites93.8%
Taylor expanded in y around 0
lower-/.f64N/A
lower-+.f6456.3
Applied rewrites56.3%
if 2.4000000000000002e-205 < y < 8.80000000000000016e156Initial program 68.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
Applied rewrites93.9%
Taylor expanded in x around 0
Applied rewrites70.9%
if 8.80000000000000016e156 < y Initial program 69.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 x around 0
lower-/.f64N/A
lower-+.f6495.1
Applied rewrites95.1%
Final simplification66.4%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -2.1e+156)
(* 1.0 (/ (/ y x) (+ y x)))
(if (<= x -1.25e-117)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) 1.0)
(* (/ x (+ y x)) (pow (+ 1.0 y) -1.0)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -2.1e+156) {
tmp = 1.0 * ((y / x) / (y + x));
} else if (x <= -1.25e-117) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) * pow((1.0 + y), -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-2.1d+156)) then
tmp = 1.0d0 * ((y / x) / (y + x))
else if (x <= (-1.25d-117)) then
tmp = (y / ((1.0d0 + (y + x)) * (y + x))) * 1.0d0
else
tmp = (x / (y + x)) * ((1.0d0 + y) ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -2.1e+156) {
tmp = 1.0 * ((y / x) / (y + x));
} else if (x <= -1.25e-117) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) * Math.pow((1.0 + y), -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -2.1e+156: tmp = 1.0 * ((y / x) / (y + x)) elif x <= -1.25e-117: tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0 else: tmp = (x / (y + x)) * math.pow((1.0 + y), -1.0) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -2.1e+156) tmp = Float64(1.0 * Float64(Float64(y / x) / Float64(y + x))); elseif (x <= -1.25e-117) tmp = Float64(Float64(y / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))) * 1.0); else tmp = Float64(Float64(x / Float64(y + x)) * (Float64(1.0 + y) ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -2.1e+156)
tmp = 1.0 * ((y / x) / (y + x));
elseif (x <= -1.25e-117)
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
else
tmp = (x / (y + x)) * ((1.0 + y) ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -2.1e+156], N[(1.0 * N[(N[(y / x), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.25e-117], 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[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[N[(1.0 + y), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -2.1 \cdot 10^{+156}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{x}}{y + x}\\
\mathbf{elif}\;x \leq -1.25 \cdot 10^{-117}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {\left(1 + y\right)}^{-1}\\
\end{array}
\end{array}
if x < -2.09999999999999981e156Initial program 67.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-/.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%
Taylor expanded in x around inf
Applied rewrites96.0%
Taylor expanded in x around inf
lower-/.f6496.1
Applied rewrites96.1%
if -2.09999999999999981e156 < x < -1.25e-117Initial program 79.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-/.f6494.8
lift-+.f64N/A
+-commutativeN/A
Applied rewrites94.8%
Taylor expanded in x around inf
Applied rewrites70.4%
if -1.25e-117 < x Initial program 68.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 x around 0
lower-/.f64N/A
lower-+.f6462.9
Applied rewrites62.9%
Final simplification67.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y 2.4e-205)
(/ y (fma x x x))
(if (<= y 8.8e+156)
(* 1.0 (/ x (* (+ 1.0 (+ y x)) (+ y x))))
(* (/ x (+ y x)) (pow y -1.0)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 2.4e-205) {
tmp = y / fma(x, x, x);
} else if (y <= 8.8e+156) {
tmp = 1.0 * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / (y + x)) * pow(y, -1.0);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 2.4e-205) tmp = Float64(y / fma(x, x, x)); elseif (y <= 8.8e+156) tmp = Float64(1.0 * Float64(x / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x)))); else tmp = Float64(Float64(x / Float64(y + x)) * (y ^ -1.0)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 2.4e-205], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.8e+156], N[(1.0 * N[(x / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[y, -1.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.4 \cdot 10^{-205}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 8.8 \cdot 10^{+156}:\\
\;\;\;\;1 \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {y}^{-1}\\
\end{array}
\end{array}
if y < 2.4000000000000002e-205Initial program 71.5%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6453.7
Applied rewrites53.7%
if 2.4000000000000002e-205 < y < 8.80000000000000016e156Initial program 68.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
Applied rewrites93.9%
Taylor expanded in x around 0
Applied rewrites70.9%
if 8.80000000000000016e156 < y Initial program 69.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around inf
lower-/.f6495.1
Applied rewrites95.1%
Final simplification64.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 8.8e+156) (* (/ y (+ y x)) (/ x (* (+ 1.0 (+ y x)) (+ y x)))) (* (/ x (+ y x)) (pow (+ 1.0 y) -1.0))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 8.8e+156) {
tmp = (y / (y + x)) * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / (y + x)) * pow((1.0 + y), -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (y <= 8.8d+156) then
tmp = (y / (y + x)) * (x / ((1.0d0 + (y + x)) * (y + x)))
else
tmp = (x / (y + x)) * ((1.0d0 + y) ** (-1.0d0))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (y <= 8.8e+156) {
tmp = (y / (y + x)) * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / (y + x)) * Math.pow((1.0 + y), -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 8.8e+156: tmp = (y / (y + x)) * (x / ((1.0 + (y + x)) * (y + x))) else: tmp = (x / (y + x)) * math.pow((1.0 + y), -1.0) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 8.8e+156) tmp = Float64(Float64(y / Float64(y + x)) * Float64(x / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x)))); else tmp = Float64(Float64(x / Float64(y + x)) * (Float64(1.0 + y) ^ -1.0)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (y <= 8.8e+156)
tmp = (y / (y + x)) * (x / ((1.0 + (y + x)) * (y + x)));
else
tmp = (x / (y + x)) * ((1.0 + y) ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 8.8e+156], N[(N[(y / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(x / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[Power[N[(1.0 + y), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 8.8 \cdot 10^{+156}:\\
\;\;\;\;\frac{y}{y + x} \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y + x} \cdot {\left(1 + y\right)}^{-1}\\
\end{array}
\end{array}
if y < 8.80000000000000016e156Initial program 70.7%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.8
Applied rewrites93.8%
if 8.80000000000000016e156 < y Initial program 69.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 x around 0
lower-/.f64N/A
lower-+.f6495.1
Applied rewrites95.1%
Final simplification94.0%
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 8.8e+156)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) t_0)
(* t_0 (pow (+ 1.0 y) -1.0)))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (y + x);
double tmp;
if (y <= 8.8e+156) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
} else {
tmp = t_0 * pow((1.0 + y), -1.0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = x / (y + x)
if (y <= 8.8d+156) then
tmp = (y / ((1.0d0 + (y + x)) * (y + x))) * t_0
else
tmp = t_0 * ((1.0d0 + y) ** (-1.0d0))
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 <= 8.8e+156) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
} else {
tmp = t_0 * Math.pow((1.0 + y), -1.0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y + x) tmp = 0 if y <= 8.8e+156: tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0 else: tmp = t_0 * math.pow((1.0 + y), -1.0) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y + x)) tmp = 0.0 if (y <= 8.8e+156) tmp = Float64(Float64(y / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + x))) * t_0); else tmp = Float64(t_0 * (Float64(1.0 + y) ^ -1.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 <= 8.8e+156)
tmp = (y / ((1.0 + (y + x)) * (y + x))) * t_0;
else
tmp = t_0 * ((1.0 + y) ^ -1.0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 8.8e+156], N[(N[(y / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(t$95$0 * N[Power[N[(1.0 + y), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y + x}\\
\mathbf{if}\;y \leq 8.8 \cdot 10^{+156}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot {\left(1 + y\right)}^{-1}\\
\end{array}
\end{array}
if y < 8.80000000000000016e156Initial program 70.7%
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-/.f6493.8
lift-+.f64N/A
+-commutativeN/A
Applied rewrites93.8%
if 8.80000000000000016e156 < y Initial program 69.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 x around 0
lower-/.f64N/A
lower-+.f6495.1
Applied rewrites95.1%
Final simplification94.0%
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 -3.8e-142)
t_0
(if (<= y 6.6e-153)
(* y (pow x -1.0))
(if (<= y 7500000.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 <= -3.8e-142) {
tmp = t_0;
} else if (y <= 6.6e-153) {
tmp = y * pow(x, -1.0);
} else if (y <= 7500000.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 <= (-3.8d-142)) then
tmp = t_0
else if (y <= 6.6d-153) then
tmp = y * (x ** (-1.0d0))
else if (y <= 7500000.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 <= -3.8e-142) {
tmp = t_0;
} else if (y <= 6.6e-153) {
tmp = y * Math.pow(x, -1.0);
} else if (y <= 7500000.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 <= -3.8e-142: tmp = t_0 elif y <= 6.6e-153: tmp = y * math.pow(x, -1.0) elif y <= 7500000.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 <= -3.8e-142) tmp = t_0; elseif (y <= 6.6e-153) tmp = Float64(y * (x ^ -1.0)); elseif (y <= 7500000.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 <= -3.8e-142)
tmp = t_0;
elseif (y <= 6.6e-153)
tmp = y * (x ^ -1.0);
elseif (y <= 7500000.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, -3.8e-142], t$95$0, If[LessEqual[y, 6.6e-153], N[(y * N[Power[x, -1.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 7500000.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 -3.8 \cdot 10^{-142}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq 6.6 \cdot 10^{-153}:\\
\;\;\;\;y \cdot {x}^{-1}\\
\mathbf{elif}\;y \leq 7500000:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if y < -3.79999999999999972e-142 or 6.59999999999999975e-153 < y < 7.5e6Initial program 72.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.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%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6431.8
Applied rewrites31.8%
if -3.79999999999999972e-142 < y < 6.59999999999999975e-153Initial program 68.7%
Taylor expanded in x around 0
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f641.5
Applied rewrites1.5%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f644.4
Applied rewrites4.4%
Taylor expanded in y around 0
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f6481.4
Applied rewrites81.4%
Taylor expanded in x around 0
Applied rewrites70.0%
if 7.5e6 < y Initial program 68.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-/.f64N/A
unpow2N/A
lower-*.f6478.6
Applied rewrites78.6%
Final simplification53.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -4.7e+101)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= x -3.7e-13)
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0)))
(if (<= x 5e-210)
(/ (* (/ x (+ x y)) y) (* (+ 1.0 y) (+ x y)))
(/ (/ x (+ 1.0 y)) y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -4.7e+101) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= -3.7e-13) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else if (x <= 5e-210) {
tmp = ((x / (x + y)) * y) / ((1.0 + y) * (x + y));
} else {
tmp = (x / (1.0 + 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 <= (-4.7d+101)) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (x <= (-3.7d-13)) then
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
else if (x <= 5d-210) then
tmp = ((x / (x + y)) * y) / ((1.0d0 + y) * (x + y))
else
tmp = (x / (1.0d0 + y)) / y
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -4.7e+101) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= -3.7e-13) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else if (x <= 5e-210) {
tmp = ((x / (x + y)) * y) / ((1.0 + y) * (x + y));
} else {
tmp = (x / (1.0 + y)) / y;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -4.7e+101: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif x <= -3.7e-13: tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)) elif x <= 5e-210: tmp = ((x / (x + y)) * y) / ((1.0 + y) * (x + y)) else: tmp = (x / (1.0 + y)) / y return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -4.7e+101) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (x <= -3.7e-13) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))); elseif (x <= 5e-210) tmp = Float64(Float64(Float64(x / Float64(x + y)) * y) / Float64(Float64(1.0 + y) * Float64(x + y))); else tmp = Float64(Float64(x / Float64(1.0 + y)) / y); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -4.7e+101)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (x <= -3.7e-13)
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
elseif (x <= 5e-210)
tmp = ((x / (x + y)) * y) / ((1.0 + y) * (x + y));
else
tmp = (x / (1.0 + 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, -4.7e+101], N[(1.0 * N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.7e-13], N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5e-210], N[(N[(N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] / N[(N[(1.0 + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4.7 \cdot 10^{+101}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;x \leq -3.7 \cdot 10^{-13}:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}\\
\mathbf{elif}\;x \leq 5 \cdot 10^{-210}:\\
\;\;\;\;\frac{\frac{x}{x + y} \cdot y}{\left(1 + y\right) \cdot \left(x + y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{y}\\
\end{array}
\end{array}
if x < -4.69999999999999971e101Initial program 65.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-/.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%
Taylor expanded in x around inf
Applied rewrites86.3%
if -4.69999999999999971e101 < x < -3.69999999999999989e-13Initial program 78.2%
if -3.69999999999999989e-13 < x < 5.0000000000000002e-210Initial program 73.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%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lift-/.f64N/A
associate-*r/N/A
associate-*l/N/A
lift-/.f64N/A
lower-/.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-/.f64N/A
*-commutativeN/A
lower-*.f6499.8
lift-+.f64N/A
+-commutativeN/A
lift-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lift-+.f6499.8
Applied rewrites99.8%
if 5.0000000000000002e-210 < 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.f6445.7
Applied rewrites45.7%
Applied rewrites46.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -4.7e+101)
(* 1.0 (/ (/ y (+ 1.0 (+ y x))) (+ y x)))
(if (<= x -1.8e-20)
(/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0)))
(if (<= x 5e-210)
(* (/ y (* (+ 1.0 y) (+ y x))) (/ x (+ y x)))
(/ (/ x (+ 1.0 y)) y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -4.7e+101) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= -1.8e-20) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else if (x <= 5e-210) {
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
} else {
tmp = (x / (1.0 + 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 <= (-4.7d+101)) then
tmp = 1.0d0 * ((y / (1.0d0 + (y + x))) / (y + x))
else if (x <= (-1.8d-20)) then
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
else if (x <= 5d-210) then
tmp = (y / ((1.0d0 + y) * (y + x))) * (x / (y + x))
else
tmp = (x / (1.0d0 + y)) / y
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -4.7e+101) {
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
} else if (x <= -1.8e-20) {
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
} else if (x <= 5e-210) {
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
} else {
tmp = (x / (1.0 + y)) / y;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -4.7e+101: tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x)) elif x <= -1.8e-20: tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)) elif x <= 5e-210: tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x)) else: tmp = (x / (1.0 + y)) / y return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -4.7e+101) tmp = Float64(1.0 * Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x))); elseif (x <= -1.8e-20) tmp = Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))); elseif (x <= 5e-210) 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)) / y); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -4.7e+101)
tmp = 1.0 * ((y / (1.0 + (y + x))) / (y + x));
elseif (x <= -1.8e-20)
tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
elseif (x <= 5e-210)
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
else
tmp = (x / (1.0 + 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, -4.7e+101], 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.8e-20], N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5e-210], 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] / y), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4.7 \cdot 10^{+101}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{1 + \left(y + x\right)}}{y + x}\\
\mathbf{elif}\;x \leq -1.8 \cdot 10^{-20}:\\
\;\;\;\;\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}\\
\mathbf{elif}\;x \leq 5 \cdot 10^{-210}:\\
\;\;\;\;\frac{y}{\left(1 + y\right) \cdot \left(y + x\right)} \cdot \frac{x}{y + x}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{y}\\
\end{array}
\end{array}
if x < -4.69999999999999971e101Initial program 65.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-/.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%
Taylor expanded in x around inf
Applied rewrites86.3%
if -4.69999999999999971e101 < x < -1.79999999999999987e-20Initial program 80.8%
if -1.79999999999999987e-20 < x < 5.0000000000000002e-210Initial program 72.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 5.0000000000000002e-210 < 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.f6445.7
Applied rewrites45.7%
Applied rewrites46.2%
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 70.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.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
(if (<= x -2.1e+156)
(* 1.0 (/ (/ y x) (+ y x)))
(if (<= x -1.25e-117)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) 1.0)
(/ (/ x (+ 1.0 y)) y))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -2.1e+156) {
tmp = 1.0 * ((y / x) / (y + x));
} else if (x <= -1.25e-117) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
} else {
tmp = (x / (1.0 + 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 <= (-2.1d+156)) then
tmp = 1.0d0 * ((y / x) / (y + x))
else if (x <= (-1.25d-117)) then
tmp = (y / ((1.0d0 + (y + x)) * (y + x))) * 1.0d0
else
tmp = (x / (1.0d0 + y)) / y
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -2.1e+156) {
tmp = 1.0 * ((y / x) / (y + x));
} else if (x <= -1.25e-117) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
} else {
tmp = (x / (1.0 + y)) / y;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -2.1e+156: tmp = 1.0 * ((y / x) / (y + x)) elif x <= -1.25e-117: tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0 else: tmp = (x / (1.0 + y)) / y return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -2.1e+156) tmp = Float64(1.0 * Float64(Float64(y / x) / Float64(y + x))); elseif (x <= -1.25e-117) 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)) / y); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -2.1e+156)
tmp = 1.0 * ((y / x) / (y + x));
elseif (x <= -1.25e-117)
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
else
tmp = (x / (1.0 + 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, -2.1e+156], N[(1.0 * N[(N[(y / x), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.25e-117], 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] / y), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -2.1 \cdot 10^{+156}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{x}}{y + x}\\
\mathbf{elif}\;x \leq -1.25 \cdot 10^{-117}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{y}\\
\end{array}
\end{array}
if x < -2.09999999999999981e156Initial program 67.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-/.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%
Taylor expanded in x around inf
Applied rewrites96.0%
Taylor expanded in x around inf
lower-/.f6496.1
Applied rewrites96.1%
if -2.09999999999999981e156 < x < -1.25e-117Initial program 79.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-/.f6494.8
lift-+.f64N/A
+-commutativeN/A
Applied rewrites94.8%
Taylor expanded in x around inf
Applied rewrites70.4%
if -1.25e-117 < x Initial program 68.1%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.4
Applied rewrites62.4%
Applied rewrites62.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= y 2.4e-205)
(/ y (fma x x x))
(if (<= y 8.8e+156)
(* 1.0 (/ x (* (+ 1.0 (+ y x)) (+ y x))))
(/ (/ x y) y))))assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 2.4e-205) {
tmp = y / fma(x, x, x);
} else if (y <= 8.8e+156) {
tmp = 1.0 * (x / ((1.0 + (y + x)) * (y + x)));
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 2.4e-205) tmp = Float64(y / fma(x, x, x)); elseif (y <= 8.8e+156) tmp = Float64(1.0 * Float64(x / Float64(Float64(1.0 + Float64(y + x)) * Float64(y + 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.4e-205], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.8e+156], N[(1.0 * N[(x / N[(N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $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.4 \cdot 10^{-205}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 8.8 \cdot 10^{+156}:\\
\;\;\;\;1 \cdot \frac{x}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < 2.4000000000000002e-205Initial program 71.5%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6453.7
Applied rewrites53.7%
if 2.4000000000000002e-205 < y < 8.80000000000000016e156Initial program 68.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6493.9
Applied rewrites93.9%
Taylor expanded in x around 0
Applied rewrites70.9%
if 8.80000000000000016e156 < y Initial program 69.7%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6495.1
Applied rewrites95.1%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 1.22e-79) (/ y (fma x x x)) (if (<= y 8.8e+156) (/ x (fma y y y)) (/ (/ x y) y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1.22e-79) {
tmp = y / fma(x, x, x);
} else if (y <= 8.8e+156) {
tmp = x / fma(y, y, y);
} else {
tmp = (x / y) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 1.22e-79) tmp = Float64(y / fma(x, x, x)); elseif (y <= 8.8e+156) tmp = Float64(x / fma(y, y, y)); else tmp = Float64(Float64(x / y) / y); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 1.22e-79], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.8e+156], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.22 \cdot 10^{-79}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{elif}\;y \leq 8.8 \cdot 10^{+156}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\
\end{array}
\end{array}
if y < 1.22e-79Initial program 69.3%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6453.2
Applied rewrites53.2%
if 1.22e-79 < y < 8.80000000000000016e156Initial program 75.7%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.1
Applied rewrites62.1%
if 8.80000000000000016e156 < y Initial program 69.7%
Taylor expanded in y around inf
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6495.1
Applied rewrites95.1%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 1.22e-79) (/ y (fma x x x)) (/ (/ x (+ 1.0 y)) y)))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1.22e-79) {
tmp = y / fma(x, x, x);
} else {
tmp = (x / (1.0 + y)) / y;
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 1.22e-79) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(Float64(x / Float64(1.0 + y)) / y); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 1.22e-79], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(1.0 + y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.22 \cdot 10^{-79}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{1 + y}}{y}\\
\end{array}
\end{array}
if y < 1.22e-79Initial program 69.3%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6453.2
Applied rewrites53.2%
if 1.22e-79 < y Initial program 73.0%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6473.4
Applied rewrites73.4%
Applied rewrites76.0%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 1.22e-79) (/ y (fma x x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1.22e-79) {
tmp = y / fma(x, x, x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 1.22e-79) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[y, 1.22e-79], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.22 \cdot 10^{-79}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if y < 1.22e-79Initial program 69.3%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6453.2
Applied rewrites53.2%
if 1.22e-79 < y Initial program 73.0%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6473.4
Applied rewrites73.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -6200.0) (/ y (* x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -6200.0) {
tmp = y / (x * x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -6200.0) tmp = Float64(y / Float64(x * x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -6200.0], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -6200:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -6200Initial program 68.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%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6467.0
Applied rewrites67.0%
if -6200 < x Initial program 71.1%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.5
Applied rewrites62.5%
Final simplification63.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 7500000.0) (/ y (* x x)) (/ x (* y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 7500000.0) {
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 (y <= 7500000.0d0) 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 (y <= 7500000.0) {
tmp = y / (x * x);
} else {
tmp = x / (y * y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 7500000.0: tmp = y / (x * x) else: tmp = x / (y * y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 7500000.0) 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 (y <= 7500000.0)
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[y, 7500000.0], 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}\;y \leq 7500000:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if y < 7.5e6Initial program 71.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6439.3
Applied rewrites39.3%
if 7.5e6 < y Initial program 68.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-/.f64N/A
unpow2N/A
lower-*.f6478.6
Applied rewrites78.6%
Final simplification49.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ x (* y y)))
assert(x < y);
double code(double x, double y) {
return x / (y * y);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = x / (y * y)
end function
assert x < y;
public static double code(double x, double y) {
return x / (y * y);
}
[x, y] = sort([x, y]) def code(x, y): return x / (y * y)
x, y = sort([x, y]) function code(x, y) return Float64(x / Float64(y * y)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = x / (y * y);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{x}{y \cdot y}
\end{array}
Initial program 70.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.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-*.f6441.2
Applied rewrites41.2%
Final simplification41.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 2024338
(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))))