
(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 14 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)
(expm1
(log1p
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(* (sin (* 0.5 phi1)) (sin (* phi2 0.5)))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * expm1(log1p(((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 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.expm1(Math.log1p(((Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))) - (Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5))))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.expm1(math.log1p(((math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) - (math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5))))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * expm1(log1p(Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) - Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5))))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(Exp[N[Log[1 + N[(N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]] - 1), $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{expm1}\left(\mathsf{log1p}\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right) - \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 65.9%
hypot-def96.2%
Simplified96.2%
expm1-log1p-u96.1%
div-inv96.1%
metadata-eval96.1%
Applied egg-rr96.1%
*-commutative96.1%
+-commutative96.1%
distribute-rgt-in96.1%
cos-sum99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(+
1.0
(+
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(* (sin (* 0.5 phi1)) (sin (* phi2 0.5))))
-1.0)))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * (1.0 + (((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5)))) + -1.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * (1.0 + (((Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))) - (Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5)))) + -1.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * (1.0 + (((math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) - (math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5)))) + -1.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * Float64(1.0 + Float64(Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) - Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5)))) + -1.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * (1.0 + (((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5)))) + -1.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(1.0 + N[(N[(N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.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 \left(1 + \left(\left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right) - \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right)\right) + -1\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 65.9%
hypot-def96.2%
Simplified96.2%
expm1-log1p-u96.1%
div-inv96.1%
metadata-eval96.1%
Applied egg-rr96.1%
*-commutative96.1%
+-commutative96.1%
distribute-rgt-in96.1%
cos-sum99.9%
Applied egg-rr99.9%
expm1-udef99.8%
log1p-expm1-u99.8%
log1p-udef99.8%
add-exp-log99.8%
expm1-log1p-u99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
associate--l+99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
*-commutative99.8%
Simplified99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -4e+196)
(*
R
(hypot
(*
lambda1
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(* (sin (* 0.5 phi1)) (sin (* phi2 0.5)))))
(- phi1 phi2)))
(*
R
(hypot
(* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0)))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4e+196) {
tmp = R * hypot((lambda1 * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -4e+196) {
tmp = R * Math.hypot((lambda1 * ((Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))) - (Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5))))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -4e+196: tmp = R * math.hypot((lambda1 * ((math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) - (math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5))))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -4e+196) tmp = Float64(R * hypot(Float64(lambda1 * Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) - Float64(sin(Float64(0.5 * phi1)) * sin(Float64(phi2 * 0.5))))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -4e+196) tmp = R * hypot((lambda1 * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -4e+196], N[(R * N[Sqrt[N[(lambda1 * N[(N[(N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(phi2 * 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[Cos[N[(N[(phi2 + phi1), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -4 \cdot 10^{+196}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \left(\cos \left(0.5 \cdot \phi_1\right) \cdot \cos \left(\phi_2 \cdot 0.5\right) - \sin \left(0.5 \cdot \phi_1\right) \cdot \sin \left(\phi_2 \cdot 0.5\right)\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -3.9999999999999998e196Initial program 62.7%
hypot-def93.3%
Simplified93.3%
expm1-log1p-u93.2%
div-inv93.2%
metadata-eval93.2%
Applied egg-rr93.2%
*-commutative93.2%
+-commutative93.2%
distribute-rgt-in93.2%
cos-sum99.7%
Applied egg-rr99.7%
Taylor expanded in lambda1 around inf 95.8%
if -3.9999999999999998e196 < lambda1 Initial program 66.2%
hypot-def96.5%
Simplified96.5%
Final simplification96.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -2.25e-58) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))) (* R (hypot phi2 (* (- lambda1 lambda2) (cos (* phi2 0.5)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.25e-58) {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.25e-58) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((phi2 * 0.5))));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -2.25e-58: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2)) else: tmp = R * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((phi2 * 0.5)))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -2.25e-58) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(phi2, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -2.25e-58) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); else tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5)))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -2.25e-58], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -2.25 \cdot 10^{-58}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if phi1 < -2.2500000000000001e-58Initial program 57.7%
hypot-def91.6%
Simplified91.6%
Taylor expanded in phi2 around 0 90.1%
if -2.2500000000000001e-58 < phi1 Initial program 69.5%
hypot-def98.2%
Simplified98.2%
Taylor expanded in phi1 around 0 58.3%
*-commutative58.3%
unpow258.3%
unpow258.3%
unpow258.3%
unswap-sqr58.3%
hypot-def79.8%
Simplified79.8%
Final simplification82.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 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(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi2 + phi1), $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_2 + \phi_1}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 65.9%
hypot-def96.2%
Simplified96.2%
Final simplification96.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 3.3e-9) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.3e-9) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 3.3e-9) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 3.3e-9: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 3.3e-9) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 3.3e-9) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 3.3e-9], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 3.3 \cdot 10^{-9}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 3.30000000000000018e-9Initial program 68.9%
hypot-def96.5%
Simplified96.5%
Taylor expanded in phi2 around 0 62.0%
*-commutative62.0%
+-commutative62.0%
unpow262.0%
unpow262.0%
unpow262.0%
unswap-sqr62.0%
hypot-def81.4%
Simplified81.4%
if 3.30000000000000018e-9 < phi2 Initial program 57.2%
hypot-def95.2%
Simplified95.2%
Taylor expanded in phi1 around -inf 63.8%
*-commutative63.8%
associate-*r*63.8%
distribute-rgt-out63.8%
mul-1-neg63.8%
Simplified63.8%
Final simplification76.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 8.5e-79) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot phi2 (* (- lambda1 lambda2) (cos (* phi2 0.5)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 8.5e-79) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 8.5e-79) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((phi2 * 0.5))));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 8.5e-79: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((phi2 * 0.5)))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 8.5e-79) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(phi2, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 8.5e-79) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5)))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 8.5e-79], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[phi2 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 8.5 \cdot 10^{-79}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_2, \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if phi2 < 8.50000000000000029e-79Initial program 68.4%
hypot-def96.3%
Simplified96.3%
Taylor expanded in phi2 around 0 62.1%
*-commutative62.1%
+-commutative62.1%
unpow262.1%
unpow262.1%
unpow262.1%
unswap-sqr62.1%
hypot-def81.2%
Simplified81.2%
if 8.50000000000000029e-79 < phi2 Initial program 60.2%
hypot-def95.9%
Simplified95.9%
Taylor expanded in phi1 around 0 55.3%
*-commutative55.3%
unpow255.3%
unpow255.3%
unpow255.3%
unswap-sqr55.3%
hypot-def80.5%
Simplified80.5%
Final simplification81.0%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -23000000.0)
(* R (- phi2 phi1))
(if (<= phi1 -1.1e-284)
(+
(* R (- lambda2 lambda1))
(* -0.25 (* phi1 (* R (* phi2 (- lambda2 lambda1))))))
(* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -23000000.0) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= -1.1e-284) {
tmp = (R * (lambda2 - lambda1)) + (-0.25 * (phi1 * (R * (phi2 * (lambda2 - lambda1)))));
} 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 (phi1 <= (-23000000.0d0)) then
tmp = r * (phi2 - phi1)
else if (phi1 <= (-1.1d-284)) then
tmp = (r * (lambda2 - lambda1)) + ((-0.25d0) * (phi1 * (r * (phi2 * (lambda2 - lambda1)))))
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 (phi1 <= -23000000.0) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= -1.1e-284) {
tmp = (R * (lambda2 - lambda1)) + (-0.25 * (phi1 * (R * (phi2 * (lambda2 - lambda1)))));
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -23000000.0: tmp = R * (phi2 - phi1) elif phi1 <= -1.1e-284: tmp = (R * (lambda2 - lambda1)) + (-0.25 * (phi1 * (R * (phi2 * (lambda2 - lambda1))))) else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -23000000.0) tmp = Float64(R * Float64(phi2 - phi1)); elseif (phi1 <= -1.1e-284) tmp = Float64(Float64(R * Float64(lambda2 - lambda1)) + Float64(-0.25 * Float64(phi1 * Float64(R * Float64(phi2 * Float64(lambda2 - lambda1)))))); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -23000000.0) tmp = R * (phi2 - phi1); elseif (phi1 <= -1.1e-284) tmp = (R * (lambda2 - lambda1)) + (-0.25 * (phi1 * (R * (phi2 * (lambda2 - lambda1))))); else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -23000000.0], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, -1.1e-284], N[(N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision] + N[(-0.25 * N[(phi1 * N[(R * N[(phi2 * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -23000000:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -1.1 \cdot 10^{-284}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right) + -0.25 \cdot \left(\phi_1 \cdot \left(R \cdot \left(\phi_2 \cdot \left(\lambda_2 - \lambda_1\right)\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -2.3e7Initial program 53.7%
hypot-def89.2%
Simplified89.2%
Taylor expanded in phi1 around -inf 61.2%
*-commutative61.2%
associate-*r*61.2%
distribute-rgt-out63.0%
mul-1-neg63.0%
Simplified63.0%
if -2.3e7 < phi1 < -1.1e-284Initial program 72.7%
hypot-def99.4%
Simplified99.4%
Taylor expanded in lambda1 around -inf 39.8%
+-commutative39.8%
mul-1-neg39.8%
unsub-neg39.8%
associate-*r*39.8%
+-commutative39.8%
*-commutative39.8%
*-commutative39.8%
associate-*r*39.8%
*-commutative39.8%
*-commutative39.8%
+-commutative39.8%
Simplified39.8%
Taylor expanded in phi2 around 0 32.1%
associate-*r*32.1%
*-commutative32.1%
associate-*r*32.1%
+-commutative32.1%
*-commutative32.1%
associate--l+32.1%
Simplified32.2%
Taylor expanded in phi1 around 0 31.7%
if -1.1e-284 < phi1 Initial program 67.7%
hypot-def97.6%
Simplified97.6%
Taylor expanded in phi2 around inf 19.8%
*-commutative19.8%
Simplified19.8%
Final simplification32.5%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -8500000.0)
(* R (- phi1))
(if (<= phi1 -2.45e-185)
(* R lambda2)
(if (<= phi1 -7.8e-272) (* R (- lambda1)) (* R phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -8500000.0) {
tmp = R * -phi1;
} else if (phi1 <= -2.45e-185) {
tmp = R * lambda2;
} else if (phi1 <= -7.8e-272) {
tmp = R * -lambda1;
} 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 (phi1 <= (-8500000.0d0)) then
tmp = r * -phi1
else if (phi1 <= (-2.45d-185)) then
tmp = r * lambda2
else if (phi1 <= (-7.8d-272)) then
tmp = r * -lambda1
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 (phi1 <= -8500000.0) {
tmp = R * -phi1;
} else if (phi1 <= -2.45e-185) {
tmp = R * lambda2;
} else if (phi1 <= -7.8e-272) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -8500000.0: tmp = R * -phi1 elif phi1 <= -2.45e-185: tmp = R * lambda2 elif phi1 <= -7.8e-272: tmp = R * -lambda1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -8500000.0) tmp = Float64(R * Float64(-phi1)); elseif (phi1 <= -2.45e-185) tmp = Float64(R * lambda2); elseif (phi1 <= -7.8e-272) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -8500000.0) tmp = R * -phi1; elseif (phi1 <= -2.45e-185) tmp = R * lambda2; elseif (phi1 <= -7.8e-272) tmp = R * -lambda1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -8500000.0], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi1, -2.45e-185], N[(R * lambda2), $MachinePrecision], If[LessEqual[phi1, -7.8e-272], N[(R * (-lambda1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -8500000:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq -2.45 \cdot 10^{-185}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{elif}\;\phi_1 \leq -7.8 \cdot 10^{-272}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -8.5e6Initial program 54.4%
hypot-def89.3%
Simplified89.3%
Taylor expanded in phi1 around -inf 57.8%
associate-*r*57.8%
mul-1-neg57.8%
Simplified57.8%
if -8.5e6 < phi1 < -2.4500000000000001e-185Initial program 72.5%
hypot-def99.2%
Simplified99.2%
Taylor expanded in lambda1 around -inf 39.2%
+-commutative39.2%
mul-1-neg39.2%
unsub-neg39.2%
associate-*r*39.2%
+-commutative39.2%
*-commutative39.2%
*-commutative39.2%
associate-*r*39.2%
*-commutative39.2%
*-commutative39.2%
+-commutative39.2%
Simplified39.2%
Taylor expanded in phi1 around 0 37.1%
*-commutative37.1%
associate-*r*37.1%
distribute-lft-out--37.2%
*-commutative37.2%
Simplified37.2%
Taylor expanded in phi2 around 0 34.7%
Taylor expanded in lambda2 around inf 17.5%
if -2.4500000000000001e-185 < phi1 < -7.7999999999999994e-272Initial program 72.4%
hypot-def100.0%
Simplified100.0%
Taylor expanded in lambda1 around -inf 52.1%
+-commutative52.1%
mul-1-neg52.1%
unsub-neg52.1%
associate-*r*52.1%
+-commutative52.1%
*-commutative52.1%
*-commutative52.1%
associate-*r*52.1%
*-commutative52.1%
*-commutative52.1%
+-commutative52.1%
Simplified52.1%
Taylor expanded in phi1 around 0 52.1%
*-commutative52.1%
associate-*r*52.1%
distribute-lft-out--52.1%
*-commutative52.1%
Simplified52.1%
Taylor expanded in phi2 around 0 52.6%
Taylor expanded in lambda2 around 0 31.9%
mul-1-neg31.9%
*-commutative31.9%
distribute-rgt-neg-in31.9%
Simplified31.9%
if -7.7999999999999994e-272 < phi1 Initial program 67.7%
hypot-def97.6%
Simplified97.6%
Taylor expanded in phi2 around inf 19.4%
*-commutative19.4%
Simplified19.4%
Final simplification28.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -2.8e+85) (* R (- phi1)) (if (<= phi1 6.6e-201) (* R (- lambda2 lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -2.8e+85) {
tmp = R * -phi1;
} else if (phi1 <= 6.6e-201) {
tmp = R * (lambda2 - lambda1);
} 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 (phi1 <= (-2.8d+85)) then
tmp = r * -phi1
else if (phi1 <= 6.6d-201) then
tmp = r * (lambda2 - lambda1)
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 (phi1 <= -2.8e+85) {
tmp = R * -phi1;
} else if (phi1 <= 6.6e-201) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -2.8e+85: tmp = R * -phi1 elif phi1 <= 6.6e-201: tmp = R * (lambda2 - lambda1) else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -2.8e+85) tmp = Float64(R * Float64(-phi1)); elseif (phi1 <= 6.6e-201) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -2.8e+85) tmp = R * -phi1; elseif (phi1 <= 6.6e-201) tmp = R * (lambda2 - lambda1); else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -2.8e+85], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi1, 6.6e-201], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -2.8 \cdot 10^{+85}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq 6.6 \cdot 10^{-201}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -2.7999999999999999e85Initial program 51.5%
hypot-def92.4%
Simplified92.4%
Taylor expanded in phi1 around -inf 72.5%
associate-*r*72.5%
mul-1-neg72.5%
Simplified72.5%
if -2.7999999999999999e85 < phi1 < 6.6000000000000007e-201Initial program 66.1%
hypot-def96.9%
Simplified96.9%
Taylor expanded in lambda1 around -inf 37.1%
+-commutative37.1%
mul-1-neg37.1%
unsub-neg37.1%
associate-*r*37.1%
+-commutative37.1%
*-commutative37.1%
*-commutative37.1%
associate-*r*37.1%
*-commutative37.1%
*-commutative37.1%
+-commutative37.1%
Simplified37.1%
Taylor expanded in phi1 around 0 33.9%
*-commutative33.9%
associate-*r*33.9%
distribute-lft-out--34.8%
*-commutative34.8%
Simplified34.8%
Taylor expanded in phi2 around 0 30.2%
if 6.6000000000000007e-201 < phi1 Initial program 71.3%
hypot-def96.9%
Simplified96.9%
Taylor expanded in phi2 around inf 19.1%
*-commutative19.1%
Simplified19.1%
Final simplification32.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -49000000.0) (* R (- phi2 phi1)) (if (<= phi1 6.5e-206) (* R (- lambda2 lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -49000000.0) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= 6.5e-206) {
tmp = R * (lambda2 - lambda1);
} 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 (phi1 <= (-49000000.0d0)) then
tmp = r * (phi2 - phi1)
else if (phi1 <= 6.5d-206) then
tmp = r * (lambda2 - lambda1)
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 (phi1 <= -49000000.0) {
tmp = R * (phi2 - phi1);
} else if (phi1 <= 6.5e-206) {
tmp = R * (lambda2 - lambda1);
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -49000000.0: tmp = R * (phi2 - phi1) elif phi1 <= 6.5e-206: tmp = R * (lambda2 - lambda1) else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -49000000.0) tmp = Float64(R * Float64(phi2 - phi1)); elseif (phi1 <= 6.5e-206) tmp = Float64(R * Float64(lambda2 - lambda1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -49000000.0) tmp = R * (phi2 - phi1); elseif (phi1 <= 6.5e-206) tmp = R * (lambda2 - lambda1); else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -49000000.0], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 6.5e-206], N[(R * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -49000000:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{elif}\;\phi_1 \leq 6.5 \cdot 10^{-206}:\\
\;\;\;\;R \cdot \left(\lambda_2 - \lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -4.9e7Initial program 54.5%
hypot-def90.4%
Simplified90.4%
Taylor expanded in phi1 around -inf 62.3%
*-commutative62.3%
associate-*r*62.3%
distribute-rgt-out64.1%
mul-1-neg64.1%
Simplified64.1%
if -4.9e7 < phi1 < 6.4999999999999996e-206Initial program 66.6%
hypot-def98.7%
Simplified98.7%
Taylor expanded in lambda1 around -inf 38.0%
+-commutative38.0%
mul-1-neg38.0%
unsub-neg38.0%
associate-*r*38.0%
+-commutative38.0%
*-commutative38.0%
*-commutative38.0%
associate-*r*38.0%
*-commutative38.0%
*-commutative38.0%
+-commutative38.0%
Simplified38.0%
Taylor expanded in phi1 around 0 37.1%
*-commutative37.1%
associate-*r*37.1%
distribute-lft-out--38.2%
*-commutative38.2%
Simplified38.2%
Taylor expanded in phi2 around 0 33.1%
if 6.4999999999999996e-206 < phi1 Initial program 71.3%
hypot-def96.9%
Simplified96.9%
Taylor expanded in phi2 around inf 19.1%
*-commutative19.1%
Simplified19.1%
Final simplification34.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -2.1e+67) (* R (- lambda1)) (if (<= lambda1 3.7e-299) (* R phi2) (* R lambda2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -2.1e+67) {
tmp = R * -lambda1;
} else if (lambda1 <= 3.7e-299) {
tmp = R * phi2;
} 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 (lambda1 <= (-2.1d+67)) then
tmp = r * -lambda1
else if (lambda1 <= 3.7d-299) then
tmp = r * phi2
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 (lambda1 <= -2.1e+67) {
tmp = R * -lambda1;
} else if (lambda1 <= 3.7e-299) {
tmp = R * phi2;
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -2.1e+67: tmp = R * -lambda1 elif lambda1 <= 3.7e-299: tmp = R * phi2 else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -2.1e+67) tmp = Float64(R * Float64(-lambda1)); elseif (lambda1 <= 3.7e-299) tmp = Float64(R * phi2); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -2.1e+67) tmp = R * -lambda1; elseif (lambda1 <= 3.7e-299) tmp = R * phi2; else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -2.1e+67], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda1, 3.7e-299], N[(R * phi2), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -2.1 \cdot 10^{+67}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_1 \leq 3.7 \cdot 10^{-299}:\\
\;\;\;\;R \cdot \phi_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda1 < -2.1000000000000001e67Initial program 66.6%
hypot-def91.7%
Simplified91.7%
Taylor expanded in lambda1 around -inf 49.6%
+-commutative49.6%
mul-1-neg49.6%
unsub-neg49.6%
associate-*r*49.6%
+-commutative49.6%
*-commutative49.6%
*-commutative49.6%
associate-*r*49.6%
*-commutative49.6%
*-commutative49.6%
+-commutative49.6%
Simplified49.6%
Taylor expanded in phi1 around 0 51.3%
*-commutative51.3%
associate-*r*51.3%
distribute-lft-out--55.5%
*-commutative55.5%
Simplified55.5%
Taylor expanded in phi2 around 0 64.0%
Taylor expanded in lambda2 around 0 61.3%
mul-1-neg61.3%
*-commutative61.3%
distribute-rgt-neg-in61.3%
Simplified61.3%
if -2.1000000000000001e67 < lambda1 < 3.70000000000000014e-299Initial program 70.1%
hypot-def97.8%
Simplified97.8%
Taylor expanded in phi2 around inf 31.3%
*-commutative31.3%
Simplified31.3%
if 3.70000000000000014e-299 < lambda1 Initial program 63.3%
hypot-def96.9%
Simplified96.9%
Taylor expanded in lambda1 around -inf 24.6%
+-commutative24.6%
mul-1-neg24.6%
unsub-neg24.6%
associate-*r*24.6%
+-commutative24.6%
*-commutative24.6%
*-commutative24.6%
associate-*r*24.6%
*-commutative24.6%
*-commutative24.6%
+-commutative24.6%
Simplified24.6%
Taylor expanded in phi1 around 0 18.1%
*-commutative18.1%
associate-*r*18.1%
distribute-lft-out--18.1%
*-commutative18.1%
Simplified18.1%
Taylor expanded in phi2 around 0 11.6%
Taylor expanded in lambda2 around inf 14.1%
Final simplification27.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 4.3e-45) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.3e-45) {
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 <= 4.3d-45) 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 <= 4.3e-45) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 4.3e-45: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 4.3e-45) 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 <= 4.3e-45) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 4.3e-45], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4.3 \cdot 10^{-45}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 4.2999999999999999e-45Initial program 68.2%
hypot-def96.4%
Simplified96.4%
Taylor expanded in lambda1 around -inf 31.8%
+-commutative31.8%
mul-1-neg31.8%
unsub-neg31.8%
associate-*r*31.8%
+-commutative31.8%
*-commutative31.8%
*-commutative31.8%
associate-*r*31.8%
*-commutative31.8%
*-commutative31.8%
+-commutative31.8%
Simplified31.8%
Taylor expanded in phi1 around 0 26.3%
*-commutative26.3%
associate-*r*26.3%
distribute-lft-out--26.9%
*-commutative26.9%
Simplified26.9%
Taylor expanded in phi2 around 0 26.8%
Taylor expanded in lambda2 around inf 14.5%
if 4.2999999999999999e-45 < phi2 Initial program 59.6%
hypot-def95.5%
Simplified95.5%
Taylor expanded in phi2 around inf 54.5%
*-commutative54.5%
Simplified54.5%
Final simplification25.4%
(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 65.9%
hypot-def96.2%
Simplified96.2%
Taylor expanded in lambda1 around -inf 29.7%
+-commutative29.7%
mul-1-neg29.7%
unsub-neg29.7%
associate-*r*29.7%
+-commutative29.7%
*-commutative29.7%
*-commutative29.7%
associate-*r*29.7%
*-commutative29.7%
*-commutative29.7%
+-commutative29.7%
Simplified29.7%
Taylor expanded in phi1 around 0 25.7%
*-commutative25.7%
associate-*r*25.7%
distribute-lft-out--26.5%
*-commutative26.5%
Simplified26.5%
Taylor expanded in phi2 around 0 24.4%
Taylor expanded in lambda2 around inf 14.8%
Final simplification14.8%
herbie shell --seed 2023199
(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))))))