
(FPCore (x y) :precision binary64 (/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))
double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
end function
public static double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
def code(x, y): return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0))
function code(x, y) return Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) end
function tmp = code(x, y) tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)); end
code[x_, y_] := N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y) :precision binary64 (/ (* x y) (* (* (+ x y) (+ x y)) (+ (+ x y) 1.0))))
double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0d0))
end function
public static double code(double x, double y) {
return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0));
}
def code(x, y): return (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0))
function code(x, y) return Float64(Float64(x * y) / Float64(Float64(Float64(x + y) * Float64(x + y)) * Float64(Float64(x + y) + 1.0))) end
function tmp = code(x, y) tmp = (x * y) / (((x + y) * (x + y)) * ((x + y) + 1.0)); end
code[x_, y_] := N[(N[(x * y), $MachinePrecision] / N[(N[(N[(x + y), $MachinePrecision] * N[(x + y), $MachinePrecision]), $MachinePrecision] * N[(N[(x + y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y}{\left(\left(x + y\right) \cdot \left(x + y\right)\right) \cdot \left(\left(x + y\right) + 1\right)}
\end{array}
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ (/ (* (/ x (+ y x)) y) (+ 1.0 (+ y x))) (+ y x)))
assert(x < y);
double code(double x, double y) {
return (((x / (y + x)) * y) / (1.0 + (y + x))) / (y + x);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (((x / (y + x)) * y) / (1.0d0 + (y + x))) / (y + x)
end function
assert x < y;
public static double code(double x, double y) {
return (((x / (y + x)) * y) / (1.0 + (y + x))) / (y + x);
}
[x, y] = sort([x, y]) def code(x, y): return (((x / (y + x)) * y) / (1.0 + (y + x))) / (y + x)
x, y = sort([x, y]) function code(x, y) return Float64(Float64(Float64(Float64(x / Float64(y + x)) * 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[(N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{\frac{x}{y + x} \cdot y}{1 + \left(y + x\right)}}{y + x}
\end{array}
Initial program 68.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6488.6
Applied rewrites88.6%
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.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))) (t_1 (+ 1.0 (+ y x))))
(if (<= x -8.2e+160)
(* 1.0 (/ (/ y t_1) (+ y x)))
(if (<= x -1.2e-269) (* (/ t_0 (* t_1 (+ y x))) y) (/ t_0 (* 1.0 t_1))))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (y + x);
double t_1 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_1) / (y + x));
} else if (x <= -1.2e-269) {
tmp = (t_0 / (t_1 * (y + x))) * y;
} else {
tmp = t_0 / (1.0 * t_1);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = x / (y + x)
t_1 = 1.0d0 + (y + x)
if (x <= (-8.2d+160)) then
tmp = 1.0d0 * ((y / t_1) / (y + x))
else if (x <= (-1.2d-269)) then
tmp = (t_0 / (t_1 * (y + x))) * y
else
tmp = t_0 / (1.0d0 * t_1)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = x / (y + x);
double t_1 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_1) / (y + x));
} else if (x <= -1.2e-269) {
tmp = (t_0 / (t_1 * (y + x))) * y;
} else {
tmp = t_0 / (1.0 * t_1);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y + x) t_1 = 1.0 + (y + x) tmp = 0 if x <= -8.2e+160: tmp = 1.0 * ((y / t_1) / (y + x)) elif x <= -1.2e-269: tmp = (t_0 / (t_1 * (y + x))) * y else: tmp = t_0 / (1.0 * t_1) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y + x)) t_1 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(1.0 * Float64(Float64(y / t_1) / Float64(y + x))); elseif (x <= -1.2e-269) tmp = Float64(Float64(t_0 / Float64(t_1 * Float64(y + x))) * y); else tmp = Float64(t_0 / Float64(1.0 * t_1)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = x / (y + x);
t_1 = 1.0 + (y + x);
tmp = 0.0;
if (x <= -8.2e+160)
tmp = 1.0 * ((y / t_1) / (y + x));
elseif (x <= -1.2e-269)
tmp = (t_0 / (t_1 * (y + x))) * y;
else
tmp = t_0 / (1.0 * t_1);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.2e+160], N[(1.0 * N[(N[(y / t$95$1), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.2e-269], N[(N[(t$95$0 / N[(t$95$1 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], N[(t$95$0 / N[(1.0 * t$95$1), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y + x}\\
t_1 := 1 + \left(y + x\right)\\
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_1}}{y + x}\\
\mathbf{elif}\;x \leq -1.2 \cdot 10^{-269}:\\
\;\;\;\;\frac{t\_0}{t\_1 \cdot \left(y + x\right)} \cdot y\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{1 \cdot t\_1}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites85.6%
if -8.19999999999999996e160 < x < -1.20000000000000005e-269Initial program 79.3%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6494.0
Applied rewrites94.0%
if -1.20000000000000005e-269 < x Initial program 65.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.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.4
Applied rewrites99.4%
Taylor expanded in y around inf
Applied rewrites51.9%
Final simplification72.2%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= x -8.2e+160)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= x -6e-11)
(* (/ y (* t_0 (+ y x))) 1.0)
(* (/ y (* (+ 1.0 y) (+ y x))) (/ x (+ y x)))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (x <= -6e-11) {
tmp = (y / (t_0 * (y + x))) * 1.0;
} else {
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (x <= (-8.2d+160)) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (x <= (-6d-11)) then
tmp = (y / (t_0 * (y + x))) * 1.0d0
else
tmp = (y / ((1.0d0 + y) * (y + x))) * (x / (y + x))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (x <= -6e-11) {
tmp = (y / (t_0 * (y + x))) * 1.0;
} else {
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if x <= -8.2e+160: tmp = 1.0 * ((y / t_0) / (y + x)) elif x <= -6e-11: tmp = (y / (t_0 * (y + x))) * 1.0 else: tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x)) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (x <= -6e-11) tmp = Float64(Float64(y / Float64(t_0 * Float64(y + x))) * 1.0); else tmp = Float64(Float64(y / Float64(Float64(1.0 + y) * Float64(y + x))) * Float64(x / Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (x <= -8.2e+160)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (x <= -6e-11)
tmp = (y / (t_0 * (y + x))) * 1.0;
else
tmp = (y / ((1.0 + y) * (y + x))) * (x / (y + x));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.2e+160], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -6e-11], N[(N[(y / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(y / N[(N[(1.0 + y), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;x \leq -6 \cdot 10^{-11}:\\
\;\;\;\;\frac{y}{t\_0 \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{\left(1 + y\right) \cdot \left(y + x\right)} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites85.6%
if -8.19999999999999996e160 < x < -6e-11Initial program 78.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-/.f6497.3
lift-+.f64N/A
+-commutativeN/A
Applied rewrites97.3%
Taylor expanded in y around 0
Applied rewrites84.8%
if -6e-11 < x Initial program 69.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-/.f6495.3
lift-+.f64N/A
+-commutativeN/A
Applied rewrites95.3%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6485.9
Applied rewrites85.9%
Final simplification85.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= x -8.2e+160)
(* 1.0 (/ (/ y t_0) (+ y x)))
(* (/ y (* t_0 (+ y x))) (/ x (+ y x))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else {
tmp = (y / (t_0 * (y + x))) * (x / (y + x));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (x <= (-8.2d+160)) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else
tmp = (y / (t_0 * (y + x))) * (x / (y + x))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else {
tmp = (y / (t_0 * (y + x))) * (x / (y + x));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if x <= -8.2e+160: tmp = 1.0 * ((y / t_0) / (y + x)) else: tmp = (y / (t_0 * (y + x))) * (x / (y + x)) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); else tmp = Float64(Float64(y / Float64(t_0 * Float64(y + x))) * Float64(x / Float64(y + x))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (x <= -8.2e+160)
tmp = 1.0 * ((y / t_0) / (y + x));
else
tmp = (y / (t_0 * (y + x))) * (x / (y + x));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.2e+160], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{t\_0 \cdot \left(y + x\right)} \cdot \frac{x}{y + x}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites85.6%
if -8.19999999999999996e160 < x Initial program 71.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.7
lift-+.f64N/A
+-commutativeN/A
Applied rewrites95.7%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (* (/ (/ y (+ 1.0 (+ y x))) (+ y x)) (/ x (+ y x))))
assert(x < y);
double code(double x, double y) {
return ((y / (1.0 + (y + x))) / (y + x)) * (x / (y + x));
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
code = ((y / (1.0d0 + (y + x))) / (y + x)) * (x / (y + x))
end function
assert x < y;
public static double code(double x, double y) {
return ((y / (1.0 + (y + x))) / (y + x)) * (x / (y + x));
}
[x, y] = sort([x, y]) def code(x, y): return ((y / (1.0 + (y + x))) / (y + x)) * (x / (y + x))
x, y = sort([x, y]) function code(x, y) return Float64(Float64(Float64(y / Float64(1.0 + Float64(y + x))) / Float64(y + x)) * Float64(x / Float64(y + x))) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = ((y / (1.0 + (y + x))) / (y + x)) * (x / (y + x));
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(N[(N[(y / N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision] * N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{\frac{y}{1 + \left(y + x\right)}}{y + x} \cdot \frac{x}{y + x}
\end{array}
Initial program 68.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
Final simplification99.8%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= x -8.2e+160)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= x -1.1e-77)
(* (/ y (* t_0 (+ y x))) 1.0)
(/ (/ x (+ y x)) (* 1.0 t_0))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (x <= -1.1e-77) {
tmp = (y / (t_0 * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) / (1.0 * t_0);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (x <= (-8.2d+160)) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (x <= (-1.1d-77)) then
tmp = (y / (t_0 * (y + x))) * 1.0d0
else
tmp = (x / (y + x)) / (1.0d0 * t_0)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (x <= -1.1e-77) {
tmp = (y / (t_0 * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) / (1.0 * t_0);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if x <= -8.2e+160: tmp = 1.0 * ((y / t_0) / (y + x)) elif x <= -1.1e-77: tmp = (y / (t_0 * (y + x))) * 1.0 else: tmp = (x / (y + x)) / (1.0 * t_0) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (x <= -1.1e-77) tmp = Float64(Float64(y / Float64(t_0 * Float64(y + x))) * 1.0); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(1.0 * t_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 (x <= -8.2e+160)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (x <= -1.1e-77)
tmp = (y / (t_0 * (y + x))) * 1.0;
else
tmp = (x / (y + x)) / (1.0 * t_0);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.2e+160], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.1e-77], N[(N[(y / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;x \leq -1.1 \cdot 10^{-77}:\\
\;\;\;\;\frac{y}{t\_0 \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 \cdot t\_0}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites85.6%
if -8.19999999999999996e160 < x < -1.10000000000000003e-77Initial program 78.6%
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%
Taylor expanded in y around 0
Applied rewrites79.6%
if -1.10000000000000003e-77 < x Initial program 68.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.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in y around inf
Applied rewrites61.3%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(let* ((t_0 (+ 1.0 (+ y x))))
(if (<= x -8.2e+160)
(* 1.0 (/ (/ y t_0) (+ y x)))
(if (<= x -1.1e-77)
(* (/ y (* t_0 (+ y x))) 1.0)
(/ (/ x (+ y x)) (+ 1.0 y))))))assert(x < y);
double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (x <= -1.1e-77) {
tmp = (y / (t_0 * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 + (y + x)
if (x <= (-8.2d+160)) then
tmp = 1.0d0 * ((y / t_0) / (y + x))
else if (x <= (-1.1d-77)) then
tmp = (y / (t_0 * (y + x))) * 1.0d0
else
tmp = (x / (y + x)) / (1.0d0 + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = 1.0 + (y + x);
double tmp;
if (x <= -8.2e+160) {
tmp = 1.0 * ((y / t_0) / (y + x));
} else if (x <= -1.1e-77) {
tmp = (y / (t_0 * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = 1.0 + (y + x) tmp = 0 if x <= -8.2e+160: tmp = 1.0 * ((y / t_0) / (y + x)) elif x <= -1.1e-77: tmp = (y / (t_0 * (y + x))) * 1.0 else: tmp = (x / (y + x)) / (1.0 + y) return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(1.0 + Float64(y + x)) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(1.0 * Float64(Float64(y / t_0) / Float64(y + x))); elseif (x <= -1.1e-77) tmp = Float64(Float64(y / Float64(t_0 * Float64(y + x))) * 1.0); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(1.0 + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = 1.0 + (y + x);
tmp = 0.0;
if (x <= -8.2e+160)
tmp = 1.0 * ((y / t_0) / (y + x));
elseif (x <= -1.1e-77)
tmp = (y / (t_0 * (y + x))) * 1.0;
else
tmp = (x / (y + x)) / (1.0 + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.2e+160], N[(1.0 * N[(N[(y / t$95$0), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.1e-77], N[(N[(y / N[(t$95$0 * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 + y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := 1 + \left(y + x\right)\\
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;1 \cdot \frac{\frac{y}{t\_0}}{y + x}\\
\mathbf{elif}\;x \leq -1.1 \cdot 10^{-77}:\\
\;\;\;\;\frac{y}{t\_0 \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 + y}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
Taylor expanded in y around 0
Applied rewrites85.6%
if -8.19999999999999996e160 < x < -1.10000000000000003e-77Initial program 78.6%
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%
Taylor expanded in y around 0
Applied rewrites79.6%
if -1.10000000000000003e-77 < x Initial program 68.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.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6460.7
Applied rewrites60.7%
Final simplification68.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -8.2e+160)
(/ (/ y x) (+ y x))
(if (<= x -1.1e-77)
(* (/ y (* (+ 1.0 (+ y x)) (+ y x))) 1.0)
(/ (/ x (+ y x)) (+ 1.0 y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -8.2e+160) {
tmp = (y / x) / (y + x);
} else if (x <= -1.1e-77) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-8.2d+160)) then
tmp = (y / x) / (y + x)
else if (x <= (-1.1d-77)) then
tmp = (y / ((1.0d0 + (y + x)) * (y + x))) * 1.0d0
else
tmp = (x / (y + x)) / (1.0d0 + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -8.2e+160) {
tmp = (y / x) / (y + x);
} else if (x <= -1.1e-77) {
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -8.2e+160: tmp = (y / x) / (y + x) elif x <= -1.1e-77: tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0 else: tmp = (x / (y + x)) / (1.0 + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(Float64(y / x) / Float64(y + x)); elseif (x <= -1.1e-77) 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)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -8.2e+160)
tmp = (y / x) / (y + x);
elseif (x <= -1.1e-77)
tmp = (y / ((1.0 + (y + x)) * (y + x))) * 1.0;
else
tmp = (x / (y + x)) / (1.0 + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -8.2e+160], N[(N[(y / x), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.1e-77], 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[(1.0 + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{y}{x}}{y + x}\\
\mathbf{elif}\;x \leq -1.1 \cdot 10^{-77}:\\
\;\;\;\;\frac{y}{\left(1 + \left(y + x\right)\right) \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 + y}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.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%
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-/.f6470.7
Applied rewrites70.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied rewrites99.9%
Taylor expanded in x around inf
lower-/.f6485.4
Applied rewrites85.4%
if -8.19999999999999996e160 < x < -1.10000000000000003e-77Initial program 78.6%
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%
Taylor expanded in y around 0
Applied rewrites79.6%
if -1.10000000000000003e-77 < x Initial program 68.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.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6460.7
Applied rewrites60.7%
Final simplification68.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -8.2e+160)
(/ (/ y x) (+ y x))
(if (<= x -1.02e-75)
(* (/ y (* (+ 1.0 x) (+ y x))) 1.0)
(/ (/ x (+ y x)) (+ 1.0 y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -8.2e+160) {
tmp = (y / x) / (y + x);
} else if (x <= -1.02e-75) {
tmp = (y / ((1.0 + x) * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (x <= (-8.2d+160)) then
tmp = (y / x) / (y + x)
else if (x <= (-1.02d-75)) then
tmp = (y / ((1.0d0 + x) * (y + x))) * 1.0d0
else
tmp = (x / (y + x)) / (1.0d0 + y)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double tmp;
if (x <= -8.2e+160) {
tmp = (y / x) / (y + x);
} else if (x <= -1.02e-75) {
tmp = (y / ((1.0 + x) * (y + x))) * 1.0;
} else {
tmp = (x / (y + x)) / (1.0 + y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if x <= -8.2e+160: tmp = (y / x) / (y + x) elif x <= -1.02e-75: tmp = (y / ((1.0 + x) * (y + x))) * 1.0 else: tmp = (x / (y + x)) / (1.0 + y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(Float64(y / x) / Float64(y + x)); elseif (x <= -1.02e-75) tmp = Float64(Float64(y / Float64(Float64(1.0 + x) * Float64(y + x))) * 1.0); else tmp = Float64(Float64(x / Float64(y + x)) / Float64(1.0 + y)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
tmp = 0.0;
if (x <= -8.2e+160)
tmp = (y / x) / (y + x);
elseif (x <= -1.02e-75)
tmp = (y / ((1.0 + x) * (y + x))) * 1.0;
else
tmp = (x / (y + x)) / (1.0 + y);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -8.2e+160], N[(N[(y / x), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.02e-75], N[(N[(y / N[(N[(1.0 + x), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision] / N[(1.0 + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{y}{x}}{y + x}\\
\mathbf{elif}\;x \leq -1.02 \cdot 10^{-75}:\\
\;\;\;\;\frac{y}{\left(1 + x\right) \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{y + x}}{1 + y}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.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%
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-/.f6470.7
Applied rewrites70.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied rewrites99.9%
Taylor expanded in x around inf
lower-/.f6485.4
Applied rewrites85.4%
if -8.19999999999999996e160 < x < -1.01999999999999997e-75Initial program 78.2%
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.0
lift-+.f64N/A
+-commutativeN/A
Applied rewrites98.0%
Taylor expanded in y around 0
Applied rewrites80.8%
Taylor expanded in y around 0
+-commutativeN/A
lower-+.f6470.3
Applied rewrites70.3%
if -1.01999999999999997e-75 < x Initial program 69.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.9
Applied rewrites99.9%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
+-commutativeN/A
lower-+.f6461.0
Applied rewrites61.0%
Final simplification66.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
:precision binary64
(if (<= x -8.2e+160)
(/ (/ y x) (+ y x))
(if (<= x -1.02e-75)
(* (/ y (* (+ 1.0 x) (+ y x))) 1.0)
(/ x (fma y y y)))))assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -8.2e+160) {
tmp = (y / x) / (y + x);
} else if (x <= -1.02e-75) {
tmp = (y / ((1.0 + x) * (y + x))) * 1.0;
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(Float64(y / x) / Float64(y + x)); elseif (x <= -1.02e-75) tmp = Float64(Float64(y / Float64(Float64(1.0 + x) * Float64(y + x))) * 1.0); 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, -8.2e+160], N[(N[(y / x), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.02e-75], N[(N[(y / N[(N[(1.0 + x), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 1.0), $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 -8.2 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{y}{x}}{y + x}\\
\mathbf{elif}\;x \leq -1.02 \cdot 10^{-75}:\\
\;\;\;\;\frac{y}{\left(1 + x\right) \cdot \left(y + x\right)} \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.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%
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-/.f6470.7
Applied rewrites70.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied rewrites99.9%
Taylor expanded in x around inf
lower-/.f6485.4
Applied rewrites85.4%
if -8.19999999999999996e160 < x < -1.01999999999999997e-75Initial program 78.2%
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.0
lift-+.f64N/A
+-commutativeN/A
Applied rewrites98.0%
Taylor expanded in y around 0
Applied rewrites80.8%
Taylor expanded in y around 0
+-commutativeN/A
lower-+.f6470.3
Applied rewrites70.3%
if -1.01999999999999997e-75 < x Initial program 69.1%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.3
Applied rewrites62.3%
Final simplification67.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 y))))
(if (<= x -4.6e-36)
(/ y (* x x))
(if (<= x -1.02e-179) t_0 (if (<= x 3.3e-67) (/ x y) t_0)))))assert(x < y);
double code(double x, double y) {
double t_0 = x / (y * y);
double tmp;
if (x <= -4.6e-36) {
tmp = y / (x * x);
} else if (x <= -1.02e-179) {
tmp = t_0;
} else if (x <= 3.3e-67) {
tmp = x / y;
} else {
tmp = t_0;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: t_0
real(8) :: tmp
t_0 = x / (y * y)
if (x <= (-4.6d-36)) then
tmp = y / (x * x)
else if (x <= (-1.02d-179)) then
tmp = t_0
else if (x <= 3.3d-67) then
tmp = x / y
else
tmp = t_0
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y) {
double t_0 = x / (y * y);
double tmp;
if (x <= -4.6e-36) {
tmp = y / (x * x);
} else if (x <= -1.02e-179) {
tmp = t_0;
} else if (x <= 3.3e-67) {
tmp = x / y;
} else {
tmp = t_0;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): t_0 = x / (y * y) tmp = 0 if x <= -4.6e-36: tmp = y / (x * x) elif x <= -1.02e-179: tmp = t_0 elif x <= 3.3e-67: tmp = x / y else: tmp = t_0 return tmp
x, y = sort([x, y]) function code(x, y) t_0 = Float64(x / Float64(y * y)) tmp = 0.0 if (x <= -4.6e-36) tmp = Float64(y / Float64(x * x)); elseif (x <= -1.02e-179) tmp = t_0; elseif (x <= 3.3e-67) tmp = Float64(x / y); else tmp = t_0; end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
t_0 = x / (y * y);
tmp = 0.0;
if (x <= -4.6e-36)
tmp = y / (x * x);
elseif (x <= -1.02e-179)
tmp = t_0;
elseif (x <= 3.3e-67)
tmp = x / y;
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := Block[{t$95$0 = N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -4.6e-36], N[(y / N[(x * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.02e-179], t$95$0, If[LessEqual[x, 3.3e-67], N[(x / y), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_0 := \frac{x}{y \cdot y}\\
\mathbf{if}\;x \leq -4.6 \cdot 10^{-36}:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{elif}\;x \leq -1.02 \cdot 10^{-179}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;x \leq 3.3 \cdot 10^{-67}:\\
\;\;\;\;\frac{x}{y}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if x < -4.59999999999999993e-36Initial program 67.4%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6458.1
Applied rewrites58.1%
if -4.59999999999999993e-36 < x < -1.02e-179 or 3.3000000000000002e-67 < x Initial program 70.1%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6439.2
Applied rewrites39.2%
if -1.02e-179 < x < 3.3000000000000002e-67Initial program 68.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
associate-/r*N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.9
Applied rewrites99.9%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6483.1
Applied rewrites83.1%
Taylor expanded in y around 0
Applied rewrites69.2%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -8.2e+160) (/ (/ y x) (+ y x)) (if (<= x -1.02e-75) (/ y (fma x x x)) (/ x (fma y y y)))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -8.2e+160) {
tmp = (y / x) / (y + x);
} else if (x <= -1.02e-75) {
tmp = y / fma(x, x, x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(Float64(y / x) / Float64(y + x)); elseif (x <= -1.02e-75) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -8.2e+160], N[(N[(y / x), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.02e-75], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{y}{x}}{y + x}\\
\mathbf{elif}\;x \leq -1.02 \cdot 10^{-75}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.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%
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-/.f6470.7
Applied rewrites70.7%
lift-*.f64N/A
lift-/.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied rewrites99.9%
Taylor expanded in x around inf
lower-/.f6485.4
Applied rewrites85.4%
if -8.19999999999999996e160 < x < -1.01999999999999997e-75Initial program 78.2%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6461.3
Applied rewrites61.3%
if -1.01999999999999997e-75 < x Initial program 69.1%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.3
Applied rewrites62.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -8.2e+160) (/ (/ y x) x) (if (<= x -1.02e-75) (/ y (fma x x x)) (/ x (fma y y y)))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -8.2e+160) {
tmp = (y / x) / x;
} else if (x <= -1.02e-75) {
tmp = y / fma(x, x, x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -8.2e+160) tmp = Float64(Float64(y / x) / x); elseif (x <= -1.02e-75) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -8.2e+160], N[(N[(y / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, -1.02e-75], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -8.2 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{y}{x}}{x}\\
\mathbf{elif}\;x \leq -1.02 \cdot 10^{-75}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -8.19999999999999996e160Initial program 50.7%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6470.7
Applied rewrites70.7%
Applied rewrites85.2%
if -8.19999999999999996e160 < x < -1.01999999999999997e-75Initial program 78.2%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6461.3
Applied rewrites61.3%
if -1.01999999999999997e-75 < x Initial program 69.1%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.3
Applied rewrites62.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -1.02e-75) (/ y (fma x x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -1.02e-75) {
tmp = y / fma(x, x, x);
} else {
tmp = x / fma(y, y, y);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (x <= -1.02e-75) tmp = Float64(y / fma(x, x, x)); else tmp = Float64(x / fma(y, y, y)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := If[LessEqual[x, -1.02e-75], N[(y / N[(x * x + x), $MachinePrecision]), $MachinePrecision], N[(x / N[(y * y + y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.02 \cdot 10^{-75}:\\
\;\;\;\;\frac{y}{\mathsf{fma}\left(x, x, x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -1.01999999999999997e-75Initial program 68.3%
Taylor expanded in y around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6464.7
Applied rewrites64.7%
if -1.01999999999999997e-75 < x Initial program 69.1%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6462.3
Applied rewrites62.3%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= x -2.3e-34) (/ y (* x x)) (/ x (fma y y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (x <= -2.3e-34) {
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 <= -2.3e-34) 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, -2.3e-34], 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 -2.3 \cdot 10^{-34}:\\
\;\;\;\;\frac{y}{x \cdot x}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(y, y, y\right)}\\
\end{array}
\end{array}
if x < -2.30000000000000011e-34Initial program 67.0%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6458.8
Applied rewrites58.8%
if -2.30000000000000011e-34 < x Initial program 69.6%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6460.9
Applied rewrites60.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (if (<= y 1.0) (/ x y) (/ x (* y y))))
assert(x < y);
double code(double x, double y) {
double tmp;
if (y <= 1.0) {
tmp = x / y;
} 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 <= 1.0d0) then
tmp = x / y
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 <= 1.0) {
tmp = x / y;
} else {
tmp = x / (y * y);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y): tmp = 0 if y <= 1.0: tmp = x / y else: tmp = x / (y * y) return tmp
x, y = sort([x, y]) function code(x, y) tmp = 0.0 if (y <= 1.0) tmp = Float64(x / y); 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 <= 1.0)
tmp = x / y;
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, 1.0], N[(x / y), $MachinePrecision], N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1:\\
\;\;\;\;\frac{x}{y}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y}\\
\end{array}
\end{array}
if y < 1Initial program 70.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%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.6
Applied rewrites99.6%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6443.4
Applied rewrites43.4%
Taylor expanded in y around 0
Applied rewrites25.8%
if 1 < y Initial program 62.6%
Taylor expanded in y around inf
lower-/.f64N/A
unpow2N/A
lower-*.f6471.8
Applied rewrites71.8%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y) :precision binary64 (/ x y))
assert(x < y);
double code(double x, double y) {
return x / 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
end function
assert x < y;
public static double code(double x, double y) {
return x / y;
}
[x, y] = sort([x, y]) def code(x, y): return x / y
x, y = sort([x, y]) function code(x, y) return Float64(x / y) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
tmp = x / y;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_] := N[(x / y), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{x}{y}
\end{array}
Initial program 68.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
associate-*l/N/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
Applied rewrites99.8%
lift-*.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
lift-/.f64N/A
clear-numN/A
lift-/.f64N/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
Applied rewrites99.5%
Taylor expanded in x around 0
lower-/.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6450.2
Applied rewrites50.2%
Taylor expanded in y around 0
Applied rewrites25.3%
(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 2024243
(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))))