
(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 15 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
(let* ((t_0 (sin (* 0.5 phi2))) (t_1 (sin (* 0.5 phi1))) (t_2 (* t_0 t_1)))
(*
R
(hypot
(*
(- lambda1 lambda2)
(+
(- (* (cos (* 0.5 phi2)) (cos (* 0.5 phi1))) t_2)
(fma (- t_1) t_0 t_2)))
(- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = sin((0.5 * phi2));
double t_1 = sin((0.5 * phi1));
double t_2 = t_0 * t_1;
return R * hypot(((lambda1 - lambda2) * (((cos((0.5 * phi2)) * cos((0.5 * phi1))) - t_2) + fma(-t_1, t_0, t_2))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) t_0 = sin(Float64(0.5 * phi2)) t_1 = sin(Float64(0.5 * phi1)) t_2 = Float64(t_0 * t_1) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * Float64(Float64(Float64(cos(Float64(0.5 * phi2)) * cos(Float64(0.5 * phi1))) - t_2) + fma(Float64(-t_1), t_0, t_2))), Float64(phi1 - phi2))) end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 * t$95$1), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision] + N[((-t$95$1) * t$95$0 + t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sin \left(0.5 \cdot \phi_2\right)\\
t_1 := \sin \left(0.5 \cdot \phi_1\right)\\
t_2 := t\_0 \cdot t\_1\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \left(\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right) - t\_2\right) + \mathsf{fma}\left(-t\_1, t\_0, t\_2\right)\right), \phi_1 - \phi_2\right)
\end{array}
\end{array}
Initial program 67.0%
hypot-define97.1%
Simplified97.1%
log1p-expm1-u97.1%
div-inv97.1%
metadata-eval97.1%
Applied egg-rr97.1%
*-commutative97.1%
distribute-rgt-in97.1%
*-commutative97.1%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
log1p-expm1-u99.9%
*-commutative99.9%
*-un-lft-identity99.9%
prod-diff99.9%
*-commutative99.9%
Applied egg-rr99.9%
fma-undefine99.9%
*-lft-identity99.9%
fma-undefine99.9%
Simplified99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(log1p
(expm1
(fma
(cos (* 0.5 phi2))
(cos (* 0.5 phi1))
(* (sin (* 0.5 phi2)) (- (sin (* 0.5 phi1))))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * log1p(expm1(fma(cos((0.5 * phi2)), cos((0.5 * phi1)), (sin((0.5 * phi2)) * -sin((0.5 * phi1))))))), (phi1 - phi2));
}
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * log1p(expm1(fma(cos(Float64(0.5 * phi2)), cos(Float64(0.5 * phi1)), Float64(sin(Float64(0.5 * phi2)) * 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[Log[1 + N[(Exp[N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * (-N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]] - 1), $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{log1p}\left(\mathsf{expm1}\left(\mathsf{fma}\left(\cos \left(0.5 \cdot \phi_2\right), \cos \left(0.5 \cdot \phi_1\right), \sin \left(0.5 \cdot \phi_2\right) \cdot \left(-\sin \left(0.5 \cdot \phi_1\right)\right)\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 67.0%
hypot-define97.1%
Simplified97.1%
log1p-expm1-u97.1%
div-inv97.1%
metadata-eval97.1%
Applied egg-rr97.1%
*-commutative97.1%
distribute-lft-in97.1%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
*-commutative99.9%
*-commutative99.9%
fmm-def99.9%
*-commutative99.9%
*-commutative99.9%
*-commutative99.9%
distribute-lft-neg-in99.9%
Simplified99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(log1p
(expm1
(-
(* (cos (* 0.5 phi2)) (cos (* 0.5 phi1)))
(* (sin (* 0.5 phi2)) (sin (* 0.5 phi1)))))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * log1p(expm1(((cos((0.5 * phi2)) * cos((0.5 * phi1))) - (sin((0.5 * phi2)) * sin((0.5 * phi1))))))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.log1p(Math.expm1(((Math.cos((0.5 * phi2)) * Math.cos((0.5 * phi1))) - (Math.sin((0.5 * phi2)) * Math.sin((0.5 * phi1))))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.log1p(math.expm1(((math.cos((0.5 * phi2)) * math.cos((0.5 * phi1))) - (math.sin((0.5 * phi2)) * math.sin((0.5 * phi1))))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * log1p(expm1(Float64(Float64(cos(Float64(0.5 * phi2)) * cos(Float64(0.5 * phi1))) - Float64(sin(Float64(0.5 * phi2)) * 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[Log[1 + N[(Exp[N[(N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]] - 1), $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{log1p}\left(\mathsf{expm1}\left(\cos \left(0.5 \cdot \phi_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right) - \sin \left(0.5 \cdot \phi_2\right) \cdot \sin \left(0.5 \cdot \phi_1\right)\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 67.0%
hypot-define97.1%
Simplified97.1%
log1p-expm1-u97.1%
div-inv97.1%
metadata-eval97.1%
Applied egg-rr97.1%
*-commutative97.1%
distribute-rgt-in97.1%
*-commutative97.1%
cos-sum99.9%
*-commutative99.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -6.5e-7) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))) (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -6.5e-7) {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -6.5e-7) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi1))), (phi1 - phi2));
} else {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -6.5e-7: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2)) else: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -6.5e-7) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi2))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -6.5e-7) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); else tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -6.5e-7], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -6.5 \cdot 10^{-7}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi1 < -6.50000000000000024e-7Initial program 67.8%
hypot-define96.2%
Simplified96.2%
Taylor expanded in phi2 around 0 96.2%
if -6.50000000000000024e-7 < phi1 Initial program 66.7%
hypot-define97.4%
Simplified97.4%
Taylor expanded in phi1 around 0 92.2%
Final simplification93.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.45e-34) (* R (hypot phi1 (- lambda1 lambda2))) (* R (hypot (* lambda2 (- (cos (* 0.5 phi2)))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.45e-34) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * hypot((lambda2 * -cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.45e-34) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * Math.hypot((lambda2 * -Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.45e-34: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * math.hypot((lambda2 * -math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.45e-34) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(-cos(Float64(0.5 * phi2)))), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.45e-34) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * hypot((lambda2 * -cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.45e-34], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * (-N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.45 \cdot 10^{-34}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(-\cos \left(0.5 \cdot \phi_2\right)\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 1.4500000000000001e-34Initial program 67.7%
hypot-define97.8%
Simplified97.8%
Taylor expanded in phi1 around 0 90.8%
Taylor expanded in phi2 around 0 58.2%
unpow258.2%
unpow258.2%
hypot-define73.0%
Simplified73.0%
if 1.4500000000000001e-34 < phi2 Initial program 64.9%
hypot-define95.3%
Simplified95.3%
Taylor expanded in phi1 around 0 94.0%
Taylor expanded in lambda1 around 0 82.3%
mul-1-neg82.3%
*-commutative82.3%
distribute-lft-neg-in82.3%
Simplified82.3%
Final simplification75.5%
(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 67.0%
hypot-define97.1%
Simplified97.1%
Final simplification97.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* 0.5 phi1))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (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 * phi1))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((0.5 * phi1))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(0.5 * phi1))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((0.5 * phi1))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(0.5 * phi1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(0.5 \cdot \phi_1\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 67.0%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi2 around 0 92.2%
Final simplification92.2%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* R (- phi2 phi1))))
(if (<= phi2 1.15e+27)
(* R (hypot phi1 (- lambda1 lambda2)))
(if (<= phi2 2.9e+113)
(* phi1 (/ t_0 phi1))
(if (<= phi2 1.18e+116) (* R (* lambda1 (cos (* 0.5 phi2)))) t_0)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * (phi2 - phi1);
double tmp;
if (phi2 <= 1.15e+27) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else if (phi2 <= 2.9e+113) {
tmp = phi1 * (t_0 / phi1);
} else if (phi2 <= 1.18e+116) {
tmp = R * (lambda1 * cos((0.5 * phi2)));
} else {
tmp = t_0;
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = R * (phi2 - phi1);
double tmp;
if (phi2 <= 1.15e+27) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else if (phi2 <= 2.9e+113) {
tmp = phi1 * (t_0 / phi1);
} else if (phi2 <= 1.18e+116) {
tmp = R * (lambda1 * Math.cos((0.5 * phi2)));
} else {
tmp = t_0;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = R * (phi2 - phi1) tmp = 0 if phi2 <= 1.15e+27: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) elif phi2 <= 2.9e+113: tmp = phi1 * (t_0 / phi1) elif phi2 <= 1.18e+116: tmp = R * (lambda1 * math.cos((0.5 * phi2))) else: tmp = t_0 return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(R * Float64(phi2 - phi1)) tmp = 0.0 if (phi2 <= 1.15e+27) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); elseif (phi2 <= 2.9e+113) tmp = Float64(phi1 * Float64(t_0 / phi1)); elseif (phi2 <= 1.18e+116) tmp = Float64(R * Float64(lambda1 * cos(Float64(0.5 * phi2)))); else tmp = t_0; end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = R * (phi2 - phi1); tmp = 0.0; if (phi2 <= 1.15e+27) tmp = R * hypot(phi1, (lambda1 - lambda2)); elseif (phi2 <= 2.9e+113) tmp = phi1 * (t_0 / phi1); elseif (phi2 <= 1.18e+116) tmp = R * (lambda1 * cos((0.5 * phi2))); else tmp = t_0; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 1.15e+27], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 2.9e+113], N[(phi1 * N[(t$95$0 / phi1), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 1.18e+116], N[(R * N[(lambda1 * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{if}\;\phi_2 \leq 1.15 \cdot 10^{+27}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{elif}\;\phi_2 \leq 2.9 \cdot 10^{+113}:\\
\;\;\;\;\phi_1 \cdot \frac{t\_0}{\phi_1}\\
\mathbf{elif}\;\phi_2 \leq 1.18 \cdot 10^{+116}:\\
\;\;\;\;R \cdot \left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if phi2 < 1.15e27Initial program 68.6%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi1 around 0 90.9%
Taylor expanded in phi2 around 0 57.9%
unpow257.9%
unpow257.9%
hypot-define72.8%
Simplified72.8%
if 1.15e27 < phi2 < 2.89999999999999984e113Initial program 77.2%
hypot-define95.0%
Simplified95.0%
Taylor expanded in phi1 around -inf 57.9%
associate-*r*57.9%
mul-1-neg57.9%
mul-1-neg57.9%
*-commutative57.9%
Simplified57.9%
Taylor expanded in phi1 around 0 51.7%
distribute-lft-out--51.7%
Simplified51.7%
if 2.89999999999999984e113 < phi2 < 1.1799999999999999e116Initial program 3.0%
hypot-define100.0%
Simplified100.0%
Taylor expanded in phi1 around 0 100.0%
Taylor expanded in lambda1 around inf 4.6%
*-commutative4.6%
Simplified4.6%
if 1.1799999999999999e116 < phi2 Initial program 57.2%
hypot-define94.0%
Simplified94.0%
Taylor expanded in phi1 around -inf 75.9%
associate-*r*75.9%
mul-1-neg75.9%
mul-1-neg75.9%
*-commutative75.9%
Simplified75.9%
Taylor expanded in phi1 around 0 75.1%
+-commutative75.1%
mul-1-neg75.1%
unsub-neg75.1%
*-commutative75.1%
*-commutative75.1%
Simplified75.1%
Taylor expanded in phi2 around 0 75.1%
distribute-lft-out--77.5%
Simplified77.5%
Final simplification72.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 6.8e+61) (* R (hypot phi1 (- lambda1 lambda2))) (* R (- phi2 phi1))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 6.8e+61) {
tmp = R * hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 6.8e+61) {
tmp = R * Math.hypot(phi1, (lambda1 - lambda2));
} else {
tmp = R * (phi2 - phi1);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 6.8e+61: tmp = R * math.hypot(phi1, (lambda1 - lambda2)) else: tmp = R * (phi2 - phi1) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 6.8e+61) tmp = Float64(R * hypot(phi1, Float64(lambda1 - lambda2))); 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 <= 6.8e+61) tmp = R * hypot(phi1, (lambda1 - lambda2)); else tmp = R * (phi2 - phi1); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 6.8e+61], N[(R * N[Sqrt[phi1 ^ 2 + N[(lambda1 - lambda2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 6.8 \cdot 10^{+61}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\phi_1, \lambda_1 - \lambda_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\end{array}
\end{array}
if phi2 < 6.80000000000000051e61Initial program 69.1%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi1 around 0 90.8%
Taylor expanded in phi2 around 0 58.7%
unpow258.7%
unpow258.7%
hypot-define73.2%
Simplified73.2%
if 6.80000000000000051e61 < phi2 Initial program 58.8%
hypot-define95.2%
Simplified95.2%
Taylor expanded in phi1 around -inf 71.9%
associate-*r*71.9%
mul-1-neg71.9%
mul-1-neg71.9%
*-commutative71.9%
Simplified71.9%
Taylor expanded in phi1 around 0 69.4%
+-commutative69.4%
mul-1-neg69.4%
unsub-neg69.4%
*-commutative69.4%
*-commutative69.4%
Simplified69.4%
Taylor expanded in phi2 around 0 69.4%
distribute-lft-out--71.3%
Simplified71.3%
Final simplification72.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 1.15e+32) (* R (- phi2 phi1)) (* phi2 (* phi1 (* (/ (+ (/ phi1 phi2) -1.0) phi1) (- R))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 1.15e+32) {
tmp = R * (phi2 - phi1);
} else {
tmp = phi2 * (phi1 * ((((phi1 / phi2) + -1.0) / 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 (r <= 1.15d+32) then
tmp = r * (phi2 - phi1)
else
tmp = phi2 * (phi1 * ((((phi1 / phi2) + (-1.0d0)) / 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 (R <= 1.15e+32) {
tmp = R * (phi2 - phi1);
} else {
tmp = phi2 * (phi1 * ((((phi1 / phi2) + -1.0) / phi1) * -R));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 1.15e+32: tmp = R * (phi2 - phi1) else: tmp = phi2 * (phi1 * ((((phi1 / phi2) + -1.0) / phi1) * -R)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 1.15e+32) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(phi2 * Float64(phi1 * Float64(Float64(Float64(Float64(phi1 / phi2) + -1.0) / phi1) * Float64(-R)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 1.15e+32) tmp = R * (phi2 - phi1); else tmp = phi2 * (phi1 * ((((phi1 / phi2) + -1.0) / phi1) * -R)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 1.15e+32], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(phi1 * N[(N[(N[(N[(phi1 / phi2), $MachinePrecision] + -1.0), $MachinePrecision] / phi1), $MachinePrecision] * (-R)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 1.15 \cdot 10^{+32}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(\phi_1 \cdot \left(\frac{\frac{\phi_1}{\phi_2} + -1}{\phi_1} \cdot \left(-R\right)\right)\right)\\
\end{array}
\end{array}
if R < 1.15e32Initial program 57.6%
hypot-define96.6%
Simplified96.6%
Taylor expanded in phi1 around -inf 29.1%
associate-*r*29.1%
mul-1-neg29.1%
mul-1-neg29.1%
*-commutative29.1%
Simplified29.1%
Taylor expanded in phi1 around 0 29.5%
+-commutative29.5%
mul-1-neg29.5%
unsub-neg29.5%
*-commutative29.5%
*-commutative29.5%
Simplified29.5%
Taylor expanded in phi2 around 0 29.5%
distribute-lft-out--30.5%
Simplified30.5%
if 1.15e32 < R Initial program 95.6%
hypot-define98.8%
Simplified98.8%
Taylor expanded in phi1 around -inf 37.4%
associate-*r*37.4%
mul-1-neg37.4%
mul-1-neg37.4%
*-commutative37.4%
Simplified37.4%
Taylor expanded in phi2 around inf 32.6%
Taylor expanded in phi1 around 0 32.7%
associate-/l*32.7%
Simplified32.7%
pow132.7%
*-commutative32.7%
fmm-def32.7%
Applied egg-rr32.7%
unpow132.7%
associate-*l*34.2%
fma-undefine34.2%
neg-mul-134.2%
*-commutative34.2%
distribute-lft-in34.2%
metadata-eval34.2%
sub-neg34.2%
associate-/l*34.2%
sub-neg34.2%
metadata-eval34.2%
Simplified34.2%
Final simplification31.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= R 2e+32) (* R (- phi2 phi1)) (* phi2 (- R (* R (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 2e+32) {
tmp = R * (phi2 - phi1);
} else {
tmp = phi2 * (R - (R * (phi1 / phi2)));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (r <= 2d+32) then
tmp = r * (phi2 - phi1)
else
tmp = phi2 * (r - (r * (phi1 / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (R <= 2e+32) {
tmp = R * (phi2 - phi1);
} else {
tmp = phi2 * (R - (R * (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if R <= 2e+32: tmp = R * (phi2 - phi1) else: tmp = phi2 * (R - (R * (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (R <= 2e+32) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(phi2 * Float64(R - Float64(R * Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (R <= 2e+32) tmp = R * (phi2 - phi1); else tmp = phi2 * (R - (R * (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[R, 2e+32], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;R \leq 2 \cdot 10^{+32}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - R \cdot \frac{\phi_1}{\phi_2}\right)\\
\end{array}
\end{array}
if R < 2.00000000000000011e32Initial program 57.6%
hypot-define96.6%
Simplified96.6%
Taylor expanded in phi1 around -inf 29.1%
associate-*r*29.1%
mul-1-neg29.1%
mul-1-neg29.1%
*-commutative29.1%
Simplified29.1%
Taylor expanded in phi1 around 0 29.5%
+-commutative29.5%
mul-1-neg29.5%
unsub-neg29.5%
*-commutative29.5%
*-commutative29.5%
Simplified29.5%
Taylor expanded in phi2 around 0 29.5%
distribute-lft-out--30.5%
Simplified30.5%
if 2.00000000000000011e32 < R Initial program 95.6%
hypot-define98.8%
Simplified98.8%
Taylor expanded in phi2 around inf 34.2%
mul-1-neg34.2%
unsub-neg34.2%
associate-/l*34.2%
Simplified34.2%
Final simplification31.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 1.1e+14) (* R (- phi2 phi1)) (* phi1 (- (* phi2 (/ R phi1)) R))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.1e+14) {
tmp = R * (phi2 - phi1);
} else {
tmp = phi1 * ((phi2 * (R / phi1)) - R);
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 1.1d+14) then
tmp = r * (phi2 - phi1)
else
tmp = phi1 * ((phi2 * (r / phi1)) - r)
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.1e+14) {
tmp = R * (phi2 - phi1);
} else {
tmp = phi1 * ((phi2 * (R / phi1)) - R);
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1.1e+14: tmp = R * (phi2 - phi1) else: tmp = phi1 * ((phi2 * (R / phi1)) - R) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.1e+14) tmp = Float64(R * Float64(phi2 - phi1)); else tmp = Float64(phi1 * Float64(Float64(phi2 * Float64(R / phi1)) - R)); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 1.1e+14) tmp = R * (phi2 - phi1); else tmp = phi1 * ((phi2 * (R / phi1)) - R); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.1e+14], N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision], N[(phi1 * N[(N[(phi2 * N[(R / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.1 \cdot 10^{+14}:\\
\;\;\;\;R \cdot \left(\phi_2 - \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_1 \cdot \left(\phi_2 \cdot \frac{R}{\phi_1} - R\right)\\
\end{array}
\end{array}
if lambda2 < 1.1e14Initial program 68.7%
hypot-define96.8%
Simplified96.8%
Taylor expanded in phi1 around -inf 31.4%
associate-*r*31.4%
mul-1-neg31.4%
mul-1-neg31.4%
*-commutative31.4%
Simplified31.4%
Taylor expanded in phi1 around 0 31.2%
+-commutative31.2%
mul-1-neg31.2%
unsub-neg31.2%
*-commutative31.2%
*-commutative31.2%
Simplified31.2%
Taylor expanded in phi2 around 0 31.2%
distribute-lft-out--31.7%
Simplified31.7%
if 1.1e14 < lambda2 Initial program 60.4%
hypot-define98.5%
Simplified98.5%
Taylor expanded in phi1 around -inf 30.2%
mul-1-neg30.2%
distribute-rgt-neg-in30.2%
mul-1-neg30.2%
unsub-neg30.2%
*-commutative30.2%
associate-/l*30.3%
Simplified30.3%
Final simplification31.4%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.95e+70) (* R (- phi1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.95e+70) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-1.95d+70)) then
tmp = r * -phi1
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.95e+70) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.95e+70: tmp = R * -phi1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.95e+70) tmp = Float64(R * Float64(-phi1)); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -1.95e+70) tmp = R * -phi1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.95e+70], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.95 \cdot 10^{+70}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -1.94999999999999987e70Initial program 67.3%
hypot-define98.3%
Simplified98.3%
Taylor expanded in phi1 around -inf 81.2%
mul-1-neg81.2%
*-commutative81.2%
distribute-rgt-neg-in81.2%
Simplified81.2%
if -1.94999999999999987e70 < phi1 Initial program 66.9%
hypot-define96.9%
Simplified96.9%
Taylor expanded in phi2 around inf 19.5%
*-commutative19.5%
Simplified19.5%
Final simplification30.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (- phi2 phi1)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * (phi2 - phi1);
}
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 - phi1)
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * (phi2 - phi1);
}
def code(R, lambda1, lambda2, phi1, phi2): return R * (phi2 - phi1)
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * Float64(phi2 - phi1)) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * (phi2 - phi1); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[(phi2 - phi1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \left(\phi_2 - \phi_1\right)
\end{array}
Initial program 67.0%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi1 around -inf 31.1%
associate-*r*31.1%
mul-1-neg31.1%
mul-1-neg31.1%
*-commutative31.1%
Simplified31.1%
Taylor expanded in phi1 around 0 30.6%
+-commutative30.6%
mul-1-neg30.6%
unsub-neg30.6%
*-commutative30.6%
*-commutative30.6%
Simplified30.6%
Taylor expanded in phi2 around 0 30.6%
distribute-lft-out--31.4%
Simplified31.4%
Final simplification31.4%
(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 67.0%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi2 around inf 18.6%
*-commutative18.6%
Simplified18.6%
Final simplification18.6%
herbie shell --seed 2024095
(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))))))