
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))
double code(double c0, double A, double V, double l) {
return c0 * sqrt((A / (V * l)));
}
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = c0 * sqrt((a / (v * l)))
end function
public static double code(double c0, double A, double V, double l) {
return c0 * Math.sqrt((A / (V * l)));
}
def code(c0, A, V, l): return c0 * math.sqrt((A / (V * l)))
function code(c0, A, V, l) return Float64(c0 * sqrt(Float64(A / Float64(V * l)))) end
function tmp = code(c0, A, V, l) tmp = c0 * sqrt((A / (V * l))); end
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}
\end{array}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) (- INFINITY))
(/ (* (sqrt (/ (- A) l)) c0) (sqrt (- V)))
(if (<= (* l V) -2e-257)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-317)
(/ c0 (* (sqrt (/ V A)) (sqrt l)))
(* (/ (sqrt A) (sqrt (* l V))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = (sqrt((-A / l)) * c0) / sqrt(-V);
} else if ((l * V) <= -2e-257) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-317) {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
} else {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((-A / l)) * c0) / Math.sqrt(-V);
} else if ((l * V) <= -2e-257) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-317) {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -math.inf: tmp = (math.sqrt((-A / l)) * c0) / math.sqrt(-V) elif (l * V) <= -2e-257: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-317: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(-A) / l)) * c0) / sqrt(Float64(-V))); elseif (Float64(l * V) <= -2e-257) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-317) tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = (sqrt((-A / l)) * c0) / sqrt(-V);
elseif ((l * V) <= -2e-257)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-317)
tmp = c0 / (sqrt((V / A)) * sqrt(l));
else
tmp = (sqrt(A) / sqrt((l * V))) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-257], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-317], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{-A}{\ell}} \cdot c0}{\sqrt{-V}}\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-257}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-317}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 39.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6475.8
Applied rewrites75.8%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6443.8
Applied rewrites43.8%
if -inf.0 < (*.f64 V l) < -2e-257Initial program 83.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -2e-257 < (*.f64 V l) < 1.00000023e-317Initial program 26.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6457.7
Applied rewrites57.7%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/r/N/A
div-invN/A
associate-/r*N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-*.f64N/A
associate-/l/N/A
lift-/.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lower-/.f64N/A
Applied rewrites26.3%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
clear-numN/A
/-rgt-identityN/A
lower-/.f64N/A
Applied rewrites57.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6441.9
Applied rewrites41.9%
if 1.00000023e-317 < (*.f64 V l) Initial program 84.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6480.0
Applied rewrites80.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6491.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.4
Applied rewrites91.4%
Final simplification83.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* (sqrt (/ A (* l V))) c0)))
(if (<= t_0 0.0)
(* (sqrt (/ (/ A V) l)) c0)
(if (<= t_0 1e+299) t_0 (/ c0 (sqrt (* (/ l A) V)))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = sqrt(((A / V) / l)) * c0;
} else if (t_0 <= 1e+299) {
tmp = t_0;
} else {
tmp = c0 / sqrt(((l / A) * V));
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((a / (l * v))) * c0
if (t_0 <= 0.0d0) then
tmp = sqrt(((a / v) / l)) * c0
else if (t_0 <= 1d+299) then
tmp = t_0
else
tmp = c0 / sqrt(((l / a) * v))
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = Math.sqrt(((A / V) / l)) * c0;
} else if (t_0 <= 1e+299) {
tmp = t_0;
} else {
tmp = c0 / Math.sqrt(((l / A) * V));
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / (l * V))) * c0 tmp = 0 if t_0 <= 0.0: tmp = math.sqrt(((A / V) / l)) * c0 elif t_0 <= 1e+299: tmp = t_0 else: tmp = c0 / math.sqrt(((l / A) * V)) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(sqrt(Float64(A / Float64(l * V))) * c0) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); elseif (t_0 <= 1e+299) tmp = t_0; else tmp = Float64(c0 / sqrt(Float64(Float64(l / A) * V))); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((A / (l * V))) * c0;
tmp = 0.0;
if (t_0 <= 0.0)
tmp = sqrt(((A / V) / l)) * c0;
elseif (t_0 <= 1e+299)
tmp = t_0;
else
tmp = c0 / sqrt(((l / A) * V));
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 1e+299], t$95$0, N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 10^{+299}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 0.0Initial program 67.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.3
Applied rewrites71.3%
if 0.0 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1.0000000000000001e299Initial program 97.0%
if 1.0000000000000001e299 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 43.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.2
Applied rewrites64.2%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/r/N/A
div-invN/A
associate-/r*N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-*.f64N/A
associate-/l/N/A
lift-/.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lower-/.f64N/A
Applied rewrites43.6%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
clear-numN/A
/-rgt-identityN/A
lower-/.f64N/A
Applied rewrites66.1%
Final simplification76.3%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* (sqrt (/ A (* l V))) c0)))
(if (<= t_0 0.0)
(* (sqrt (/ (/ A V) l)) c0)
(if (<= t_0 5e+294) t_0 (* (sqrt (/ (/ A l) V)) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = sqrt(((A / V) / l)) * c0;
} else if (t_0 <= 5e+294) {
tmp = t_0;
} else {
tmp = sqrt(((A / l) / V)) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = sqrt((a / (l * v))) * c0
if (t_0 <= 0.0d0) then
tmp = sqrt(((a / v) / l)) * c0
else if (t_0 <= 5d+294) then
tmp = t_0
else
tmp = sqrt(((a / l) / v)) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((A / (l * V))) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = Math.sqrt(((A / V) / l)) * c0;
} else if (t_0 <= 5e+294) {
tmp = t_0;
} else {
tmp = Math.sqrt(((A / l) / V)) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / (l * V))) * c0 tmp = 0 if t_0 <= 0.0: tmp = math.sqrt(((A / V) / l)) * c0 elif t_0 <= 5e+294: tmp = t_0 else: tmp = math.sqrt(((A / l) / V)) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(sqrt(Float64(A / Float64(l * V))) * c0) tmp = 0.0 if (t_0 <= 0.0) tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); elseif (t_0 <= 5e+294) tmp = t_0; else tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((A / (l * V))) * c0;
tmp = 0.0;
if (t_0 <= 0.0)
tmp = sqrt(((A / V) / l)) * c0;
elseif (t_0 <= 5e+294)
tmp = t_0;
else
tmp = sqrt(((A / l) / V)) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 5e+294], t$95$0, N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+294}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 0.0Initial program 67.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.3
Applied rewrites71.3%
if 0.0 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 4.9999999999999999e294Initial program 97.0%
if 4.9999999999999999e294 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 43.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6464.2
Applied rewrites64.2%
Final simplification76.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (let* ((t_0 (* (sqrt (/ A (* l V))) c0)) (t_1 (* (sqrt (/ (/ A V) l)) c0))) (if (<= t_0 0.0) t_1 (if (<= t_0 5e+304) t_0 t_1))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt((A / (l * V))) * c0;
double t_1 = sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = t_1;
} else if (t_0 <= 5e+304) {
tmp = t_0;
} else {
tmp = t_1;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = sqrt((a / (l * v))) * c0
t_1 = sqrt(((a / v) / l)) * c0
if (t_0 <= 0.0d0) then
tmp = t_1
else if (t_0 <= 5d+304) then
tmp = t_0
else
tmp = t_1
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = Math.sqrt((A / (l * V))) * c0;
double t_1 = Math.sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = t_1;
} else if (t_0 <= 5e+304) {
tmp = t_0;
} else {
tmp = t_1;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt((A / (l * V))) * c0 t_1 = math.sqrt(((A / V) / l)) * c0 tmp = 0 if t_0 <= 0.0: tmp = t_1 elif t_0 <= 5e+304: tmp = t_0 else: tmp = t_1 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(sqrt(Float64(A / Float64(l * V))) * c0) t_1 = Float64(sqrt(Float64(Float64(A / V) / l)) * c0) tmp = 0.0 if (t_0 <= 0.0) tmp = t_1; elseif (t_0 <= 5e+304) tmp = t_0; else tmp = t_1; end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = sqrt((A / (l * V))) * c0;
t_1 = sqrt(((A / V) / l)) * c0;
tmp = 0.0;
if (t_0 <= 0.0)
tmp = t_1;
elseif (t_0 <= 5e+304)
tmp = t_0;
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 5e+304], t$95$0, t$95$1]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\
t_1 := \sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+304}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 0.0 or 4.9999999999999997e304 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 64.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6470.4
Applied rewrites70.4%
if 0.0 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 4.9999999999999997e304Initial program 97.0%
Final simplification76.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) (- INFINITY))
(* (/ (sqrt (/ (- A) l)) (sqrt (- V))) c0)
(if (<= (* l V) -2e-257)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-317)
(/ c0 (* (sqrt (/ V A)) (sqrt l)))
(* (/ (sqrt A) (sqrt (* l V))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
} else if ((l * V) <= -2e-257) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-317) {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
} else {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((-A / l)) / Math.sqrt(-V)) * c0;
} else if ((l * V) <= -2e-257) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-317) {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -math.inf: tmp = (math.sqrt((-A / l)) / math.sqrt(-V)) * c0 elif (l * V) <= -2e-257: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-317: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V))) * c0); elseif (Float64(l * V) <= -2e-257) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-317) tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
elseif ((l * V) <= -2e-257)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-317)
tmp = c0 / (sqrt((V / A)) * sqrt(l));
else
tmp = (sqrt(A) / sqrt((l * V))) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-257], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-317], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{-A}{\ell}}}{\sqrt{-V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-257}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-317}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 39.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6475.8
Applied rewrites75.8%
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6443.9
Applied rewrites43.9%
if -inf.0 < (*.f64 V l) < -2e-257Initial program 83.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -2e-257 < (*.f64 V l) < 1.00000023e-317Initial program 26.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6457.7
Applied rewrites57.7%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/r/N/A
div-invN/A
associate-/r*N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-*.f64N/A
associate-/l/N/A
lift-/.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lower-/.f64N/A
Applied rewrites26.3%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
clear-numN/A
/-rgt-identityN/A
lower-/.f64N/A
Applied rewrites57.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6441.9
Applied rewrites41.9%
if 1.00000023e-317 < (*.f64 V l) Initial program 84.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6480.0
Applied rewrites80.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6491.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.4
Applied rewrites91.4%
Final simplification83.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) (- INFINITY))
(* (/ (sqrt (/ A V)) (sqrt l)) c0)
(if (<= (* l V) -2e-257)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-317)
(/ c0 (* (sqrt (/ V A)) (sqrt l)))
(* (/ (sqrt A) (sqrt (* l V))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
} else if ((l * V) <= -2e-257) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-317) {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
} else {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((A / V)) / Math.sqrt(l)) * c0;
} else if ((l * V) <= -2e-257) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-317) {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -math.inf: tmp = (math.sqrt((A / V)) / math.sqrt(l)) * c0 elif (l * V) <= -2e-257: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-317: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(A / V)) / sqrt(l)) * c0); elseif (Float64(l * V) <= -2e-257) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-317) tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = (sqrt((A / V)) / sqrt(l)) * c0;
elseif ((l * V) <= -2e-257)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-317)
tmp = c0 / (sqrt((V / A)) * sqrt(l));
else
tmp = (sqrt(A) / sqrt((l * V))) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-257], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-317], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-257}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-317}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 39.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6443.9
Applied rewrites43.9%
if -inf.0 < (*.f64 V l) < -2e-257Initial program 83.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -2e-257 < (*.f64 V l) < 1.00000023e-317Initial program 26.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6457.7
Applied rewrites57.7%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/r/N/A
div-invN/A
associate-/r*N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-*.f64N/A
associate-/l/N/A
lift-/.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lower-/.f64N/A
Applied rewrites26.3%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
clear-numN/A
/-rgt-identityN/A
lower-/.f64N/A
Applied rewrites57.7%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6441.9
Applied rewrites41.9%
if 1.00000023e-317 < (*.f64 V l) Initial program 84.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6480.0
Applied rewrites80.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6491.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.4
Applied rewrites91.4%
Final simplification83.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(let* ((t_0 (* (/ (sqrt (/ A V)) (sqrt l)) c0)))
(if (<= (* l V) (- INFINITY))
t_0
(if (<= (* l V) -2e-286)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 1e-317) t_0 (* (/ (sqrt A) (sqrt (* l V))) c0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = (sqrt((A / V)) / sqrt(l)) * c0;
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = t_0;
} else if ((l * V) <= -2e-286) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-317) {
tmp = t_0;
} else {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double t_0 = (Math.sqrt((A / V)) / Math.sqrt(l)) * c0;
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = t_0;
} else if ((l * V) <= -2e-286) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 1e-317) {
tmp = t_0;
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = (math.sqrt((A / V)) / math.sqrt(l)) * c0 tmp = 0 if (l * V) <= -math.inf: tmp = t_0 elif (l * V) <= -2e-286: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 1e-317: tmp = t_0 else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(Float64(sqrt(Float64(A / V)) / sqrt(l)) * c0) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = t_0; elseif (Float64(l * V) <= -2e-286) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 1e-317) tmp = t_0; else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
t_0 = (sqrt((A / V)) / sqrt(l)) * c0;
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = t_0;
elseif ((l * V) <= -2e-286)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 1e-317)
tmp = t_0;
else
tmp = (sqrt(A) / sqrt((l * V))) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -2e-286], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 1e-317], t$95$0, N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}} \cdot c0\\
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-286}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 10^{-317}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0 or -2.0000000000000001e-286 < (*.f64 V l) < 1.00000023e-317Initial program 27.5%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6442.5
Applied rewrites42.5%
if -inf.0 < (*.f64 V l) < -2.0000000000000001e-286Initial program 83.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6471.2
Applied rewrites71.2%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if 1.00000023e-317 < (*.f64 V l) Initial program 84.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6480.0
Applied rewrites80.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6491.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.4
Applied rewrites91.4%
Final simplification83.5%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
:precision binary64
(if (<= (* l V) (- INFINITY))
(* (sqrt (/ (/ A V) l)) c0)
(if (<= (* l V) -2e-257)
(* (/ (sqrt (- A)) (sqrt (* (- l) V))) c0)
(if (<= (* l V) 0.0)
(/ c0 (sqrt (* (/ V A) l)))
(* (/ (sqrt A) (sqrt (* l V))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -((double) INFINITY)) {
tmp = sqrt(((A / V) / l)) * c0;
} else if ((l * V) <= -2e-257) {
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = c0 / sqrt(((V / A) * l));
} else {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
}
return tmp;
}
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= -Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((A / V) / l)) * c0;
} else if ((l * V) <= -2e-257) {
tmp = (Math.sqrt(-A) / Math.sqrt((-l * V))) * c0;
} else if ((l * V) <= 0.0) {
tmp = c0 / Math.sqrt(((V / A) * l));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= -math.inf: tmp = math.sqrt(((A / V) / l)) * c0 elif (l * V) <= -2e-257: tmp = (math.sqrt(-A) / math.sqrt((-l * V))) * c0 elif (l * V) <= 0.0: tmp = c0 / math.sqrt(((V / A) * l)) else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= Float64(-Inf)) tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0); elseif (Float64(l * V) <= -2e-257) tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-l) * V))) * c0); elseif (Float64(l * V) <= 0.0) tmp = Float64(c0 / sqrt(Float64(Float64(V / A) * l))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= -Inf)
tmp = sqrt(((A / V) / l)) * c0;
elseif ((l * V) <= -2e-257)
tmp = (sqrt(-A) / sqrt((-l * V))) * c0;
elseif ((l * V) <= 0.0)
tmp = c0 / sqrt(((V / A) * l));
else
tmp = (sqrt(A) / sqrt((l * V))) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], (-Infinity)], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -2e-257], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(N[(V / A), $MachinePrecision] * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq -\infty:\\
\;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-257}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-\ell\right) \cdot V}} \cdot c0\\
\mathbf{elif}\;\ell \cdot V \leq 0:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \cdot \ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 39.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.6
Applied rewrites75.6%
if -inf.0 < (*.f64 V l) < -2e-257Initial program 83.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6499.5
Applied rewrites99.5%
if -2e-257 < (*.f64 V l) < 0.0Initial program 24.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6456.9
Applied rewrites56.9%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-/r/N/A
div-invN/A
associate-/r*N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-divN/A
lift-*.f64N/A
associate-/l/N/A
lift-/.f64N/A
lift-/.f64N/A
lift-sqrt.f64N/A
lower-/.f64N/A
Applied rewrites24.4%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
clear-numN/A
associate-/r*N/A
associate-/l/N/A
lift-/.f64N/A
clear-numN/A
/-rgt-identityN/A
lower-/.f64N/A
Applied rewrites57.0%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6457.0
Applied rewrites57.0%
if 0.0 < (*.f64 V l) Initial program 83.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6479.7
Applied rewrites79.7%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6490.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.7
Applied rewrites90.7%
Final simplification87.7%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (if (<= A -5e-310) (* (/ (sqrt (- A)) (* (sqrt l) (sqrt (- V)))) c0) (* (/ (sqrt A) (sqrt (* l V))) c0)))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -5e-310) {
tmp = (sqrt(-A) / (sqrt(l) * sqrt(-V))) * c0;
} else {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if (a <= (-5d-310)) then
tmp = (sqrt(-a) / (sqrt(l) * sqrt(-v))) * c0
else
tmp = (sqrt(a) / sqrt((l * v))) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if (A <= -5e-310) {
tmp = (Math.sqrt(-A) / (Math.sqrt(l) * Math.sqrt(-V))) * c0;
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if A <= -5e-310: tmp = (math.sqrt(-A) / (math.sqrt(l) * math.sqrt(-V))) * c0 else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (A <= -5e-310) tmp = Float64(Float64(sqrt(Float64(-A)) / Float64(sqrt(l) * sqrt(Float64(-V)))) * c0); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if (A <= -5e-310)
tmp = (sqrt(-A) / (sqrt(l) * sqrt(-V))) * c0;
else
tmp = (sqrt(A) / sqrt((l * V))) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[A, -5e-310], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[(N[Sqrt[l], $MachinePrecision] * N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -5 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{-A}}{\sqrt{\ell} \cdot \sqrt{-V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 66.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.0
Applied rewrites67.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f6477.0
Applied rewrites77.0%
lift-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-neg.f64N/A
neg-mul-1N/A
associate-*r*N/A
sqrt-prodN/A
*-commutativeN/A
neg-mul-1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f6450.2
Applied rewrites50.2%
if -4.999999999999985e-310 < A Initial program 77.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6479.1
Applied rewrites79.1%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6484.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6484.3
Applied rewrites84.3%
Final simplification65.8%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (if (<= V -2e-310) (* (/ (sqrt (/ (- A) l)) (sqrt (- V))) c0) (* (/ (sqrt A) (* (sqrt V) (sqrt l))) c0)))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if (V <= -2e-310) {
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
} else {
tmp = (sqrt(A) / (sqrt(V) * sqrt(l))) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if (v <= (-2d-310)) then
tmp = (sqrt((-a / l)) / sqrt(-v)) * c0
else
tmp = (sqrt(a) / (sqrt(v) * sqrt(l))) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if (V <= -2e-310) {
tmp = (Math.sqrt((-A / l)) / Math.sqrt(-V)) * c0;
} else {
tmp = (Math.sqrt(A) / (Math.sqrt(V) * Math.sqrt(l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if V <= -2e-310: tmp = (math.sqrt((-A / l)) / math.sqrt(-V)) * c0 else: tmp = (math.sqrt(A) / (math.sqrt(V) * math.sqrt(l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (V <= -2e-310) tmp = Float64(Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V))) * c0); else tmp = Float64(Float64(sqrt(A) / Float64(sqrt(V) * sqrt(l))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if (V <= -2e-310)
tmp = (sqrt((-A / l)) / sqrt(-V)) * c0;
else
tmp = (sqrt(A) / (sqrt(V) * sqrt(l))) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[V, -2e-310], N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[(N[Sqrt[V], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;V \leq -2 \cdot 10^{-310}:\\
\;\;\;\;\frac{\sqrt{\frac{-A}{\ell}}}{\sqrt{-V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V} \cdot \sqrt{\ell}} \cdot c0\\
\end{array}
\end{array}
if V < -1.999999999999994e-310Initial program 70.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6473.3
Applied rewrites73.3%
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6485.7
Applied rewrites85.7%
if -1.999999999999994e-310 < V Initial program 71.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6471.8
Applied rewrites71.8%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
frac-2negN/A
div-invN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
distribute-neg-frac2N/A
frac-timesN/A
*-rgt-identityN/A
lower-/.f64N/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6449.7
Applied rewrites49.7%
Final simplification67.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (if (<= (* l V) 0.0) (* (sqrt (/ (/ A l) V)) c0) (* (/ (sqrt A) (sqrt (* l V))) c0)))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= 0.0) {
tmp = sqrt(((A / l) / V)) * c0;
} else {
tmp = (sqrt(A) / sqrt((l * V))) * c0;
}
return tmp;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
real(8) :: tmp
if ((l * v) <= 0.0d0) then
tmp = sqrt(((a / l) / v)) * c0
else
tmp = (sqrt(a) / sqrt((l * v))) * c0
end if
code = tmp
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
double tmp;
if ((l * V) <= 0.0) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else {
tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (l * V) <= 0.0: tmp = math.sqrt(((A / l) / V)) * c0 else: tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(l * V) <= 0.0) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0); end return tmp end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
tmp = 0.0;
if ((l * V) <= 0.0)
tmp = sqrt(((A / l) / V)) * c0;
else
tmp = (sqrt(A) / sqrt((l * V))) * c0;
end
tmp_2 = tmp;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \cdot V \leq 0:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < 0.0Initial program 62.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.5
Applied rewrites67.5%
if 0.0 < (*.f64 V l) Initial program 83.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6479.7
Applied rewrites79.7%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lower-/.f6490.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.7
Applied rewrites90.7%
Final simplification77.1%
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. (FPCore (c0 A V l) :precision binary64 (* (sqrt (/ A (* l V))) c0))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
return sqrt((A / (l * V))) * c0;
}
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
real(8), intent (in) :: c0
real(8), intent (in) :: a
real(8), intent (in) :: v
real(8), intent (in) :: l
code = sqrt((a / (l * v))) * c0
end function
assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
return Math.sqrt((A / (l * V))) * c0;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): return math.sqrt((A / (l * V))) * c0
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) return Float64(sqrt(Float64(A / Float64(l * V))) * c0) end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp = code(c0, A, V, l)
tmp = sqrt((A / (l * V))) * c0;
end
NOTE: c0, A, V, and l should be sorted in increasing order before calling this function. code[c0_, A_, V_, l_] := N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\sqrt{\frac{A}{\ell \cdot V}} \cdot c0
\end{array}
Initial program 71.4%
Final simplification71.4%
herbie shell --seed 2024240
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))