
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (let* ((t_0 (* (- lambda1 lambda2) (cos (/ (+ phi1 phi2) 2.0))))) (* R (sqrt (+ (* t_0 t_0) (* (- phi1 phi2) (- phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0));
return R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: t_0
t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0d0))
code = r * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = (lambda1 - lambda2) * Math.cos(((phi1 + phi2) / 2.0));
return R * Math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))));
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = (lambda1 - lambda2) * math.cos(((phi1 + phi2) / 2.0)) return R * math.sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2))))
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(Float64(lambda1 - lambda2) * cos(Float64(Float64(phi1 + phi2) / 2.0))) return Float64(R * sqrt(Float64(Float64(t_0 * t_0) + Float64(Float64(phi1 - phi2) * Float64(phi1 - phi2))))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) t_0 = (lambda1 - lambda2) * cos(((phi1 + phi2) / 2.0)); tmp = R * sqrt(((t_0 * t_0) + ((phi1 - phi2) * (phi1 - phi2)))); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(N[(lambda1 - lambda2), $MachinePrecision] * N[Cos[N[(N[(phi1 + phi2), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(R * N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(N[(phi1 - phi2), $MachinePrecision] * N[(phi1 - phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\lambda_1 - \lambda_2\right) \cdot \cos \left(\frac{\phi_1 + \phi_2}{2}\right)\\
R \cdot \sqrt{t\_0 \cdot t\_0 + \left(\phi_1 - \phi_2\right) \cdot \left(\phi_1 - \phi_2\right)}
\end{array}
\end{array}
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(*
R
(hypot
(*
(- lambda1 lambda2)
(-
(* (cos (* 0.5 phi2)) (cos (* phi1 0.5)))
(* (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((0.5 * phi2)) * cos((phi1 * 0.5))) - (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((0.5 * phi2)) * Math.cos((phi1 * 0.5))) - (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((0.5 * phi2)) * math.cos((phi1 * 0.5))) - (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(0.5 * phi2)) * cos(Float64(phi1 * 0.5))) - 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((0.5 * phi2)) * cos((phi1 * 0.5))) - (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[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(phi1 * 0.5), $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(0.5 \cdot \phi_2\right) \cdot \cos \left(\phi_1 \cdot 0.5\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 60.2%
hypot-define97.1%
Simplified97.1%
add-cbrt-cube97.0%
pow397.0%
div-inv97.0%
metadata-eval97.0%
Applied egg-rr97.0%
rem-cbrt-cube97.1%
*-commutative97.1%
distribute-rgt-in97.1%
cos-sum99.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 880.0) (* 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 <= 880.0) {
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 <= 880.0) {
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 <= 880.0: 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 <= 880.0) 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 <= 880.0) 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, 880.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[(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 880:\\
\;\;\;\;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 < 880Initial program 62.3%
hypot-define97.9%
Simplified97.9%
Taylor expanded in phi2 around 0 93.9%
*-commutative93.9%
Simplified93.9%
if 880 < phi2 Initial program 52.4%
hypot-define94.4%
Simplified94.4%
Taylor expanded in phi1 around 0 94.3%
*-commutative94.3%
Simplified94.3%
Final simplification94.0%
(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 60.2%
hypot-define97.1%
Simplified97.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (* R (hypot (* (- lambda1 lambda2) (cos (* phi1 0.5))) (- phi1 phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2));
}
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
return R * Math.hypot(((lambda1 - lambda2) * Math.cos((phi1 * 0.5))), (phi1 - phi2));
}
def code(R, lambda1, lambda2, phi1, phi2): return R * math.hypot(((lambda1 - lambda2) * math.cos((phi1 * 0.5))), (phi1 - phi2))
function code(R, lambda1, lambda2, phi1, phi2) return Float64(R * hypot(Float64(Float64(lambda1 - lambda2) * cos(Float64(phi1 * 0.5))), Float64(phi1 - phi2))) end
function tmp = code(R, lambda1, lambda2, phi1, phi2) tmp = R * hypot(((lambda1 - lambda2) * cos((phi1 * 0.5))), (phi1 - phi2)); end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := 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]
\begin{array}{l}
\\
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)
\end{array}
Initial program 60.2%
hypot-define97.1%
Simplified97.1%
Taylor expanded in phi2 around 0 90.6%
*-commutative90.6%
Simplified90.6%
Final simplification90.6%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -2.3e-85)
(* lambda1 (* (- R) (cos (* phi1 0.5))))
(if (<= lambda2 1.95e+187)
(* phi1 (- (/ (* R phi2) phi1) R))
(* R lambda2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -2.3e-85) {
tmp = lambda1 * (-R * cos((phi1 * 0.5)));
} else if (lambda2 <= 1.95e+187) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} 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 <= (-2.3d-85)) then
tmp = lambda1 * (-r * cos((phi1 * 0.5d0)))
else if (lambda2 <= 1.95d+187) then
tmp = phi1 * (((r * phi2) / phi1) - r)
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 <= -2.3e-85) {
tmp = lambda1 * (-R * Math.cos((phi1 * 0.5)));
} else if (lambda2 <= 1.95e+187) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -2.3e-85: tmp = lambda1 * (-R * math.cos((phi1 * 0.5))) elif lambda2 <= 1.95e+187: tmp = phi1 * (((R * phi2) / phi1) - R) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -2.3e-85) tmp = Float64(lambda1 * Float64(Float64(-R) * cos(Float64(phi1 * 0.5)))); elseif (lambda2 <= 1.95e+187) tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R)); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= -2.3e-85) tmp = lambda1 * (-R * cos((phi1 * 0.5))); elseif (lambda2 <= 1.95e+187) tmp = phi1 * (((R * phi2) / phi1) - R); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -2.3e-85], N[(lambda1 * N[((-R) * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[lambda2, 1.95e+187], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -2.3 \cdot 10^{-85}:\\
\;\;\;\;\lambda_1 \cdot \left(\left(-R\right) \cdot \cos \left(\phi_1 \cdot 0.5\right)\right)\\
\mathbf{elif}\;\lambda_2 \leq 1.95 \cdot 10^{+187}:\\
\;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < -2.3e-85Initial program 53.5%
hypot-define97.9%
Simplified97.9%
Taylor expanded in lambda1 around -inf 29.7%
mul-1-neg29.7%
*-commutative29.7%
distribute-rgt-neg-in29.7%
+-commutative29.7%
mul-1-neg29.7%
unsub-neg29.7%
associate-*r*29.7%
associate-/l*29.7%
Simplified29.7%
Taylor expanded in lambda2 around 0 19.6%
Taylor expanded in phi2 around 0 18.5%
if -2.3e-85 < lambda2 < 1.94999999999999991e187Initial program 67.4%
hypot-define97.2%
Simplified97.2%
Taylor expanded in phi1 around -inf 28.6%
associate-*r*28.6%
mul-1-neg28.6%
associate-*r/28.6%
mul-1-neg28.6%
Simplified28.6%
if 1.94999999999999991e187 < lambda2 Initial program 41.4%
hypot-define94.3%
Simplified94.3%
Taylor expanded in lambda2 around -inf 29.0%
mul-1-neg29.0%
associate-*r*28.9%
Simplified28.9%
Taylor expanded in phi2 around 0 24.7%
associate-*r*24.7%
Simplified24.7%
add-sqr-sqrt16.2%
sqrt-unprod37.1%
sqr-neg37.1%
sqrt-unprod24.7%
add-sqr-sqrt43.5%
*-commutative43.5%
Applied egg-rr43.5%
Taylor expanded in phi1 around 0 61.9%
Final simplification28.7%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= lambda2 -7.3e-87)
(* (* R lambda1) (- (cos (* phi1 0.5))))
(if (<= lambda2 1.05e+186)
(* phi1 (- (/ (* R phi2) phi1) R))
(* R lambda2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= -7.3e-87) {
tmp = (R * lambda1) * -cos((phi1 * 0.5));
} else if (lambda2 <= 1.05e+186) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} 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.3d-87)) then
tmp = (r * lambda1) * -cos((phi1 * 0.5d0))
else if (lambda2 <= 1.05d+186) then
tmp = phi1 * (((r * phi2) / phi1) - r)
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.3e-87) {
tmp = (R * lambda1) * -Math.cos((phi1 * 0.5));
} else if (lambda2 <= 1.05e+186) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= -7.3e-87: tmp = (R * lambda1) * -math.cos((phi1 * 0.5)) elif lambda2 <= 1.05e+186: tmp = phi1 * (((R * phi2) / phi1) - R) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= -7.3e-87) tmp = Float64(Float64(R * lambda1) * Float64(-cos(Float64(phi1 * 0.5)))); elseif (lambda2 <= 1.05e+186) tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R)); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= -7.3e-87) tmp = (R * lambda1) * -cos((phi1 * 0.5)); elseif (lambda2 <= 1.05e+186) tmp = phi1 * (((R * phi2) / phi1) - R); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, -7.3e-87], N[(N[(R * lambda1), $MachinePrecision] * (-N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[lambda2, 1.05e+186], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq -7.3 \cdot 10^{-87}:\\
\;\;\;\;\left(R \cdot \lambda_1\right) \cdot \left(-\cos \left(\phi_1 \cdot 0.5\right)\right)\\
\mathbf{elif}\;\lambda_2 \leq 1.05 \cdot 10^{+186}:\\
\;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < -7.29999999999999967e-87Initial program 53.5%
hypot-define97.9%
Simplified97.9%
Taylor expanded in lambda1 around -inf 29.7%
mul-1-neg29.7%
*-commutative29.7%
distribute-rgt-neg-in29.7%
+-commutative29.7%
mul-1-neg29.7%
unsub-neg29.7%
associate-*r*29.7%
associate-/l*29.7%
Simplified29.7%
Taylor expanded in lambda2 around 0 19.6%
Taylor expanded in phi2 around 0 18.5%
mul-1-neg18.5%
associate-*r*18.5%
*-commutative18.5%
distribute-rgt-neg-in18.5%
*-commutative18.5%
Simplified18.5%
if -7.29999999999999967e-87 < lambda2 < 1.05e186Initial program 67.4%
hypot-define97.2%
Simplified97.2%
Taylor expanded in phi1 around -inf 28.6%
associate-*r*28.6%
mul-1-neg28.6%
associate-*r/28.6%
mul-1-neg28.6%
Simplified28.6%
if 1.05e186 < lambda2 Initial program 41.4%
hypot-define94.3%
Simplified94.3%
Taylor expanded in lambda2 around -inf 29.0%
mul-1-neg29.0%
associate-*r*28.9%
Simplified28.9%
Taylor expanded in phi2 around 0 24.7%
associate-*r*24.7%
Simplified24.7%
add-sqr-sqrt16.2%
sqrt-unprod37.1%
sqr-neg37.1%
sqrt-unprod24.7%
add-sqr-sqrt43.5%
*-commutative43.5%
Applied egg-rr43.5%
Taylor expanded in phi1 around 0 61.9%
Final simplification28.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 5.2e+185) (* phi1 (- (/ (* R phi2) phi1) R)) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 5.2e+185) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} 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 <= 5.2d+185) then
tmp = phi1 * (((r * phi2) / phi1) - r)
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 <= 5.2e+185) {
tmp = phi1 * (((R * phi2) / phi1) - R);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 5.2e+185: tmp = phi1 * (((R * phi2) / phi1) - R) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 5.2e+185) tmp = Float64(phi1 * Float64(Float64(Float64(R * phi2) / phi1) - R)); else tmp = Float64(R * lambda2); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (lambda2 <= 5.2e+185) tmp = phi1 * (((R * phi2) / phi1) - R); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 5.2e+185], N[(phi1 * N[(N[(N[(R * phi2), $MachinePrecision] / phi1), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 5.2 \cdot 10^{+185}:\\
\;\;\;\;\phi_1 \cdot \left(\frac{R \cdot \phi_2}{\phi_1} - R\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 5.20000000000000001e185Initial program 62.3%
hypot-define97.4%
Simplified97.4%
Taylor expanded in phi1 around -inf 24.2%
associate-*r*24.2%
mul-1-neg24.2%
associate-*r/24.2%
mul-1-neg24.2%
Simplified24.2%
if 5.20000000000000001e185 < lambda2 Initial program 41.4%
hypot-define94.3%
Simplified94.3%
Taylor expanded in lambda2 around -inf 29.0%
mul-1-neg29.0%
associate-*r*28.9%
Simplified28.9%
Taylor expanded in phi2 around 0 24.7%
associate-*r*24.7%
Simplified24.7%
add-sqr-sqrt16.2%
sqrt-unprod37.1%
sqr-neg37.1%
sqrt-unprod24.7%
add-sqr-sqrt43.5%
*-commutative43.5%
Applied egg-rr43.5%
Taylor expanded in phi1 around 0 61.9%
Final simplification28.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 -4.5e-204) (* R (- phi1)) (if (<= phi2 4.9e+84) (* R lambda2) (* R phi2))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= -4.5e-204) {
tmp = R * -phi1;
} else if (phi2 <= 4.9e+84) {
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 <= (-4.5d-204)) then
tmp = r * -phi1
else if (phi2 <= 4.9d+84) 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 <= -4.5e-204) {
tmp = R * -phi1;
} else if (phi2 <= 4.9e+84) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= -4.5e-204: tmp = R * -phi1 elif phi2 <= 4.9e+84: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= -4.5e-204) tmp = Float64(R * Float64(-phi1)); elseif (phi2 <= 4.9e+84) 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 <= -4.5e-204) tmp = R * -phi1; elseif (phi2 <= 4.9e+84) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, -4.5e-204], N[(R * (-phi1)), $MachinePrecision], If[LessEqual[phi2, 4.9e+84], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq -4.5 \cdot 10^{-204}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{elif}\;\phi_2 \leq 4.9 \cdot 10^{+84}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < -4.49999999999999974e-204Initial program 59.5%
hypot-define97.0%
Simplified97.0%
Taylor expanded in phi1 around -inf 11.2%
mul-1-neg11.2%
distribute-rgt-neg-in11.2%
Simplified11.2%
if -4.49999999999999974e-204 < phi2 < 4.9e84Initial program 64.7%
hypot-define97.5%
Simplified97.5%
Taylor expanded in lambda2 around -inf 24.4%
mul-1-neg24.4%
associate-*r*24.4%
Simplified24.4%
Taylor expanded in phi2 around 0 22.7%
associate-*r*22.7%
Simplified22.7%
add-sqr-sqrt13.8%
sqrt-unprod16.5%
sqr-neg16.5%
sqrt-unprod8.3%
add-sqr-sqrt18.4%
*-commutative18.4%
Applied egg-rr18.4%
Taylor expanded in phi1 around 0 19.2%
if 4.9e84 < phi2 Initial program 51.1%
hypot-define96.5%
Simplified96.5%
Taylor expanded in phi2 around inf 67.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 3.8e+110) (- (* R phi2) (* R phi1)) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 3.8e+110) {
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 <= 3.8d+110) 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 <= 3.8e+110) {
tmp = (R * phi2) - (R * phi1);
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 3.8e+110: tmp = (R * phi2) - (R * phi1) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 3.8e+110) 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 <= 3.8e+110) tmp = (R * phi2) - (R * phi1); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 3.8e+110], 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 3.8 \cdot 10^{+110}:\\
\;\;\;\;R \cdot \phi_2 - R \cdot \phi_1\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 3.79999999999999989e110Initial program 62.6%
hypot-define98.0%
Simplified98.0%
Taylor expanded in phi2 around inf 24.0%
associate-*r/24.0%
mul-1-neg24.0%
Simplified24.0%
Taylor expanded in phi2 around 0 24.1%
neg-mul-124.1%
+-commutative24.1%
unsub-neg24.1%
Simplified24.1%
if 3.79999999999999989e110 < lambda2 Initial program 49.5%
hypot-define93.3%
Simplified93.3%
Taylor expanded in lambda2 around -inf 30.4%
mul-1-neg30.4%
associate-*r*30.4%
Simplified30.4%
Taylor expanded in phi2 around 0 23.5%
associate-*r*23.5%
Simplified23.5%
add-sqr-sqrt13.9%
sqrt-unprod36.4%
sqr-neg36.4%
sqrt-unprod20.8%
add-sqr-sqrt38.6%
*-commutative38.6%
Applied egg-rr38.6%
Taylor expanded in phi1 around 0 52.9%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 5e+84) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 5e+84) {
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 <= 5d+84) 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 <= 5e+84) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 5e+84: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 5e+84) 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 <= 5e+84) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 5e+84], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 5 \cdot 10^{+84}:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 5.0000000000000001e84Initial program 62.0%
hypot-define97.2%
Simplified97.2%
Taylor expanded in lambda2 around -inf 21.6%
mul-1-neg21.6%
associate-*r*21.6%
Simplified21.6%
Taylor expanded in phi2 around 0 19.7%
associate-*r*19.7%
Simplified19.7%
add-sqr-sqrt12.4%
sqrt-unprod18.3%
sqr-neg18.3%
sqrt-unprod8.0%
add-sqr-sqrt16.3%
*-commutative16.3%
Applied egg-rr16.3%
Taylor expanded in phi1 around 0 16.5%
if 5.0000000000000001e84 < phi2 Initial program 51.1%
hypot-define96.5%
Simplified96.5%
Taylor expanded in phi2 around inf 67.6%
(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 60.2%
hypot-define97.1%
Simplified97.1%
Taylor expanded in lambda2 around -inf 20.3%
mul-1-neg20.3%
associate-*r*20.2%
Simplified20.2%
Taylor expanded in phi2 around 0 17.2%
associate-*r*17.2%
Simplified17.2%
add-sqr-sqrt10.8%
sqrt-unprod17.0%
sqr-neg17.0%
sqrt-unprod7.4%
add-sqr-sqrt15.0%
*-commutative15.0%
Applied egg-rr15.0%
Taylor expanded in phi1 around 0 15.2%
herbie shell --seed 2024169
(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))))))