
(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 11 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) (* (cos (* phi1 0.5)) (cos (* 0.5 phi2))))
(* (* (sin (* phi1 0.5)) (sin (* 0.5 phi2))) (- lambda2 lambda1)))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((lambda1 - lambda2) * (cos((phi1 * 0.5)) * cos((0.5 * phi2)))) + ((sin((phi1 * 0.5)) * sin((0.5 * phi2))) * (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((phi1 * 0.5)) * Math.cos((0.5 * phi2)))) + ((Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2))) * (lambda2 - lambda1))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((lambda1 - lambda2) * (math.cos((phi1 * 0.5)) * math.cos((0.5 * phi2)))) + ((math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2))) * (lambda2 - lambda1))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(Float64(lambda1 - lambda2) * Float64(cos(Float64(phi1 * 0.5)) * cos(Float64(0.5 * phi2)))) + Float64(Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2))) * Float64(lambda2 - lambda1))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((((lambda1 - lambda2) * (cos((phi1 * 0.5)) * cos((0.5 * phi2)))) + ((sin((phi1 * 0.5)) * sin((0.5 * phi2))) * (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[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $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(\phi_1 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_2\right)\right) + \left(\sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right) \cdot \left(\lambda_2 - \lambda_1\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 62.5%
hypot-def98.2%
Simplified98.2%
expm1-log1p-u98.2%
div-inv98.2%
metadata-eval98.2%
Applied egg-rr98.2%
*-commutative98.2%
distribute-rgt-in98.2%
cos-sum99.8%
Applied egg-rr99.8%
expm1-log1p-u99.9%
sub-neg99.9%
distribute-lft-in99.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
(+
(* (* (sin (* phi1 0.5)) (sin (* 0.5 phi2))) (- lambda2 lambda1))
(* (cos (* 0.5 phi2)) (* (- lambda1 lambda2) (cos (* phi1 0.5)))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot((((sin((phi1 * 0.5)) * sin((0.5 * phi2))) * (lambda2 - lambda1)) + (cos((0.5 * phi2)) * ((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((((Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2))) * (lambda2 - lambda1)) + (Math.cos((0.5 * phi2)) * ((lambda1 - lambda2) * Math.cos((phi1 * 0.5))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot((((math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2))) * (lambda2 - lambda1)) + (math.cos((0.5 * phi2)) * ((lambda1 - lambda2) * math.cos((phi1 * 0.5))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2))) * Float64(lambda2 - lambda1)) + Float64(cos(Float64(0.5 * phi2)) * Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot((((sin((phi1 * 0.5)) * sin((0.5 * phi2))) * (lambda2 - lambda1)) + (cos((0.5 * phi2)) * ((lambda1 - lambda2) * cos((phi1 * 0.5))))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision] + N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[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(\sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right) \cdot \left(\lambda_2 - \lambda_1\right) + \cos \left(0.5 \cdot \phi_2\right) \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 62.5%
hypot-def98.2%
Simplified98.2%
expm1-log1p-u98.2%
div-inv98.2%
metadata-eval98.2%
Applied egg-rr98.2%
*-commutative98.2%
distribute-rgt-in98.2%
cos-sum99.8%
Applied egg-rr99.8%
expm1-log1p-u99.9%
sub-neg99.9%
distribute-lft-in99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
*-commutative99.9%
Applied egg-rr99.9%
Taylor expanded in lambda1 around 0 99.9%
+-commutative99.9%
associate-*r*99.9%
mul-1-neg99.9%
associate-*r*99.9%
distribute-lft-neg-in99.9%
distribute-lft-neg-out99.9%
*-commutative99.9%
distribute-rgt-out99.9%
*-commutative99.9%
distribute-rgt-in99.9%
sub-neg99.9%
*-commutative99.9%
Simplified99.9%
Final simplification99.9%
(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 62.5%
hypot-def98.2%
Simplified98.2%
Final simplification98.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi2))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (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))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi2))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi2))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := 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}
\\
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}
Initial program 62.5%
hypot-def98.2%
Simplified98.2%
Taylor expanded in phi1 around 0 91.8%
Final simplification91.8%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi2 -5.4e-246)
(* R (- phi1))
(if (<= phi2 5.4e-13)
(* R (* (cos (* 0.5 (+ phi1 phi2))) (- lambda2 lambda1)))
(* R (- phi2 phi1)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -5.4e-246) {
tmp = R * -phi1;
} else if (phi2 <= 5.4e-13) {
tmp = R * (cos((0.5 * (phi1 + phi2))) * (lambda2 - lambda1));
} else {
tmp = R * (phi2 - phi1);
}
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 <= (-5.4d-246)) then
tmp = r * -phi1
else if (phi2 <= 5.4d-13) then
tmp = r * (cos((0.5d0 * (phi1 + phi2))) * (lambda2 - lambda1))
else
tmp = r * (phi2 - phi1)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -5.4e-246) {
tmp = R * -phi1;
} else if (phi2 <= 5.4e-13) {
tmp = R * (Math.cos((0.5 * (phi1 + phi2))) * (lambda2 - lambda1));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -5.4e-246: tmp = R * -phi1 elif phi2 <= 5.4e-13: tmp = R * (math.cos((0.5 * (phi1 + phi2))) * (lambda2 - lambda1)) else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -5.4e-246) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 5.4e-13) tmp = Float64(R * Float64(cos(Float64(0.5 * Float64(phi1 + phi2))) * Float64(lambda2 - lambda1))); 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 <= -5.4e-246) tmp = R * -phi1; elseif (phi2 <= 5.4e-13) tmp = R * (cos((0.5 * (phi1 + phi2))) * (lambda2 - lambda1)); else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -5.4e-246], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 5.4e-13], N[(R * N[(N[Cos[N[(0.5 * N[(phi1 + phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(lambda2 - lambda1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -5.4 \cdot 10^{-246}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 5.4 \cdot 10^{-13}:\\
\;\;\;\;R \cdot \left(\cos \left(0.5 \cdot \left(\phi_1 + \phi_2\right)\right) \cdot \left(\lambda_2 - \lambda_1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < -5.3999999999999998e-246Initial program 60.4%
hypot-def97.8%
Simplified97.8%
Taylor expanded in phi1 around -inf 24.0%
mul-1-neg24.0%
*-commutative24.0%
distribute-rgt-neg-in24.0%
Simplified24.0%
if -5.3999999999999998e-246 < phi2 < 5.40000000000000021e-13Initial program 59.2%
Taylor expanded in lambda1 around -inf 42.7%
+-commutative42.7%
associate-*r*42.7%
distribute-rgt-out42.7%
mul-1-neg42.7%
Simplified42.7%
if 5.40000000000000021e-13 < phi2 Initial program 69.8%
Taylor expanded in phi1 around -inf 61.3%
mul-1-neg61.3%
unsub-neg61.3%
Simplified61.3%
Final simplification39.4%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* 0.5 (+ phi1 phi2)))))
(if (<= lambda1 -7e+296)
(* R (* lambda1 t_0))
(if (<= lambda1 -5.5e+172)
(* R (* lambda1 (- t_0)))
(* R (- phi2 phi1))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((0.5 * (phi1 + phi2)));
double tmp;
if (lambda1 <= -7e+296) {
tmp = R * (lambda1 * t_0);
} else if (lambda1 <= -5.5e+172) {
tmp = R * (lambda1 * -t_0);
} else {
tmp = R * (phi2 - phi1);
}
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) :: t_0
real(8) :: tmp
t_0 = cos((0.5d0 * (phi1 + phi2)))
if (lambda1 <= (-7d+296)) then
tmp = r * (lambda1 * t_0)
else if (lambda1 <= (-5.5d+172)) then
tmp = r * (lambda1 * -t_0)
else
tmp = r * (phi2 - phi1)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((0.5 * (phi1 + phi2)));
double tmp;
if (lambda1 <= -7e+296) {
tmp = R * (lambda1 * t_0);
} else if (lambda1 <= -5.5e+172) {
tmp = R * (lambda1 * -t_0);
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((0.5 * (phi1 + phi2))) tmp = 0 if lambda1 <= -7e+296: tmp = R * (lambda1 * t_0) elif lambda1 <= -5.5e+172: tmp = R * (lambda1 * -t_0) else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(0.5 * Float64(phi1 + phi2))) tmp = 0.0 if (lambda1 <= -7e+296) tmp = Float64(R * Float64(lambda1 * t_0)); elseif (lambda1 <= -5.5e+172) tmp = Float64(R * Float64(lambda1 * Float64(-t_0))); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos((0.5 * (phi1 + phi2))); tmp = 0.0; if (lambda1 <= -7e+296) tmp = R * (lambda1 * t_0); elseif (lambda1 <= -5.5e+172) tmp = R * (lambda1 * -t_0); else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * N[(phi1 + phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda1, -7e+296], N[(R * N[(lambda1 * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, -5.5e+172], N[(R * N[(lambda1 * (-t$95$0)), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(0.5 \cdot \left(\phi_1 + \phi_2\right)\right)\\
\mathbf{if}\;\lambda_1 \leq -7 \cdot 10^{+296}:\\
\;\;\;\;R \cdot \left(\lambda_1 \cdot t_0\right)\\
\mathbf{elif}\;\lambda_1 \leq -5.5 \cdot 10^{+172}:\\
\;\;\;\;R \cdot \left(\lambda_1 \cdot \left(-t_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -7.0000000000000004e296Initial program 61.5%
hypot-def99.7%
Simplified99.7%
Taylor expanded in lambda1 around inf 80.2%
*-commutative80.2%
*-commutative80.2%
Simplified80.2%
if -7.0000000000000004e296 < lambda1 < -5.4999999999999999e172Initial program 55.0%
hypot-def99.8%
Simplified99.8%
Taylor expanded in lambda1 around -inf 82.4%
mul-1-neg82.4%
*-commutative82.4%
distribute-rgt-neg-in82.4%
*-commutative82.4%
Simplified82.4%
if -5.4999999999999999e172 < lambda1 Initial program 63.1%
Taylor expanded in phi1 around -inf 31.0%
mul-1-neg31.0%
unsub-neg31.0%
Simplified31.0%
Final simplification35.4%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* 0.5 (+ phi1 phi2)))))
(if (<= lambda1 -5.2e+296)
(* R (* (- lambda1 lambda2) t_0))
(if (<= lambda1 -4.5e+172)
(* R (* lambda1 (- t_0)))
(* R (- phi2 phi1))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((0.5 * (phi1 + phi2)));
double tmp;
if (lambda1 <= -5.2e+296) {
tmp = R * ((lambda1 - lambda2) * t_0);
} else if (lambda1 <= -4.5e+172) {
tmp = R * (lambda1 * -t_0);
} else {
tmp = R * (phi2 - phi1);
}
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) :: t_0
real(8) :: tmp
t_0 = cos((0.5d0 * (phi1 + phi2)))
if (lambda1 <= (-5.2d+296)) then
tmp = r * ((lambda1 - lambda2) * t_0)
else if (lambda1 <= (-4.5d+172)) then
tmp = r * (lambda1 * -t_0)
else
tmp = r * (phi2 - phi1)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((0.5 * (phi1 + phi2)));
double tmp;
if (lambda1 <= -5.2e+296) {
tmp = R * ((lambda1 - lambda2) * t_0);
} else if (lambda1 <= -4.5e+172) {
tmp = R * (lambda1 * -t_0);
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((0.5 * (phi1 + phi2))) tmp = 0 if lambda1 <= -5.2e+296: tmp = R * ((lambda1 - lambda2) * t_0) elif lambda1 <= -4.5e+172: tmp = R * (lambda1 * -t_0) else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(0.5 * Float64(phi1 + phi2))) tmp = 0.0 if (lambda1 <= -5.2e+296) tmp = Float64(R * Float64(Float64(lambda1 - lambda2) * t_0)); elseif (lambda1 <= -4.5e+172) tmp = Float64(R * Float64(lambda1 * Float64(-t_0))); else tmp = Float64(R * Float64(phi2 - phi1)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos((0.5 * (phi1 + phi2))); tmp = 0.0; if (lambda1 <= -5.2e+296) tmp = R * ((lambda1 - lambda2) * t_0); elseif (lambda1 <= -4.5e+172) tmp = R * (lambda1 * -t_0); else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * N[(phi1 + phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda1, -5.2e+296], N[(R * N[(N[(lambda1 - lambda2), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda1, -4.5e+172], N[(R * N[(lambda1 * (-t$95$0)), $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(0.5 \cdot \left(\phi_1 + \phi_2\right)\right)\\
\mathbf{if}\;\lambda_1 \leq -5.2 \cdot 10^{+296}:\\
\;\;\;\;R \cdot \left(\left(\lambda_1 - \lambda_2\right) \cdot t_0\right)\\
\mathbf{elif}\;\lambda_1 \leq -4.5 \cdot 10^{+172}:\\
\;\;\;\;R \cdot \left(\lambda_1 \cdot \left(-t_0\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if lambda1 < -5.2000000000000003e296Initial program 61.5%
Taylor expanded in lambda1 around inf 80.2%
+-commutative80.2%
associate-*r*80.2%
neg-mul-180.2%
distribute-rgt-in80.2%
sub-neg80.2%
Simplified80.2%
if -5.2000000000000003e296 < lambda1 < -4.5000000000000002e172Initial program 55.0%
hypot-def99.8%
Simplified99.8%
Taylor expanded in lambda1 around -inf 82.4%
mul-1-neg82.4%
*-commutative82.4%
distribute-rgt-neg-in82.4%
*-commutative82.4%
Simplified82.4%
if -4.5000000000000002e172 < lambda1 Initial program 63.1%
Taylor expanded in phi1 around -inf 31.0%
mul-1-neg31.0%
unsub-neg31.0%
Simplified31.0%
Final simplification35.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -2.4e-290) (* R (- phi1)) (if (<= phi2 0.0023) (* R lambda2) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -2.4e-290) {
tmp = R * -phi1;
} else if (phi2 <= 0.0023) {
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 <= (-2.4d-290)) then
tmp = r * -phi1
else if (phi2 <= 0.0023d0) 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 <= -2.4e-290) {
tmp = R * -phi1;
} else if (phi2 <= 0.0023) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -2.4e-290: tmp = R * -phi1 elif phi2 <= 0.0023: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -2.4e-290) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 0.0023) 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 <= -2.4e-290) tmp = R * -phi1; elseif (phi2 <= 0.0023) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -2.4e-290], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 0.0023], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -2.4 \cdot 10^{-290}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 0.0023:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -2.4000000000000001e-290Initial program 58.1%
hypot-def97.9%
Simplified97.9%
Taylor expanded in phi1 around -inf 23.9%
mul-1-neg23.9%
*-commutative23.9%
distribute-rgt-neg-in23.9%
Simplified23.9%
if -2.4000000000000001e-290 < phi2 < 0.0023Initial program 63.9%
hypot-def99.9%
Simplified99.9%
add-exp-log45.3%
add-sqr-sqrt22.6%
sqrt-prod34.8%
sqrt-prod22.6%
add-sqr-sqrt45.3%
div-inv45.3%
metadata-eval45.3%
Applied egg-rr45.3%
Taylor expanded in lambda2 around inf 22.3%
*-commutative22.3%
+-commutative22.3%
Simplified22.3%
Taylor expanded in phi1 around 0 18.7%
*-commutative18.7%
Simplified18.7%
Taylor expanded in phi2 around 0 18.7%
if 0.0023 < phi2 Initial program 69.3%
hypot-def97.0%
Simplified97.0%
Taylor expanded in phi2 around inf 65.0%
*-commutative65.0%
Simplified65.0%
Final simplification33.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 4.6e+173) (* R (- phi2 phi1)) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 4.6e+173) {
tmp = R * (phi2 - phi1);
} 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 <= 4.6d+173) then
tmp = r * (phi2 - phi1)
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 <= 4.6e+173) {
tmp = R * (phi2 - phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 4.6e+173: tmp = R * (phi2 - phi1) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 4.6e+173) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 4.6e+173) tmp = R * (phi2 - phi1); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 4.6e+173], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 4.6 \cdot 10^{+173}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 4.5999999999999999e173Initial program 66.3%
Taylor expanded in phi1 around -inf 31.8%
mul-1-neg31.8%
unsub-neg31.8%
Simplified31.8%
if 4.5999999999999999e173 < lambda2 Initial program 27.4%
hypot-def99.7%
Simplified99.7%
add-exp-log59.7%
add-sqr-sqrt29.8%
sqrt-prod18.4%
sqrt-prod29.8%
add-sqr-sqrt59.7%
div-inv59.7%
metadata-eval59.7%
Applied egg-rr59.7%
Taylor expanded in lambda2 around inf 52.8%
*-commutative52.8%
+-commutative52.8%
Simplified52.8%
Taylor expanded in phi1 around 0 47.1%
*-commutative47.1%
Simplified47.1%
Taylor expanded in phi2 around 0 53.6%
Final simplification33.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 0.00072) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.00072) {
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 <= 0.00072d0) 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 <= 0.00072) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.00072: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.00072) 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 <= 0.00072) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 0.00072], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.00072:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 7.20000000000000045e-4Initial program 60.1%
hypot-def98.6%
Simplified98.6%
add-exp-log43.8%
add-sqr-sqrt22.8%
sqrt-prod32.7%
sqrt-prod22.8%
add-sqr-sqrt43.8%
div-inv43.8%
metadata-eval43.8%
Applied egg-rr43.8%
Taylor expanded in lambda2 around inf 18.5%
*-commutative18.5%
+-commutative18.5%
Simplified18.5%
Taylor expanded in phi1 around 0 15.2%
*-commutative15.2%
Simplified15.2%
Taylor expanded in phi2 around 0 15.2%
if 7.20000000000000045e-4 < phi2 Initial program 69.3%
hypot-def97.0%
Simplified97.0%
Taylor expanded in phi2 around inf 65.0%
*-commutative65.0%
Simplified65.0%
Final simplification28.2%
(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 62.5%
hypot-def98.2%
Simplified98.2%
add-exp-log47.3%
add-sqr-sqrt23.9%
sqrt-prod37.7%
sqrt-prod23.9%
add-sqr-sqrt47.3%
div-inv47.3%
metadata-eval47.3%
Applied egg-rr47.3%
Taylor expanded in lambda2 around inf 17.9%
*-commutative17.9%
+-commutative17.9%
Simplified17.9%
Taylor expanded in phi1 around 0 15.4%
*-commutative15.4%
Simplified15.4%
Taylor expanded in phi2 around 0 14.0%
Final simplification14.0%
herbie shell --seed 2024020
(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))))))