
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))
double code(double x, double y, double z) {
return 2.0 * sqrt((((x * y) + (x * z)) + (y * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}
def code(x, y, z): return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))
function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z)))) end
function tmp = code(x, y, z) tmp = 2.0 * sqrt((((x * y) + (x * z)) + (y * z))); end
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z}
\end{array}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0
(*
2.0
(pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0))))
(if (<= y -8.5e+55)
t_0
(if (<= y -1.65e-204)
(* 2.0 (sqrt (* x (+ y z))))
(if (<= y 4e-306) t_0 (* 2.0 (* (sqrt (+ y x)) (sqrt z))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
double tmp;
if (y <= -8.5e+55) {
tmp = t_0;
} else if (y <= -1.65e-204) {
tmp = 2.0 * sqrt((x * (y + z)));
} else if (y <= 4e-306) {
tmp = t_0;
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 * (exp((0.25d0 * (log((-y - z)) - log(((-1.0d0) / x))))) ** 2.0d0)
if (y <= (-8.5d+55)) then
tmp = t_0
else if (y <= (-1.65d-204)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else if (y <= 4d-306) then
tmp = t_0
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double t_0 = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((-y - z)) - Math.log((-1.0 / x))))), 2.0);
double tmp;
if (y <= -8.5e+55) {
tmp = t_0;
} else if (y <= -1.65e-204) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else if (y <= 4e-306) {
tmp = t_0;
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): t_0 = 2.0 * math.pow(math.exp((0.25 * (math.log((-y - z)) - math.log((-1.0 / x))))), 2.0) tmp = 0 if y <= -8.5e+55: tmp = t_0 elif y <= -1.65e-204: tmp = 2.0 * math.sqrt((x * (y + z))) elif y <= 4e-306: tmp = t_0 else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0)) tmp = 0.0 if (y <= -8.5e+55) tmp = t_0; elseif (y <= -1.65e-204) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); elseif (y <= 4e-306) tmp = t_0; else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
t_0 = 2.0 * (exp((0.25 * (log((-y - z)) - log((-1.0 / x))))) ^ 2.0);
tmp = 0.0;
if (y <= -8.5e+55)
tmp = t_0;
elseif (y <= -1.65e-204)
tmp = 2.0 * sqrt((x * (y + z)));
elseif (y <= 4e-306)
tmp = t_0;
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -8.5e+55], t$95$0, If[LessEqual[y, -1.65e-204], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4e-306], t$95$0, N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := 2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\
\mathbf{if}\;y \leq -8.5 \cdot 10^{+55}:\\
\;\;\;\;t_0\\
\mathbf{elif}\;y \leq -1.65 \cdot 10^{-204}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{elif}\;y \leq 4 \cdot 10^{-306}:\\
\;\;\;\;t_0\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -8.50000000000000002e55 or -1.65000000000000005e-204 < y < 4.00000000000000011e-306Initial program 66.9%
+-commutative66.9%
associate-+r+66.9%
*-commutative66.9%
+-commutative66.9%
associate-+l+66.9%
*-commutative66.9%
*-commutative66.9%
*-commutative66.9%
distribute-lft-out66.9%
Simplified66.9%
add-sqr-sqrt66.3%
pow266.3%
pow1/266.3%
sqrt-pow166.4%
+-commutative66.4%
+-commutative66.4%
fma-def66.5%
metadata-eval66.5%
Applied egg-rr66.5%
Taylor expanded in x around -inf 46.2%
if -8.50000000000000002e55 < y < -1.65000000000000005e-204Initial program 84.1%
+-commutative84.1%
associate-+r+84.1%
*-commutative84.1%
+-commutative84.1%
associate-+l+84.1%
*-commutative84.1%
*-commutative84.1%
*-commutative84.1%
distribute-lft-out84.1%
Simplified84.1%
Taylor expanded in x around inf 55.4%
if 4.00000000000000011e-306 < y Initial program 75.2%
+-commutative75.2%
associate-+r+75.2%
*-commutative75.2%
+-commutative75.2%
associate-+l+75.2%
*-commutative75.2%
*-commutative75.2%
*-commutative75.2%
distribute-lft-out75.2%
Simplified75.2%
Taylor expanded in z around inf 54.5%
+-commutative54.5%
Simplified54.5%
+-commutative54.5%
*-commutative54.5%
sqrt-prod53.4%
Applied egg-rr53.4%
Final simplification52.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0 (log (/ -1.0 x))))
(if (<= y -3.1e+54)
(* 2.0 (pow (exp (* 0.16666666666666666 (- (log (- y)) t_0))) 3.0))
(if (<= y -1.65e-204)
(* 2.0 (sqrt (* x (+ y z))))
(if (<= y -2.7e-285)
(*
2.0
(pow (exp (* (- (log (- (- y) z)) t_0) 0.08333333333333333)) 6.0))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = log((-1.0 / x));
double tmp;
if (y <= -3.1e+54) {
tmp = 2.0 * pow(exp((0.16666666666666666 * (log(-y) - t_0))), 3.0);
} else if (y <= -1.65e-204) {
tmp = 2.0 * sqrt((x * (y + z)));
} else if (y <= -2.7e-285) {
tmp = 2.0 * pow(exp(((log((-y - z)) - t_0) * 0.08333333333333333)), 6.0);
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = log(((-1.0d0) / x))
if (y <= (-3.1d+54)) then
tmp = 2.0d0 * (exp((0.16666666666666666d0 * (log(-y) - t_0))) ** 3.0d0)
else if (y <= (-1.65d-204)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else if (y <= (-2.7d-285)) then
tmp = 2.0d0 * (exp(((log((-y - z)) - t_0) * 0.08333333333333333d0)) ** 6.0d0)
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double t_0 = Math.log((-1.0 / x));
double tmp;
if (y <= -3.1e+54) {
tmp = 2.0 * Math.pow(Math.exp((0.16666666666666666 * (Math.log(-y) - t_0))), 3.0);
} else if (y <= -1.65e-204) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else if (y <= -2.7e-285) {
tmp = 2.0 * Math.pow(Math.exp(((Math.log((-y - z)) - t_0) * 0.08333333333333333)), 6.0);
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): t_0 = math.log((-1.0 / x)) tmp = 0 if y <= -3.1e+54: tmp = 2.0 * math.pow(math.exp((0.16666666666666666 * (math.log(-y) - t_0))), 3.0) elif y <= -1.65e-204: tmp = 2.0 * math.sqrt((x * (y + z))) elif y <= -2.7e-285: tmp = 2.0 * math.pow(math.exp(((math.log((-y - z)) - t_0) * 0.08333333333333333)), 6.0) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = log(Float64(-1.0 / x)) tmp = 0.0 if (y <= -3.1e+54) tmp = Float64(2.0 * (exp(Float64(0.16666666666666666 * Float64(log(Float64(-y)) - t_0))) ^ 3.0)); elseif (y <= -1.65e-204) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); elseif (y <= -2.7e-285) tmp = Float64(2.0 * (exp(Float64(Float64(log(Float64(Float64(-y) - z)) - t_0) * 0.08333333333333333)) ^ 6.0)); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
t_0 = log((-1.0 / x));
tmp = 0.0;
if (y <= -3.1e+54)
tmp = 2.0 * (exp((0.16666666666666666 * (log(-y) - t_0))) ^ 3.0);
elseif (y <= -1.65e-204)
tmp = 2.0 * sqrt((x * (y + z)));
elseif (y <= -2.7e-285)
tmp = 2.0 * (exp(((log((-y - z)) - t_0) * 0.08333333333333333)) ^ 6.0);
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[y, -3.1e+54], N[(2.0 * N[Power[N[Exp[N[(0.16666666666666666 * N[(N[Log[(-y)], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.65e-204], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -2.7e-285], N[(2.0 * N[Power[N[Exp[N[(N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - t$95$0), $MachinePrecision] * 0.08333333333333333), $MachinePrecision]], $MachinePrecision], 6.0], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := \log \left(\frac{-1}{x}\right)\\
\mathbf{if}\;y \leq -3.1 \cdot 10^{+54}:\\
\;\;\;\;2 \cdot {\left(e^{0.16666666666666666 \cdot \left(\log \left(-y\right) - t_0\right)}\right)}^{3}\\
\mathbf{elif}\;y \leq -1.65 \cdot 10^{-204}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{elif}\;y \leq -2.7 \cdot 10^{-285}:\\
\;\;\;\;2 \cdot {\left(e^{\left(\log \left(\left(-y\right) - z\right) - t_0\right) \cdot 0.08333333333333333}\right)}^{6}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -3.0999999999999999e54Initial program 63.0%
+-commutative63.0%
associate-+r+63.0%
*-commutative63.0%
+-commutative63.0%
associate-+l+63.0%
*-commutative63.0%
*-commutative63.0%
*-commutative63.0%
distribute-lft-out63.0%
Simplified63.0%
add-cube-cbrt62.4%
pow362.5%
+-commutative62.5%
+-commutative62.5%
fma-def62.6%
Applied egg-rr62.6%
pow1/262.6%
rem-cube-cbrt63.2%
metadata-eval63.2%
pow-pow62.7%
add-cube-cbrt61.8%
pow361.8%
Applied egg-rr57.7%
Taylor expanded in z around 0 30.0%
Taylor expanded in x around -inf 46.3%
if -3.0999999999999999e54 < y < -1.65000000000000005e-204Initial program 83.9%
+-commutative83.9%
associate-+r+83.9%
*-commutative83.9%
+-commutative83.9%
associate-+l+83.9%
*-commutative83.9%
*-commutative83.9%
*-commutative83.9%
distribute-lft-out83.9%
Simplified83.9%
Taylor expanded in x around inf 54.6%
if -1.65000000000000005e-204 < y < -2.6999999999999998e-285Initial program 72.8%
+-commutative72.8%
associate-+r+72.8%
*-commutative72.8%
+-commutative72.8%
associate-+l+72.8%
*-commutative72.8%
*-commutative72.8%
*-commutative72.8%
distribute-lft-out72.8%
Simplified72.8%
add-cube-cbrt72.1%
pow372.0%
+-commutative72.0%
+-commutative72.0%
fma-def72.0%
Applied egg-rr72.0%
pow1/272.0%
rem-cube-cbrt72.8%
metadata-eval72.8%
pow-pow72.5%
add-cube-cbrt71.4%
pow371.5%
Applied egg-rr67.1%
add-sqr-sqrt67.1%
unpow-prod-down67.1%
sqrt-pow167.1%
metadata-eval67.1%
sqrt-pow167.1%
metadata-eval67.1%
Applied egg-rr67.1%
pow-sqr67.1%
metadata-eval67.1%
Simplified67.1%
Taylor expanded in x around -inf 47.7%
if -2.6999999999999998e-285 < y Initial program 75.6%
+-commutative75.6%
associate-+r+75.6%
*-commutative75.6%
+-commutative75.6%
associate-+l+75.6%
*-commutative75.6%
*-commutative75.6%
*-commutative75.6%
distribute-lft-out75.6%
Simplified75.6%
Taylor expanded in z around inf 55.1%
+-commutative55.1%
Simplified55.1%
+-commutative55.1%
*-commutative55.1%
sqrt-prod54.1%
Applied egg-rr54.1%
Final simplification52.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(let* ((t_0 (log (/ -1.0 x))))
(if (<= y -4.2e+53)
(* 2.0 (pow (exp (* 0.16666666666666666 (- (log (- y)) t_0))) 3.0))
(if (<= y -1.65e-204)
(* 2.0 (sqrt (* x (+ y z))))
(if (<= y -3.3e-292)
(*
2.0
(pow (exp (* (- (log (- (- y) z)) t_0) 0.16666666666666666)) 3.0))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double t_0 = log((-1.0 / x));
double tmp;
if (y <= -4.2e+53) {
tmp = 2.0 * pow(exp((0.16666666666666666 * (log(-y) - t_0))), 3.0);
} else if (y <= -1.65e-204) {
tmp = 2.0 * sqrt((x * (y + z)));
} else if (y <= -3.3e-292) {
tmp = 2.0 * pow(exp(((log((-y - z)) - t_0) * 0.16666666666666666)), 3.0);
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = log(((-1.0d0) / x))
if (y <= (-4.2d+53)) then
tmp = 2.0d0 * (exp((0.16666666666666666d0 * (log(-y) - t_0))) ** 3.0d0)
else if (y <= (-1.65d-204)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else if (y <= (-3.3d-292)) then
tmp = 2.0d0 * (exp(((log((-y - z)) - t_0) * 0.16666666666666666d0)) ** 3.0d0)
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double t_0 = Math.log((-1.0 / x));
double tmp;
if (y <= -4.2e+53) {
tmp = 2.0 * Math.pow(Math.exp((0.16666666666666666 * (Math.log(-y) - t_0))), 3.0);
} else if (y <= -1.65e-204) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else if (y <= -3.3e-292) {
tmp = 2.0 * Math.pow(Math.exp(((Math.log((-y - z)) - t_0) * 0.16666666666666666)), 3.0);
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): t_0 = math.log((-1.0 / x)) tmp = 0 if y <= -4.2e+53: tmp = 2.0 * math.pow(math.exp((0.16666666666666666 * (math.log(-y) - t_0))), 3.0) elif y <= -1.65e-204: tmp = 2.0 * math.sqrt((x * (y + z))) elif y <= -3.3e-292: tmp = 2.0 * math.pow(math.exp(((math.log((-y - z)) - t_0) * 0.16666666666666666)), 3.0) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) t_0 = log(Float64(-1.0 / x)) tmp = 0.0 if (y <= -4.2e+53) tmp = Float64(2.0 * (exp(Float64(0.16666666666666666 * Float64(log(Float64(-y)) - t_0))) ^ 3.0)); elseif (y <= -1.65e-204) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); elseif (y <= -3.3e-292) tmp = Float64(2.0 * (exp(Float64(Float64(log(Float64(Float64(-y) - z)) - t_0) * 0.16666666666666666)) ^ 3.0)); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
t_0 = log((-1.0 / x));
tmp = 0.0;
if (y <= -4.2e+53)
tmp = 2.0 * (exp((0.16666666666666666 * (log(-y) - t_0))) ^ 3.0);
elseif (y <= -1.65e-204)
tmp = 2.0 * sqrt((x * (y + z)));
elseif (y <= -3.3e-292)
tmp = 2.0 * (exp(((log((-y - z)) - t_0) * 0.16666666666666666)) ^ 3.0);
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[y, -4.2e+53], N[(2.0 * N[Power[N[Exp[N[(0.16666666666666666 * N[(N[Log[(-y)], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.65e-204], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -3.3e-292], N[(2.0 * N[Power[N[Exp[N[(N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - t$95$0), $MachinePrecision] * 0.16666666666666666), $MachinePrecision]], $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
t_0 := \log \left(\frac{-1}{x}\right)\\
\mathbf{if}\;y \leq -4.2 \cdot 10^{+53}:\\
\;\;\;\;2 \cdot {\left(e^{0.16666666666666666 \cdot \left(\log \left(-y\right) - t_0\right)}\right)}^{3}\\
\mathbf{elif}\;y \leq -1.65 \cdot 10^{-204}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{elif}\;y \leq -3.3 \cdot 10^{-292}:\\
\;\;\;\;2 \cdot {\left(e^{\left(\log \left(\left(-y\right) - z\right) - t_0\right) \cdot 0.16666666666666666}\right)}^{3}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -4.2000000000000004e53Initial program 63.0%
+-commutative63.0%
associate-+r+63.0%
*-commutative63.0%
+-commutative63.0%
associate-+l+63.0%
*-commutative63.0%
*-commutative63.0%
*-commutative63.0%
distribute-lft-out63.0%
Simplified63.0%
add-cube-cbrt62.4%
pow362.5%
+-commutative62.5%
+-commutative62.5%
fma-def62.6%
Applied egg-rr62.6%
pow1/262.6%
rem-cube-cbrt63.2%
metadata-eval63.2%
pow-pow62.7%
add-cube-cbrt61.8%
pow361.8%
Applied egg-rr57.7%
Taylor expanded in z around 0 30.0%
Taylor expanded in x around -inf 46.3%
if -4.2000000000000004e53 < y < -1.65000000000000005e-204Initial program 83.9%
+-commutative83.9%
associate-+r+83.9%
*-commutative83.9%
+-commutative83.9%
associate-+l+83.9%
*-commutative83.9%
*-commutative83.9%
*-commutative83.9%
distribute-lft-out83.9%
Simplified83.9%
Taylor expanded in x around inf 54.6%
if -1.65000000000000005e-204 < y < -3.29999999999999995e-292Initial program 72.8%
+-commutative72.8%
associate-+r+72.8%
*-commutative72.8%
+-commutative72.8%
associate-+l+72.8%
*-commutative72.8%
*-commutative72.8%
*-commutative72.8%
distribute-lft-out72.8%
Simplified72.8%
add-cube-cbrt72.1%
pow372.0%
+-commutative72.0%
+-commutative72.0%
fma-def72.0%
Applied egg-rr72.0%
pow1/272.0%
rem-cube-cbrt72.8%
metadata-eval72.8%
pow-pow72.5%
add-cube-cbrt71.4%
pow371.5%
Applied egg-rr67.1%
Taylor expanded in x around -inf 47.7%
if -3.29999999999999995e-292 < y Initial program 75.6%
+-commutative75.6%
associate-+r+75.6%
*-commutative75.6%
+-commutative75.6%
associate-+l+75.6%
*-commutative75.6%
*-commutative75.6%
*-commutative75.6%
distribute-lft-out75.6%
Simplified75.6%
Taylor expanded in z around inf 55.1%
+-commutative55.1%
Simplified55.1%
+-commutative55.1%
*-commutative55.1%
sqrt-prod54.1%
Applied egg-rr54.1%
Final simplification52.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -3.1e+54)
(*
2.0
(pow (exp (* 0.16666666666666666 (- (log (- y)) (log (/ -1.0 x))))) 3.0))
(if (<= y 6.1e-279)
(* 2.0 (sqrt (* x (+ y z))))
(* 2.0 (* (sqrt (+ y x)) (sqrt z))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -3.1e+54) {
tmp = 2.0 * pow(exp((0.16666666666666666 * (log(-y) - log((-1.0 / x))))), 3.0);
} else if (y <= 6.1e-279) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-3.1d+54)) then
tmp = 2.0d0 * (exp((0.16666666666666666d0 * (log(-y) - log(((-1.0d0) / x))))) ** 3.0d0)
else if (y <= 6.1d-279) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -3.1e+54) {
tmp = 2.0 * Math.pow(Math.exp((0.16666666666666666 * (Math.log(-y) - Math.log((-1.0 / x))))), 3.0);
} else if (y <= 6.1e-279) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -3.1e+54: tmp = 2.0 * math.pow(math.exp((0.16666666666666666 * (math.log(-y) - math.log((-1.0 / x))))), 3.0) elif y <= 6.1e-279: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -3.1e+54) tmp = Float64(2.0 * (exp(Float64(0.16666666666666666 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))) ^ 3.0)); elseif (y <= 6.1e-279) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -3.1e+54)
tmp = 2.0 * (exp((0.16666666666666666 * (log(-y) - log((-1.0 / x))))) ^ 3.0);
elseif (y <= 6.1e-279)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -3.1e+54], N[(2.0 * N[Power[N[Exp[N[(0.16666666666666666 * N[(N[Log[(-y)], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 6.1e-279], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.1 \cdot 10^{+54}:\\
\;\;\;\;2 \cdot {\left(e^{0.16666666666666666 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{3}\\
\mathbf{elif}\;y \leq 6.1 \cdot 10^{-279}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < -3.0999999999999999e54Initial program 63.0%
+-commutative63.0%
associate-+r+63.0%
*-commutative63.0%
+-commutative63.0%
associate-+l+63.0%
*-commutative63.0%
*-commutative63.0%
*-commutative63.0%
distribute-lft-out63.0%
Simplified63.0%
add-cube-cbrt62.4%
pow362.5%
+-commutative62.5%
+-commutative62.5%
fma-def62.6%
Applied egg-rr62.6%
pow1/262.6%
rem-cube-cbrt63.2%
metadata-eval63.2%
pow-pow62.7%
add-cube-cbrt61.8%
pow361.8%
Applied egg-rr57.7%
Taylor expanded in z around 0 30.0%
Taylor expanded in x around -inf 46.3%
if -3.0999999999999999e54 < y < 6.0999999999999999e-279Initial program 81.5%
+-commutative81.5%
associate-+r+81.5%
*-commutative81.5%
+-commutative81.5%
associate-+l+81.5%
*-commutative81.5%
*-commutative81.5%
*-commutative81.5%
distribute-lft-out81.5%
Simplified81.5%
Taylor expanded in x around inf 59.7%
if 6.0999999999999999e-279 < y Initial program 75.0%
+-commutative75.0%
associate-+r+75.0%
*-commutative75.0%
+-commutative75.0%
associate-+l+75.0%
*-commutative75.0%
*-commutative75.0%
*-commutative75.0%
distribute-lft-out75.0%
Simplified75.0%
Taylor expanded in z around inf 53.4%
+-commutative53.4%
Simplified53.4%
+-commutative53.4%
*-commutative53.4%
sqrt-prod54.0%
Applied egg-rr54.0%
Final simplification54.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.6e-280) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (* (sqrt (+ y x)) (sqrt z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.6e-280) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 2.6d-280) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 2.6e-280) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 2.6e-280: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 2.6e-280) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 2.6e-280)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 2.6e-280], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.6 \cdot 10^{-280}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\
\end{array}
\end{array}
if y < 2.6e-280Initial program 75.6%
+-commutative75.6%
associate-+r+75.6%
*-commutative75.6%
+-commutative75.6%
associate-+l+75.6%
*-commutative75.6%
*-commutative75.6%
*-commutative75.6%
distribute-lft-out75.6%
Simplified75.6%
Taylor expanded in x around inf 51.1%
if 2.6e-280 < y Initial program 75.0%
+-commutative75.0%
associate-+r+75.0%
*-commutative75.0%
+-commutative75.0%
associate-+l+75.0%
*-commutative75.0%
*-commutative75.0%
*-commutative75.0%
distribute-lft-out75.0%
Simplified75.0%
Taylor expanded in z around inf 53.4%
+-commutative53.4%
Simplified53.4%
+-commutative53.4%
*-commutative53.4%
sqrt-prod54.0%
Applied egg-rr54.0%
Final simplification52.5%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 3.6e-242) (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))) (* 2.0 (* (sqrt z) (sqrt y)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 3.6e-242) {
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
} else {
tmp = 2.0 * (sqrt(z) * sqrt(y));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= 3.6d-242) then
tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
else
tmp = 2.0d0 * (sqrt(z) * sqrt(y))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= 3.6e-242) {
tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
} else {
tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 3.6e-242: tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x)))) else: tmp = 2.0 * (math.sqrt(z) * math.sqrt(y)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 3.6e-242) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))); else tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= 3.6e-242)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
else
tmp = 2.0 * (sqrt(z) * sqrt(y));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, 3.6e-242], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 3.6 \cdot 10^{-242}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\
\end{array}
\end{array}
if y < 3.60000000000000014e-242Initial program 75.1%
+-commutative75.1%
associate-+r+75.1%
*-commutative75.1%
+-commutative75.1%
associate-+l+75.1%
*-commutative75.1%
*-commutative75.1%
*-commutative75.1%
distribute-lft-out75.1%
Simplified75.1%
if 3.60000000000000014e-242 < y Initial program 75.5%
+-commutative75.5%
associate-+r+75.5%
*-commutative75.5%
+-commutative75.5%
associate-+l+75.5%
*-commutative75.5%
*-commutative75.5%
*-commutative75.5%
distribute-lft-out75.5%
Simplified75.5%
Taylor expanded in x around 0 33.1%
*-commutative33.1%
sqrt-prod41.1%
Applied egg-rr41.1%
Final simplification59.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt(((y * x) + (z * (y + x))));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt(((y * x) + (z * (y + x))))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}
\end{array}
Initial program 75.3%
+-commutative75.3%
associate-+r+75.3%
*-commutative75.3%
+-commutative75.3%
associate-+l+75.3%
*-commutative75.3%
*-commutative75.3%
*-commutative75.3%
distribute-lft-out75.3%
Simplified75.3%
Final simplification75.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.75e-277) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.75e-277) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-1.75d-277)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -1.75e-277) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1.75e-277: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.75e-277) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -1.75e-277)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -1.75e-277], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.75 \cdot 10^{-277}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.74999999999999991e-277Initial program 74.8%
+-commutative74.8%
associate-+r+74.8%
*-commutative74.8%
+-commutative74.8%
associate-+l+74.8%
*-commutative74.8%
*-commutative74.8%
*-commutative74.8%
distribute-lft-out74.8%
Simplified74.8%
Taylor expanded in x around inf 47.8%
if -1.74999999999999991e-277 < y Initial program 75.8%
+-commutative75.8%
associate-+r+75.8%
*-commutative75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
distribute-lft-out75.8%
Simplified75.8%
Taylor expanded in x around 0 30.2%
Final simplification38.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -4e-271) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* z (+ y x))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -4e-271) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = 2.0 * sqrt((z * (y + x)));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-4d-271)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = 2.0d0 * sqrt((z * (y + x)))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -4e-271) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = 2.0 * Math.sqrt((z * (y + x)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -4e-271: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = 2.0 * math.sqrt((z * (y + x))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -4e-271) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x)))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -4e-271)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = 2.0 * sqrt((z * (y + x)));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -4e-271], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -4 \cdot 10^{-271}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\end{array}
\end{array}
if y < -3.99999999999999985e-271Initial program 75.2%
+-commutative75.2%
associate-+r+75.2%
*-commutative75.2%
+-commutative75.2%
associate-+l+75.2%
*-commutative75.2%
*-commutative75.2%
*-commutative75.2%
distribute-lft-out75.2%
Simplified75.2%
Taylor expanded in x around inf 47.7%
if -3.99999999999999985e-271 < y Initial program 75.5%
+-commutative75.5%
associate-+r+75.5%
*-commutative75.5%
+-commutative75.5%
associate-+l+75.5%
*-commutative75.5%
*-commutative75.5%
*-commutative75.5%
distribute-lft-out75.5%
Simplified75.5%
Taylor expanded in z around inf 56.0%
+-commutative56.0%
Simplified56.0%
Final simplification52.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -1.75e-277) (* 2.0 (sqrt (* y x))) (* 2.0 (sqrt (* y z)))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -1.75e-277) {
tmp = 2.0 * sqrt((y * x));
} else {
tmp = 2.0 * sqrt((y * z));
}
return tmp;
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: tmp
if (y <= (-1.75d-277)) then
tmp = 2.0d0 * sqrt((y * x))
else
tmp = 2.0d0 * sqrt((y * z))
end if
code = tmp
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
double tmp;
if (y <= -1.75e-277) {
tmp = 2.0 * Math.sqrt((y * x));
} else {
tmp = 2.0 * Math.sqrt((y * z));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -1.75e-277: tmp = 2.0 * math.sqrt((y * x)) else: tmp = 2.0 * math.sqrt((y * z)) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -1.75e-277) tmp = Float64(2.0 * sqrt(Float64(y * x))); else tmp = Float64(2.0 * sqrt(Float64(y * z))); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -1.75e-277)
tmp = 2.0 * sqrt((y * x));
else
tmp = 2.0 * sqrt((y * z));
end
tmp_2 = tmp;
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := If[LessEqual[y, -1.75e-277], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.75 \cdot 10^{-277}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -1.74999999999999991e-277Initial program 74.8%
+-commutative74.8%
associate-+r+74.8%
*-commutative74.8%
+-commutative74.8%
associate-+l+74.8%
*-commutative74.8%
*-commutative74.8%
*-commutative74.8%
distribute-lft-out74.8%
Simplified74.8%
Taylor expanded in z around 0 28.8%
*-commutative28.8%
Simplified28.8%
if -1.74999999999999991e-277 < y Initial program 75.8%
+-commutative75.8%
associate-+r+75.8%
*-commutative75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
*-commutative75.8%
*-commutative75.8%
distribute-lft-out75.8%
Simplified75.8%
Taylor expanded in x around 0 30.2%
Final simplification29.6%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (* 2.0 (sqrt (* y x))))
assert(x < y && y < z);
double code(double x, double y, double z) {
return 2.0 * sqrt((y * x));
}
NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = 2.0d0 * sqrt((y * x))
end function
assert x < y && y < z;
public static double code(double x, double y, double z) {
return 2.0 * Math.sqrt((y * x));
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): return 2.0 * math.sqrt((y * x))
x, y, z = sort([x, y, z]) function code(x, y, z) return Float64(2.0 * sqrt(Float64(y * x))) end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
tmp = 2.0 * sqrt((y * x));
end
NOTE: x, y, and z should be sorted in increasing order before calling this function. code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
2 \cdot \sqrt{y \cdot x}
\end{array}
Initial program 75.3%
+-commutative75.3%
associate-+r+75.3%
*-commutative75.3%
+-commutative75.3%
associate-+l+75.3%
*-commutative75.3%
*-commutative75.3%
*-commutative75.3%
distribute-lft-out75.3%
Simplified75.3%
Taylor expanded in z around 0 25.3%
*-commutative25.3%
Simplified25.3%
Final simplification25.3%
(FPCore (x y z)
:precision binary64
(let* ((t_0
(+
(* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z)))
(* (pow z 0.25) (pow y 0.25)))))
(if (< z 7.636950090573675e+176)
(* 2.0 (sqrt (+ (* (+ x y) z) (* x y))))
(* (* t_0 t_0) 2.0))))
double code(double x, double y, double z) {
double t_0 = (0.25 * ((pow(y, -0.75) * (pow(z, -0.75) * x)) * (y + z))) + (pow(z, 0.25) * pow(y, 0.25));
double tmp;
if (z < 7.636950090573675e+176) {
tmp = 2.0 * sqrt((((x + y) * z) + (x * y)));
} else {
tmp = (t_0 * t_0) * 2.0;
}
return tmp;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8) :: t_0
real(8) :: tmp
t_0 = (0.25d0 * (((y ** (-0.75d0)) * ((z ** (-0.75d0)) * x)) * (y + z))) + ((z ** 0.25d0) * (y ** 0.25d0))
if (z < 7.636950090573675d+176) then
tmp = 2.0d0 * sqrt((((x + y) * z) + (x * y)))
else
tmp = (t_0 * t_0) * 2.0d0
end if
code = tmp
end function
public static double code(double x, double y, double z) {
double t_0 = (0.25 * ((Math.pow(y, -0.75) * (Math.pow(z, -0.75) * x)) * (y + z))) + (Math.pow(z, 0.25) * Math.pow(y, 0.25));
double tmp;
if (z < 7.636950090573675e+176) {
tmp = 2.0 * Math.sqrt((((x + y) * z) + (x * y)));
} else {
tmp = (t_0 * t_0) * 2.0;
}
return tmp;
}
def code(x, y, z): t_0 = (0.25 * ((math.pow(y, -0.75) * (math.pow(z, -0.75) * x)) * (y + z))) + (math.pow(z, 0.25) * math.pow(y, 0.25)) tmp = 0 if z < 7.636950090573675e+176: tmp = 2.0 * math.sqrt((((x + y) * z) + (x * y))) else: tmp = (t_0 * t_0) * 2.0 return tmp
function code(x, y, z) t_0 = Float64(Float64(0.25 * Float64(Float64((y ^ -0.75) * Float64((z ^ -0.75) * x)) * Float64(y + z))) + Float64((z ^ 0.25) * (y ^ 0.25))) tmp = 0.0 if (z < 7.636950090573675e+176) tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(x + y) * z) + Float64(x * y)))); else tmp = Float64(Float64(t_0 * t_0) * 2.0); end return tmp end
function tmp_2 = code(x, y, z) t_0 = (0.25 * (((y ^ -0.75) * ((z ^ -0.75) * x)) * (y + z))) + ((z ^ 0.25) * (y ^ 0.25)); tmp = 0.0; if (z < 7.636950090573675e+176) tmp = 2.0 * sqrt((((x + y) * z) + (x * y))); else tmp = (t_0 * t_0) * 2.0; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(0.25 * N[(N[(N[Power[y, -0.75], $MachinePrecision] * N[(N[Power[z, -0.75], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * N[(y + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[z, 0.25], $MachinePrecision] * N[Power[y, 0.25], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, 7.636950090573675e+176], N[(2.0 * N[Sqrt[N[(N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 2.0), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.25 \cdot \left(\left({y}^{-0.75} \cdot \left({z}^{-0.75} \cdot x\right)\right) \cdot \left(y + z\right)\right) + {z}^{0.25} \cdot {y}^{0.25}\\
\mathbf{if}\;z < 7.636950090573675 \cdot 10^{+176}:\\
\;\;\;\;2 \cdot \sqrt{\left(x + y\right) \cdot z + x \cdot y}\\
\mathbf{else}:\\
\;\;\;\;\left(t_0 \cdot t_0\right) \cdot 2\\
\end{array}
\end{array}
herbie shell --seed 2023293
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
:precision binary64
:herbie-target
(if (< z 7.636950090573675e+176) (* 2.0 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25))) (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25)))) 2.0))
(* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))