
(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 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(-
(* (cos (* phi1 0.5)) (cos (* 0.5 phi2)))
(* (sin (* phi1 0.5)) (sin (* 0.5 phi2)))))
(- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * ((cos((phi1 * 0.5)) * cos((0.5 * phi2))) - (sin((phi1 * 0.5)) * sin((0.5 * phi2))))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * ((Math.cos((phi1 * 0.5)) * Math.cos((0.5 * phi2))) - (Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2))))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * ((math.cos((phi1 * 0.5)) * math.cos((0.5 * phi2))) - (math.sin((phi1 * 0.5)) * math.sin((0.5 * phi2))))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * Float64(Float64(cos(Float64(phi1 * 0.5)) * cos(Float64(0.5 * phi2))) - Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2))))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * ((cos((phi1 * 0.5)) * cos((0.5 * phi2))) - (sin((phi1 * 0.5)) * sin((0.5 * phi2))))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[(N[(N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $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 \left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_2\right) - \sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-define97.2%
Simplified97.2%
log1p-expm1-u97.2%
div-inv97.2%
metadata-eval97.2%
Applied egg-rr97.2%
log1p-expm1-u97.2%
*-commutative97.2%
distribute-rgt-in97.2%
cos-sum99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.85e-32) (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- 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 (phi2 <= 1.85e-32) {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (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 (phi2 <= 1.85e-32) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (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 phi2 <= 1.85e-32: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (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 (phi2 <= 1.85e-32) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), 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 (phi2 <= 1.85e-32) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (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[phi2, 1.85e-32], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $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_2 \leq 1.85 \cdot 10^{-32}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\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 phi2 < 1.85e-32Initial program 66.0%
hypot-define97.0%
Simplified97.0%
Taylor expanded in phi2 around 0 95.2%
*-commutative95.2%
Simplified95.2%
if 1.85e-32 < phi2 Initial program 50.5%
hypot-define97.6%
Simplified97.6%
Taylor expanded in phi1 around 0 97.6%
*-commutative97.6%
Simplified97.6%
Final simplification95.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 460000000000.0) (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))) (* R (hypot (* lambda1 (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 460000000000.0) {
tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * hypot((lambda1 * 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 <= 460000000000.0) {
tmp = R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda1 * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 460000000000.0: tmp = R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2)) else: tmp = R * math.hypot((lambda1 * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 460000000000.0) tmp = Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda1 * 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 <= 460000000000.0) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); else tmp = R * hypot((lambda1 * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 460000000000.0], N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 * 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 460000000000:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\right), \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 4.6e11Initial program 65.7%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi2 around 0 95.0%
*-commutative95.0%
Simplified95.0%
if 4.6e11 < phi2 Initial program 50.5%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi1 around 0 97.5%
*-commutative97.5%
Simplified97.5%
Taylor expanded in lambda1 around inf 90.1%
Final simplification93.7%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (cos (* 0.5 phi2))))
(if (<= lambda1 -5e+53)
(* R (hypot (* lambda1 t_0) (- phi1 phi2)))
(* R (hypot (* lambda2 (- t_0)) (- phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = cos((0.5 * phi2));
double tmp;
if (lambda1 <= -5e+53) {
tmp = R * hypot((lambda1 * t_0), (phi1 - phi2));
} else {
tmp = R * hypot((lambda2 * -t_0), (phi1 - phi2));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = Math.cos((0.5 * phi2));
double tmp;
if (lambda1 <= -5e+53) {
tmp = R * Math.hypot((lambda1 * t_0), (phi1 - phi2));
} else {
tmp = R * Math.hypot((lambda2 * -t_0), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = math.cos((0.5 * phi2)) tmp = 0 if lambda1 <= -5e+53: tmp = R * math.hypot((lambda1 * t_0), (phi1 - phi2)) else: tmp = R * math.hypot((lambda2 * -t_0), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = cos(Float64(0.5 * phi2)) tmp = 0.0 if (lambda1 <= -5e+53) tmp = Float64(R * hypot(Float64(lambda1 * t_0), Float64(phi1 - phi2))); else tmp = Float64(R * hypot(Float64(lambda2 * Float64(-t_0)), Float64(phi1 - phi2))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) t_0 = cos((0.5 * phi2)); tmp = 0.0; if (lambda1 <= -5e+53) tmp = R * hypot((lambda1 * t_0), (phi1 - phi2)); else tmp = R * hypot((lambda2 * -t_0), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[lambda1, -5e+53], N[(R * N[Sqrt[N[(lambda1 * t$95$0), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda2 * (-t$95$0)), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(0.5 \cdot \phi_2\right)\\
\mathbf{if}\;\lambda_1 \leq -5 \cdot 10^{+53}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot t\_0, \phi_1 - \phi_2\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_2 \cdot \left(-t\_0\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if lambda1 < -5.0000000000000004e53Initial program 59.0%
hypot-define94.7%
Simplified94.7%
Taylor expanded in phi1 around 0 87.8%
*-commutative87.8%
Simplified87.8%
Taylor expanded in lambda1 around inf 87.6%
if -5.0000000000000004e53 < lambda1 Initial program 62.5%
hypot-define97.9%
Simplified97.9%
Taylor expanded in phi1 around 0 93.8%
*-commutative93.8%
Simplified93.8%
Taylor expanded in lambda1 around 0 82.6%
neg-mul-182.6%
Simplified82.6%
Final simplification83.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 68000000000.0) (* R (hypot (- lambda1 lambda2) phi1)) (* R (hypot (* lambda1 (cos (* 0.5 phi2))) (- phi1 phi2)))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 68000000000.0) {
tmp = R * hypot((lambda1 - lambda2), phi1);
} else {
tmp = R * hypot((lambda1 * 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 <= 68000000000.0) {
tmp = R * Math.hypot((lambda1 - lambda2), phi1);
} else {
tmp = R * Math.hypot((lambda1 * Math.cos((0.5 * phi2))), (phi1 - phi2));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 68000000000.0: tmp = R * math.hypot((lambda1 - lambda2), phi1) else: tmp = R * math.hypot((lambda1 * math.cos((0.5 * phi2))), (phi1 - phi2)) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 68000000000.0) tmp = Float64(R * hypot(Float64(lambda1 - lambda2), phi1)); else tmp = Float64(R * hypot(Float64(lambda1 * 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 <= 68000000000.0) tmp = R * hypot((lambda1 - lambda2), phi1); else tmp = R * hypot((lambda1 * cos((0.5 * phi2))), (phi1 - phi2)); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 68000000000.0], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[Sqrt[N[(lambda1 * 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 68000000000:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 \cdot \cos \left(0.5 \cdot \phi_2\right), \phi_1 - \phi_2\right)\\
\end{array}
\end{array}
if phi2 < 6.8e10Initial program 65.7%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi1 around 0 90.6%
*-commutative90.6%
Simplified90.6%
Taylor expanded in phi2 around 0 56.7%
+-commutative56.7%
unpow256.7%
unpow256.7%
hypot-define76.6%
Simplified76.6%
if 6.8e10 < phi2 Initial program 50.5%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi1 around 0 97.5%
*-commutative97.5%
Simplified97.5%
Taylor expanded in lambda1 around inf 90.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * N[Sqrt[N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2 + N[(phi1 - phi2), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \mathsf{hypot}\left(\left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.7%
hypot-define97.2%
Simplified97.2%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 7.2e+32) (* R (hypot (- lambda1 lambda2) phi1)) (* R (* phi2 (- 1.0 (/ phi1 phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.2e+32) {
tmp = R * hypot((lambda1 - lambda2), phi1);
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 7.2e+32) {
tmp = R * Math.hypot((lambda1 - lambda2), phi1);
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 7.2e+32: tmp = R * math.hypot((lambda1 - lambda2), phi1) else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 7.2e+32) tmp = Float64(R * hypot(Float64(lambda1 - lambda2), phi1)); else tmp = Float64(R * Float64(phi2 * Float64(1.0 - Float64(phi1 / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 7.2e+32) tmp = R * hypot((lambda1 - lambda2), phi1); else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 7.2e+32], N[(R * N[Sqrt[N[(lambda1 - lambda2), $MachinePrecision] ^ 2 + phi1 ^ 2], $MachinePrecision]), $MachinePrecision], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 7.2 \cdot 10^{+32}:\\
\;\;\;\;R \cdot \mathsf{hypot}\left(\lambda_1 - \lambda_2, \phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi2 < 7.1999999999999994e32Initial program 65.5%
hypot-define97.2%
Simplified97.2%
Taylor expanded in phi1 around 0 91.1%
*-commutative91.1%
Simplified91.1%
Taylor expanded in phi2 around 0 55.7%
+-commutative55.7%
unpow255.7%
unpow255.7%
hypot-define75.7%
Simplified75.7%
if 7.1999999999999994e32 < phi2 Initial program 48.5%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi2 around inf 69.7%
mul-1-neg69.7%
unsub-neg69.7%
Simplified69.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 7.4e+183) (* phi2 (- R (* phi1 (/ R phi2)))) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 7.4e+183) {
tmp = phi2 * (R - (phi1 * (R / phi2)));
} else {
tmp = R * lambda2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 7.4d+183) then
tmp = phi2 * (r - (phi1 * (r / phi2)))
else
tmp = r * lambda2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 7.4e+183) {
tmp = phi2 * (R - (phi1 * (R / phi2)));
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 7.4e+183: tmp = phi2 * (R - (phi1 * (R / phi2))) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 7.4e+183) tmp = Float64(phi2 * Float64(R - Float64(phi1 * Float64(R / phi2)))); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 7.4e+183) tmp = phi2 * (R - (phi1 * (R / phi2))); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 7.4e+183], N[(phi2 * N[(R - N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 7.4 \cdot 10^{+183}:\\
\;\;\;\;\phi_2 \cdot \left(R - \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 7.4000000000000002e183Initial program 64.0%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi2 around inf 34.7%
mul-1-neg34.7%
unsub-neg34.7%
*-commutative34.7%
associate-/l*34.8%
Simplified34.8%
if 7.4000000000000002e183 < lambda2 Initial program 41.5%
hypot-define90.2%
Simplified90.2%
Taylor expanded in lambda2 around -inf 29.1%
mul-1-neg29.1%
distribute-rgt-neg-in29.1%
*-commutative29.1%
distribute-rgt-neg-in29.1%
Simplified29.1%
add-sqr-sqrt0.0%
sqrt-unprod20.8%
sqr-neg20.8%
sqrt-unprod44.1%
add-sqr-sqrt44.4%
expm1-log1p-u41.7%
expm1-undefine41.7%
Applied egg-rr41.7%
expm1-define41.7%
Simplified41.7%
Taylor expanded in phi1 around 0 51.1%
*-commutative51.1%
Simplified51.1%
Taylor expanded in phi2 around 0 64.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 3.9e+185) (* phi2 (- R (* R (/ phi1 phi2)))) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 3.9e+185) {
tmp = phi2 * (R - (R * (phi1 / phi2)));
} else {
tmp = R * lambda2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 3.9d+185) then
tmp = phi2 * (r - (r * (phi1 / phi2)))
else
tmp = r * lambda2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 3.9e+185) {
tmp = phi2 * (R - (R * (phi1 / phi2)));
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 3.9e+185: tmp = phi2 * (R - (R * (phi1 / phi2))) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 3.9e+185) tmp = Float64(phi2 * Float64(R - Float64(R * Float64(phi1 / phi2)))); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 3.9e+185) tmp = phi2 * (R - (R * (phi1 / phi2))); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 3.9e+185], N[(phi2 * N[(R - N[(R * N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 3.9 \cdot 10^{+185}:\\
\;\;\;\;\phi_2 \cdot \left(R - R \cdot \frac{\phi_1}{\phi_2}\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 3.8999999999999999e185Initial program 64.0%
hypot-define98.0%
Simplified98.0%
log1p-expm1-u98.0%
div-inv98.0%
metadata-eval98.0%
Applied egg-rr98.0%
Taylor expanded in phi2 around inf 34.7%
mul-1-neg34.7%
unsub-neg34.7%
associate-/l*33.4%
Simplified33.4%
if 3.8999999999999999e185 < lambda2 Initial program 41.5%
hypot-define90.2%
Simplified90.2%
Taylor expanded in lambda2 around -inf 29.1%
mul-1-neg29.1%
distribute-rgt-neg-in29.1%
*-commutative29.1%
distribute-rgt-neg-in29.1%
Simplified29.1%
add-sqr-sqrt0.0%
sqrt-unprod20.8%
sqr-neg20.8%
sqrt-unprod44.1%
add-sqr-sqrt44.4%
expm1-log1p-u41.7%
expm1-undefine41.7%
Applied egg-rr41.7%
expm1-define41.7%
Simplified41.7%
Taylor expanded in phi1 around 0 51.1%
*-commutative51.1%
Simplified51.1%
Taylor expanded in phi2 around 0 64.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -7.5e-273) (* R (- phi1)) (if (<= phi2 1.9e+32) (* R lambda2) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -7.5e-273) {
tmp = R * -phi1;
} else if (phi2 <= 1.9e+32) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= (-7.5d-273)) then
tmp = r * -phi1
else if (phi2 <= 1.9d+32) then
tmp = r * lambda2
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -7.5e-273) {
tmp = R * -phi1;
} else if (phi2 <= 1.9e+32) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -7.5e-273: tmp = R * -phi1 elif phi2 <= 1.9e+32: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -7.5e-273) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 1.9e+32) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= -7.5e-273) tmp = R * -phi1; elseif (phi2 <= 1.9e+32) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -7.5e-273], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 1.9e+32], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -7.5 \cdot 10^{-273}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 1.9 \cdot 10^{+32}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -7.5000000000000007e-273Initial program 63.2%
hypot-define95.5%
Simplified95.5%
Taylor expanded in phi1 around -inf 19.7%
mul-1-neg19.7%
distribute-rgt-neg-in19.7%
Simplified19.7%
if -7.5000000000000007e-273 < phi2 < 1.9000000000000002e32Initial program 69.0%
hypot-define99.9%
Simplified99.9%
Taylor expanded in lambda2 around -inf 14.5%
mul-1-neg14.5%
distribute-rgt-neg-in14.5%
*-commutative14.5%
distribute-rgt-neg-in14.5%
Simplified14.5%
add-sqr-sqrt9.0%
sqrt-unprod15.6%
sqr-neg15.6%
sqrt-unprod14.1%
add-sqr-sqrt23.0%
expm1-log1p-u15.4%
expm1-undefine14.0%
Applied egg-rr14.0%
expm1-define15.4%
Simplified15.4%
Taylor expanded in phi1 around 0 22.2%
*-commutative22.2%
Simplified22.2%
Taylor expanded in phi2 around 0 19.9%
if 1.9000000000000002e32 < phi2 Initial program 48.5%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi2 around inf 74.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 1.7e+183) (- (* R phi2) (* R phi1)) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.7e+183) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (lambda2 <= 1.7d+183) then
tmp = (r * phi2) - (r * phi1)
else
tmp = r * lambda2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.7e+183) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1.7e+183: tmp = (R * phi2) - (R * phi1) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.7e+183) tmp = Float64(Float64(R * phi2) - Float64(R * phi1)); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 1.7e+183) tmp = (R * phi2) - (R * phi1); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.7e+183], N[(N[(R * phi2), $MachinePrecision] - N[(R * phi1), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.7 \cdot 10^{+183}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 1.7e183Initial program 64.0%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi1 around -inf 34.4%
associate-*r*34.4%
mul-1-neg34.4%
associate-*r/34.4%
mul-1-neg34.4%
Simplified34.4%
Taylor expanded in phi1 around 0 34.7%
+-commutative34.7%
mul-1-neg34.7%
unsub-neg34.7%
Simplified34.7%
if 1.7e183 < lambda2 Initial program 41.5%
hypot-define90.2%
Simplified90.2%
Taylor expanded in lambda2 around -inf 29.1%
mul-1-neg29.1%
distribute-rgt-neg-in29.1%
*-commutative29.1%
distribute-rgt-neg-in29.1%
Simplified29.1%
add-sqr-sqrt0.0%
sqrt-unprod20.8%
sqr-neg20.8%
sqrt-unprod44.1%
add-sqr-sqrt44.4%
expm1-log1p-u41.7%
expm1-undefine41.7%
Applied egg-rr41.7%
expm1-define41.7%
Simplified41.7%
Taylor expanded in phi1 around 0 51.1%
*-commutative51.1%
Simplified51.1%
Taylor expanded in phi2 around 0 64.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 1.6e+32) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.6e+32) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi2 <= 1.6d+32) then
tmp = r * lambda2
else
tmp = r * phi2
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 1.6e+32) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 1.6e+32: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 1.6e+32) tmp = Float64(R * lambda2); else tmp = Float64(R * phi2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi2 <= 1.6e+32) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 1.6e+32], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 1.6 \cdot 10^{+32}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 1.5999999999999999e32Initial program 65.5%
hypot-define97.2%
Simplified97.2%
Taylor expanded in lambda2 around -inf 19.1%
mul-1-neg19.1%
distribute-rgt-neg-in19.1%
*-commutative19.1%
distribute-rgt-neg-in19.1%
Simplified19.1%
add-sqr-sqrt12.7%
sqrt-unprod17.5%
sqr-neg17.5%
sqrt-unprod11.3%
add-sqr-sqrt17.6%
expm1-log1p-u12.1%
expm1-undefine11.4%
Applied egg-rr11.4%
expm1-define12.1%
Simplified12.1%
Taylor expanded in phi1 around 0 17.3%
*-commutative17.3%
Simplified17.3%
Taylor expanded in phi2 around 0 17.5%
if 1.5999999999999999e32 < phi2 Initial program 48.5%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi2 around inf 74.0%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R lambda2))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
code = r * lambda2
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * lambda2;
}
def code(R, lambda1, lambda2, phi1, phi2): return R * lambda2
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * lambda2) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * lambda2; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := N[(R * lambda2), $MachinePrecision]
\begin{array}{l}
\\
R \cdot \lambda_2
\end{array}
Initial program 61.7%
hypot-define97.2%
Simplified97.2%
Taylor expanded in lambda2 around -inf 17.8%
mul-1-neg17.8%
distribute-rgt-neg-in17.8%
*-commutative17.8%
distribute-rgt-neg-in17.8%
Simplified17.8%
add-sqr-sqrt11.4%
sqrt-unprod15.7%
sqr-neg15.7%
sqrt-unprod9.5%
add-sqr-sqrt15.4%
expm1-log1p-u10.3%
expm1-undefine9.7%
Applied egg-rr9.7%
expm1-define10.3%
Simplified10.3%
Taylor expanded in phi1 around 0 15.5%
*-commutative15.5%
Simplified15.5%
Taylor expanded in phi2 around 0 15.5%
herbie shell --seed 2024143
(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))))))