
(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 13 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 4.8e-8)
(* (hypot (* (- lambda1 lambda2) (cos (* -0.5 phi1))) phi1) R)
(*
(hypot
(*
(-
(* (cos (* 0.5 phi1)) (cos (* 0.5 phi2)))
(* (sin (* 0.5 phi1)) (sin (* 0.5 phi2))))
lambda2)
(- phi1 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.8e-8) {
tmp = hypot(((lambda1 - lambda2) * cos((-0.5 * phi1))), phi1) * R;
} else {
tmp = hypot((((cos((0.5 * phi1)) * cos((0.5 * phi2))) - (sin((0.5 * phi1)) * sin((0.5 * phi2)))) * lambda2), (phi1 - phi2)) * R;
}
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 <= 4.8e-8) {
tmp = Math.hypot(((lambda1 - lambda2) * Math.cos((-0.5 * phi1))), phi1) * R;
} else {
tmp = Math.hypot((((Math.cos((0.5 * phi1)) * Math.cos((0.5 * phi2))) - (Math.sin((0.5 * phi1)) * Math.sin((0.5 * phi2)))) * lambda2), (phi1 - 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.8e-8: tmp = math.hypot(((lambda1 - lambda2) * math.cos((-0.5 * phi1))), phi1) * R else: tmp = math.hypot((((math.cos((0.5 * phi1)) * math.cos((0.5 * phi2))) - (math.sin((0.5 * phi1)) * math.sin((0.5 * phi2)))) * lambda2), (phi1 - 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.8e-8) tmp = Float64(hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(-0.5 * phi1))), phi1) * R); else tmp = Float64(hypot(Float64(Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(0.5 * phi2))) - Float64(sin(Float64(0.5 * phi1)) * sin(Float64(0.5 * phi2)))) * lambda2), Float64(phi1 - 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.8e-8)
tmp = hypot(((lambda1 - lambda2) * cos((-0.5 * phi1))), phi1) * R;
else
tmp = hypot((((cos((0.5 * phi1)) * cos((0.5 * phi2))) - (sin((0.5 * phi1)) * sin((0.5 * phi2)))) * lambda2), (phi1 - 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.8e-8], N[(N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision] * 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.8 \cdot 10^{-8}:\\
\;\;\;\;\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(-0.5 \cdot \phi_1\right), \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(0.5 \cdot \phi_2\right) - \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 4.79999999999999997e-8Initial program 62.6%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6479.3
Applied rewrites79.3%
if 4.79999999999999997e-8 < phi2 Initial program 60.9%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6490.2
Applied rewrites90.2%
Applied rewrites95.3%
Final simplification83.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 4.8e-8)
(* (hypot (* (- lambda1 lambda2) (cos (* -0.5 phi1))) phi1) R)
(*
(hypot
(*
(fma
(cos (* -0.5 phi2))
(cos (* 0.5 phi1))
(* (sin (* -0.5 phi2)) (sin (* 0.5 phi1))))
lambda2)
(- phi1 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.8e-8) {
tmp = hypot(((lambda1 - lambda2) * cos((-0.5 * phi1))), phi1) * R;
} else {
tmp = hypot((fma(cos((-0.5 * phi2)), cos((0.5 * phi1)), (sin((-0.5 * phi2)) * sin((0.5 * phi1)))) * lambda2), (phi1 - 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.8e-8) tmp = Float64(hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(-0.5 * phi1))), phi1) * R); else tmp = Float64(hypot(Float64(fma(cos(Float64(-0.5 * phi2)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(-0.5 * phi2)) * sin(Float64(0.5 * phi1)))) * lambda2), Float64(phi1 - 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[phi2, 4.8e-8], N[(N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[(N[Cos[N[(-0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(-0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision] * 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.8 \cdot 10^{-8}:\\
\;\;\;\;\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(-0.5 \cdot \phi_1\right), \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\mathsf{fma}\left(\cos \left(-0.5 \cdot \phi_2\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(-0.5 \cdot \phi_2\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right) \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 4.79999999999999997e-8Initial program 62.6%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6479.3
Applied rewrites79.3%
if 4.79999999999999997e-8 < phi2 Initial program 60.9%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6490.2
Applied rewrites90.2%
Applied rewrites95.3%
Final simplification83.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 4.3e-5) (* (hypot (* (- lambda1 lambda2) (cos (* -0.5 phi1))) phi1) R) (* (hypot (* (cos (* -0.5 phi2)) (- 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 (phi2 <= 4.3e-5) {
tmp = hypot(((lambda1 - lambda2) * cos((-0.5 * phi1))), phi1) * R;
} else {
tmp = hypot((cos((-0.5 * phi2)) * (lambda1 - lambda2)), phi2) * R;
}
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 <= 4.3e-5) {
tmp = Math.hypot(((lambda1 - lambda2) * Math.cos((-0.5 * phi1))), phi1) * R;
} else {
tmp = Math.hypot((Math.cos((-0.5 * phi2)) * (lambda1 - lambda2)), 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.3e-5: tmp = math.hypot(((lambda1 - lambda2) * math.cos((-0.5 * phi1))), phi1) * R else: tmp = math.hypot((math.cos((-0.5 * phi2)) * (lambda1 - lambda2)), 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.3e-5) tmp = Float64(hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(-0.5 * phi1))), phi1) * R); else tmp = Float64(hypot(Float64(cos(Float64(-0.5 * phi2)) * Float64(lambda1 - lambda2)), 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.3e-5)
tmp = hypot(((lambda1 - lambda2) * cos((-0.5 * phi1))), phi1) * R;
else
tmp = hypot((cos((-0.5 * phi2)) * (lambda1 - lambda2)), 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.3e-5], N[(N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[Cos[N[(-0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[(lambda1 - lambda2), $MachinePrecision]), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * 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.3 \cdot 10^{-5}:\\
\;\;\;\;\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(-0.5 \cdot \phi_1\right), \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\cos \left(-0.5 \cdot \phi_2\right) \cdot \left(\lambda_1 - \lambda_2\right), \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 4.3000000000000002e-5Initial program 62.6%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6479.3
Applied rewrites79.3%
if 4.3000000000000002e-5 < phi2 Initial program 60.9%
Taylor expanded in phi1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6480.8
Applied rewrites80.8%
Final simplification79.7%
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.0063) (* (hypot (* (- lambda1 lambda2) (cos (* -0.5 phi1))) phi1) R) (* (hypot (* (cos (* -0.5 phi2)) 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 <= 0.0063) {
tmp = hypot(((lambda1 - lambda2) * cos((-0.5 * phi1))), phi1) * R;
} else {
tmp = hypot((cos((-0.5 * phi2)) * lambda2), phi2) * R;
}
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 <= 0.0063) {
tmp = Math.hypot(((lambda1 - lambda2) * Math.cos((-0.5 * phi1))), phi1) * R;
} else {
tmp = Math.hypot((Math.cos((-0.5 * phi2)) * lambda2), 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 <= 0.0063: tmp = math.hypot(((lambda1 - lambda2) * math.cos((-0.5 * phi1))), phi1) * R else: tmp = math.hypot((math.cos((-0.5 * phi2)) * lambda2), 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 <= 0.0063) tmp = Float64(hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(-0.5 * phi1))), phi1) * R); else tmp = Float64(hypot(Float64(cos(Float64(-0.5 * phi2)) * lambda2), 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 <= 0.0063)
tmp = hypot(((lambda1 - lambda2) * cos((-0.5 * phi1))), phi1) * R;
else
tmp = hypot((cos((-0.5 * phi2)) * lambda2), 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, 0.0063], N[(N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(N[Cos[N[(-0.5 * phi2), $MachinePrecision]], $MachinePrecision] * lambda2), $MachinePrecision] ^ 2 + phi2 ^ 2], $MachinePrecision] * 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 0.0063:\\
\;\;\;\;\mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(-0.5 \cdot \phi_1\right), \phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(\cos \left(-0.5 \cdot \phi_2\right) \cdot \lambda_2, \phi_2\right) \cdot R\\
\end{array}
\end{array}
if phi2 < 0.0063Initial program 62.0%
Taylor expanded in phi2 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
lower--.f6479.2
Applied rewrites79.2%
if 0.0063 < phi2 Initial program 62.9%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6491.0
Applied rewrites91.0%
Taylor expanded in phi1 around 0
Applied rewrites78.0%
Final simplification78.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 (<= lambda1 -4.1e+210) (* (* (sin (/ (+ (+ phi1 phi2) (PI)) 2.0)) (- lambda1)) R) (* (hypot (* 1.0 lambda2) (- phi1 phi2)) R)))
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -4.1 \cdot 10^{+210}:\\
\;\;\;\;\left(\sin \left(\frac{\left(\phi_1 + \phi_2\right) + \mathsf{PI}\left(\right)}{2}\right) \cdot \left(-\lambda_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(1 \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\
\end{array}
\end{array}
if lambda1 < -4.10000000000000001e210Initial program 49.9%
Taylor expanded in lambda1 around -inf
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6475.3
Applied rewrites75.3%
Applied rewrites76.1%
if -4.10000000000000001e210 < lambda1 Initial program 63.3%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6483.9
Applied rewrites83.9%
Taylor expanded in phi1 around 0
Applied rewrites73.4%
Taylor expanded in phi2 around 0
Applied rewrites76.3%
Final simplification76.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 (<= lambda1 -2.5e+210) (* (cos (fma -0.5 (+ phi1 phi2) (PI))) (* lambda1 R)) (* (hypot (* 1.0 lambda2) (- phi1 phi2)) R)))
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.5 \cdot 10^{+210}:\\
\;\;\;\;\cos \left(\mathsf{fma}\left(-0.5, \phi_1 + \phi_2, \mathsf{PI}\left(\right)\right)\right) \cdot \left(\lambda_1 \cdot R\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(1 \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\
\end{array}
\end{array}
if lambda1 < -2.4999999999999999e210Initial program 49.9%
Taylor expanded in lambda1 around -inf
mul-1-negN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
lower-*.f64N/A
mul-1-negN/A
cos-neg-revN/A
cos-+PI-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-PI.f6467.4
Applied rewrites67.4%
if -2.4999999999999999e210 < lambda1 Initial program 63.3%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6483.9
Applied rewrites83.9%
Taylor expanded in phi1 around 0
Applied rewrites73.4%
Taylor expanded in phi2 around 0
Applied rewrites76.3%
Final simplification75.5%
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 (<= lambda1 -2.45e+210) (* (* (cos (* -0.5 phi1)) (- lambda1)) R) (* (hypot (* 1.0 lambda2) (- phi1 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 (lambda1 <= -2.45e+210) {
tmp = (cos((-0.5 * phi1)) * -lambda1) * R;
} else {
tmp = hypot((1.0 * lambda2), (phi1 - phi2)) * R;
}
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 (lambda1 <= -2.45e+210) {
tmp = (Math.cos((-0.5 * phi1)) * -lambda1) * R;
} else {
tmp = Math.hypot((1.0 * lambda2), (phi1 - 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 lambda1 <= -2.45e+210: tmp = (math.cos((-0.5 * phi1)) * -lambda1) * R else: tmp = math.hypot((1.0 * lambda2), (phi1 - 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 (lambda1 <= -2.45e+210) tmp = Float64(Float64(cos(Float64(-0.5 * phi1)) * Float64(-lambda1)) * R); else tmp = Float64(hypot(Float64(1.0 * lambda2), Float64(phi1 - 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 (lambda1 <= -2.45e+210)
tmp = (cos((-0.5 * phi1)) * -lambda1) * R;
else
tmp = hypot((1.0 * lambda2), (phi1 - 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[lambda1, -2.45e+210], N[(N[(N[Cos[N[(-0.5 * phi1), $MachinePrecision]], $MachinePrecision] * (-lambda1)), $MachinePrecision] * R), $MachinePrecision], N[(N[Sqrt[N[(1.0 * lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.45 \cdot 10^{+210}:\\
\;\;\;\;\left(\cos \left(-0.5 \cdot \phi_1\right) \cdot \left(-\lambda_1\right)\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{hypot}\left(1 \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R\\
\end{array}
\end{array}
if lambda1 < -2.45000000000000003e210Initial program 49.9%
Taylor expanded in lambda1 around -inf
mul-1-negN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6475.3
Applied rewrites75.3%
Taylor expanded in phi1 around inf
Applied rewrites65.0%
if -2.45000000000000003e210 < lambda1 Initial program 63.3%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6483.9
Applied rewrites83.9%
Taylor expanded in phi1 around 0
Applied rewrites73.4%
Taylor expanded in phi2 around 0
Applied rewrites76.3%
Final simplification75.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 (* (hypot (* 1.0 lambda2) (- phi1 phi2)) R))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return hypot((1.0 * lambda2), (phi1 - phi2)) * R;
}
assert R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2;
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return Math.hypot((1.0 * lambda2), (phi1 - phi2)) * R;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return math.hypot((1.0 * lambda2), (phi1 - phi2)) * R
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(hypot(Float64(1.0 * lambda2), Float64(phi1 - phi2)) * R) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = hypot((1.0 * lambda2), (phi1 - 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[(N[Sqrt[N[(1.0 * lambda2), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision] * R), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\mathsf{hypot}\left(1 \cdot \lambda_2, \phi_1 - \phi_2\right) \cdot R
\end{array}
Initial program 62.2%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6479.6
Applied rewrites79.6%
Taylor expanded in phi1 around 0
Applied rewrites70.1%
Taylor expanded in phi2 around 0
Applied rewrites72.6%
Final simplification72.6%
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 -9.8e-16) (* (- (* (/ phi2 phi1) R) R) phi1) (* (fma R (/ (- phi1) phi2) R) 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 (phi1 <= -9.8e-16) {
tmp = (((phi2 / phi1) * R) - R) * phi1;
} else {
tmp = fma(R, (-phi1 / phi2), R) * 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 (phi1 <= -9.8e-16) tmp = Float64(Float64(Float64(Float64(phi2 / phi1) * R) - R) * phi1); else tmp = Float64(fma(R, Float64(Float64(-phi1) / phi2), R) * 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[phi1, -9.8e-16], N[(N[(N[(N[(phi2 / phi1), $MachinePrecision] * R), $MachinePrecision] - R), $MachinePrecision] * phi1), $MachinePrecision], N[(N[(R * N[((-phi1) / phi2), $MachinePrecision] + R), $MachinePrecision] * phi2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -9.8 \cdot 10^{-16}:\\
\;\;\;\;\left(\frac{\phi_2}{\phi_1} \cdot R - R\right) \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(R, \frac{-\phi_1}{\phi_2}, R\right) \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -9.7999999999999995e-16Initial program 56.8%
Taylor expanded in phi1 around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6454.1
Applied rewrites54.1%
if -9.7999999999999995e-16 < phi1 Initial program 64.2%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6419.2
Applied rewrites19.2%
Final simplification28.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 1.6e-136) (* (- phi1) R) (* (fma R (/ (- phi1) phi2) R) 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.6e-136) {
tmp = -phi1 * R;
} else {
tmp = fma(R, (-phi1 / phi2), R) * 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.6e-136) tmp = Float64(Float64(-phi1) * R); else tmp = Float64(fma(R, Float64(Float64(-phi1) / phi2), R) * 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.6e-136], N[((-phi1) * R), $MachinePrecision], N[(N[(R * N[((-phi1) / phi2), $MachinePrecision] + R), $MachinePrecision] * phi2), $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.6 \cdot 10^{-136}:\\
\;\;\;\;\left(-\phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(R, \frac{-\phi_1}{\phi_2}, R\right) \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 1.59999999999999996e-136Initial program 63.3%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6418.8
Applied rewrites18.8%
if 1.59999999999999996e-136 < phi2 Initial program 60.1%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
mul-1-negN/A
associate-/l*N/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-fma.f64N/A
associate-*r/N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6448.7
Applied rewrites48.7%
Final simplification29.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 -7.5e+133) (* (- phi1) R) (* (- R (/ (* phi1 R) 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 (phi1 <= -7.5e+133) {
tmp = -phi1 * R;
} else {
tmp = (R - ((phi1 * R) / phi2)) * phi2;
}
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 (phi1 <= (-7.5d+133)) then
tmp = -phi1 * r
else
tmp = (r - ((phi1 * r) / phi2)) * phi2
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 (phi1 <= -7.5e+133) {
tmp = -phi1 * R;
} else {
tmp = (R - ((phi1 * R) / phi2)) * phi2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -7.5e+133: tmp = -phi1 * R else: tmp = (R - ((phi1 * R) / 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 (phi1 <= -7.5e+133) tmp = Float64(Float64(-phi1) * R); else tmp = Float64(Float64(R - Float64(Float64(phi1 * R) / phi2)) * phi2); 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 (phi1 <= -7.5e+133)
tmp = -phi1 * R;
else
tmp = (R - ((phi1 * R) / phi2)) * phi2;
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[phi1, -7.5e+133], N[((-phi1) * R), $MachinePrecision], N[(N[(R - N[(N[(phi1 * R), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision] * phi2), $MachinePrecision]]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -7.5 \cdot 10^{+133}:\\
\;\;\;\;\left(-\phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;\left(R - \frac{\phi_1 \cdot R}{\phi_2}\right) \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -7.49999999999999992e133Initial program 53.6%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6478.8
Applied rewrites78.8%
if -7.49999999999999992e133 < phi1 Initial program 63.4%
Taylor expanded in lambda1 around 0
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
lower-hypot.f64N/A
*-commutativeN/A
lower-*.f64N/A
cos-neg-revN/A
lower-cos.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6477.9
Applied rewrites77.9%
Taylor expanded in phi2 around inf
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
unsub-negN/A
lower--.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6421.7
Applied rewrites21.7%
Final simplification28.6%
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 -1e-26) (* (- phi1) R) (* R 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 (phi1 <= -1e-26) {
tmp = -phi1 * R;
} else {
tmp = R * phi2;
}
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 (phi1 <= (-1d-26)) then
tmp = -phi1 * r
else
tmp = r * phi2
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 (phi1 <= -1e-26) {
tmp = -phi1 * R;
} else {
tmp = R * phi2;
}
return tmp;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1e-26: tmp = -phi1 * R else: tmp = R * 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 (phi1 <= -1e-26) tmp = Float64(Float64(-phi1) * R); else tmp = Float64(R * phi2); 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 (phi1 <= -1e-26)
tmp = -phi1 * R;
else
tmp = R * phi2;
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[phi1, -1e-26], N[((-phi1) * R), $MachinePrecision], N[(R * phi2), $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 \cdot 10^{-26}:\\
\;\;\;\;\left(-\phi_1\right) \cdot R\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -1e-26Initial program 57.4%
Taylor expanded in phi1 around -inf
mul-1-negN/A
lower-neg.f6450.7
Applied rewrites50.7%
if -1e-26 < phi1 Initial program 64.0%
Taylor expanded in phi2 around inf
lower-*.f6420.5
Applied rewrites20.5%
Final simplification28.6%
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 (* R phi2))
assert(R < lambda1 && lambda1 < lambda2 && lambda2 < phi1 && phi1 < phi2);
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
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 = r * phi2
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 R * phi2;
}
[R, lambda1, lambda2, phi1, phi2] = sort([R, lambda1, lambda2, phi1, phi2]) def code(R, lambda1, lambda2, phi1, phi2): return R * phi2
R, lambda1, lambda2, phi1, phi2 = sort([R, lambda1, lambda2, phi1, phi2]) function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * phi2) end
R, lambda1, lambda2, phi1, phi2 = num2cell(sort([R, lambda1, lambda2, phi1, phi2])){:}
function tmp = code(R, lambda1, lambda2, phi1, phi2)
tmp = R * phi2;
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[(R * phi2), $MachinePrecision]
\begin{array}{l}
[R, lambda1, lambda2, phi1, phi2] = \mathsf{sort}([R, lambda1, lambda2, phi1, phi2])\\
\\
R \cdot \phi_2
\end{array}
Initial program 62.2%
Taylor expanded in phi2 around inf
lower-*.f6417.9
Applied rewrites17.9%
herbie shell --seed 2024298
(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))))))