
(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 18 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
(let* ((t_0 (sqrt (- V))))
(if (<= (* V l) (- INFINITY))
(/ (* (sqrt (/ A V)) c0) (sqrt l))
(if (<= (* V l) -2e-243)
(* (* (sqrt (/ (/ -1.0 V) l)) (sqrt (- A))) c0)
(if (<= (* V l) 0.0)
(/ c0 (* (sqrt (/ (- l) A)) t_0))
(if (<= (* V l) 1e+282)
(* (/ (sqrt A) (sqrt (* V l))) c0)
(/ (* (sqrt A) c0) (* (sqrt (- l)) t_0))))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = sqrt(-V);
double tmp;
if ((V * l) <= -((double) INFINITY)) {
tmp = (sqrt((A / V)) * c0) / sqrt(l);
} else if ((V * l) <= -2e-243) {
tmp = (sqrt(((-1.0 / V) / l)) * sqrt(-A)) * c0;
} else if ((V * l) <= 0.0) {
tmp = c0 / (sqrt((-l / A)) * t_0);
} else if ((V * l) <= 1e+282) {
tmp = (sqrt(A) / sqrt((V * l))) * c0;
} else {
tmp = (sqrt(A) * c0) / (sqrt(-l) * t_0);
}
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(-V);
double tmp;
if ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((A / V)) * c0) / Math.sqrt(l);
} else if ((V * l) <= -2e-243) {
tmp = (Math.sqrt(((-1.0 / V) / l)) * Math.sqrt(-A)) * c0;
} else if ((V * l) <= 0.0) {
tmp = c0 / (Math.sqrt((-l / A)) * t_0);
} else if ((V * l) <= 1e+282) {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
} else {
tmp = (Math.sqrt(A) * c0) / (Math.sqrt(-l) * t_0);
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = math.sqrt(-V) tmp = 0 if (V * l) <= -math.inf: tmp = (math.sqrt((A / V)) * c0) / math.sqrt(l) elif (V * l) <= -2e-243: tmp = (math.sqrt(((-1.0 / V) / l)) * math.sqrt(-A)) * c0 elif (V * l) <= 0.0: tmp = c0 / (math.sqrt((-l / A)) * t_0) elif (V * l) <= 1e+282: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 else: tmp = (math.sqrt(A) * c0) / (math.sqrt(-l) * t_0) return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = sqrt(Float64(-V)) tmp = 0.0 if (Float64(V * l) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(A / V)) * c0) / sqrt(l)); elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(sqrt(Float64(Float64(-1.0 / V) / l)) * sqrt(Float64(-A))) * c0); elseif (Float64(V * l) <= 0.0) tmp = Float64(c0 / Float64(sqrt(Float64(Float64(-l) / A)) * t_0)); elseif (Float64(V * l) <= 1e+282) tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * l))) * c0); else tmp = Float64(Float64(sqrt(A) * c0) / Float64(sqrt(Float64(-l)) * t_0)); 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(-V);
tmp = 0.0;
if ((V * l) <= -Inf)
tmp = (sqrt((A / V)) * c0) / sqrt(l);
elseif ((V * l) <= -2e-243)
tmp = (sqrt(((-1.0 / V) / l)) * sqrt(-A)) * c0;
elseif ((V * l) <= 0.0)
tmp = c0 / (sqrt((-l / A)) * t_0);
elseif ((V * l) <= 1e+282)
tmp = (sqrt(A) / sqrt((V * l))) * c0;
else
tmp = (sqrt(A) * c0) / (sqrt(-l) * t_0);
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[Sqrt[(-V)], $MachinePrecision]}, If[LessEqual[N[(V * l), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(N[Sqrt[N[(N[(-1.0 / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 / N[(N[Sqrt[N[((-l) / A), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+282], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] * c0), $MachinePrecision] / N[(N[Sqrt[(-l)], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \sqrt{-V}\\
\mathbf{if}\;V \cdot \ell \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{A}{V}} \cdot c0}{\sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\left(\sqrt{\frac{\frac{-1}{V}}{\ell}} \cdot \sqrt{-A}\right) \cdot c0\\
\mathbf{elif}\;V \cdot \ell \leq 0:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{-\ell}{A}} \cdot t\_0}\\
\mathbf{elif}\;V \cdot \ell \leq 10^{+282}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A} \cdot c0}{\sqrt{-\ell} \cdot t\_0}\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6464.4
Applied rewrites64.4%
if -inf.0 < (*.f64 V l) < -1.99999999999999999e-243Initial program 86.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6479.0
Applied rewrites79.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
div-invN/A
associate-/l*N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
distribute-neg-frac2N/A
remove-double-negN/A
lower-/.f6499.4
Applied rewrites99.4%
if -1.99999999999999999e-243 < (*.f64 V l) < 0.0Initial program 52.4%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6452.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6452.4
Applied rewrites52.4%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
associate-/r/N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/r/N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
frac-2negN/A
remove-double-negN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6443.8
Applied rewrites43.8%
if 0.0 < (*.f64 V l) < 1.00000000000000003e282Initial program 85.8%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6498.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6498.3
Applied rewrites98.3%
if 1.00000000000000003e282 < (*.f64 V l) Initial program 36.7%
lift-*.f64N/A
*-commutativeN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
associate-*l/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6442.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6442.4
Applied rewrites42.4%
lift-sqrt.f64N/A
remove-double-negN/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6470.2
Applied rewrites70.2%
Final simplification88.2%
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 l))) c0)))
(if (<= t_0 4e-307)
(* (sqrt (/ (/ A l) V)) c0)
(if (<= t_0 5e+229) 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 / (V * l))) * c0;
double tmp;
if (t_0 <= 4e-307) {
tmp = sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 5e+229) {
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 / (v * l))) * c0
if (t_0 <= 4d-307) then
tmp = sqrt(((a / l) / v)) * c0
else if (t_0 <= 5d+229) 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 / (V * l))) * c0;
double tmp;
if (t_0 <= 4e-307) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if (t_0 <= 5e+229) {
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 / (V * l))) * c0 tmp = 0 if t_0 <= 4e-307: tmp = math.sqrt(((A / l) / V)) * c0 elif t_0 <= 5e+229: 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(V * l))) * c0) tmp = 0.0 if (t_0 <= 4e-307) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (t_0 <= 5e+229) 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 / (V * l))) * c0;
tmp = 0.0;
if (t_0 <= 4e-307)
tmp = sqrt(((A / l) / V)) * c0;
elseif (t_0 <= 5e+229)
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[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 4e-307], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 5e+229], 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}{V \cdot \ell}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 4 \cdot 10^{-307}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+229}:\\
\;\;\;\;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)))) < 3.99999999999999964e-307Initial program 71.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.4
Applied rewrites67.4%
if 3.99999999999999964e-307 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 5.0000000000000005e229Initial program 98.9%
if 5.0000000000000005e229 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 56.1%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6456.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6456.2
Applied rewrites56.2%
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6465.3
Applied rewrites65.3%
Final simplification74.8%
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 l))) c0)) (t_1 (* (sqrt (/ (/ A l) V)) c0))) (if (<= t_0 4e-307) t_1 (if (<= t_0 5e+229) 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 / (V * l))) * c0;
double t_1 = sqrt(((A / l) / V)) * c0;
double tmp;
if (t_0 <= 4e-307) {
tmp = t_1;
} else if (t_0 <= 5e+229) {
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 / (v * l))) * c0
t_1 = sqrt(((a / l) / v)) * c0
if (t_0 <= 4d-307) then
tmp = t_1
else if (t_0 <= 5d+229) 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 / (V * l))) * c0;
double t_1 = Math.sqrt(((A / l) / V)) * c0;
double tmp;
if (t_0 <= 4e-307) {
tmp = t_1;
} else if (t_0 <= 5e+229) {
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 / (V * l))) * c0 t_1 = math.sqrt(((A / l) / V)) * c0 tmp = 0 if t_0 <= 4e-307: tmp = t_1 elif t_0 <= 5e+229: 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(V * l))) * c0) t_1 = Float64(sqrt(Float64(Float64(A / l) / V)) * c0) tmp = 0.0 if (t_0 <= 4e-307) tmp = t_1; elseif (t_0 <= 5e+229) 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 / (V * l))) * c0;
t_1 = sqrt(((A / l) / V)) * c0;
tmp = 0.0;
if (t_0 <= 4e-307)
tmp = t_1;
elseif (t_0 <= 5e+229)
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[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 4e-307], t$95$1, If[LessEqual[t$95$0, 5e+229], 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}{V \cdot \ell}} \cdot c0\\
t_1 := \sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 4 \cdot 10^{-307}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+229}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 3.99999999999999964e-307 or 5.0000000000000005e229 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) Initial program 68.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6467.0
Applied rewrites67.0%
if 3.99999999999999964e-307 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 5.0000000000000005e229Initial program 98.9%
Final simplification74.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 l) (- INFINITY))
(/ (* (sqrt (/ A V)) c0) (sqrt l))
(if (<= (* V l) -2e-243)
(* (* (sqrt (/ (/ -1.0 V) l)) (sqrt (- A))) c0)
(if (<= (* V l) 0.0)
(/ c0 (* (sqrt (/ (- l) A)) (sqrt (- V))))
(* (/ (sqrt A) (sqrt (* V l))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -((double) INFINITY)) {
tmp = (sqrt((A / V)) * c0) / sqrt(l);
} else if ((V * l) <= -2e-243) {
tmp = (sqrt(((-1.0 / V) / l)) * sqrt(-A)) * c0;
} else if ((V * l) <= 0.0) {
tmp = c0 / (sqrt((-l / A)) * sqrt(-V));
} else {
tmp = (sqrt(A) / sqrt((V * l))) * 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 ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((A / V)) * c0) / Math.sqrt(l);
} else if ((V * l) <= -2e-243) {
tmp = (Math.sqrt(((-1.0 / V) / l)) * Math.sqrt(-A)) * c0;
} else if ((V * l) <= 0.0) {
tmp = c0 / (Math.sqrt((-l / A)) * Math.sqrt(-V));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= -math.inf: tmp = (math.sqrt((A / V)) * c0) / math.sqrt(l) elif (V * l) <= -2e-243: tmp = (math.sqrt(((-1.0 / V) / l)) * math.sqrt(-A)) * c0 elif (V * l) <= 0.0: tmp = c0 / (math.sqrt((-l / A)) * math.sqrt(-V)) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(A / V)) * c0) / sqrt(l)); elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(sqrt(Float64(Float64(-1.0 / V) / l)) * sqrt(Float64(-A))) * c0); elseif (Float64(V * l) <= 0.0) tmp = Float64(c0 / Float64(sqrt(Float64(Float64(-l) / A)) * sqrt(Float64(-V)))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 * l) <= -Inf)
tmp = (sqrt((A / V)) * c0) / sqrt(l);
elseif ((V * l) <= -2e-243)
tmp = (sqrt(((-1.0 / V) / l)) * sqrt(-A)) * c0;
elseif ((V * l) <= 0.0)
tmp = c0 / (sqrt((-l / A)) * sqrt(-V));
else
tmp = (sqrt(A) / sqrt((V * 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[N[(V * l), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(N[Sqrt[N[(N[(-1.0 / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 / N[(N[Sqrt[N[((-l) / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * 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 \cdot \ell \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{A}{V}} \cdot c0}{\sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\left(\sqrt{\frac{\frac{-1}{V}}{\ell}} \cdot \sqrt{-A}\right) \cdot c0\\
\mathbf{elif}\;V \cdot \ell \leq 0:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{-\ell}{A}} \cdot \sqrt{-V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6464.4
Applied rewrites64.4%
if -inf.0 < (*.f64 V l) < -1.99999999999999999e-243Initial program 86.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6479.0
Applied rewrites79.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
div-invN/A
associate-/l*N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
metadata-evalN/A
distribute-neg-fracN/A
distribute-neg-frac2N/A
remove-double-negN/A
lower-/.f6499.4
Applied rewrites99.4%
if -1.99999999999999999e-243 < (*.f64 V l) < 0.0Initial program 52.4%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6452.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6452.4
Applied rewrites52.4%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
associate-/r/N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/r/N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
frac-2negN/A
remove-double-negN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6443.8
Applied rewrites43.8%
if 0.0 < (*.f64 V l) Initial program 78.5%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.0
Applied rewrites90.0%
Final simplification86.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 (/ c0 (* (sqrt (/ (- l) A)) (sqrt (- V))))))
(if (<= (* V l) -1e+219)
t_0
(if (<= (* V l) -2e-243)
(* (/ c0 (sqrt (* (- l) V))) (sqrt (- A)))
(if (<= (* V l) 0.0) t_0 (* (/ (sqrt A) (sqrt (* V l))) c0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 / (sqrt((-l / A)) * sqrt(-V));
double tmp;
if ((V * l) <= -1e+219) {
tmp = t_0;
} else if ((V * l) <= -2e-243) {
tmp = (c0 / sqrt((-l * V))) * sqrt(-A);
} else if ((V * l) <= 0.0) {
tmp = t_0;
} else {
tmp = (sqrt(A) / sqrt((V * 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) :: t_0
real(8) :: tmp
t_0 = c0 / (sqrt((-l / a)) * sqrt(-v))
if ((v * l) <= (-1d+219)) then
tmp = t_0
else if ((v * l) <= (-2d-243)) then
tmp = (c0 / sqrt((-l * v))) * sqrt(-a)
else if ((v * l) <= 0.0d0) then
tmp = t_0
else
tmp = (sqrt(a) / sqrt((v * 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 t_0 = c0 / (Math.sqrt((-l / A)) * Math.sqrt(-V));
double tmp;
if ((V * l) <= -1e+219) {
tmp = t_0;
} else if ((V * l) <= -2e-243) {
tmp = (c0 / Math.sqrt((-l * V))) * Math.sqrt(-A);
} else if ((V * l) <= 0.0) {
tmp = t_0;
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 / (math.sqrt((-l / A)) * math.sqrt(-V)) tmp = 0 if (V * l) <= -1e+219: tmp = t_0 elif (V * l) <= -2e-243: tmp = (c0 / math.sqrt((-l * V))) * math.sqrt(-A) elif (V * l) <= 0.0: tmp = t_0 else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 / Float64(sqrt(Float64(Float64(-l) / A)) * sqrt(Float64(-V)))) tmp = 0.0 if (Float64(V * l) <= -1e+219) tmp = t_0; elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(c0 / sqrt(Float64(Float64(-l) * V))) * sqrt(Float64(-A))); elseif (Float64(V * l) <= 0.0) tmp = t_0; else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * l))) * 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 = c0 / (sqrt((-l / A)) * sqrt(-V));
tmp = 0.0;
if ((V * l) <= -1e+219)
tmp = t_0;
elseif ((V * l) <= -2e-243)
tmp = (c0 / sqrt((-l * V))) * sqrt(-A);
elseif ((V * l) <= 0.0)
tmp = t_0;
else
tmp = (sqrt(A) / sqrt((V * 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_] := Block[{t$95$0 = N[(c0 / N[(N[Sqrt[N[((-l) / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(V * l), $MachinePrecision], -1e+219], t$95$0, If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(c0 / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], t$95$0, N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{c0}{\sqrt{\frac{-\ell}{A}} \cdot \sqrt{-V}}\\
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{+219}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(-\ell\right) \cdot V}} \cdot \sqrt{-A}\\
\mathbf{elif}\;V \cdot \ell \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -9.99999999999999965e218 or -1.99999999999999999e-243 < (*.f64 V l) < 0.0Initial program 53.1%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6453.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6453.1
Applied rewrites53.1%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
associate-/r/N/A
lift-/.f64N/A
lift-/.f64N/A
frac-2negN/A
associate-/r/N/A
sqrt-prodN/A
lower-*.f64N/A
lower-sqrt.f64N/A
frac-2negN/A
remove-double-negN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6443.4
Applied rewrites43.4%
if -9.99999999999999965e218 < (*.f64 V l) < -1.99999999999999999e-243Initial program 89.1%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6489.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6489.4
Applied rewrites89.4%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6499.3
Applied rewrites99.3%
if 0.0 < (*.f64 V l) Initial program 78.5%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.0
Applied rewrites90.0%
Final simplification82.0%
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)) (sqrt (- V))) c0)))
(if (<= (* V l) -1e+219)
t_0
(if (<= (* V l) -2e-243)
(* (/ c0 (sqrt (* (- l) V))) (sqrt (- A)))
(if (<= (* V l) 0.0) t_0 (* (/ (sqrt A) (sqrt (* V l))) c0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = (sqrt((-A / l)) / sqrt(-V)) * c0;
double tmp;
if ((V * l) <= -1e+219) {
tmp = t_0;
} else if ((V * l) <= -2e-243) {
tmp = (c0 / sqrt((-l * V))) * sqrt(-A);
} else if ((V * l) <= 0.0) {
tmp = t_0;
} else {
tmp = (sqrt(A) / sqrt((V * 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) :: t_0
real(8) :: tmp
t_0 = (sqrt((-a / l)) / sqrt(-v)) * c0
if ((v * l) <= (-1d+219)) then
tmp = t_0
else if ((v * l) <= (-2d-243)) then
tmp = (c0 / sqrt((-l * v))) * sqrt(-a)
else if ((v * l) <= 0.0d0) then
tmp = t_0
else
tmp = (sqrt(a) / sqrt((v * 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 t_0 = (Math.sqrt((-A / l)) / Math.sqrt(-V)) * c0;
double tmp;
if ((V * l) <= -1e+219) {
tmp = t_0;
} else if ((V * l) <= -2e-243) {
tmp = (c0 / Math.sqrt((-l * V))) * Math.sqrt(-A);
} else if ((V * l) <= 0.0) {
tmp = t_0;
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = (math.sqrt((-A / l)) / math.sqrt(-V)) * c0 tmp = 0 if (V * l) <= -1e+219: tmp = t_0 elif (V * l) <= -2e-243: tmp = (c0 / math.sqrt((-l * V))) * math.sqrt(-A) elif (V * l) <= 0.0: tmp = t_0 else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(Float64(sqrt(Float64(Float64(-A) / l)) / sqrt(Float64(-V))) * c0) tmp = 0.0 if (Float64(V * l) <= -1e+219) tmp = t_0; elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(c0 / sqrt(Float64(Float64(-l) * V))) * sqrt(Float64(-A))); elseif (Float64(V * l) <= 0.0) tmp = t_0; else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * l))) * 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)) / sqrt(-V)) * c0;
tmp = 0.0;
if ((V * l) <= -1e+219)
tmp = t_0;
elseif ((V * l) <= -2e-243)
tmp = (c0 / sqrt((-l * V))) * sqrt(-A);
elseif ((V * l) <= 0.0)
tmp = t_0;
else
tmp = (sqrt(A) / sqrt((V * 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_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[((-A) / l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(V * l), $MachinePrecision], -1e+219], t$95$0, If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(c0 / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], t$95$0, N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $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}{\ell}}}{\sqrt{-V}} \cdot c0\\
\mathbf{if}\;V \cdot \ell \leq -1 \cdot 10^{+219}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(-\ell\right) \cdot V}} \cdot \sqrt{-A}\\
\mathbf{elif}\;V \cdot \ell \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -9.99999999999999965e218 or -1.99999999999999999e-243 < (*.f64 V l) < 0.0Initial program 53.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.3
Applied rewrites71.3%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lift-sqrt.f64N/A
div-invN/A
*-commutativeN/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
associate-*r/N/A
lower-/.f64N/A
inv-powN/A
lift-sqrt.f64N/A
sqrt-pow2N/A
sqrt-pow1N/A
inv-powN/A
sqrt-prodN/A
*-commutativeN/A
lower-sqrt.f64N/A
un-div-invN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6443.3
Applied rewrites43.3%
if -9.99999999999999965e218 < (*.f64 V l) < -1.99999999999999999e-243Initial program 89.1%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6489.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6489.4
Applied rewrites89.4%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6499.3
Applied rewrites99.3%
if 0.0 < (*.f64 V l) Initial program 78.5%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.0
Applied rewrites90.0%
Final simplification82.0%
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 (/ A (* V l))) (t_1 (* (sqrt (/ (/ A V) l)) c0))) (if (<= t_0 0.0) t_1 (if (<= t_0 4e+289) (* (sqrt t_0) c0) t_1))))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = A / (V * l);
double t_1 = sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = t_1;
} else if (t_0 <= 4e+289) {
tmp = sqrt(t_0) * c0;
} 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 = a / (v * l)
t_1 = sqrt(((a / v) / l)) * c0
if (t_0 <= 0.0d0) then
tmp = t_1
else if (t_0 <= 4d+289) then
tmp = sqrt(t_0) * c0
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 = A / (V * l);
double t_1 = Math.sqrt(((A / V) / l)) * c0;
double tmp;
if (t_0 <= 0.0) {
tmp = t_1;
} else if (t_0 <= 4e+289) {
tmp = Math.sqrt(t_0) * c0;
} else {
tmp = t_1;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = A / (V * l) t_1 = math.sqrt(((A / V) / l)) * c0 tmp = 0 if t_0 <= 0.0: tmp = t_1 elif t_0 <= 4e+289: tmp = math.sqrt(t_0) * c0 else: tmp = t_1 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(A / Float64(V * l)) t_1 = Float64(sqrt(Float64(Float64(A / V) / l)) * c0) tmp = 0.0 if (t_0 <= 0.0) tmp = t_1; elseif (t_0 <= 4e+289) tmp = Float64(sqrt(t_0) * c0); 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 = A / (V * l);
t_1 = sqrt(((A / V) / l)) * c0;
tmp = 0.0;
if (t_0 <= 0.0)
tmp = t_1;
elseif (t_0 <= 4e+289)
tmp = sqrt(t_0) * c0;
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[(A / N[(V * l), $MachinePrecision]), $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, 4e+289], N[(N[Sqrt[t$95$0], $MachinePrecision] * c0), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{A}{V \cdot \ell}\\
t_1 := \sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_0 \leq 4 \cdot 10^{+289}:\\
\;\;\;\;\sqrt{t\_0} \cdot c0\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (/.f64 A (*.f64 V l)) < 0.0 or 4.0000000000000002e289 < (/.f64 A (*.f64 V l)) Initial program 42.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6453.7
Applied rewrites53.7%
if 0.0 < (/.f64 A (*.f64 V l)) < 4.0000000000000002e289Initial program 98.8%
Final simplification80.6%
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 l) (- INFINITY))
(/ (* (sqrt (/ A V)) c0) (sqrt l))
(if (<= (* V l) -2e-243)
(/ (* (sqrt (- A)) c0) (sqrt (* (- l) V)))
(if (<= (* V l) 5e-323)
(/ c0 (sqrt (/ V (/ A l))))
(* (/ (sqrt A) (sqrt (* V l))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -((double) INFINITY)) {
tmp = (sqrt((A / V)) * c0) / sqrt(l);
} else if ((V * l) <= -2e-243) {
tmp = (sqrt(-A) * c0) / sqrt((-l * V));
} else if ((V * l) <= 5e-323) {
tmp = c0 / sqrt((V / (A / l)));
} else {
tmp = (sqrt(A) / sqrt((V * l))) * 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 ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = (Math.sqrt((A / V)) * c0) / Math.sqrt(l);
} else if ((V * l) <= -2e-243) {
tmp = (Math.sqrt(-A) * c0) / Math.sqrt((-l * V));
} else if ((V * l) <= 5e-323) {
tmp = c0 / Math.sqrt((V / (A / l)));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= -math.inf: tmp = (math.sqrt((A / V)) * c0) / math.sqrt(l) elif (V * l) <= -2e-243: tmp = (math.sqrt(-A) * c0) / math.sqrt((-l * V)) elif (V * l) <= 5e-323: tmp = c0 / math.sqrt((V / (A / l))) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(A / V)) * c0) / sqrt(l)); elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / sqrt(Float64(Float64(-l) * V))); elseif (Float64(V * l) <= 5e-323) tmp = Float64(c0 / sqrt(Float64(V / Float64(A / l)))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 * l) <= -Inf)
tmp = (sqrt((A / V)) * c0) / sqrt(l);
elseif ((V * l) <= -2e-243)
tmp = (sqrt(-A) * c0) / sqrt((-l * V));
elseif ((V * l) <= 5e-323)
tmp = c0 / sqrt((V / (A / l)));
else
tmp = (sqrt(A) / sqrt((V * 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[N[(V * l), $MachinePrecision], (-Infinity)], N[(N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e-323], N[(c0 / N[Sqrt[N[(V / N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * 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 \cdot \ell \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\frac{A}{V}} \cdot c0}{\sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{\left(-\ell\right) \cdot V}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{-323}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{\frac{A}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-sqrt.f6464.4
Applied rewrites64.4%
if -inf.0 < (*.f64 V l) < -1.99999999999999999e-243Initial program 86.7%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6486.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.9
Applied rewrites86.9%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
sqrt-prodN/A
lift-sqrt.f64N/A
pow1/2N/A
associate-/r*N/A
lift-/.f64N/A
un-div-invN/A
metadata-evalN/A
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-/.f64N/A
Applied rewrites97.6%
if -1.99999999999999999e-243 < (*.f64 V l) < 4.94066e-323Initial program 51.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6451.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6451.0
Applied rewrites51.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l/N/A
/-rgt-identityN/A
metadata-evalN/A
clear-numN/A
metadata-evalN/A
div-invN/A
associate-/l/N/A
*-commutativeN/A
div-invN/A
lower-/.f64N/A
lower-/.f6470.1
Applied rewrites70.1%
if 4.94066e-323 < (*.f64 V l) Initial program 79.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.8
Applied rewrites90.8%
Final simplification89.2%
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 l) (- INFINITY))
(/ c0 (* (sqrt (/ V A)) (sqrt l)))
(if (<= (* V l) -2e-243)
(/ (* (sqrt (- A)) c0) (sqrt (* (- l) V)))
(if (<= (* V l) 5e-323)
(/ c0 (sqrt (/ V (/ A l))))
(* (/ (sqrt A) (sqrt (* V l))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -((double) INFINITY)) {
tmp = c0 / (sqrt((V / A)) * sqrt(l));
} else if ((V * l) <= -2e-243) {
tmp = (sqrt(-A) * c0) / sqrt((-l * V));
} else if ((V * l) <= 5e-323) {
tmp = c0 / sqrt((V / (A / l)));
} else {
tmp = (sqrt(A) / sqrt((V * l))) * 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 ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
} else if ((V * l) <= -2e-243) {
tmp = (Math.sqrt(-A) * c0) / Math.sqrt((-l * V));
} else if ((V * l) <= 5e-323) {
tmp = c0 / Math.sqrt((V / (A / l)));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= -math.inf: tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l)) elif (V * l) <= -2e-243: tmp = (math.sqrt(-A) * c0) / math.sqrt((-l * V)) elif (V * l) <= 5e-323: tmp = c0 / math.sqrt((V / (A / l))) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= Float64(-Inf)) tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l))); elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / sqrt(Float64(Float64(-l) * V))); elseif (Float64(V * l) <= 5e-323) tmp = Float64(c0 / sqrt(Float64(V / Float64(A / l)))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 * l) <= -Inf)
tmp = c0 / (sqrt((V / A)) * sqrt(l));
elseif ((V * l) <= -2e-243)
tmp = (sqrt(-A) * c0) / sqrt((-l * V));
elseif ((V * l) <= 5e-323)
tmp = c0 / sqrt((V / (A / l)));
else
tmp = (sqrt(A) / sqrt((V * 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[N[(V * l), $MachinePrecision], (-Infinity)], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e-323], N[(c0 / N[Sqrt[N[(V / N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * 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 \cdot \ell \leq -\infty:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{\left(-\ell\right) \cdot V}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{-323}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{\frac{A}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6435.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6435.0
Applied rewrites35.0%
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
sqrt-prodN/A
lift-sqrt.f64N/A
pow1/2N/A
*-commutativeN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
lower-/.f6464.3
Applied rewrites64.3%
if -inf.0 < (*.f64 V l) < -1.99999999999999999e-243Initial program 86.7%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6486.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.9
Applied rewrites86.9%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
sqrt-prodN/A
lift-sqrt.f64N/A
pow1/2N/A
associate-/r*N/A
lift-/.f64N/A
un-div-invN/A
metadata-evalN/A
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-/.f64N/A
Applied rewrites97.6%
if -1.99999999999999999e-243 < (*.f64 V l) < 4.94066e-323Initial program 51.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6451.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6451.0
Applied rewrites51.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l/N/A
/-rgt-identityN/A
metadata-evalN/A
clear-numN/A
metadata-evalN/A
div-invN/A
associate-/l/N/A
*-commutativeN/A
div-invN/A
lower-/.f64N/A
lower-/.f6470.1
Applied rewrites70.1%
if 4.94066e-323 < (*.f64 V l) Initial program 79.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.8
Applied rewrites90.8%
Final simplification89.2%
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 l) (- INFINITY))
(* (sqrt (/ A V)) (/ c0 (sqrt l)))
(if (<= (* V l) -2e-243)
(/ (* (sqrt (- A)) c0) (sqrt (* (- l) V)))
(if (<= (* V l) 5e-323)
(/ c0 (sqrt (/ V (/ A l))))
(* (/ (sqrt A) (sqrt (* V l))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -((double) INFINITY)) {
tmp = sqrt((A / V)) * (c0 / sqrt(l));
} else if ((V * l) <= -2e-243) {
tmp = (sqrt(-A) * c0) / sqrt((-l * V));
} else if ((V * l) <= 5e-323) {
tmp = c0 / sqrt((V / (A / l)));
} else {
tmp = (sqrt(A) / sqrt((V * l))) * 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 ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = Math.sqrt((A / V)) * (c0 / Math.sqrt(l));
} else if ((V * l) <= -2e-243) {
tmp = (Math.sqrt(-A) * c0) / Math.sqrt((-l * V));
} else if ((V * l) <= 5e-323) {
tmp = c0 / Math.sqrt((V / (A / l)));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= -math.inf: tmp = math.sqrt((A / V)) * (c0 / math.sqrt(l)) elif (V * l) <= -2e-243: tmp = (math.sqrt(-A) * c0) / math.sqrt((-l * V)) elif (V * l) <= 5e-323: tmp = c0 / math.sqrt((V / (A / l))) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= Float64(-Inf)) tmp = Float64(sqrt(Float64(A / V)) * Float64(c0 / sqrt(l))); elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / sqrt(Float64(Float64(-l) * V))); elseif (Float64(V * l) <= 5e-323) tmp = Float64(c0 / sqrt(Float64(V / Float64(A / l)))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 * l) <= -Inf)
tmp = sqrt((A / V)) * (c0 / sqrt(l));
elseif ((V * l) <= -2e-243)
tmp = (sqrt(-A) * c0) / sqrt((-l * V));
elseif ((V * l) <= 5e-323)
tmp = c0 / sqrt((V / (A / l)));
else
tmp = (sqrt(A) / sqrt((V * 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[N[(V * l), $MachinePrecision], (-Infinity)], N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * N[(c0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e-323], N[(c0 / N[Sqrt[N[(V / N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * 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 \cdot \ell \leq -\infty:\\
\;\;\;\;\sqrt{\frac{A}{V}} \cdot \frac{c0}{\sqrt{\ell}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{\left(-\ell\right) \cdot V}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{-323}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{\frac{A}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6462.7
Applied rewrites62.7%
if -inf.0 < (*.f64 V l) < -1.99999999999999999e-243Initial program 86.7%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6486.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.9
Applied rewrites86.9%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
sqrt-prodN/A
lift-sqrt.f64N/A
pow1/2N/A
associate-/r*N/A
lift-/.f64N/A
un-div-invN/A
metadata-evalN/A
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-/.f64N/A
Applied rewrites97.6%
if -1.99999999999999999e-243 < (*.f64 V l) < 4.94066e-323Initial program 51.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6451.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6451.0
Applied rewrites51.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l/N/A
/-rgt-identityN/A
metadata-evalN/A
clear-numN/A
metadata-evalN/A
div-invN/A
associate-/l/N/A
*-commutativeN/A
div-invN/A
lower-/.f64N/A
lower-/.f6470.1
Applied rewrites70.1%
if 4.94066e-323 < (*.f64 V l) Initial program 79.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.8
Applied rewrites90.8%
Final simplification89.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 (<= (* V l) (- INFINITY))
(/ c0 (sqrt (* (/ l A) V)))
(if (<= (* V l) -2e-243)
(* (/ c0 (sqrt (* (- l) V))) (sqrt (- A)))
(if (<= (* V l) 5e-323)
(/ c0 (sqrt (/ V (/ A l))))
(* (/ (sqrt A) (sqrt (* V l))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -((double) INFINITY)) {
tmp = c0 / sqrt(((l / A) * V));
} else if ((V * l) <= -2e-243) {
tmp = (c0 / sqrt((-l * V))) * sqrt(-A);
} else if ((V * l) <= 5e-323) {
tmp = c0 / sqrt((V / (A / l)));
} else {
tmp = (sqrt(A) / sqrt((V * l))) * 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 ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = c0 / Math.sqrt(((l / A) * V));
} else if ((V * l) <= -2e-243) {
tmp = (c0 / Math.sqrt((-l * V))) * Math.sqrt(-A);
} else if ((V * l) <= 5e-323) {
tmp = c0 / Math.sqrt((V / (A / l)));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= -math.inf: tmp = c0 / math.sqrt(((l / A) * V)) elif (V * l) <= -2e-243: tmp = (c0 / math.sqrt((-l * V))) * math.sqrt(-A) elif (V * l) <= 5e-323: tmp = c0 / math.sqrt((V / (A / l))) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= Float64(-Inf)) tmp = Float64(c0 / sqrt(Float64(Float64(l / A) * V))); elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(c0 / sqrt(Float64(Float64(-l) * V))) * sqrt(Float64(-A))); elseif (Float64(V * l) <= 5e-323) tmp = Float64(c0 / sqrt(Float64(V / Float64(A / l)))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 * l) <= -Inf)
tmp = c0 / sqrt(((l / A) * V));
elseif ((V * l) <= -2e-243)
tmp = (c0 / sqrt((-l * V))) * sqrt(-A);
elseif ((V * l) <= 5e-323)
tmp = c0 / sqrt((V / (A / l)));
else
tmp = (sqrt(A) / sqrt((V * 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[N[(V * l), $MachinePrecision], (-Infinity)], N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(c0 / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e-323], N[(c0 / N[Sqrt[N[(V / N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * 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 \cdot \ell \leq -\infty:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\frac{c0}{\sqrt{\left(-\ell\right) \cdot V}} \cdot \sqrt{-A}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{-323}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{\frac{A}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0Initial program 35.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6435.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6435.0
Applied rewrites35.0%
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6472.7
Applied rewrites72.7%
if -inf.0 < (*.f64 V l) < -1.99999999999999999e-243Initial program 86.7%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6486.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.9
Applied rewrites86.9%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6497.5
Applied rewrites97.5%
if -1.99999999999999999e-243 < (*.f64 V l) < 4.94066e-323Initial program 51.0%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6451.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6451.0
Applied rewrites51.0%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l/N/A
/-rgt-identityN/A
metadata-evalN/A
clear-numN/A
metadata-evalN/A
div-invN/A
associate-/l/N/A
*-commutativeN/A
div-invN/A
lower-/.f64N/A
lower-/.f6470.1
Applied rewrites70.1%
if 4.94066e-323 < (*.f64 V l) Initial program 79.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.8
Applied rewrites90.8%
Final simplification89.6%
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 l) -5e+197)
(* (sqrt (/ (/ A l) V)) c0)
(if (<= (* V l) -1e-183)
(/ c0 (sqrt (/ (* V l) A)))
(if (<= (* V l) 5e-323)
(/ c0 (sqrt (/ V (/ A l))))
(* (/ (sqrt A) (sqrt (* V l))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -5e+197) {
tmp = sqrt(((A / l) / V)) * c0;
} else if ((V * l) <= -1e-183) {
tmp = c0 / sqrt(((V * l) / A));
} else if ((V * l) <= 5e-323) {
tmp = c0 / sqrt((V / (A / l)));
} else {
tmp = (sqrt(A) / sqrt((V * 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 * l) <= (-5d+197)) then
tmp = sqrt(((a / l) / v)) * c0
else if ((v * l) <= (-1d-183)) then
tmp = c0 / sqrt(((v * l) / a))
else if ((v * l) <= 5d-323) then
tmp = c0 / sqrt((v / (a / l)))
else
tmp = (sqrt(a) / sqrt((v * 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 * l) <= -5e+197) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if ((V * l) <= -1e-183) {
tmp = c0 / Math.sqrt(((V * l) / A));
} else if ((V * l) <= 5e-323) {
tmp = c0 / Math.sqrt((V / (A / l)));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= -5e+197: tmp = math.sqrt(((A / l) / V)) * c0 elif (V * l) <= -1e-183: tmp = c0 / math.sqrt(((V * l) / A)) elif (V * l) <= 5e-323: tmp = c0 / math.sqrt((V / (A / l))) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= -5e+197) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (Float64(V * l) <= -1e-183) tmp = Float64(c0 / sqrt(Float64(Float64(V * l) / A))); elseif (Float64(V * l) <= 5e-323) tmp = Float64(c0 / sqrt(Float64(V / Float64(A / l)))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 * l) <= -5e+197)
tmp = sqrt(((A / l) / V)) * c0;
elseif ((V * l) <= -1e-183)
tmp = c0 / sqrt(((V * l) / A));
elseif ((V * l) <= 5e-323)
tmp = c0 / sqrt((V / (A / l)));
else
tmp = (sqrt(A) / sqrt((V * 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[N[(V * l), $MachinePrecision], -5e+197], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -1e-183], N[(c0 / N[Sqrt[N[(N[(V * l), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 5e-323], N[(c0 / N[Sqrt[N[(V / N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * 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 \cdot \ell \leq -5 \cdot 10^{+197}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;V \cdot \ell \leq -1 \cdot 10^{-183}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V \cdot \ell}{A}}}\\
\mathbf{elif}\;V \cdot \ell \leq 5 \cdot 10^{-323}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V}{\frac{A}{\ell}}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -5.00000000000000009e197Initial program 55.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6468.1
Applied rewrites68.1%
if -5.00000000000000009e197 < (*.f64 V l) < -1.00000000000000001e-183Initial program 95.4%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6495.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.8
Applied rewrites95.8%
if -1.00000000000000001e-183 < (*.f64 V l) < 4.94066e-323Initial program 51.3%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6451.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6451.4
Applied rewrites51.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l/N/A
/-rgt-identityN/A
metadata-evalN/A
clear-numN/A
metadata-evalN/A
div-invN/A
associate-/l/N/A
*-commutativeN/A
div-invN/A
lower-/.f64N/A
lower-/.f6466.7
Applied rewrites66.7%
if 4.94066e-323 < (*.f64 V l) Initial program 79.2%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.8
Applied rewrites90.8%
Final simplification85.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 (/ c0 (sqrt (* (/ l A) V)))))
(if (<= (* V l) (- INFINITY))
t_0
(if (<= (* V l) -2e-243)
(/ (* (sqrt (- A)) c0) (sqrt (* (- l) V)))
(if (<= (* V l) 0.0) t_0 (* (/ (sqrt A) (sqrt (* V l))) c0))))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double t_0 = c0 / sqrt(((l / A) * V));
double tmp;
if ((V * l) <= -((double) INFINITY)) {
tmp = t_0;
} else if ((V * l) <= -2e-243) {
tmp = (sqrt(-A) * c0) / sqrt((-l * V));
} else if ((V * l) <= 0.0) {
tmp = t_0;
} else {
tmp = (sqrt(A) / sqrt((V * l))) * 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 = c0 / Math.sqrt(((l / A) * V));
double tmp;
if ((V * l) <= -Double.POSITIVE_INFINITY) {
tmp = t_0;
} else if ((V * l) <= -2e-243) {
tmp = (Math.sqrt(-A) * c0) / Math.sqrt((-l * V));
} else if ((V * l) <= 0.0) {
tmp = t_0;
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): t_0 = c0 / math.sqrt(((l / A) * V)) tmp = 0 if (V * l) <= -math.inf: tmp = t_0 elif (V * l) <= -2e-243: tmp = (math.sqrt(-A) * c0) / math.sqrt((-l * V)) elif (V * l) <= 0.0: tmp = t_0 else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) t_0 = Float64(c0 / sqrt(Float64(Float64(l / A) * V))) tmp = 0.0 if (Float64(V * l) <= Float64(-Inf)) tmp = t_0; elseif (Float64(V * l) <= -2e-243) tmp = Float64(Float64(sqrt(Float64(-A)) * c0) / sqrt(Float64(Float64(-l) * V))); elseif (Float64(V * l) <= 0.0) tmp = t_0; else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * l))) * 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 = c0 / sqrt(((l / A) * V));
tmp = 0.0;
if ((V * l) <= -Inf)
tmp = t_0;
elseif ((V * l) <= -2e-243)
tmp = (sqrt(-A) * c0) / sqrt((-l * V));
elseif ((V * l) <= 0.0)
tmp = t_0;
else
tmp = (sqrt(A) / sqrt((V * 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_] := Block[{t$95$0 = N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(V * l), $MachinePrecision], (-Infinity)], t$95$0, If[LessEqual[N[(V * l), $MachinePrecision], -2e-243], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[((-l) * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], t$95$0, N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision]]]]]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\begin{array}{l}
t_0 := \frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{if}\;V \cdot \ell \leq -\infty:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-243}:\\
\;\;\;\;\frac{\sqrt{-A} \cdot c0}{\sqrt{\left(-\ell\right) \cdot V}}\\
\mathbf{elif}\;V \cdot \ell \leq 0:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -inf.0 or -1.99999999999999999e-243 < (*.f64 V l) < 0.0Initial program 47.1%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6447.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6447.1
Applied rewrites47.1%
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6472.3
Applied rewrites72.3%
if -inf.0 < (*.f64 V l) < -1.99999999999999999e-243Initial program 86.7%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6486.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.9
Applied rewrites86.9%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
sqrt-prodN/A
lift-sqrt.f64N/A
pow1/2N/A
associate-/r*N/A
lift-/.f64N/A
un-div-invN/A
metadata-evalN/A
metadata-evalN/A
pow1/2N/A
sqrt-divN/A
metadata-evalN/A
clear-numN/A
lift-/.f64N/A
*-commutativeN/A
lift-/.f64N/A
Applied rewrites97.6%
if 0.0 < (*.f64 V l) Initial program 78.5%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.0
Applied rewrites90.0%
Final simplification89.6%
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 l) -5e+197)
(* (sqrt (/ (/ A l) V)) c0)
(if (<= (* V l) -2e-140)
(/ c0 (sqrt (/ (* V l) A)))
(if (<= (* V l) 0.0)
(/ c0 (sqrt (* (/ l A) V)))
(* (/ (sqrt A) (sqrt (* V l))) c0)))))assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
double tmp;
if ((V * l) <= -5e+197) {
tmp = sqrt(((A / l) / V)) * c0;
} else if ((V * l) <= -2e-140) {
tmp = c0 / sqrt(((V * l) / A));
} else if ((V * l) <= 0.0) {
tmp = c0 / sqrt(((l / A) * V));
} else {
tmp = (sqrt(A) / sqrt((V * 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 * l) <= (-5d+197)) then
tmp = sqrt(((a / l) / v)) * c0
else if ((v * l) <= (-2d-140)) then
tmp = c0 / sqrt(((v * l) / a))
else if ((v * l) <= 0.0d0) then
tmp = c0 / sqrt(((l / a) * v))
else
tmp = (sqrt(a) / sqrt((v * 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 * l) <= -5e+197) {
tmp = Math.sqrt(((A / l) / V)) * c0;
} else if ((V * l) <= -2e-140) {
tmp = c0 / Math.sqrt(((V * l) / A));
} else if ((V * l) <= 0.0) {
tmp = c0 / Math.sqrt(((l / A) * V));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * c0;
}
return tmp;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): tmp = 0 if (V * l) <= -5e+197: tmp = math.sqrt(((A / l) / V)) * c0 elif (V * l) <= -2e-140: tmp = c0 / math.sqrt(((V * l) / A)) elif (V * l) <= 0.0: tmp = c0 / math.sqrt(((l / A) * V)) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * c0 return tmp
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) tmp = 0.0 if (Float64(V * l) <= -5e+197) tmp = Float64(sqrt(Float64(Float64(A / l) / V)) * c0); elseif (Float64(V * l) <= -2e-140) tmp = Float64(c0 / sqrt(Float64(Float64(V * l) / A))); elseif (Float64(V * l) <= 0.0) tmp = Float64(c0 / sqrt(Float64(Float64(l / A) * V))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 * l) <= -5e+197)
tmp = sqrt(((A / l) / V)) * c0;
elseif ((V * l) <= -2e-140)
tmp = c0 / sqrt(((V * l) / A));
elseif ((V * l) <= 0.0)
tmp = c0 / sqrt(((l / A) * V));
else
tmp = (sqrt(A) / sqrt((V * 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[N[(V * l), $MachinePrecision], -5e+197], N[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -2e-140], N[(c0 / N[Sqrt[N[(N[(V * l), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(N[(l / A), $MachinePrecision] * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * 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 \cdot \ell \leq -5 \cdot 10^{+197}:\\
\;\;\;\;\sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\
\mathbf{elif}\;V \cdot \ell \leq -2 \cdot 10^{-140}:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{V \cdot \ell}{A}}}\\
\mathbf{elif}\;V \cdot \ell \leq 0:\\
\;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{A} \cdot V}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if (*.f64 V l) < -5.00000000000000009e197Initial program 55.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lower-/.f6468.1
Applied rewrites68.1%
if -5.00000000000000009e197 < (*.f64 V l) < -2e-140Initial program 95.1%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6495.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.4
Applied rewrites95.4%
if -2e-140 < (*.f64 V l) < 0.0Initial program 57.8%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6457.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6457.8
Applied rewrites57.8%
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6471.7
Applied rewrites71.7%
if 0.0 < (*.f64 V l) Initial program 78.5%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6490.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.0
Applied rewrites90.0%
Final simplification85.3%
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) (/ c0 (* (sqrt (- V)) (/ (sqrt l) (sqrt (- A))))) (* (/ (sqrt A) (sqrt (* V l))) 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 = c0 / (sqrt(-V) * (sqrt(l) / sqrt(-A)));
} else {
tmp = (sqrt(A) / sqrt((V * 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 (a <= (-5d-310)) then
tmp = c0 / (sqrt(-v) * (sqrt(l) / sqrt(-a)))
else
tmp = (sqrt(a) / sqrt((v * 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 (A <= -5e-310) {
tmp = c0 / (Math.sqrt(-V) * (Math.sqrt(l) / Math.sqrt(-A)));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * 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 = c0 / (math.sqrt(-V) * (math.sqrt(l) / math.sqrt(-A))) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * 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(c0 / Float64(sqrt(Float64(-V)) * Float64(sqrt(l) / sqrt(Float64(-A))))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 (A <= -5e-310)
tmp = c0 / (sqrt(-V) * (sqrt(l) / sqrt(-A)));
else
tmp = (sqrt(A) / sqrt((V * 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[A, -5e-310], N[(c0 / N[(N[Sqrt[(-V)], $MachinePrecision] * N[(N[Sqrt[l], $MachinePrecision] / N[Sqrt[(-A)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $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{c0}{\sqrt{-V} \cdot \frac{\sqrt{\ell}}{\sqrt{-A}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 76.5%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6476.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
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-/.f64N/A
frac-2negN/A
sqrt-divN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-neg.f6441.6
Applied rewrites41.6%
if -4.999999999999985e-310 < A Initial program 75.4%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6485.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.8
Applied rewrites85.8%
Final simplification63.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 (<= A -5e-310) (* (/ (sqrt (- A)) (sqrt (- V))) (/ c0 (sqrt l))) (* (/ (sqrt A) (sqrt (* V l))) 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(-V)) * (c0 / sqrt(l));
} else {
tmp = (sqrt(A) / sqrt((V * 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 (a <= (-5d-310)) then
tmp = (sqrt(-a) / sqrt(-v)) * (c0 / sqrt(l))
else
tmp = (sqrt(a) / sqrt((v * 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 (A <= -5e-310) {
tmp = (Math.sqrt(-A) / Math.sqrt(-V)) * (c0 / Math.sqrt(l));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * 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(-V)) * (c0 / math.sqrt(l)) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * 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)) / sqrt(Float64(-V))) * Float64(c0 / sqrt(l))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 (A <= -5e-310)
tmp = (sqrt(-A) / sqrt(-V)) * (c0 / sqrt(l));
else
tmp = (sqrt(A) / sqrt((V * 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[A, -5e-310], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[(-V)], $MachinePrecision]), $MachinePrecision] * N[(c0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $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{-V}} \cdot \frac{c0}{\sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 76.5%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
sqrt-divN/A
associate-*r/N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f6437.7
Applied rewrites37.7%
lift-sqrt.f64N/A
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-neg.f6441.5
Applied rewrites41.5%
if -4.999999999999985e-310 < A Initial program 75.4%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6485.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.8
Applied rewrites85.8%
Final simplification63.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 (<= A -5e-310) (/ (* (sqrt (- A)) c0) (* (sqrt (- V)) (sqrt l))) (* (/ (sqrt A) (sqrt (* V l))) 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) * c0) / (sqrt(-V) * sqrt(l));
} else {
tmp = (sqrt(A) / sqrt((V * 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 (a <= (-5d-310)) then
tmp = (sqrt(-a) * c0) / (sqrt(-v) * sqrt(l))
else
tmp = (sqrt(a) / sqrt((v * 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 (A <= -5e-310) {
tmp = (Math.sqrt(-A) * c0) / (Math.sqrt(-V) * Math.sqrt(l));
} else {
tmp = (Math.sqrt(A) / Math.sqrt((V * l))) * 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) * c0) / (math.sqrt(-V) * math.sqrt(l)) else: tmp = (math.sqrt(A) / math.sqrt((V * l))) * 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)) * c0) / Float64(sqrt(Float64(-V)) * sqrt(l))); else tmp = Float64(Float64(sqrt(A) / sqrt(Float64(V * 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 (A <= -5e-310)
tmp = (sqrt(-A) * c0) / (sqrt(-V) * sqrt(l));
else
tmp = (sqrt(A) / sqrt((V * 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[A, -5e-310], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * c0), $MachinePrecision] / N[(N[Sqrt[(-V)], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $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} \cdot c0}{\sqrt{-V} \cdot \sqrt{\ell}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A}}{\sqrt{V \cdot \ell}} \cdot c0\\
\end{array}
\end{array}
if A < -4.999999999999985e-310Initial program 76.5%
lift-*.f64N/A
lift-sqrt.f64N/A
lift-/.f64N/A
clear-numN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-/.f6476.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l/N/A
/-rgt-identityN/A
metadata-evalN/A
clear-numN/A
metadata-evalN/A
div-invN/A
associate-/l/N/A
*-commutativeN/A
div-invN/A
lower-/.f64N/A
lower-/.f6475.9
Applied rewrites75.9%
lift-/.f64N/A
*-lft-identityN/A
lift-sqrt.f64N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
sqrt-prodN/A
lift-sqrt.f64N/A
frac-timesN/A
frac-2negN/A
lift-neg.f64N/A
sqrt-divN/A
clear-numN/A
frac-timesN/A
*-commutativeN/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
Applied rewrites41.6%
if -4.999999999999985e-310 < A Initial program 75.4%
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6485.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.8
Applied rewrites85.8%
Final simplification63.5%
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 (* V l))) c0))
assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
return sqrt((A / (V * l))) * 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 / (v * l))) * 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 / (V * l))) * c0;
}
[c0, A, V, l] = sort([c0, A, V, l]) def code(c0, A, V, l): return math.sqrt((A / (V * l))) * c0
c0, A, V, l = sort([c0, A, V, l]) function code(c0, A, V, l) return Float64(sqrt(Float64(A / Float64(V * l))) * c0) end
c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp = code(c0, A, V, l)
tmp = sqrt((A / (V * l))) * 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[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]
\begin{array}{l}
[c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\
\\
\sqrt{\frac{A}{V \cdot \ell}} \cdot c0
\end{array}
Initial program 75.9%
Final simplification75.9%
herbie shell --seed 2024276
(FPCore (c0 A V l)
:name "Henrywood and Agarwal, Equation (3)"
:precision binary64
(* c0 (sqrt (/ A (* V l)))))