
(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 10 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}
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(pow
(sqrt
(*
R_m
(hypot
(*
(- lambda1 lambda2)
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(* (sin (* 0.5 phi1)) (sin (* phi2 0.5)))))
(- phi1 phi2))))
2.0)))R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * pow(sqrt((R_m * hypot(((lambda1 - lambda2) * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2)))), 2.0);
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * Math.pow(Math.sqrt((R_m * Math.hypot(((lambda1 - lambda2) * ((Math.cos((0.5 * phi1)) * Math.cos((phi2 * 0.5))) - (Math.sin((0.5 * phi1)) * Math.sin((phi2 * 0.5))))), (phi1 - phi2)))), 2.0);
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): return R_s * math.pow(math.sqrt((R_m * math.hypot(((lambda1 - lambda2) * ((math.cos((0.5 * phi1)) * math.cos((phi2 * 0.5))) - (math.sin((0.5 * phi1)) * math.sin((phi2 * 0.5))))), (phi1 - phi2)))), 2.0)
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) return Float64(R_s * (sqrt(Float64(R_m * hypot(Float64(Float64(lambda1 - lambda2) * 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)))) ^ 2.0)) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = R_s * (sqrt((R_m * hypot(((lambda1 - lambda2) * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2)))) ^ 2.0); end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * N[Power[N[Sqrt[N[(R$95$m * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * 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]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot {\left(\sqrt{R_m \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \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)}\right)}^{2}
\end{array}
Initial program 60.2%
hypot-def96.2%
Simplified96.2%
add-sqr-sqrt49.6%
pow249.6%
*-commutative49.6%
div-inv49.6%
metadata-eval49.6%
Applied egg-rr49.6%
*-commutative49.6%
+-commutative49.6%
distribute-lft-in49.6%
cos-sum52.5%
*-commutative52.5%
*-commutative52.5%
*-commutative52.5%
*-commutative52.5%
Applied egg-rr52.5%
Final simplification52.5%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= lambda1 -1.05e+212)
(pow
(sqrt
(*
R_m
(hypot
(*
lambda1
(-
(* (cos (* 0.5 phi1)) (cos (* phi2 0.5)))
(* (sin (* 0.5 phi1)) (sin (* phi2 0.5)))))
(- phi1 phi2))))
2.0)
(*
R_m
(hypot
(* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0)))
(- phi1 phi2))))))R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.05e+212) {
tmp = pow(sqrt((R_m * hypot((lambda1 * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2)))), 2.0);
} else {
tmp = R_m * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
return R_s * tmp;
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda1 <= -1.05e+212) {
tmp = Math.pow(Math.sqrt((R_m * 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)))), 2.0);
} else {
tmp = R_m * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda1 <= -1.05e+212: tmp = math.pow(math.sqrt((R_m * 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)))), 2.0) else: tmp = R_m * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda1 <= -1.05e+212) tmp = sqrt(Float64(R_m * 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)))) ^ 2.0; else tmp = Float64(R_m * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2))); end return Float64(R_s * tmp) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda1 <= -1.05e+212) tmp = sqrt((R_m * hypot((lambda1 * ((cos((0.5 * phi1)) * cos((phi2 * 0.5))) - (sin((0.5 * phi1)) * sin((phi2 * 0.5))))), (phi1 - phi2)))) ^ 2.0; else tmp = R_m * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)); end tmp_2 = R_s * tmp; end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[lambda1, -1.05e+212], N[Power[N[Sqrt[N[(R$95$m * 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]], $MachinePrecision], 2.0], $MachinePrecision], N[(R$95$m * 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]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\lambda_1 \leq -1.05 \cdot 10^{+212}:\\
\;\;\;\;{\left(\sqrt{R_m \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)}\right)}^{2}\\
\mathbf{else}:\\
\;\;\;\;R_m \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 < -1.05e212Initial program 40.0%
hypot-def81.2%
Simplified81.2%
add-sqr-sqrt34.8%
pow234.8%
*-commutative34.8%
div-inv34.8%
metadata-eval34.8%
Applied egg-rr34.8%
*-commutative34.8%
+-commutative34.8%
distribute-lft-in34.8%
cos-sum49.5%
*-commutative49.5%
*-commutative49.5%
*-commutative49.5%
*-commutative49.5%
Applied egg-rr49.5%
Taylor expanded in lambda1 around inf 44.0%
if -1.05e212 < lambda1 Initial program 61.5%
hypot-def97.2%
Simplified97.2%
Final simplification93.8%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi2 2.6e-137)
(* R_m (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1)))))
(* R_m (hypot (* (- lambda1 lambda2) (cos (* phi2 0.5))) (- phi1 phi2))))))R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.6e-137) {
tmp = R_m * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R_m * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2));
}
return R_s * tmp;
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.6e-137) {
tmp = R_m * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R_m * Math.hypot(((lambda1 - lambda2) * Math.cos((phi2 * 0.5))), (phi1 - phi2));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.6e-137: tmp = R_m * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R_m * math.hypot(((lambda1 - lambda2) * math.cos((phi2 * 0.5))), (phi1 - phi2)) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.6e-137) tmp = Float64(R_m * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R_m * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))), Float64(phi1 - phi2))); end return Float64(R_s * tmp) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 2.6e-137) tmp = R_m * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R_m * hypot(((lambda1 - lambda2) * cos((phi2 * 0.5))), (phi1 - phi2)); end tmp_2 = R_s * tmp; end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi2, 2.6e-137], N[(R$95$m * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.6 \cdot 10^{-137}:\\
\;\;\;\;R_m \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_m \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 < 2.6e-137Initial program 66.2%
hypot-def98.2%
Simplified98.2%
Taylor expanded in phi2 around 0 59.2%
+-commutative59.2%
unpow259.2%
unpow259.2%
unpow259.2%
unswap-sqr59.2%
hypot-def81.6%
Simplified81.6%
if 2.6e-137 < phi2 Initial program 50.0%
hypot-def92.7%
Simplified92.7%
Taylor expanded in phi1 around 0 89.7%
Final simplification84.6%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi2 2.05e+63)
(* R_m (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1)))))
(* R_m (- phi2 phi1)))))R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.05e+63) {
tmp = R_m * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R_m * (phi2 - phi1);
}
return R_s * tmp;
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 2.05e+63) {
tmp = R_m * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R_m * (phi2 - phi1);
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 2.05e+63: tmp = R_m * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R_m * (phi2 - phi1) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 2.05e+63) tmp = Float64(R_m * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R_m * Float64(phi2 - phi1)); end return Float64(R_s * tmp) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 2.05e+63) tmp = R_m * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R_m * (phi2 - phi1); end tmp_2 = R_s * tmp; end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi2, 2.05e+63], N[(R$95$m * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq 2.05 \cdot 10^{+63}:\\
\;\;\;\;R_m \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_m \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 2.04999999999999996e63Initial program 65.9%
hypot-def97.3%
Simplified97.3%
Taylor expanded in phi2 around 0 58.2%
+-commutative58.2%
unpow258.2%
unpow258.2%
unpow258.2%
unswap-sqr58.2%
hypot-def81.0%
Simplified81.0%
if 2.04999999999999996e63 < phi2 Initial program 36.1%
hypot-def91.6%
Simplified91.6%
Taylor expanded in phi1 around -inf 70.8%
+-commutative70.8%
mul-1-neg70.8%
unsub-neg70.8%
*-commutative70.8%
*-commutative70.8%
Simplified70.8%
Taylor expanded in R around -inf 70.8%
associate-*r*70.8%
neg-mul-170.8%
distribute-lft-out--70.8%
neg-mul-170.8%
distribute-lft-neg-in70.8%
neg-mul-170.8%
distribute-lft-out--70.8%
cancel-sign-sub-inv70.8%
metadata-eval70.8%
*-lft-identity70.8%
distribute-lft-in70.8%
mul-1-neg70.8%
distribute-rgt-neg-in70.8%
mul-1-neg70.8%
+-commutative70.8%
mul-1-neg70.8%
distribute-rgt-neg-in70.8%
mul-1-neg70.8%
distribute-lft-in70.8%
mul-1-neg70.8%
sub-neg70.8%
*-commutative70.8%
Simplified70.8%
Final simplification79.1%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi1 -3800.0)
(* R_m (hypot phi1 (* (- lambda1 lambda2) (cos (* 0.5 phi1)))))
(* R_m (hypot phi2 (* (- lambda1 lambda2) (cos (* phi2 0.5))))))))R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3800.0) {
tmp = R_m * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1))));
} else {
tmp = R_m * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5))));
}
return R_s * tmp;
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3800.0) {
tmp = R_m * Math.hypot(phi1, ((lambda1 - lambda2) * Math.cos((0.5 * phi1))));
} else {
tmp = R_m * Math.hypot(phi2, ((lambda1 - lambda2) * Math.cos((phi2 * 0.5))));
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -3800.0: tmp = R_m * math.hypot(phi1, ((lambda1 - lambda2) * math.cos((0.5 * phi1)))) else: tmp = R_m * math.hypot(phi2, ((lambda1 - lambda2) * math.cos((phi2 * 0.5)))) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -3800.0) tmp = Float64(R_m * hypot(phi1, Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))))); else tmp = Float64(R_m * hypot(phi2, Float64(Float64(lambda1 - lambda2) * cos(Float64(phi2 * 0.5))))); end return Float64(R_s * tmp) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -3800.0) tmp = R_m * hypot(phi1, ((lambda1 - lambda2) * cos((0.5 * phi1)))); else tmp = R_m * hypot(phi2, ((lambda1 - lambda2) * cos((phi2 * 0.5)))); end tmp_2 = R_s * tmp; end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi1, -3800.0], N[(R$95$m * N[Sqrt[phi1 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[Sqrt[phi2 ^ 2 + N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi2 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_1 \leq -3800:\\
\;\;\;\;R_m \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_m \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 < -3800Initial program 50.2%
hypot-def91.9%
Simplified91.9%
Taylor expanded in phi2 around 0 45.9%
+-commutative45.9%
unpow245.9%
unpow245.9%
unpow245.9%
unswap-sqr45.9%
hypot-def79.1%
Simplified79.1%
if -3800 < phi1 Initial program 63.6%
hypot-def97.6%
Simplified97.6%
Taylor expanded in phi1 around 0 53.5%
+-commutative53.5%
unpow253.5%
unpow253.5%
unpow253.5%
unswap-sqr53.5%
hypot-def80.6%
Simplified80.6%
Final simplification80.2%
R_m = (fabs.f64 R) R_s = (copysign.f64 1 R) (FPCore (R_s R_m lambda1 lambda2 phi1 phi2) :precision binary64 (* R_s (* R_m (hypot (* (- lambda1 lambda2) (cos (/ (+ phi2 phi1) 2.0))) (- phi1 phi2)))))
R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (R_m * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)));
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (R_m * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)));
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): return R_s * (R_m * math.hypot(((lambda1 - lambda2) * math.cos(((phi2 + phi1) / 2.0))), (phi1 - phi2)))
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) return Float64(R_s * Float64(R_m * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi2 + phi1) / 2.0))), Float64(phi1 - phi2)))) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = R_s * (R_m * hypot(((lambda1 - lambda2) * cos(((phi2 + phi1) / 2.0))), (phi1 - phi2))); end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * N[(R$95$m * 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]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \left(R_m \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)\right)
\end{array}
Initial program 60.2%
hypot-def96.2%
Simplified96.2%
Final simplification96.2%
R_m = (fabs.f64 R)
R_s = (copysign.f64 1 R)
(FPCore (R_s R_m lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R_s
(if (<= phi2 4.8e+61)
(* R_m (hypot (- lambda1 lambda2) phi1))
(* R_m (- phi2 phi1)))))R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.8e+61) {
tmp = R_m * hypot((lambda1 - lambda2), phi1);
} else {
tmp = R_m * (phi2 - phi1);
}
return R_s * tmp;
}
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 4.8e+61) {
tmp = R_m * Math.hypot((lambda1 - lambda2), phi1);
} else {
tmp = R_m * (phi2 - phi1);
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 4.8e+61: tmp = R_m * math.hypot((lambda1 - lambda2), phi1) else: tmp = R_m * (phi2 - phi1) return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 4.8e+61) tmp = Float64(R_m * hypot(Float64(lambda1 - lambda2), phi1)); else tmp = Float64(R_m * Float64(phi2 - phi1)); end return Float64(R_s * tmp) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 4.8e+61) tmp = R_m * hypot((lambda1 - lambda2), phi1); else tmp = R_m * (phi2 - phi1); end tmp_2 = R_s * tmp; end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi2, 4.8e+61], N[(R$95$m * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R$95$m * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq 4.8 \cdot 10^{+61}:\\
\;\;\;\;R_m \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 4.7999999999999998e61Initial program 65.9%
hypot-def97.3%
Simplified97.3%
Taylor expanded in phi1 around 0 92.0%
Taylor expanded in phi2 around 0 55.9%
+-commutative55.9%
unpow255.9%
unpow255.9%
hypot-def75.8%
Simplified75.8%
if 4.7999999999999998e61 < phi2 Initial program 36.1%
hypot-def91.6%
Simplified91.6%
Taylor expanded in phi1 around -inf 70.8%
+-commutative70.8%
mul-1-neg70.8%
unsub-neg70.8%
*-commutative70.8%
*-commutative70.8%
Simplified70.8%
Taylor expanded in R around -inf 70.8%
associate-*r*70.8%
neg-mul-170.8%
distribute-lft-out--70.8%
neg-mul-170.8%
distribute-lft-neg-in70.8%
neg-mul-170.8%
distribute-lft-out--70.8%
cancel-sign-sub-inv70.8%
metadata-eval70.8%
*-lft-identity70.8%
distribute-lft-in70.8%
mul-1-neg70.8%
distribute-rgt-neg-in70.8%
mul-1-neg70.8%
+-commutative70.8%
mul-1-neg70.8%
distribute-rgt-neg-in70.8%
mul-1-neg70.8%
distribute-lft-in70.8%
mul-1-neg70.8%
sub-neg70.8%
*-commutative70.8%
Simplified70.8%
Final simplification74.9%
R_m = (fabs.f64 R) R_s = (copysign.f64 1 R) (FPCore (R_s R_m lambda1 lambda2 phi1 phi2) :precision binary64 (* R_s (if (<= phi2 0.0078) (* R_m (- phi1)) (* R_m phi2))))
R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.0078) {
tmp = R_m * -phi1;
} else {
tmp = R_m * phi2;
}
return R_s * tmp;
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
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.0078d0) then
tmp = r_m * -phi1
else
tmp = r_m * phi2
end if
code = r_s * tmp
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 0.0078) {
tmp = R_m * -phi1;
} else {
tmp = R_m * phi2;
}
return R_s * tmp;
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 0.0078: tmp = R_m * -phi1 else: tmp = R_m * phi2 return R_s * tmp
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 0.0078) tmp = Float64(R_m * Float64(-phi1)); else tmp = Float64(R_m * phi2); end return Float64(R_s * tmp) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp_2 = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 0.0078) tmp = R_m * -phi1; else tmp = R_m * phi2; end tmp_2 = R_s * tmp; end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * If[LessEqual[phi2, 0.0078], N[(R$95$m * (-phi1)), $MachinePrecision], N[(R$95$m * phi2), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \begin{array}{l}
\mathbf{if}\;\phi_2 \leq 0.0078:\\
\;\;\;\;R_m \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R_m \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 0.0077999999999999996Initial program 65.7%
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 0.0077999999999999996 < phi2 Initial program 43.6%
hypot-def91.0%
Simplified91.0%
Taylor expanded in phi2 around inf 61.6%
*-commutative61.6%
Simplified61.6%
Final simplification33.3%
R_m = (fabs.f64 R) R_s = (copysign.f64 1 R) (FPCore (R_s R_m lambda1 lambda2 phi1 phi2) :precision binary64 (* R_s (* R_m (- phi2 phi1))))
R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (R_m * (phi2 - phi1));
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r_s * (r_m * (phi2 - phi1))
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (R_m * (phi2 - phi1));
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): return R_s * (R_m * (phi2 - phi1))
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) return Float64(R_s * Float64(R_m * Float64(phi2 - phi1))) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = R_s * (R_m * (phi2 - phi1)); end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * N[(R$95$m * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \left(R_m \cdot \left(\phi_2 - \phi_1\right)\right)
\end{array}
Initial program 60.2%
hypot-def96.2%
Simplified96.2%
Taylor expanded in phi1 around -inf 33.7%
+-commutative33.7%
mul-1-neg33.7%
unsub-neg33.7%
*-commutative33.7%
*-commutative33.7%
Simplified33.7%
Taylor expanded in R around -inf 34.5%
associate-*r*34.5%
neg-mul-134.5%
distribute-lft-out--34.5%
neg-mul-134.5%
distribute-lft-neg-in34.5%
neg-mul-134.5%
distribute-lft-out--34.5%
cancel-sign-sub-inv34.5%
metadata-eval34.5%
*-lft-identity34.5%
distribute-lft-in33.7%
mul-1-neg33.7%
distribute-rgt-neg-in33.7%
mul-1-neg33.7%
+-commutative33.7%
mul-1-neg33.7%
distribute-rgt-neg-in33.7%
mul-1-neg33.7%
distribute-lft-in34.5%
mul-1-neg34.5%
sub-neg34.5%
*-commutative34.5%
Simplified34.5%
Final simplification34.5%
R_m = (fabs.f64 R) R_s = (copysign.f64 1 R) (FPCore (R_s R_m lambda1 lambda2 phi1 phi2) :precision binary64 (* R_s (* R_m phi2)))
R_m = fabs(R);
R_s = copysign(1.0, R);
double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (R_m * phi2);
}
R_m = abs(R)
R_s = copysign(1.0d0, R)
real(8) function code(r_s, r_m, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r_s
real(8), intent (in) :: r_m
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r_s * (r_m * phi2)
end function
R_m = Math.abs(R);
R_s = Math.copySign(1.0, R);
public static double code(double R_s, double R_m, double lambda1, double lambda2, double phi1, double phi2) {
return R_s * (R_m * phi2);
}
R_m = math.fabs(R) R_s = math.copysign(1.0, R) def code(R_s, R_m, lambda1, lambda2, phi1, phi2): return R_s * (R_m * phi2)
R_m = abs(R) R_s = copysign(1.0, R) function code(R_s, R_m, lambda1, lambda2, phi1, phi2) return Float64(R_s * Float64(R_m * phi2)) end
R_m = abs(R); R_s = sign(R) * abs(1.0); function tmp = code(R_s, R_m, lambda1, lambda2, phi1, phi2) tmp = R_s * (R_m * phi2); end
R_m = N[Abs[R], $MachinePrecision]
R_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[R]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[R$95$s_, R$95$m_, lambda1_, lambda2_, phi1_, phi2_] := N[(R$95$s * N[(R$95$m * phi2), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
R_m = \left|R\right|
\\
R_s = \mathsf{copysign}\left(1, R\right)
\\
R_s \cdot \left(R_m \cdot \phi_2\right)
\end{array}
Initial program 60.2%
hypot-def96.2%
Simplified96.2%
Taylor expanded in phi2 around inf 19.4%
*-commutative19.4%
Simplified19.4%
Final simplification19.4%
herbie shell --seed 2024024
(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))))))