
(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 10 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
(if (<= y -3e+47)
(*
2.0
(exp
(*
0.25
(+ (log (+ (* z z) (* y (+ y (* 2.0 z))))) (* -2.0 (log (/ -1.0 x)))))))
(if (<= y 6.7e-257)
(* 2.0 (sqrt (* y (+ (+ z x) (/ (* z x) y)))))
(* (* 2.0 (sqrt z)) (pow (+ y x) 0.5)))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -3e+47) {
tmp = 2.0 * exp((0.25 * (log(((z * z) + (y * (y + (2.0 * z))))) + (-2.0 * log((-1.0 / x))))));
} else if (y <= 6.7e-257) {
tmp = 2.0 * sqrt((y * ((z + x) + ((z * x) / y))));
} else {
tmp = (2.0 * sqrt(z)) * pow((y + x), 0.5);
}
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 <= (-3d+47)) then
tmp = 2.0d0 * exp((0.25d0 * (log(((z * z) + (y * (y + (2.0d0 * z))))) + ((-2.0d0) * log(((-1.0d0) / x))))))
else if (y <= 6.7d-257) then
tmp = 2.0d0 * sqrt((y * ((z + x) + ((z * x) / y))))
else
tmp = (2.0d0 * sqrt(z)) * ((y + x) ** 0.5d0)
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 <= -3e+47) {
tmp = 2.0 * Math.exp((0.25 * (Math.log(((z * z) + (y * (y + (2.0 * z))))) + (-2.0 * Math.log((-1.0 / x))))));
} else if (y <= 6.7e-257) {
tmp = 2.0 * Math.sqrt((y * ((z + x) + ((z * x) / y))));
} else {
tmp = (2.0 * Math.sqrt(z)) * Math.pow((y + x), 0.5);
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -3e+47: tmp = 2.0 * math.exp((0.25 * (math.log(((z * z) + (y * (y + (2.0 * z))))) + (-2.0 * math.log((-1.0 / x)))))) elif y <= 6.7e-257: tmp = 2.0 * math.sqrt((y * ((z + x) + ((z * x) / y)))) else: tmp = (2.0 * math.sqrt(z)) * math.pow((y + x), 0.5) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -3e+47) tmp = Float64(2.0 * exp(Float64(0.25 * Float64(log(Float64(Float64(z * z) + Float64(y * Float64(y + Float64(2.0 * z))))) + Float64(-2.0 * log(Float64(-1.0 / x))))))); elseif (y <= 6.7e-257) tmp = Float64(2.0 * sqrt(Float64(y * Float64(Float64(z + x) + Float64(Float64(z * x) / y))))); else tmp = Float64(Float64(2.0 * sqrt(z)) * (Float64(y + x) ^ 0.5)); end return tmp end
x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
tmp = 0.0;
if (y <= -3e+47)
tmp = 2.0 * exp((0.25 * (log(((z * z) + (y * (y + (2.0 * z))))) + (-2.0 * log((-1.0 / x))))));
elseif (y <= 6.7e-257)
tmp = 2.0 * sqrt((y * ((z + x) + ((z * x) / y))));
else
tmp = (2.0 * sqrt(z)) * ((y + x) ^ 0.5);
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, -3e+47], N[(2.0 * N[Exp[N[(0.25 * N[(N[Log[N[(N[(z * z), $MachinePrecision] + N[(y * N[(y + N[(2.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(-2.0 * N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 6.7e-257], N[(2.0 * N[Sqrt[N[(y * N[(N[(z + x), $MachinePrecision] + N[(N[(z * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Sqrt[z], $MachinePrecision]), $MachinePrecision] * N[Power[N[(y + x), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3 \cdot 10^{+47}:\\
\;\;\;\;2 \cdot e^{0.25 \cdot \left(\log \left(z \cdot z + y \cdot \left(y + 2 \cdot z\right)\right) + -2 \cdot \log \left(\frac{-1}{x}\right)\right)}\\
\mathbf{elif}\;y \leq 6.7 \cdot 10^{-257}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot \left(\left(z + x\right) + \frac{z \cdot x}{y}\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot {\left(y + x\right)}^{0.5}\\
\end{array}
\end{array}
if y < -3.0000000000000001e47Initial program 46.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6446.9%
Simplified46.9%
pow1/2N/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-eval25.9%
Applied egg-rr25.9%
Taylor expanded in y around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
Simplified19.6%
Taylor expanded in x around -inf
*-lowering-*.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
log-lowering-log.f64N/A
/-lowering-/.f6415.7%
Simplified15.7%
if -3.0000000000000001e47 < y < 6.69999999999999977e-257Initial program 84.5%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6484.5%
Simplified84.5%
Taylor expanded in y around inf
*-lowering-*.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6468.9%
Simplified68.9%
if 6.69999999999999977e-257 < y Initial program 71.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6471.3%
Simplified71.3%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6447.0%
Simplified47.0%
+-commutativeN/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
+-lowering-+.f6449.9%
Applied egg-rr49.9%
Final simplification48.4%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.12e-268) (* 2.0 (sqrt (* x (+ y z)))) (* (* 2.0 (sqrt z)) (pow (+ y x) 0.5))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.12e-268) {
tmp = 2.0 * sqrt((x * (y + z)));
} else {
tmp = (2.0 * sqrt(z)) * pow((y + x), 0.5);
}
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.12d-268) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else
tmp = (2.0d0 * sqrt(z)) * ((y + x) ** 0.5d0)
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.12e-268) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else {
tmp = (2.0 * Math.sqrt(z)) * Math.pow((y + x), 0.5);
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1.12e-268: tmp = 2.0 * math.sqrt((x * (y + z))) else: tmp = (2.0 * math.sqrt(z)) * math.pow((y + x), 0.5) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.12e-268) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(Float64(2.0 * sqrt(z)) * (Float64(y + x) ^ 0.5)); 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.12e-268)
tmp = 2.0 * sqrt((x * (y + z)));
else
tmp = (2.0 * sqrt(z)) * ((y + x) ^ 0.5);
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.12e-268], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Sqrt[z], $MachinePrecision]), $MachinePrecision] * N[Power[N[(y + x), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.12 \cdot 10^{-268}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot {\left(y + x\right)}^{0.5}\\
\end{array}
\end{array}
if y < 1.11999999999999998e-268Initial program 69.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6469.0%
Simplified69.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6450.3%
Simplified50.3%
if 1.11999999999999998e-268 < y Initial program 71.5%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6471.6%
Simplified71.6%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6447.5%
Simplified47.5%
+-commutativeN/A
sqrt-prodN/A
pow1/2N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
+-lowering-+.f6450.3%
Applied egg-rr50.3%
Final simplification50.3%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 2.1e-268) (* 2.0 (sqrt (* x (+ y z)))) (* (* 2.0 (sqrt z)) (sqrt y))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 2.1e-268) {
tmp = 2.0 * sqrt((x * (y + z)));
} 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 <= 2.1d-268) then
tmp = 2.0d0 * sqrt((x * (y + z)))
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 <= 2.1e-268) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} 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 <= 2.1e-268: tmp = 2.0 * math.sqrt((x * (y + z))) 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 <= 2.1e-268) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); else tmp = Float64(Float64(2.0 * 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 <= 2.1e-268)
tmp = 2.0 * sqrt((x * (y + z)));
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, 2.1e-268], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Sqrt[z], $MachinePrecision]), $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.1 \cdot 10^{-268}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(2 \cdot \sqrt{z}\right) \cdot \sqrt{y}\\
\end{array}
\end{array}
if y < 2.09999999999999998e-268Initial program 69.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6469.0%
Simplified69.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6450.3%
Simplified50.3%
if 2.09999999999999998e-268 < y Initial program 71.5%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6471.6%
Simplified71.6%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6447.5%
Simplified47.5%
Taylor expanded in y around inf
Simplified29.2%
pow1/2N/A
unpow-prod-downN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6436.1%
Applied egg-rr36.1%
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+16) (* 2.0 (sqrt (* y (+ (+ z x) (/ (* z x) y))))) (* y (* 2.0 (sqrt (/ z y))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 3.6e+16) {
tmp = 2.0 * sqrt((y * ((z + x) + ((z * x) / y))));
} else {
tmp = y * (2.0 * sqrt((z / 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+16) then
tmp = 2.0d0 * sqrt((y * ((z + x) + ((z * x) / y))))
else
tmp = y * (2.0d0 * sqrt((z / 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+16) {
tmp = 2.0 * Math.sqrt((y * ((z + x) + ((z * x) / y))));
} else {
tmp = y * (2.0 * Math.sqrt((z / y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 3.6e+16: tmp = 2.0 * math.sqrt((y * ((z + x) + ((z * x) / y)))) else: tmp = y * (2.0 * math.sqrt((z / y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 3.6e+16) tmp = Float64(2.0 * sqrt(Float64(y * Float64(Float64(z + x) + Float64(Float64(z * x) / y))))); else tmp = Float64(y * Float64(2.0 * sqrt(Float64(z / 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+16)
tmp = 2.0 * sqrt((y * ((z + x) + ((z * x) / y))));
else
tmp = y * (2.0 * sqrt((z / 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+16], N[(2.0 * N[Sqrt[N[(y * N[(N[(z + x), $MachinePrecision] + N[(N[(z * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $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^{+16}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot \left(\left(z + x\right) + \frac{z \cdot x}{y}\right)}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}}\right)\\
\end{array}
\end{array}
if y < 3.6e16Initial program 72.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6472.0%
Simplified72.0%
Taylor expanded in y around inf
*-lowering-*.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6462.0%
Simplified62.0%
if 3.6e16 < y Initial program 63.2%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6463.3%
Simplified63.3%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6431.2%
Simplified31.2%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6438.1%
Simplified38.1%
Taylor expanded in y around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6438.1%
Simplified38.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
:precision binary64
(if (<= y -5e-285)
(* 2.0 (sqrt (* x (+ y z))))
(if (<= y 1e+15)
(* 2.0 (sqrt (* z (+ y x))))
(* y (* 2.0 (sqrt (/ z y)))))))assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= -5e-285) {
tmp = 2.0 * sqrt((x * (y + z)));
} else if (y <= 1e+15) {
tmp = 2.0 * sqrt((z * (y + x)));
} else {
tmp = y * (2.0 * sqrt((z / 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 <= (-5d-285)) then
tmp = 2.0d0 * sqrt((x * (y + z)))
else if (y <= 1d+15) then
tmp = 2.0d0 * sqrt((z * (y + x)))
else
tmp = y * (2.0d0 * sqrt((z / 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 <= -5e-285) {
tmp = 2.0 * Math.sqrt((x * (y + z)));
} else if (y <= 1e+15) {
tmp = 2.0 * Math.sqrt((z * (y + x)));
} else {
tmp = y * (2.0 * Math.sqrt((z / y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= -5e-285: tmp = 2.0 * math.sqrt((x * (y + z))) elif y <= 1e+15: tmp = 2.0 * math.sqrt((z * (y + x))) else: tmp = y * (2.0 * math.sqrt((z / y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= -5e-285) tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z)))); elseif (y <= 1e+15) tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x)))); else tmp = Float64(y * Float64(2.0 * sqrt(Float64(z / 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 <= -5e-285)
tmp = 2.0 * sqrt((x * (y + z)));
elseif (y <= 1e+15)
tmp = 2.0 * sqrt((z * (y + x)));
else
tmp = y * (2.0 * sqrt((z / 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, -5e-285], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1e+15], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -5 \cdot 10^{-285}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{elif}\;y \leq 10^{+15}:\\
\;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}}\right)\\
\end{array}
\end{array}
if y < -5.00000000000000018e-285Initial program 68.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6468.3%
Simplified68.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6447.4%
Simplified47.4%
if -5.00000000000000018e-285 < y < 1e15Initial program 78.6%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6478.6%
Simplified78.6%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6465.1%
Simplified65.1%
if 1e15 < y Initial program 63.2%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6463.3%
Simplified63.3%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6431.2%
Simplified31.2%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6438.1%
Simplified38.1%
Taylor expanded in y around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6438.1%
Simplified38.1%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y 1.02e+15) (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))) (* y (* 2.0 (sqrt (/ z y))))))
assert(x < y && y < z);
double code(double x, double y, double z) {
double tmp;
if (y <= 1.02e+15) {
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
} else {
tmp = y * (2.0 * sqrt((z / 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 <= 1.02d+15) then
tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
else
tmp = y * (2.0d0 * sqrt((z / 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 <= 1.02e+15) {
tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
} else {
tmp = y * (2.0 * Math.sqrt((z / y)));
}
return tmp;
}
[x, y, z] = sort([x, y, z]) def code(x, y, z): tmp = 0 if y <= 1.02e+15: tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x)))) else: tmp = y * (2.0 * math.sqrt((z / y))) return tmp
x, y, z = sort([x, y, z]) function code(x, y, z) tmp = 0.0 if (y <= 1.02e+15) tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x))))); else tmp = Float64(y * Float64(2.0 * sqrt(Float64(z / 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 <= 1.02e+15)
tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
else
tmp = y * (2.0 * sqrt((z / 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, 1.02e+15], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(y * N[(2.0 * N[Sqrt[N[(z / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z] = \mathsf{sort}([x, y, z])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.02 \cdot 10^{+15}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(2 \cdot \sqrt{\frac{z}{y}}\right)\\
\end{array}
\end{array}
if y < 1.02e15Initial program 72.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6472.0%
Simplified72.0%
if 1.02e15 < y Initial program 63.2%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6463.3%
Simplified63.3%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6431.2%
Simplified31.2%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6438.1%
Simplified38.1%
Taylor expanded in y around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6438.1%
Simplified38.1%
Final simplification64.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -2e-281) (* 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 <= -2e-281) {
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 <= (-2d-281)) 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 <= -2e-281) {
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 <= -2e-281: 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 <= -2e-281) 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 <= -2e-281)
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, -2e-281], 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 -2 \cdot 10^{-281}:\\
\;\;\;\;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 < -2e-281Initial program 68.0%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6468.1%
Simplified68.1%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6447.0%
Simplified47.0%
if -2e-281 < y Initial program 72.1%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6472.2%
Simplified72.2%
Taylor expanded in z around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6450.7%
Simplified50.7%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -6e-286) (* 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 <= -6e-286) {
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 <= (-6d-286)) 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 <= -6e-286) {
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 <= -6e-286: 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 <= -6e-286) 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 <= -6e-286)
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, -6e-286], 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 -6 \cdot 10^{-286}:\\
\;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -6.0000000000000001e-286Initial program 68.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6468.3%
Simplified68.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6447.4%
Simplified47.4%
if -6.0000000000000001e-286 < y Initial program 71.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6472.0%
Simplified72.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6426.2%
Simplified26.2%
NOTE: x, y, and z should be sorted in increasing order before calling this function. (FPCore (x y z) :precision binary64 (if (<= y -6e-286) (* 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 <= -6e-286) {
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 <= (-6d-286)) 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 <= -6e-286) {
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 <= -6e-286: 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 <= -6e-286) 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 <= -6e-286)
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, -6e-286], 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 -6 \cdot 10^{-286}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot x}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{y \cdot z}\\
\end{array}
\end{array}
if y < -6.0000000000000001e-286Initial program 68.3%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6468.3%
Simplified68.3%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6429.0%
Simplified29.0%
if -6.0000000000000001e-286 < y Initial program 71.9%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6472.0%
Simplified72.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f6426.2%
Simplified26.2%
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 70.1%
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-lowering-+.f6470.1%
Simplified70.1%
Taylor expanded in z around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
*-lowering-*.f6426.7%
Simplified26.7%
(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 2024150
(FPCore (x y z)
:name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
:precision binary64
:alt
(! :herbie-platform default (if (< z 763695009057367500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 2 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4))) (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4)))) 2)))
(* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))