
(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 18 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}
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(fma
(cos (* phi1 0.5))
(cos (* 0.5 phi2))
(* (sin (* 0.5 phi2)) (- (sin (* phi1 0.5))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * fma(cos((phi1 * 0.5)), cos((0.5 * phi2)), (sin((0.5 * phi2)) * -sin((phi1 * 0.5))))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * fma(cos(Float64(phi1 * 0.5)), cos(Float64(0.5 * phi2)), Float64(sin(Float64(0.5 * phi2)) * Float64(-sin(Float64(phi1 * 0.5)))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * (-N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{fma}\left(\cos \left(\phi_1 \cdot 0.5\right), \cos \left(0.5 \cdot \phi_2\right), \sin \left(0.5 \cdot \phi_2\right) \cdot \left(-\sin \left(\phi_1 \cdot 0.5\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 55.5%
hypot-define95.7%
Simplified95.7%
expm1-log1p-u95.7%
div-inv95.7%
metadata-eval95.7%
Applied egg-rr95.7%
*-commutative95.7%
distribute-lft-in95.7%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
expm1-log1p-u99.8%
fma-neg99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(+
(* (- lambda1 lambda2) (* (cos (* 0.5 phi2)) (cos (* phi1 0.5))))
(* (* (sin (* 0.5 phi2)) (sin (* phi1 0.5))) (- lambda2 lambda1)))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi2)) * cos((phi1 * 0.5)))) + ((sin((0.5 * phi2)) * sin((phi1 * 0.5))) * (lambda2 - lambda1))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot((((lambda1 - lambda2) * (Math.cos((0.5 * phi2)) * Math.cos((phi1 * 0.5)))) + ((Math.sin((0.5 * phi2)) * Math.sin((phi1 * 0.5))) * (lambda2 - lambda1))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((lambda1 - lambda2) * (math.cos((0.5 * phi2)) * math.cos((phi1 * 0.5)))) + ((math.sin((0.5 * phi2)) * math.sin((phi1 * 0.5))) * (lambda2 - lambda1))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(Float64(lambda1 - lambda2) * Float64(cos(Float64(0.5 * phi2)) * cos(Float64(phi1 * 0.5)))) + Float64(Float64(sin(Float64(0.5 * phi2)) * sin(Float64(phi1 * 0.5))) * Float64(lambda2 - lambda1))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((((lambda1 - lambda2) * (cos((0.5 * phi2)) * cos((phi1 * 0.5)))) + ((sin((0.5 * phi2)) * sin((phi1 * 0.5))) * (lambda2 - lambda1))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right) + \left(\sin \left(0.5 \cdot \phi_2\right) \cdot \sin \left(\phi_1 \cdot 0.5\right)\right) \cdot \left(\lambda_2 - \lambda_1\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 55.5%
hypot-define95.7%
Simplified95.7%
expm1-log1p-u95.7%
div-inv95.7%
metadata-eval95.7%
Applied egg-rr95.7%
*-commutative95.7%
distribute-lft-in95.7%
cos-sum99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
expm1-log1p-u99.8%
sub-neg99.8%
distribute-lft-in99.9%
*-commutative99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -4.8e+226)
(*
R
(hypot
(*
lambda1
(-
(* (cos (* 0.5 phi2)) (cos (* phi1 0.5)))
(* (sin (* 0.5 phi2)) (sin (* phi1 0.5)))))
(- phi1 phi2)))
(*
R
(hypot
(* (- lambda1 lambda2) (expm1 (log1p (cos (* 0.5 (+ phi1 phi2))))))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.8e+226) {
tmp = R * hypot((lambda1 * ((cos((0.5 * phi2)) * cos((phi1 * 0.5))) - (sin((0.5 * phi2)) * sin((phi1 * 0.5))))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * expm1(log1p(cos((0.5 * (phi1 + phi2)))))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4.8e+226) {
tmp = R * Math.hypot((lambda1 * ((Math.cos((0.5 * phi2)) * Math.cos((phi1 * 0.5))) - (Math.sin((0.5 * phi2)) * Math.sin((phi1 * 0.5))))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.expm1(Math.log1p(Math.cos((0.5 * (phi1 + phi2)))))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -4.8e+226: tmp = R * math.hypot((lambda1 * ((math.cos((0.5 * phi2)) * math.cos((phi1 * 0.5))) - (math.sin((0.5 * phi2)) * math.sin((phi1 * 0.5))))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.expm1(math.log1p(math.cos((0.5 * (phi1 + phi2)))))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -4.8e+226) tmp = Float64(R * hypot(Float64(lambda1 * Float64(Float64(cos(Float64(0.5 * phi2)) * cos(Float64(phi1 * 0.5))) - Float64(sin(Float64(0.5 * phi2)) * sin(Float64(phi1 * 0.5))))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * expm1(log1p(cos(Float64(0.5 * Float64(phi1 + phi2)))))), Float64(phi1 - phi2))); end return tmp end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -4.8e+226], N[(R * N[Sqrt[N[(lambda1 * N[(N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(Exp[N[Log[1 + N[Cos[N[(0.5 * N[(phi1 + phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -4.8 \cdot 10^{+226}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \left(\cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right) - \sin \left(0.5 \cdot \phi_2\right) \cdot \sin \left(\phi_1 \cdot 0.5\right)\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\cos \left(0.5 \cdot \left(\phi_1 + \phi_2\right)\right)\right)\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -4.8e226Initial program 31.1%
hypot-define77.3%
Simplified77.3%
expm1-log1p-u77.2%
div-inv77.2%
metadata-eval77.2%
Applied egg-rr77.2%
*-commutative77.2%
distribute-lft-in77.2%
cos-sum99.3%
*-commutative99.3%
*-commutative99.3%
*-commutative99.3%
*-commutative99.3%
Applied egg-rr99.3%
Taylor expanded in lambda1 around inf 84.4%
*-commutative84.4%
*-commutative84.4%
*-commutative84.4%
Simplified84.4%
if -4.8e226 < lambda1 Initial program 57.3%
hypot-define97.1%
Simplified97.1%
expm1-log1p-u97.1%
div-inv97.1%
metadata-eval97.1%
Applied egg-rr97.1%
Final simplification96.2%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* (sin (* 0.5 phi2)) (sin (* phi1 0.5))))
(t_1 (* (cos (* 0.5 phi2)) (cos (* phi1 0.5)))))
(if (<= lambda1 -2.5e+41)
(* R (hypot (* lambda1 (- t_1 t_0)) (- phi1 phi2)))
(* R (hypot (* lambda2 (- t_0 t_1)) (- phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin((0.5 * phi2)) * sin((phi1 * 0.5));
double t_1 = cos((0.5 * phi2)) * cos((phi1 * 0.5));
double tmp;
if (lambda1 <= -2.5e+41) {
tmp = R * hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.sin((0.5 * phi2)) * Math.sin((phi1 * 0.5));
double t_1 = Math.cos((0.5 * phi2)) * Math.cos((phi1 * 0.5));
double tmp;
if (lambda1 <= -2.5e+41) {
tmp = R * Math.hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.sin((0.5 * phi2)) * math.sin((phi1 * 0.5)) t_1 = math.cos((0.5 * phi2)) * math.cos((phi1 * 0.5)) tmp = 0 if lambda1 <= -2.5e+41: tmp = R * math.hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(sin(Float64(0.5 * phi2)) * sin(Float64(phi1 * 0.5))) t_1 = Float64(cos(Float64(0.5 * phi2)) * cos(Float64(phi1 * 0.5))) tmp = 0.0 if (lambda1 <= -2.5e+41) tmp = Float64(R * hypot(Float64(lambda1 * Float64(t_1 - t_0)), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(t_0 - t_1)), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = sin((0.5 * phi2)) * sin((phi1 * 0.5)); t_1 = cos((0.5 * phi2)) * cos((phi1 * 0.5)); tmp = 0.0; if (lambda1 <= -2.5e+41) tmp = R * hypot((lambda1 * (t_1 - t_0)), (phi1 - phi2)); else tmp = R * hypot((lambda2 * (t_0 - t_1)), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[lambda1, -2.5e+41], N[(R * N[Sqrt[N[(lambda1 * N[(t$95$1 - t$95$0), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * N[(t$95$0 - t$95$1), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sin \left(0.5 \cdot \phi_2\right) \cdot \sin \left(\phi_1 \cdot 0.5\right)\\
t_1 := \cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\\
\mathbf{if}\;\lambda_1 \leq -2.5 \cdot 10^{+41}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \left(t\_1 - t\_0\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(t\_0 - t\_1\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -2.50000000000000011e41Initial program 48.3%
hypot-define91.4%
Simplified91.4%
expm1-log1p-u91.3%
div-inv91.3%
metadata-eval91.3%
Applied egg-rr91.3%
*-commutative91.3%
distribute-lft-in91.3%
cos-sum99.7%
*-commutative99.7%
*-commutative99.7%
*-commutative99.7%
*-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in lambda1 around inf 86.8%
*-commutative86.8%
*-commutative86.8%
*-commutative86.8%
Simplified86.8%
if -2.50000000000000011e41 < lambda1 Initial program 57.6%
hypot-define96.9%
Simplified96.9%
expm1-log1p-u96.9%
div-inv96.9%
metadata-eval96.9%
Applied egg-rr96.9%
*-commutative96.9%
distribute-lft-in96.9%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in lambda1 around 0 85.5%
associate-*r*85.5%
neg-mul-185.5%
*-commutative85.5%
*-commutative85.5%
Simplified85.5%
Final simplification85.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 4.7e-6) (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.7e-6) {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.7e-6) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 4.7e-6: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 4.7e-6) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi2))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 4.7e-6) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 4.7e-6], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4.7 \cdot 10^{-6}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 4.69999999999999989e-6Initial program 58.0%
hypot-define97.9%
Simplified97.9%
Taylor expanded in phi2 around 0 95.3%
if 4.69999999999999989e-6 < phi2 Initial program 48.6%
hypot-define89.5%
Simplified89.5%
Taylor expanded in phi1 around 0 89.4%
Final simplification93.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* phi1 0.5))))
(if (<= lambda1 -9.2e+39)
(* R (hypot (* lambda1 t_0) (- phi1 phi2)))
(* R (hypot (* lambda2 (- t_0)) (- phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((phi1 * 0.5));
double tmp;
if (lambda1 <= -9.2e+39) {
tmp = R * hypot((lambda1 * t_0), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * -t_0), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((phi1 * 0.5));
double tmp;
if (lambda1 <= -9.2e+39) {
tmp = R * Math.hypot((lambda1 * t_0), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * -t_0), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((phi1 * 0.5)) tmp = 0 if lambda1 <= -9.2e+39: tmp = R * math.hypot((lambda1 * t_0), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * -t_0), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(phi1 * 0.5)) tmp = 0.0 if (lambda1 <= -9.2e+39) tmp = Float64(R * hypot(Float64(lambda1 * t_0), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(-t_0)), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos((phi1 * 0.5)); tmp = 0.0; if (lambda1 <= -9.2e+39) tmp = R * hypot((lambda1 * t_0), (phi1 - phi2)); else tmp = R * hypot((lambda2 * -t_0), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda1, -9.2e+39], N[(R * N[Sqrt[N[(lambda1 * t$95$0), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * (-t$95$0)), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(\phi_1 \cdot 0.5\right)\\
\mathbf{if}\;\lambda_1 \leq -9.2 \cdot 10^{+39}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot t\_0, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(-t\_0\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -9.20000000000000047e39Initial program 48.3%
hypot-define91.4%
Simplified91.4%
Taylor expanded in phi2 around 0 85.4%
Taylor expanded in lambda1 around inf 78.6%
*-commutative78.6%
Simplified78.6%
if -9.20000000000000047e39 < lambda1 Initial program 57.6%
hypot-define96.9%
Simplified96.9%
Taylor expanded in phi2 around 0 91.0%
Taylor expanded in lambda1 around 0 80.9%
mul-1-neg80.9%
*-commutative80.9%
*-commutative80.9%
distribute-rgt-neg-out80.9%
*-commutative80.9%
Simplified80.9%
Final simplification80.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -6.2e-5) (* R (hypot (* lambda1 (cos (* phi1 0.5))) (- phi1 phi2))) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -6.2e-5) {
tmp = R * hypot((lambda1 * cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -6.2e-5) {
tmp = R * Math.hypot((lambda1 * Math.cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -6.2e-5: tmp = R * math.hypot((lambda1 * math.cos((phi1 * 0.5))), (phi1 - phi2)) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -6.2e-5) tmp = Float64(R * hypot(Float64(lambda1 * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -6.2e-5) tmp = R * hypot((lambda1 * cos((phi1 * 0.5))), (phi1 - phi2)); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -6.2e-5], N[(R * N[Sqrt[N[(lambda1 * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -6.2 \cdot 10^{-5}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi1 < -6.20000000000000027e-5Initial program 52.7%
hypot-define89.4%
Simplified89.4%
Taylor expanded in phi2 around 0 89.3%
Taylor expanded in lambda1 around inf 80.5%
*-commutative80.5%
Simplified80.5%
if -6.20000000000000027e-5 < phi1 Initial program 56.6%
hypot-define98.2%
Simplified98.2%
Taylor expanded in phi2 around 0 89.9%
Taylor expanded in phi1 around 0 46.2%
unpow246.2%
unpow246.2%
hypot-define72.7%
Simplified72.7%
Final simplification75.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 55.5%
hypot-define95.7%
Simplified95.7%
Final simplification95.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 55.5%
hypot-define95.7%
Simplified95.7%
Taylor expanded in phi2 around 0 89.8%
Final simplification89.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.12e+30) (* R (hypot phi1 (- lambda1 lambda2))) (* phi2 (- R (* R (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.12e+30) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = phi2 * (R - (R * (phi1 / phi2)));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.12e+30) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = phi2 * (R - (R * (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.12e+30: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = phi2 * (R - (R * (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.12e+30) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(phi2 * Float64(R - Float64(R * Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.12e+30) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = phi2 * (R - (R * (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.12e+30], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.12 \cdot 10^{+30}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - R \cdot \frac{\phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if phi2 < 1.12e30Initial program 59.3%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi1 around 0 91.4%
Taylor expanded in phi2 around 0 48.4%
unpow248.4%
unpow248.4%
hypot-define73.2%
Simplified73.2%
if 1.12e30 < phi2 Initial program 43.7%
hypot-define88.5%
Simplified88.5%
Taylor expanded in phi1 around 0 88.4%
Taylor expanded in phi2 around inf 51.8%
mul-1-neg51.8%
unsub-neg51.8%
associate-/l*53.4%
Simplified53.4%
Final simplification68.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 4.45e+36) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot phi2 (- lambda1 lambda2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.45e+36) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.45e+36) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot(phi2, (lambda1 - lambda2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 4.45e+36: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot(phi2, (lambda1 - lambda2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 4.45e+36) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(phi2, Float64(lambda1 - lambda2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 4.45e+36) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * hypot(phi2, (lambda1 - lambda2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 4.45e+36], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4.45 \cdot 10^{+36}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \lambda_1 - \lambda_2\right)\\
\end{array}
\end{array}
if phi2 < 4.44999999999999999e36Initial program 59.0%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi1 around 0 91.5%
Taylor expanded in phi2 around 0 48.2%
unpow248.2%
unpow248.2%
hypot-define73.3%
Simplified73.3%
if 4.44999999999999999e36 < phi2 Initial program 44.3%
hypot-define88.3%
Simplified88.3%
Taylor expanded in phi2 around 0 72.5%
Taylor expanded in phi1 around 0 34.3%
unpow234.3%
unpow234.3%
hypot-define58.9%
Simplified58.9%
Final simplification69.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= lambda2 1.7e+15)
(and (not (<= lambda2 1.45e+26)) (<= lambda2 4.5e+199)))
(* R (* phi1 (+ (/ phi2 phi1) -1.0)))
(* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((lambda2 <= 1.7e+15) || (!(lambda2 <= 1.45e+26) && (lambda2 <= 4.5e+199))) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else {
tmp = R * lambda2;
}
return tmp;
}
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 ((lambda2 <= 1.7d+15) .or. (.not. (lambda2 <= 1.45d+26)) .and. (lambda2 <= 4.5d+199)) then
tmp = r * (phi1 * ((phi2 / phi1) + (-1.0d0)))
else
tmp = r * lambda2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((lambda2 <= 1.7e+15) || (!(lambda2 <= 1.45e+26) && (lambda2 <= 4.5e+199))) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (lambda2 <= 1.7e+15) or (not (lambda2 <= 1.45e+26) and (lambda2 <= 4.5e+199)): tmp = R * (phi1 * ((phi2 / phi1) + -1.0)) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((lambda2 <= 1.7e+15) || (!(lambda2 <= 1.45e+26) && (lambda2 <= 4.5e+199))) tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0))); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if ((lambda2 <= 1.7e+15) || (~((lambda2 <= 1.45e+26)) && (lambda2 <= 4.5e+199))) tmp = R * (phi1 * ((phi2 / phi1) + -1.0)); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[lambda2, 1.7e+15], And[N[Not[LessEqual[lambda2, 1.45e+26]], $MachinePrecision], LessEqual[lambda2, 4.5e+199]]], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.7 \cdot 10^{+15} \lor \neg \left(\lambda_2 \leq 1.45 \cdot 10^{+26}\right) \land \lambda_2 \leq 4.5 \cdot 10^{+199}:\\
\;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 1.7e15 or 1.45e26 < lambda2 < 4.4999999999999997e199Initial program 57.6%
Taylor expanded in phi1 around -inf 30.4%
mul-1-neg30.4%
distribute-rgt-neg-in30.4%
mul-1-neg30.4%
unsub-neg30.4%
Simplified30.4%
if 1.7e15 < lambda2 < 1.45e26 or 4.4999999999999997e199 < lambda2 Initial program 39.7%
Taylor expanded in lambda2 around inf 57.4%
Taylor expanded in phi2 around 0 55.2%
*-commutative55.2%
*-commutative55.2%
Simplified55.2%
Taylor expanded in phi1 around 0 56.6%
Final simplification33.5%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (or (<= lambda2 1.7e+15)
(and (not (<= lambda2 1.45e+26)) (<= lambda2 9e+199)))
(* phi1 (- (* R (/ phi2 phi1)) R))
(* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((lambda2 <= 1.7e+15) || (!(lambda2 <= 1.45e+26) && (lambda2 <= 9e+199))) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else {
tmp = R * lambda2;
}
return tmp;
}
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 ((lambda2 <= 1.7d+15) .or. (.not. (lambda2 <= 1.45d+26)) .and. (lambda2 <= 9d+199)) then
tmp = phi1 * ((r * (phi2 / phi1)) - r)
else
tmp = r * lambda2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if ((lambda2 <= 1.7e+15) || (!(lambda2 <= 1.45e+26) && (lambda2 <= 9e+199))) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if (lambda2 <= 1.7e+15) or (not (lambda2 <= 1.45e+26) and (lambda2 <= 9e+199)): tmp = phi1 * ((R * (phi2 / phi1)) - R) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if ((lambda2 <= 1.7e+15) || (!(lambda2 <= 1.45e+26) && (lambda2 <= 9e+199))) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if ((lambda2 <= 1.7e+15) || (~((lambda2 <= 1.45e+26)) && (lambda2 <= 9e+199))) tmp = phi1 * ((R * (phi2 / phi1)) - R); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[Or[LessEqual[lambda2, 1.7e+15], And[N[Not[LessEqual[lambda2, 1.45e+26]], $MachinePrecision], LessEqual[lambda2, 9e+199]]], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.7 \cdot 10^{+15} \lor \neg \left(\lambda_2 \leq 1.45 \cdot 10^{+26}\right) \land \lambda_2 \leq 9 \cdot 10^{+199}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 1.7e15 or 1.45e26 < lambda2 < 8.9999999999999994e199Initial program 57.6%
hypot-define95.7%
Simplified95.7%
Taylor expanded in phi1 around 0 91.3%
Taylor expanded in phi1 around -inf 31.7%
mul-1-neg31.7%
distribute-rgt-neg-in31.7%
mul-1-neg31.7%
unsub-neg31.7%
associate-/l*32.1%
Simplified32.1%
if 1.7e15 < lambda2 < 1.45e26 or 8.9999999999999994e199 < lambda2 Initial program 39.7%
Taylor expanded in lambda2 around inf 57.4%
Taylor expanded in phi2 around 0 55.2%
*-commutative55.2%
*-commutative55.2%
Simplified55.2%
Taylor expanded in phi1 around 0 56.6%
Final simplification35.0%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 1.7e+15)
(* phi1 (- (* phi2 (/ R phi1)) R))
(if (or (<= lambda2 1.45e+26) (not (<= lambda2 1.5e+201)))
(* R lambda2)
(* phi1 (- (* R (/ phi2 phi1)) R)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.7e+15) {
tmp = phi1 * ((phi2 * (R / phi1)) - R);
} else if ((lambda2 <= 1.45e+26) || !(lambda2 <= 1.5e+201)) {
tmp = R * lambda2;
} else {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
}
return tmp;
}
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 (lambda2 <= 1.7d+15) then
tmp = phi1 * ((phi2 * (r / phi1)) - r)
else if ((lambda2 <= 1.45d+26) .or. (.not. (lambda2 <= 1.5d+201))) then
tmp = r * lambda2
else
tmp = phi1 * ((r * (phi2 / phi1)) - r)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.7e+15) {
tmp = phi1 * ((phi2 * (R / phi1)) - R);
} else if ((lambda2 <= 1.45e+26) || !(lambda2 <= 1.5e+201)) {
tmp = R * lambda2;
} else {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1.7e+15: tmp = phi1 * ((phi2 * (R / phi1)) - R) elif (lambda2 <= 1.45e+26) or not (lambda2 <= 1.5e+201): tmp = R * lambda2 else: tmp = phi1 * ((R * (phi2 / phi1)) - R) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.7e+15) tmp = Float64(phi1 * Float64(Float64(phi2 * Float64(R / phi1)) - R)); elseif ((lambda2 <= 1.45e+26) || !(lambda2 <= 1.5e+201)) tmp = Float64(R * lambda2); else tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 1.7e+15) tmp = phi1 * ((phi2 * (R / phi1)) - R); elseif ((lambda2 <= 1.45e+26) || ~((lambda2 <= 1.5e+201))) tmp = R * lambda2; else tmp = phi1 * ((R * (phi2 / phi1)) - R); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.7e+15], N[(phi1 * N[(N[(phi2 * N[(R / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[lambda2, 1.45e+26], N[Not[LessEqual[lambda2, 1.5e+201]], $MachinePrecision]], N[(R * lambda2), $MachinePrecision], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.7 \cdot 10^{+15}:\\
\;\;\;\;\phi_1 \cdot \left(\phi_2 \cdot \frac{R}{\phi_1} - R\right)\\
\mathbf{elif}\;\lambda_2 \leq 1.45 \cdot 10^{+26} \lor \neg \left(\lambda_2 \leq 1.5 \cdot 10^{+201}\right):\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\end{array}
\end{array}
if lambda2 < 1.7e15Initial program 58.0%
hypot-define96.0%
Simplified96.0%
Taylor expanded in phi1 around -inf 32.9%
mul-1-neg32.9%
distribute-rgt-neg-in32.9%
mul-1-neg32.9%
unsub-neg32.9%
*-commutative32.9%
associate-/l*33.4%
Simplified33.4%
if 1.7e15 < lambda2 < 1.45e26 or 1.50000000000000012e201 < lambda2 Initial program 39.7%
Taylor expanded in lambda2 around inf 57.4%
Taylor expanded in phi2 around 0 55.2%
*-commutative55.2%
*-commutative55.2%
Simplified55.2%
Taylor expanded in phi1 around 0 56.6%
if 1.45e26 < lambda2 < 1.50000000000000012e201Initial program 55.2%
hypot-define94.5%
Simplified94.5%
Taylor expanded in phi1 around 0 90.2%
Taylor expanded in phi1 around -inf 25.6%
mul-1-neg25.6%
distribute-rgt-neg-in25.6%
mul-1-neg25.6%
unsub-neg25.6%
associate-/l*28.3%
Simplified28.3%
Final simplification35.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -6.4e-298) (* R (- phi1)) (if (<= phi2 1.25e-41) (* R lambda2) (* R (* phi2 (- 1.0 (/ phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -6.4e-298) {
tmp = R * -phi1;
} else if (phi2 <= 1.25e-41) {
tmp = R * lambda2;
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
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.4d-298)) then
tmp = r * -phi1
else if (phi2 <= 1.25d-41) then
tmp = r * lambda2
else
tmp = r * (phi2 * (1.0d0 - (phi1 / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -6.4e-298) {
tmp = R * -phi1;
} else if (phi2 <= 1.25e-41) {
tmp = R * lambda2;
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -6.4e-298: tmp = R * -phi1 elif phi2 <= 1.25e-41: tmp = R * lambda2 else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -6.4e-298) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 1.25e-41) tmp = Float64(R * lambda2); else tmp = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= -6.4e-298) tmp = R * -phi1; elseif (phi2 <= 1.25e-41) tmp = R * lambda2; else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -6.4e-298], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 1.25e-41], N[(R * lambda2), $MachinePrecision], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -6.4 \cdot 10^{-298}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 1.25 \cdot 10^{-41}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi2 < -6.39999999999999995e-298Initial program 53.9%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi1 around -inf 24.3%
mul-1-neg24.3%
*-commutative24.3%
distribute-rgt-neg-in24.3%
Simplified24.3%
if -6.39999999999999995e-298 < phi2 < 1.2499999999999999e-41Initial program 70.2%
Taylor expanded in lambda2 around inf 24.2%
Taylor expanded in phi2 around 0 24.2%
*-commutative24.2%
*-commutative24.2%
Simplified24.2%
Taylor expanded in phi1 around 0 18.6%
if 1.2499999999999999e-41 < phi2 Initial program 49.7%
Taylor expanded in phi2 around inf 50.2%
mul-1-neg50.2%
unsub-neg50.2%
Simplified50.2%
Final simplification31.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -9.4e-299) (* R (- phi1)) (if (<= phi2 1.6e+24) (* R lambda2) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -9.4e-299) {
tmp = R * -phi1;
} else if (phi2 <= 1.6e+24) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
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 <= (-9.4d-299)) then
tmp = r * -phi1
else if (phi2 <= 1.6d+24) then
tmp = r * lambda2
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -9.4e-299) {
tmp = R * -phi1;
} else if (phi2 <= 1.6e+24) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -9.4e-299: tmp = R * -phi1 elif phi2 <= 1.6e+24: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -9.4e-299) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 1.6e+24) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= -9.4e-299) tmp = R * -phi1; elseif (phi2 <= 1.6e+24) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -9.4e-299], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 1.6e+24], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -9.4 \cdot 10^{-299}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 1.6 \cdot 10^{+24}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -9.3999999999999995e-299Initial program 53.9%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi1 around -inf 24.3%
mul-1-neg24.3%
*-commutative24.3%
distribute-rgt-neg-in24.3%
Simplified24.3%
if -9.3999999999999995e-299 < phi2 < 1.5999999999999999e24Initial program 70.8%
Taylor expanded in lambda2 around inf 22.7%
Taylor expanded in phi2 around 0 22.7%
*-commutative22.7%
*-commutative22.7%
Simplified22.7%
Taylor expanded in phi1 around 0 18.4%
if 1.5999999999999999e24 < phi2 Initial program 44.6%
hypot-define88.7%
Simplified88.7%
Taylor expanded in phi2 around inf 49.0%
*-commutative49.0%
Simplified49.0%
Final simplification29.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 6.2e+21) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 6.2e+21) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
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.2d+21) then
tmp = r * lambda2
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 6.2e+21) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 6.2e+21: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 6.2e+21) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 6.2e+21) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 6.2e+21], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 6.2 \cdot 10^{+21}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 6.2e21Initial program 59.1%
Taylor expanded in lambda2 around inf 21.2%
Taylor expanded in phi2 around 0 21.7%
*-commutative21.7%
*-commutative21.7%
Simplified21.7%
Taylor expanded in phi1 around 0 15.8%
if 6.2e21 < phi2 Initial program 44.6%
hypot-define88.7%
Simplified88.7%
Taylor expanded in phi2 around inf 49.0%
*-commutative49.0%
Simplified49.0%
Final simplification24.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
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 * lambda2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_2
\end{array}
Initial program 55.5%
Taylor expanded in lambda2 around inf 20.2%
Taylor expanded in phi2 around 0 18.4%
*-commutative18.4%
*-commutative18.4%
Simplified18.4%
Taylor expanded in phi1 around 0 13.7%
Final simplification13.7%
herbie shell --seed 2024074
(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))))))