
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 2.1e-17)
(* R (hypot phi1 (* (- lambda1 lambda2) (cos (* phi1 0.5)))))
(*
R
(hypot phi2 (/ 1.0 (/ 1.0 (* (- lambda1 lambda2) (cos (* phi2 0.5)))))))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.1e-17) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5))));
} else {
tmp = R * hypot(phi2, (1.0 / (1.0 / ((lambda1 - lambda2) * cos((phi2 * 0.5))))));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.1e-17) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((phi1 * 0.5))));
} else {
tmp = R * Math.hypot(phi2, (1.0 / (1.0 / ((lambda1 - lambda2) * Math.cos((phi2 * 0.5))))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.1e-17: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((phi1 * 0.5)))) else: tmp = R * math.hypot(phi2, (1.0 / (1.0 / ((lambda1 - lambda2) * math.cos((phi2 * 0.5)))))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.1e-17) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))))); else tmp = Float64(R * hypot(phi2, Float64(1.0 / Float64(1.0 / Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 2.1e-17)
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5))));
else
tmp = R * hypot(phi2, (1.0 / (1.0 / ((lambda1 - lambda2) * cos((phi2 * 0.5))))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.1e-17], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(1.0 / N[(1.0 / N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.1 \cdot 10^{-17}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \frac{1}{\frac{1}{\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)}}\right)\\
\end{array}
\end{array}
if phi2 < 2.09999999999999992e-17Initial program 64.4%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6479.5
Simplified79.5%
if 2.09999999999999992e-17 < phi2 Initial program 53.9%
Taylor expanded in phi1 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6484.2
Simplified84.2%
lift-*.f64N/A
lift-cos.f64N/A
flip--N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
clear-numN/A
flip--N/A
lift--.f64N/A
lower-/.f6484.2
Applied egg-rr84.2%
lift-*.f64N/A
lift-cos.f64N/A
lift--.f64N/A
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
lift-/.f64N/A
lower-/.f6484.3
lift-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
lower-*.f6484.2
Applied egg-rr84.2%
Final simplification80.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 2.1e-17) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* phi1 0.5))))) (* R (hypot phi2 (* (- lambda1 lambda2) (cos (* phi2 0.5)))))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.1e-17) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5))));
} else {
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
}
return tmp;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.1e-17) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((phi1 * 0.5))));
} else {
tmp = R * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((phi2 * 0.5))));
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.1e-17: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((phi1 * 0.5)))) else: tmp = R * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((phi2 * 0.5)))) return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.1e-17) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))))); else tmp = Float64(R * hypot(phi2, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))))); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 2.1e-17)
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5))));
else
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.1e-17], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.1 \cdot 10^{-17}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if phi2 < 2.09999999999999992e-17Initial program 64.4%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6479.5
Simplified79.5%
if 2.09999999999999992e-17 < phi2 Initial program 53.9%
Taylor expanded in phi1 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
lower-*.f64N/A
lower-cos.f64N/A
lower-*.f64N/A
lower--.f6484.2
Simplified84.2%
Final simplification80.9%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 0.65)
(* R (hypot phi1 (* (- lambda1 lambda2) (cos (* phi1 0.5)))))
(if (<= phi2 2.2e+150)
(*
R
(sqrt
(+
(*
(- lambda1 lambda2)
(fma
(- lambda1 lambda2)
0.5
(* (cos (+ phi2 phi1)) (* (- lambda1 lambda2) 0.5))))
(* (- phi1 phi2) (- phi1 phi2)))))
(* R (fma phi2 (- (/ phi1 phi2)) phi2)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.65) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((phi1 * 0.5))));
} else if (phi2 <= 2.2e+150) {
tmp = R * sqrt((((lambda1 - lambda2) * fma((lambda1 - lambda2), 0.5, (cos((phi2 + phi1)) * ((lambda1 - lambda2) * 0.5)))) + ((phi1 - phi2) * (phi1 - phi2))));
} else {
tmp = R * fma(phi2, -(phi1 / phi2), phi2);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.65) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))))); elseif (phi2 <= 2.2e+150) tmp = Float64(R * sqrt(Float64(Float64(Float64(lambda1 - lambda2) * fma(Float64(lambda1 - lambda2), 0.5, Float64(cos(Float64(phi2 + phi1)) * Float64(Float64(lambda1 - lambda2) * 0.5)))) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))); else tmp = Float64(R * fma(phi2, Float64(-Float64(phi1 / phi2)), phi2)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.65], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.2e+150], N[(R * N[Sqrt[N[(N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * 0.5 + N[(N[Cos[N[(phi2 + phi1), $MachinePrecision]], $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * (-N[(phi1 / phi2), $MachinePrecision]) + phi2), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.65:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 2.2 \cdot 10^{+150}:\\
\;\;\;\;R \cdot \sqrt{\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{fma}\left(\lambda_1 - \lambda_2, 0.5, \cos \left(\phi_2 + \phi_1\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot 0.5\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\phi_2, -\frac{\phi_1}{\phi_2}, \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 0.650000000000000022Initial program 64.5%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6479.8
Simplified79.8%
if 0.650000000000000022 < phi2 < 2.19999999999999999e150Initial program 58.8%
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied egg-rr58.8%
lift--.f64N/A
lift-+.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6458.9
Applied egg-rr58.9%
if 2.19999999999999999e150 < phi2 Initial program 48.6%
Taylor expanded in phi2 around inf
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6494.9
Simplified94.9%
Final simplification79.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 0.65)
(* R (hypot phi1 (- lambda1 lambda2)))
(if (<= phi2 2.2e+150)
(*
R
(sqrt
(+
(*
(- lambda1 lambda2)
(fma
(- lambda1 lambda2)
0.5
(* (cos (+ phi2 phi1)) (* (- lambda1 lambda2) 0.5))))
(* (- phi1 phi2) (- phi1 phi2)))))
(* R (fma phi2 (- (/ phi1 phi2)) phi2)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.65) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else if (phi2 <= 2.2e+150) {
tmp = R * sqrt((((lambda1 - lambda2) * fma((lambda1 - lambda2), 0.5, (cos((phi2 + phi1)) * ((lambda1 - lambda2) * 0.5)))) + ((phi1 - phi2) * (phi1 - phi2))));
} else {
tmp = R * fma(phi2, -(phi1 / phi2), phi2);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.65) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); elseif (phi2 <= 2.2e+150) tmp = Float64(R * sqrt(Float64(Float64(Float64(lambda1 - lambda2) * fma(Float64(lambda1 - lambda2), 0.5, Float64(cos(Float64(phi2 + phi1)) * Float64(Float64(lambda1 - lambda2) * 0.5)))) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))); else tmp = Float64(R * fma(phi2, Float64(-Float64(phi1 / phi2)), phi2)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.65], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.2e+150], N[(R * N[Sqrt[N[(N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * 0.5 + N[(N[Cos[N[(phi2 + phi1), $MachinePrecision]], $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * (-N[(phi1 / phi2), $MachinePrecision]) + phi2), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.65:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 2.2 \cdot 10^{+150}:\\
\;\;\;\;R \cdot \sqrt{\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{fma}\left(\lambda_1 - \lambda_2, 0.5, \cos \left(\phi_2 + \phi_1\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot 0.5\right)\right) + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\phi_2, -\frac{\phi_1}{\phi_2}, \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 0.650000000000000022Initial program 64.5%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6479.8
Simplified79.8%
Taylor expanded in phi1 around 0
lower--.f6472.4
Simplified72.4%
if 0.650000000000000022 < phi2 < 2.19999999999999999e150Initial program 58.8%
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied egg-rr58.8%
lift--.f64N/A
lift-+.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6458.9
Applied egg-rr58.9%
if 2.19999999999999999e150 < phi2 Initial program 48.6%
Taylor expanded in phi2 around inf
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6494.9
Simplified94.9%
Final simplification74.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 0.65)
(* R (hypot phi1 (- lambda1 lambda2)))
(if (<= phi2 2.2e+150)
(*
R
(sqrt
(fma
(- phi1 phi2)
(- phi1 phi2)
(*
(* (- lambda1 lambda2) (- lambda1 lambda2))
(+ 0.5 (* 0.5 (cos (+ phi2 phi1))))))))
(* R (fma phi2 (- (/ phi1 phi2)) phi2)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.65) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else if (phi2 <= 2.2e+150) {
tmp = R * sqrt(fma((phi1 - phi2), (phi1 - phi2), (((lambda1 - lambda2) * (lambda1 - lambda2)) * (0.5 + (0.5 * cos((phi2 + phi1)))))));
} else {
tmp = R * fma(phi2, -(phi1 / phi2), phi2);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.65) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); elseif (phi2 <= 2.2e+150) tmp = Float64(R * sqrt(fma(Float64(phi1 - phi2), Float64(phi1 - phi2), Float64(Float64(Float64(lambda1 - lambda2) * Float64(lambda1 - lambda2)) * Float64(0.5 + Float64(0.5 * cos(Float64(phi2 + phi1)))))))); else tmp = Float64(R * fma(phi2, Float64(-Float64(phi1 / phi2)), phi2)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.65], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.2e+150], N[(R * N[Sqrt[N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision] + N[(N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] * N[(0.5 + N[(0.5 * N[Cos[N[(phi2 + phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * (-N[(phi1 / phi2), $MachinePrecision]) + phi2), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.65:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 2.2 \cdot 10^{+150}:\\
\;\;\;\;R \cdot \sqrt{\mathsf{fma}\left(\phi_1 - \phi_2, \phi_1 - \phi_2, \left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\lambda_1 - \lambda_2\right)\right) \cdot \left(0.5 + 0.5 \cdot \cos \left(\phi_2 + \phi_1\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\phi_2, -\frac{\phi_1}{\phi_2}, \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 0.650000000000000022Initial program 64.5%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6479.8
Simplified79.8%
Taylor expanded in phi1 around 0
lower--.f6472.4
Simplified72.4%
if 0.650000000000000022 < phi2 < 2.19999999999999999e150Initial program 58.8%
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift--.f64N/A
lift-*.f64N/A
Applied egg-rr58.9%
if 2.19999999999999999e150 < phi2 Initial program 48.6%
Taylor expanded in phi2 around inf
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6494.9
Simplified94.9%
Final simplification74.0%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.95e+15) (* R (hypot phi1 (- lambda1 lambda2))) (* R (fma phi2 (- (/ phi1 phi2)) phi2))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.95e+15) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * fma(phi2, -(phi1 / phi2), phi2);
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.95e+15) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * fma(phi2, Float64(-Float64(phi1 / phi2)), phi2)); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.95e+15], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * (-N[(phi1 / phi2), $MachinePrecision]) + phi2), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.95 \cdot 10^{+15}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\phi_2, -\frac{\phi_1}{\phi_2}, \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.95e15Initial program 64.4%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6478.7
Simplified78.7%
Taylor expanded in phi1 around 0
lower--.f6471.5
Simplified71.5%
if 1.95e15 < phi2 Initial program 52.6%
Taylor expanded in phi2 around inf
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6474.8
Simplified74.8%
Final simplification72.3%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -1.7e-51)
(* R (fma phi1 (/ phi2 phi1) (- phi1)))
(if (<= phi1 6.5e-183)
(* lambda2 (- R (/ (* R lambda1) lambda2)))
(* phi2 R))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.7e-51) {
tmp = R * fma(phi1, (phi2 / phi1), -phi1);
} else if (phi1 <= 6.5e-183) {
tmp = lambda2 * (R - ((R * lambda1) / lambda2));
} else {
tmp = phi2 * R;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.7e-51) tmp = Float64(R * fma(phi1, Float64(phi2 / phi1), Float64(-phi1))); elseif (phi1 <= 6.5e-183) tmp = Float64(lambda2 * Float64(R - Float64(Float64(R * lambda1) / lambda2))); else tmp = Float64(phi2 * R); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.7e-51], N[(R * N[(phi1 * N[(phi2 / phi1), $MachinePrecision] + (-phi1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 6.5e-183], N[(lambda2 * N[(R - N[(N[(R * lambda1), $MachinePrecision] / lambda2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(phi2 * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.7 \cdot 10^{-51}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\phi_1, \frac{\phi_2}{\phi_1}, -\phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq 6.5 \cdot 10^{-183}:\\
\;\;\;\;\lambda_2 \cdot \left(R - \frac{R \cdot \lambda_1}{\lambda_2}\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot R\\
\end{array}
\end{array}
if phi1 < -1.70000000000000001e-51Initial program 49.6%
Taylor expanded in phi1 around -inf
associate-*r*N/A
+-commutativeN/A
distribute-lft-inN/A
mul-1-negN/A
distribute-lft-neg-inN/A
mul-1-negN/A
distribute-rgt-neg-outN/A
remove-double-negN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6467.5
Simplified67.5%
if -1.70000000000000001e-51 < phi1 < 6.50000000000000014e-183Initial program 72.2%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6460.1
Simplified60.1%
Taylor expanded in phi1 around 0
lower--.f6460.1
Simplified60.1%
Taylor expanded in lambda2 around inf
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6426.5
Simplified26.5%
if 6.50000000000000014e-183 < phi1 Initial program 63.3%
Taylor expanded in phi1 around -inf
Simplified10.3%
Taylor expanded in phi2 around inf
lower-*.f6419.2
Simplified19.2%
Final simplification37.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 1.05e+191) (* R (fma phi1 (/ phi2 phi1) (- phi1))) (* R lambda2)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.05e+191) {
tmp = R * fma(phi1, (phi2 / phi1), -phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.05e+191) tmp = Float64(R * fma(phi1, Float64(phi2 / phi1), Float64(-phi1))); else tmp = Float64(R * lambda2); end return tmp end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.05e+191], N[(R * N[(phi1 * N[(phi2 / phi1), $MachinePrecision] + (-phi1)), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.05 \cdot 10^{+191}:\\
\;\;\;\;R \cdot \mathsf{fma}\left(\phi_1, \frac{\phi_2}{\phi_1}, -\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 1.05e191Initial program 62.1%
Taylor expanded in phi1 around -inf
associate-*r*N/A
+-commutativeN/A
distribute-lft-inN/A
mul-1-negN/A
distribute-lft-neg-inN/A
mul-1-negN/A
distribute-rgt-neg-outN/A
remove-double-negN/A
*-rgt-identityN/A
lower-fma.f64N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6434.8
Simplified34.8%
if 1.05e191 < lambda2 Initial program 54.8%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6476.1
Simplified76.1%
Taylor expanded in phi1 around 0
lower--.f6465.8
Simplified65.8%
Taylor expanded in lambda2 around inf
*-commutativeN/A
lower-*.f6465.8
Simplified65.8%
Final simplification37.4%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 6.9e-189)
(- (* R phi1))
(if (<= phi2 1.25e-115)
(- (* R lambda1))
(if (<= phi2 4.9e+14) (* R lambda2) (* phi2 R)))))assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 6.9e-189) {
tmp = -(R * phi1);
} else if (phi2 <= 1.25e-115) {
tmp = -(R * lambda1);
} else if (phi2 <= 4.9e+14) {
tmp = R * lambda2;
} else {
tmp = phi2 * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 6.9d-189) then
tmp = -(r * phi1)
else if (phi2 <= 1.25d-115) then
tmp = -(r * lambda1)
else if (phi2 <= 4.9d+14) then
tmp = r * lambda2
else
tmp = phi2 * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 6.9e-189) {
tmp = -(R * phi1);
} else if (phi2 <= 1.25e-115) {
tmp = -(R * lambda1);
} else if (phi2 <= 4.9e+14) {
tmp = R * lambda2;
} else {
tmp = phi2 * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 6.9e-189: tmp = -(R * phi1) elif phi2 <= 1.25e-115: tmp = -(R * lambda1) elif phi2 <= 4.9e+14: tmp = R * lambda2 else: tmp = phi2 * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 6.9e-189) tmp = Float64(-Float64(R * phi1)); elseif (phi2 <= 1.25e-115) tmp = Float64(-Float64(R * lambda1)); elseif (phi2 <= 4.9e+14) tmp = Float64(R * lambda2); else tmp = Float64(phi2 * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 6.9e-189)
tmp = -(R * phi1);
elseif (phi2 <= 1.25e-115)
tmp = -(R * lambda1);
elseif (phi2 <= 4.9e+14)
tmp = R * lambda2;
else
tmp = phi2 * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 6.9e-189], (-N[(R * phi1), $MachinePrecision]), If[LessEqual[phi2, 1.25e-115], (-N[(R * lambda1), $MachinePrecision]), If[LessEqual[phi2, 4.9e+14], N[(R * lambda2), $MachinePrecision], N[(phi2 * R), $MachinePrecision]]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 6.9 \cdot 10^{-189}:\\
\;\;\;\;-R \cdot \phi_1\\
\mathbf{elif}\;\phi_2 \leq 1.25 \cdot 10^{-115}:\\
\;\;\;\;-R \cdot \lambda_1\\
\mathbf{elif}\;\phi_2 \leq 4.9 \cdot 10^{+14}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot R\\
\end{array}
\end{array}
if phi2 < 6.9000000000000003e-189Initial program 63.2%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6421.7
Simplified21.7%
if 6.9000000000000003e-189 < phi2 < 1.2500000000000001e-115Initial program 73.2%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6493.3
Simplified93.3%
Taylor expanded in phi1 around 0
lower--.f6487.9
Simplified87.9%
Taylor expanded in lambda1 around -inf
mul-1-negN/A
lower-neg.f6416.4
Simplified16.4%
if 1.2500000000000001e-115 < phi2 < 4.9e14Initial program 67.9%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6476.1
Simplified76.1%
Taylor expanded in phi1 around 0
lower--.f6461.3
Simplified61.3%
Taylor expanded in lambda2 around inf
*-commutativeN/A
lower-*.f6420.3
Simplified20.3%
if 4.9e14 < phi2 Initial program 52.6%
Taylor expanded in phi1 around -inf
Simplified48.5%
Taylor expanded in phi2 around inf
lower-*.f6467.7
Simplified67.7%
Final simplification32.8%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.25e-115) (- (* R lambda1)) (if (<= phi2 4.9e+14) (* R lambda2) (* phi2 R))))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.25e-115) {
tmp = -(R * lambda1);
} else if (phi2 <= 4.9e+14) {
tmp = R * lambda2;
} else {
tmp = phi2 * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 1.25d-115) then
tmp = -(r * lambda1)
else if (phi2 <= 4.9d+14) then
tmp = r * lambda2
else
tmp = phi2 * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.25e-115) {
tmp = -(R * lambda1);
} else if (phi2 <= 4.9e+14) {
tmp = R * lambda2;
} else {
tmp = phi2 * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.25e-115: tmp = -(R * lambda1) elif phi2 <= 4.9e+14: tmp = R * lambda2 else: tmp = phi2 * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.25e-115) tmp = Float64(-Float64(R * lambda1)); elseif (phi2 <= 4.9e+14) tmp = Float64(R * lambda2); else tmp = Float64(phi2 * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 1.25e-115)
tmp = -(R * lambda1);
elseif (phi2 <= 4.9e+14)
tmp = R * lambda2;
else
tmp = phi2 * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.25e-115], (-N[(R * lambda1), $MachinePrecision]), If[LessEqual[phi2, 4.9e+14], N[(R * lambda2), $MachinePrecision], N[(phi2 * R), $MachinePrecision]]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.25 \cdot 10^{-115}:\\
\;\;\;\;-R \cdot \lambda_1\\
\mathbf{elif}\;\phi_2 \leq 4.9 \cdot 10^{+14}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot R\\
\end{array}
\end{array}
if phi2 < 1.2500000000000001e-115Initial program 64.0%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6479.0
Simplified79.0%
Taylor expanded in phi1 around 0
lower--.f6472.8
Simplified72.8%
Taylor expanded in lambda1 around -inf
mul-1-negN/A
lower-neg.f6417.4
Simplified17.4%
if 1.2500000000000001e-115 < phi2 < 4.9e14Initial program 67.9%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6476.1
Simplified76.1%
Taylor expanded in phi1 around 0
lower--.f6461.3
Simplified61.3%
Taylor expanded in lambda2 around inf
*-commutativeN/A
lower-*.f6420.3
Simplified20.3%
if 4.9e14 < phi2 Initial program 52.6%
Taylor expanded in phi1 around -inf
Simplified48.5%
Taylor expanded in phi2 around inf
lower-*.f6467.7
Simplified67.7%
Final simplification30.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 4.9e+14) (* R lambda2) (* phi2 R)))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.9e+14) {
tmp = R * lambda2;
} else {
tmp = phi2 * R;
}
return tmp;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 4.9d+14) then
tmp = r * lambda2
else
tmp = phi2 * r
end if
code = tmp
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.9e+14) {
tmp = R * lambda2;
} else {
tmp = phi2 * R;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 4.9e+14: tmp = R * lambda2 else: tmp = phi2 * R return tmp
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 4.9e+14) tmp = Float64(R * lambda2); else tmp = Float64(phi2 * R); end return tmp end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2)
tmp = 0.0;
if (phi2 <= 4.9e+14)
tmp = R * lambda2;
else
tmp = phi2 * R;
end
tmp_2 = tmp;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 4.9e+14], N[(R * lambda2), $MachinePrecision], N[(phi2 * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4.9 \cdot 10^{+14}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot R\\
\end{array}
\end{array}
if phi2 < 4.9e14Initial program 64.4%
Taylor expanded in phi2 around 0
+-commutativeN/A
unpow2N/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-cos.f64N/A
lower-*.f6478.7
Simplified78.7%
Taylor expanded in phi1 around 0
lower--.f6471.5
Simplified71.5%
Taylor expanded in lambda2 around inf
*-commutativeN/A
lower-*.f6413.7
Simplified13.7%
if 4.9e14 < phi2 Initial program 52.6%
Taylor expanded in phi1 around -inf
Simplified48.5%
Taylor expanded in phi2 around inf
lower-*.f6467.7
Simplified67.7%
Final simplification27.2%
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. (FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* phi2 R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return phi2 * R;
}
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function.
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = phi2 * r
end function
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return phi2 * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return phi2 * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(phi2 * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = phi2 * R;
end
NOTE: R, lambda1, lambda2, phi1, and phi2 should be sorted in increasing order before calling this function. code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(phi2 * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\phi_2 \cdot R
\end{array}
Initial program 61.5%
Taylor expanded in phi1 around -inf
Simplified32.8%
Taylor expanded in phi2 around inf
lower-*.f6419.6
Simplified19.6%
Final simplification19.6%
herbie shell --seed 2024215
(FPCore (R lambda1 lambda2 phi1 phi2)
:name "Equirectangular approximation to distance on a great circle"
:precision binary64
(* R (sqrt (+ (* (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0)))) (* (- phi1 phi2) (- phi1 phi2))))))