
(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)
(fma
(cos (* phi2 0.5))
(cos (* 0.5 phi1))
(* (sin (* phi2 0.5)) (- (sin (* 0.5 phi1))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * fma(cos((phi2 * 0.5)), cos((0.5 * phi1)), (sin((phi2 * 0.5)) * -sin((0.5 * phi1))))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * fma(cos(Float64(phi2 * 0.5)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(phi2 * 0.5)) * Float64(-sin(Float64(0.5 * phi1)))))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * (-N[Sin[N[(0.5 * phi1), $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_2 \cdot 0.5\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(\phi_2 \cdot 0.5\right) \cdot \left(-\sin \left(0.5 \cdot \phi_1\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 59.3%
hypot-define95.2%
Simplified95.2%
log1p-expm1-u95.2%
div-inv95.2%
metadata-eval95.2%
Applied egg-rr95.2%
*-commutative95.2%
+-commutative95.2%
distribute-rgt-in95.2%
cos-sum99.8%
Applied egg-rr99.8%
log1p-expm1-u99.9%
cancel-sign-sub-inv99.9%
fma-define99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -2e+191)
(*
R
(hypot
(*
lambda1
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(* (sin (* phi2 0.5)) (sin (* 0.5 phi1)))))
(- 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 <= -2e+191) {
tmp = R * hypot((lambda1 * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((phi2 * 0.5)) * sin((0.5 * phi1))))), (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 <= -2e+191) {
tmp = R * Math.hypot((lambda1 * ((Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))) - (Math.sin((phi2 * 0.5)) * Math.sin((0.5 * phi1))))), (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 <= -2e+191: tmp = R * math.hypot((lambda1 * ((math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) - (math.sin((phi2 * 0.5)) * math.sin((0.5 * phi1))))), (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 <= -2e+191) tmp = Float64(R * hypot(Float64(lambda1 * Float64(Float64(cos(Float64(0.5 * phi1)) * cos(Float64(phi2 * 0.5))) - Float64(sin(Float64(phi2 * 0.5)) * sin(Float64(0.5 * phi1))))), 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 <= -2e+191) tmp = R * hypot((lambda1 * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((phi2 * 0.5)) * sin((0.5 * phi1))))), (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, -2e+191], 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[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $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 -2 \cdot 10^{+191}:\\
\;\;\;\;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(\phi_2 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_1\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 < -2.00000000000000015e191Initial program 37.2%
hypot-define84.6%
Simplified84.6%
log1p-expm1-u84.5%
div-inv84.5%
metadata-eval84.5%
Applied egg-rr84.5%
*-commutative84.5%
+-commutative84.5%
distribute-rgt-in84.5%
cos-sum99.6%
Applied egg-rr99.6%
Taylor expanded in lambda1 around inf 97.4%
*-commutative97.4%
Simplified97.4%
if -2.00000000000000015e191 < lambda1 Initial program 61.3%
hypot-define96.1%
Simplified96.1%
Final simplification96.3%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.75e-79) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* R (hypot (* (- lambda1 lambda2) (cos (* phi2 0.5))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.75e-79) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.75e-79) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi2 * 0.5))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.75e-79: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi2 * 0.5))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.75e-79) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.75e-79) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.75e-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[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.75 \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(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_2 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.75000000000000015e-79Initial program 63.1%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi2 around 0 57.9%
+-commutative57.9%
unpow257.9%
unpow257.9%
unpow257.9%
unswap-sqr57.9%
hypot-define81.2%
Simplified81.2%
if 1.75000000000000015e-79 < phi2 Initial program 50.6%
hypot-define89.6%
Simplified89.6%
Taylor expanded in phi1 around 0 87.6%
Final simplification83.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 2.9e-60) (* 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 <= 2.9e-60) {
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 <= 2.9e-60) {
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 <= 2.9e-60: 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 <= 2.9e-60) 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 <= 2.9e-60) 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, 2.9e-60], 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 2.9 \cdot 10^{-60}:\\
\;\;\;\;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 < 2.8999999999999999e-60Initial program 63.3%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi2 around 0 58.1%
+-commutative58.1%
unpow258.1%
unpow258.1%
unpow258.1%
unswap-sqr58.1%
hypot-define81.3%
Simplified81.3%
if 2.8999999999999999e-60 < phi2 Initial program 50.0%
hypot-define89.5%
Simplified89.5%
Taylor expanded in phi1 around 0 43.8%
+-commutative43.8%
unpow243.8%
unpow243.8%
unpow243.8%
unswap-sqr43.8%
hypot-define74.5%
Simplified74.5%
Final simplification79.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.08e+58) (* R (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1))))) (* phi2 (- R (/ (* R phi1) phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.08e+58) {
tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} 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.08e+58) {
tmp = R * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = phi2 * (R - ((R * phi1) / phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.08e+58: tmp = R * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = phi2 * (R - ((R * phi1) / phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.08e+58) tmp = Float64(R * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(phi2 * Float64(R - Float64(Float64(R * phi1) / phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.08e+58) tmp = R * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = phi2 * (R - ((R * phi1) / phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.08e+58], N[(R * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.08 \cdot 10^{+58}:\\
\;\;\;\;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}:\\
\;\;\;\;\phi_2 \cdot \left(R - \frac{R \cdot \phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if phi2 < 1.0799999999999999e58Initial program 62.4%
hypot-define97.2%
Simplified97.2%
Taylor expanded in phi2 around 0 55.8%
+-commutative55.8%
unpow255.8%
unpow255.8%
unpow255.8%
unswap-sqr55.8%
hypot-define79.0%
Simplified79.0%
if 1.0799999999999999e58 < phi2 Initial program 46.1%
hypot-define86.9%
Simplified86.9%
Taylor expanded in phi2 around inf 65.4%
associate-*r/65.4%
mul-1-neg65.4%
*-commutative65.4%
Simplified65.4%
Final simplification76.4%
(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 59.3%
hypot-define95.2%
Simplified95.2%
Final simplification95.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 6e+58) (* 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 <= 6e+58) {
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 <= 6e+58) {
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 <= 6e+58: 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 <= 6e+58) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(phi2 * Float64(R - Float64(Float64(R * phi1) / phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 6e+58) 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, 6e+58], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 6 \cdot 10^{+58}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - \frac{R \cdot \phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if phi2 < 6.0000000000000005e58Initial program 62.4%
hypot-define97.2%
Simplified97.2%
Taylor expanded in phi2 around 0 55.8%
+-commutative55.8%
unpow255.8%
unpow255.8%
unpow255.8%
unswap-sqr55.8%
hypot-define79.0%
Simplified79.0%
Taylor expanded in phi1 around 0 69.9%
if 6.0000000000000005e58 < phi2 Initial program 46.1%
hypot-define86.9%
Simplified86.9%
Taylor expanded in phi2 around inf 65.4%
associate-*r/65.4%
mul-1-neg65.4%
*-commutative65.4%
Simplified65.4%
Final simplification69.0%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -1.26e+219)
(* R (- lambda1))
(if (<= lambda1 -1e+23)
(* phi2 (- R (/ (* R phi1) phi2)))
(* phi1 (- (/ (* R phi2) phi1) R)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.26e+219) {
tmp = R * -lambda1;
} else if (lambda1 <= -1e+23) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} 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 (lambda1 <= (-1.26d+219)) then
tmp = r * -lambda1
else if (lambda1 <= (-1d+23)) then
tmp = phi2 * (r - ((r * phi1) / phi2))
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 (lambda1 <= -1.26e+219) {
tmp = R * -lambda1;
} else if (lambda1 <= -1e+23) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} else {
tmp = phi1 * (((R * phi2) / phi1) - R);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.26e+219: tmp = R * -lambda1 elif lambda1 <= -1e+23: tmp = phi2 * (R - ((R * phi1) / phi2)) else: tmp = phi1 * (((R * phi2) / phi1) - R) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.26e+219) tmp = Float64(R * Float64(-lambda1)); elseif (lambda1 <= -1e+23) tmp = Float64(phi2 * Float64(R - Float64(Float64(R * phi1) / phi2))); else tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1.26e+219) tmp = R * -lambda1; elseif (lambda1 <= -1e+23) tmp = phi2 * (R - ((R * phi1) / phi2)); else tmp = phi1 * (((R * phi2) / phi1) - R); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.26e+219], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda1, -1e+23], N[(phi2 * N[(R - N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.26 \cdot 10^{+219}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_1 \leq -1 \cdot 10^{+23}:\\
\;\;\;\;\phi_2 \cdot \left(R - \frac{R \cdot \phi_1}{\phi_2}\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\
\end{array}
\end{array}
if lambda1 < -1.2599999999999999e219Initial program 40.8%
hypot-define89.6%
Simplified89.6%
Taylor expanded in lambda1 around -inf 51.1%
mul-1-neg51.1%
associate-*r*51.3%
distribute-lft-neg-in51.3%
+-commutative51.3%
Simplified51.3%
Taylor expanded in phi2 around 0 52.7%
mul-1-neg52.7%
*-commutative52.7%
distribute-rgt-neg-in52.7%
*-commutative52.7%
Simplified52.7%
Taylor expanded in phi1 around 0 61.3%
if -1.2599999999999999e219 < lambda1 < -9.9999999999999992e22Initial program 48.1%
hypot-define94.7%
Simplified94.7%
Taylor expanded in phi2 around inf 23.5%
associate-*r/23.5%
mul-1-neg23.5%
*-commutative23.5%
Simplified23.5%
if -9.9999999999999992e22 < lambda1 Initial program 63.5%
hypot-define95.8%
Simplified95.8%
Taylor expanded in phi1 around -inf 30.2%
associate-*r*30.2%
mul-1-neg30.2%
associate-*r/30.2%
mul-1-neg30.2%
*-commutative30.2%
Simplified30.2%
Final simplification30.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda1 -1.15e+219)
(* R (- lambda1))
(if (<= lambda1 -2.4e-235)
(* phi2 (- R (/ (* R phi1) phi2)))
(* phi1 (- (* R (/ phi2 phi1)) R)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.15e+219) {
tmp = R * -lambda1;
} else if (lambda1 <= -2.4e-235) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} 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 (lambda1 <= (-1.15d+219)) then
tmp = r * -lambda1
else if (lambda1 <= (-2.4d-235)) then
tmp = phi2 * (r - ((r * phi1) / phi2))
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 (lambda1 <= -1.15e+219) {
tmp = R * -lambda1;
} else if (lambda1 <= -2.4e-235) {
tmp = phi2 * (R - ((R * phi1) / phi2));
} else {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.15e+219: tmp = R * -lambda1 elif lambda1 <= -2.4e-235: tmp = phi2 * (R - ((R * phi1) / phi2)) else: tmp = phi1 * ((R * (phi2 / phi1)) - R) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.15e+219) tmp = Float64(R * Float64(-lambda1)); elseif (lambda1 <= -2.4e-235) tmp = Float64(phi2 * Float64(R - Float64(Float64(R * phi1) / phi2))); 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 (lambda1 <= -1.15e+219) tmp = R * -lambda1; elseif (lambda1 <= -2.4e-235) tmp = phi2 * (R - ((R * phi1) / phi2)); else tmp = phi1 * ((R * (phi2 / phi1)) - R); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.15e+219], N[(R * (-lambda1)), $MachinePrecision], If[LessEqual[lambda1, -2.4e-235], N[(phi2 * N[(R - N[(N[(R * phi1), $MachinePrecision] / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.15 \cdot 10^{+219}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{elif}\;\lambda_1 \leq -2.4 \cdot 10^{-235}:\\
\;\;\;\;\phi_2 \cdot \left(R - \frac{R \cdot \phi_1}{\phi_2}\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\end{array}
\end{array}
if lambda1 < -1.15e219Initial program 40.8%
hypot-define89.6%
Simplified89.6%
Taylor expanded in lambda1 around -inf 51.1%
mul-1-neg51.1%
associate-*r*51.3%
distribute-lft-neg-in51.3%
+-commutative51.3%
Simplified51.3%
Taylor expanded in phi2 around 0 52.7%
mul-1-neg52.7%
*-commutative52.7%
distribute-rgt-neg-in52.7%
*-commutative52.7%
Simplified52.7%
Taylor expanded in phi1 around 0 61.3%
if -1.15e219 < lambda1 < -2.40000000000000011e-235Initial program 56.3%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi2 around inf 24.0%
associate-*r/24.0%
mul-1-neg24.0%
*-commutative24.0%
Simplified24.0%
if -2.40000000000000011e-235 < lambda1 Initial program 63.4%
hypot-define94.3%
Simplified94.3%
Taylor expanded in phi1 around -inf 32.9%
mul-1-neg32.9%
distribute-rgt-neg-in32.9%
mul-1-neg32.9%
unsub-neg32.9%
associate-/l*30.1%
Simplified30.1%
Final simplification29.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -9.5e-283) (* R (- phi1)) (if (<= phi2 2.65e-39) (* R (- lambda1)) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -9.5e-283) {
tmp = R * -phi1;
} else if (phi2 <= 2.65e-39) {
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 (phi2 <= (-9.5d-283)) then
tmp = r * -phi1
else if (phi2 <= 2.65d-39) 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 (phi2 <= -9.5e-283) {
tmp = R * -phi1;
} else if (phi2 <= 2.65e-39) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -9.5e-283: tmp = R * -phi1 elif phi2 <= 2.65e-39: tmp = R * -lambda1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -9.5e-283) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 2.65e-39) 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 (phi2 <= -9.5e-283) tmp = R * -phi1; elseif (phi2 <= 2.65e-39) tmp = R * -lambda1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -9.5e-283], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 2.65e-39], N[(R * (-lambda1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -9.5 \cdot 10^{-283}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 2.65 \cdot 10^{-39}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -9.49999999999999979e-283Initial program 60.6%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi1 around -inf 19.7%
mul-1-neg19.7%
*-commutative19.7%
distribute-rgt-neg-in19.7%
Simplified19.7%
if -9.49999999999999979e-283 < phi2 < 2.65000000000000002e-39Initial program 64.7%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda1 around -inf 23.7%
mul-1-neg23.7%
associate-*r*23.7%
distribute-lft-neg-in23.7%
+-commutative23.7%
Simplified23.7%
Taylor expanded in phi2 around 0 23.7%
mul-1-neg23.7%
*-commutative23.7%
distribute-rgt-neg-in23.7%
*-commutative23.7%
Simplified23.7%
Taylor expanded in phi1 around 0 21.3%
if 2.65000000000000002e-39 < phi2 Initial program 51.7%
hypot-define88.5%
Simplified88.5%
Taylor expanded in phi2 around inf 51.9%
*-commutative51.9%
Simplified51.9%
Final simplification28.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.9e+80) (* phi1 (- (* R (/ phi2 phi1)) R)) (* phi2 (- R (* phi1 (/ R phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.9e+80) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else {
tmp = phi2 * (R - (phi1 * (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 <= (-1.9d+80)) then
tmp = phi1 * ((r * (phi2 / phi1)) - r)
else
tmp = phi2 * (r - (phi1 * (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 <= -1.9e+80) {
tmp = phi1 * ((R * (phi2 / phi1)) - R);
} else {
tmp = phi2 * (R - (phi1 * (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.9e+80: tmp = phi1 * ((R * (phi2 / phi1)) - R) else: tmp = phi2 * (R - (phi1 * (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.9e+80) tmp = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)); else tmp = Float64(phi2 * Float64(R - Float64(phi1 * Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -1.9e+80) tmp = phi1 * ((R * (phi2 / phi1)) - R); else tmp = phi2 * (R - (phi1 * (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.9e+80], N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.9 \cdot 10^{+80}:\\
\;\;\;\;\phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\end{array}
\end{array}
if phi1 < -1.89999999999999999e80Initial program 50.5%
hypot-define93.7%
Simplified93.7%
Taylor expanded in phi1 around -inf 65.0%
mul-1-neg65.0%
distribute-rgt-neg-in65.0%
mul-1-neg65.0%
unsub-neg65.0%
associate-/l*65.0%
Simplified65.0%
if -1.89999999999999999e80 < phi1 Initial program 61.5%
hypot-define95.6%
Simplified95.6%
Taylor expanded in phi2 around inf 18.3%
mul-1-neg18.3%
unsub-neg18.3%
*-commutative18.3%
associate-/l*20.5%
Simplified20.5%
Final simplification29.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda1 -1.25e+219) (* R (- lambda1)) (* phi2 (- R (* phi1 (/ R phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.25e+219) {
tmp = R * -lambda1;
} else {
tmp = phi2 * (R - (phi1 * (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 (lambda1 <= (-1.25d+219)) then
tmp = r * -lambda1
else
tmp = phi2 * (r - (phi1 * (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 (lambda1 <= -1.25e+219) {
tmp = R * -lambda1;
} else {
tmp = phi2 * (R - (phi1 * (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.25e+219: tmp = R * -lambda1 else: tmp = phi2 * (R - (phi1 * (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.25e+219) tmp = Float64(R * Float64(-lambda1)); else tmp = Float64(phi2 * Float64(R - Float64(phi1 * Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1.25e+219) tmp = R * -lambda1; else tmp = phi2 * (R - (phi1 * (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda1, -1.25e+219], N[(R * (-lambda1)), $MachinePrecision], N[(phi2 * N[(R - N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.25 \cdot 10^{+219}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\end{array}
\end{array}
if lambda1 < -1.25e219Initial program 40.8%
hypot-define89.6%
Simplified89.6%
Taylor expanded in lambda1 around -inf 51.1%
mul-1-neg51.1%
associate-*r*51.3%
distribute-lft-neg-in51.3%
+-commutative51.3%
Simplified51.3%
Taylor expanded in phi2 around 0 52.7%
mul-1-neg52.7%
*-commutative52.7%
distribute-rgt-neg-in52.7%
*-commutative52.7%
Simplified52.7%
Taylor expanded in phi1 around 0 61.3%
if -1.25e219 < lambda1 Initial program 60.5%
hypot-define95.6%
Simplified95.6%
Taylor expanded in phi2 around inf 27.3%
mul-1-neg27.3%
unsub-neg27.3%
*-commutative27.3%
associate-/l*28.8%
Simplified28.8%
Final simplification30.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 2.7e-37) (* R (- lambda1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.7e-37) {
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 (phi2 <= 2.7d-37) 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 (phi2 <= 2.7e-37) {
tmp = R * -lambda1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.7e-37: tmp = R * -lambda1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.7e-37) 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 (phi2 <= 2.7e-37) tmp = R * -lambda1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 2.7e-37], N[(R * (-lambda1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.7 \cdot 10^{-37}:\\
\;\;\;\;R \cdot \left(-\lambda_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 2.70000000000000016e-37Initial program 62.4%
hypot-define97.7%
Simplified97.7%
Taylor expanded in lambda1 around -inf 16.3%
mul-1-neg16.3%
associate-*r*16.3%
distribute-lft-neg-in16.3%
+-commutative16.3%
Simplified16.3%
Taylor expanded in phi2 around 0 17.3%
mul-1-neg17.3%
*-commutative17.3%
distribute-rgt-neg-in17.3%
*-commutative17.3%
Simplified17.3%
Taylor expanded in phi1 around 0 16.0%
if 2.70000000000000016e-37 < phi2 Initial program 51.0%
hypot-define88.3%
Simplified88.3%
Taylor expanded in phi2 around inf 52.6%
*-commutative52.6%
Simplified52.6%
Final simplification25.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R phi2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * 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
code = r * phi2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * phi2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * phi2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * phi2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * phi2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * phi2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \phi_2
\end{array}
Initial program 59.3%
hypot-define95.2%
Simplified95.2%
Taylor expanded in phi2 around inf 15.9%
*-commutative15.9%
Simplified15.9%
Final simplification15.9%
herbie shell --seed 2024103
(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))))))