
(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 16 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)))
(pow (cbrt (* (sin (* phi1 0.5)) (sin (* 0.5 phi2)))) 3.0)))
(- 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))) - pow(cbrt((sin((phi1 * 0.5)) * sin((0.5 * phi2)))), 3.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 * 0.5)) * Math.cos((0.5 * phi2))) - Math.pow(Math.cbrt((Math.sin((phi1 * 0.5)) * Math.sin((0.5 * phi2)))), 3.0))), (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))) - (cbrt(Float64(sin(Float64(phi1 * 0.5)) * sin(Float64(0.5 * phi2)))) ^ 3.0))), Float64(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[Power[N[Power[N[(N[Sin[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sin[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision], 3.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 \left(\cos \left(\phi_1 \cdot 0.5\right) \cdot \cos \left(0.5 \cdot \phi_2\right) - {\left(\sqrt[3]{\sin \left(\phi_1 \cdot 0.5\right) \cdot \sin \left(0.5 \cdot \phi_2\right)}\right)}^{3}\right), \phi_1 - \phi_2\right)
\end{array}
Initial program 61.6%
hypot-define96.4%
Simplified96.4%
add-log-exp96.3%
div-inv96.3%
metadata-eval96.3%
Applied egg-rr96.3%
rem-log-exp96.4%
*-commutative96.4%
distribute-rgt-in96.4%
cos-sum99.8%
Applied egg-rr99.8%
add-cube-cbrt99.8%
pow399.9%
*-commutative99.9%
Applied egg-rr99.9%
Final simplification99.9%
(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.6%
hypot-define96.4%
Simplified96.4%
add-log-exp96.3%
div-inv96.3%
metadata-eval96.3%
Applied egg-rr96.3%
rem-log-exp96.4%
*-commutative96.4%
distribute-rgt-in96.4%
cos-sum99.8%
Applied egg-rr99.8%
Final simplification99.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -0.14) (* 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 (phi1 <= -0.14) {
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 (phi1 <= -0.14) {
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 phi1 <= -0.14: 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 (phi1 <= -0.14) 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 (phi1 <= -0.14) 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[phi1, -0.14], 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_1 \leq -0.14:\\
\;\;\;\;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 phi1 < -0.14000000000000001Initial program 55.8%
hypot-define93.6%
Simplified93.6%
Taylor expanded in phi2 around 0 93.7%
*-commutative93.7%
Simplified93.7%
if -0.14000000000000001 < phi1 Initial program 63.9%
hypot-define97.5%
Simplified97.5%
Taylor expanded in phi1 around 0 93.0%
*-commutative93.0%
Simplified93.0%
Final simplification93.2%
(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.6%
hypot-define96.4%
Simplified96.4%
(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 61.6%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi2 around 0 91.7%
*-commutative91.7%
Simplified91.7%
Final simplification91.7%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -3.5e-14)
(* R (* phi1 (+ (/ phi2 phi1) -1.0)))
(if (<= phi1 4.1e-124)
(* R (* (* lambda2 (cos (* phi1 0.5))) (- 1.0 (/ lambda1 lambda2))))
(* R (* phi2 (- 1.0 (/ phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.5e-14) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else if (phi1 <= 4.1e-124) {
tmp = R * ((lambda2 * cos((phi1 * 0.5))) * (1.0 - (lambda1 / lambda2)));
} else {
tmp = R * (phi2 * (1.0 - (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 (phi1 <= (-3.5d-14)) then
tmp = r * (phi1 * ((phi2 / phi1) + (-1.0d0)))
else if (phi1 <= 4.1d-124) then
tmp = r * ((lambda2 * cos((phi1 * 0.5d0))) * (1.0d0 - (lambda1 / lambda2)))
else
tmp = r * (phi2 * (1.0d0 - (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 (phi1 <= -3.5e-14) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else if (phi1 <= 4.1e-124) {
tmp = R * ((lambda2 * Math.cos((phi1 * 0.5))) * (1.0 - (lambda1 / lambda2)));
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -3.5e-14: tmp = R * (phi1 * ((phi2 / phi1) + -1.0)) elif phi1 <= 4.1e-124: tmp = R * ((lambda2 * math.cos((phi1 * 0.5))) * (1.0 - (lambda1 / lambda2))) else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -3.5e-14) tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0))); elseif (phi1 <= 4.1e-124) tmp = Float64(R * Float64(Float64(lambda2 * cos(Float64(phi1 * 0.5))) * Float64(1.0 - Float64(lambda1 / lambda2)))); 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 (phi1 <= -3.5e-14) tmp = R * (phi1 * ((phi2 / phi1) + -1.0)); elseif (phi1 <= 4.1e-124) tmp = R * ((lambda2 * cos((phi1 * 0.5))) * (1.0 - (lambda1 / lambda2))); else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -3.5e-14], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 4.1e-124], N[(R * N[(N[(lambda2 * N[Cos[N[(phi1 * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(lambda1 / lambda2), $MachinePrecision]), $MachinePrecision]), $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_1 \leq -3.5 \cdot 10^{-14}:\\
\;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 4.1 \cdot 10^{-124}:\\
\;\;\;\;R \cdot \left(\left(\lambda_2 \cdot \cos \left(\phi_1 \cdot 0.5\right)\right) \cdot \left(1 - \frac{\lambda_1}{\lambda_2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi1 < -3.5000000000000002e-14Initial program 57.6%
hypot-define93.8%
Simplified93.8%
Taylor expanded in phi1 around -inf 62.3%
mul-1-neg62.3%
distribute-rgt-neg-in62.3%
mul-1-neg62.3%
unsub-neg62.3%
Simplified62.3%
if -3.5000000000000002e-14 < phi1 < 4.1000000000000004e-124Initial program 66.0%
hypot-define99.7%
Simplified99.7%
Taylor expanded in lambda2 around -inf 38.4%
mul-1-neg38.4%
distribute-rgt-neg-in38.4%
+-commutative38.4%
mul-1-neg38.4%
unsub-neg38.4%
associate-/l*35.0%
*-commutative35.0%
associate-/l*35.0%
Simplified35.0%
pow135.0%
Applied egg-rr33.4%
unpow133.4%
associate-*r*31.2%
*-commutative31.2%
*-commutative31.2%
Simplified31.2%
Taylor expanded in phi2 around 0 27.3%
associate-*r*27.3%
Simplified27.3%
if 4.1000000000000004e-124 < phi1 Initial program 60.8%
hypot-define95.3%
Simplified95.3%
Taylor expanded in phi2 around inf 11.5%
mul-1-neg11.5%
unsub-neg11.5%
Simplified11.5%
Final simplification31.6%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(if (<= phi1 -3.7e-14)
(* R (* phi1 (+ (/ phi2 phi1) -1.0)))
(if (<= phi1 8.6e-104)
(* R (* lambda2 (* (cos (* 0.5 phi2)) (- 1.0 (/ lambda1 lambda2)))))
(* R (* phi2 (- 1.0 (/ phi1 phi2)))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -3.7e-14) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else if (phi1 <= 8.6e-104) {
tmp = R * (lambda2 * (cos((0.5 * phi2)) * (1.0 - (lambda1 / lambda2))));
} else {
tmp = R * (phi2 * (1.0 - (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 (phi1 <= (-3.7d-14)) then
tmp = r * (phi1 * ((phi2 / phi1) + (-1.0d0)))
else if (phi1 <= 8.6d-104) then
tmp = r * (lambda2 * (cos((0.5d0 * phi2)) * (1.0d0 - (lambda1 / lambda2))))
else
tmp = r * (phi2 * (1.0d0 - (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 (phi1 <= -3.7e-14) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else if (phi1 <= 8.6e-104) {
tmp = R * (lambda2 * (Math.cos((0.5 * phi2)) * (1.0 - (lambda1 / lambda2))));
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -3.7e-14: tmp = R * (phi1 * ((phi2 / phi1) + -1.0)) elif phi1 <= 8.6e-104: tmp = R * (lambda2 * (math.cos((0.5 * phi2)) * (1.0 - (lambda1 / lambda2)))) else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -3.7e-14) tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0))); elseif (phi1 <= 8.6e-104) tmp = Float64(R * Float64(lambda2 * Float64(cos(Float64(0.5 * phi2)) * Float64(1.0 - Float64(lambda1 / lambda2))))); 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 (phi1 <= -3.7e-14) tmp = R * (phi1 * ((phi2 / phi1) + -1.0)); elseif (phi1 <= 8.6e-104) tmp = R * (lambda2 * (cos((0.5 * phi2)) * (1.0 - (lambda1 / lambda2)))); else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -3.7e-14], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi1, 8.6e-104], N[(R * N[(lambda2 * N[(N[Cos[N[(0.5 * phi2), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(lambda1 / lambda2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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_1 \leq -3.7 \cdot 10^{-14}:\\
\;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\
\mathbf{elif}\;\phi_1 \leq 8.6 \cdot 10^{-104}:\\
\;\;\;\;R \cdot \left(\lambda_2 \cdot \left(\cos \left(0.5 \cdot \phi_2\right) \cdot \left(1 - \frac{\lambda_1}{\lambda_2}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi1 < -3.70000000000000001e-14Initial program 57.6%
hypot-define93.8%
Simplified93.8%
Taylor expanded in phi1 around -inf 62.3%
mul-1-neg62.3%
distribute-rgt-neg-in62.3%
mul-1-neg62.3%
unsub-neg62.3%
Simplified62.3%
if -3.70000000000000001e-14 < phi1 < 8.6000000000000002e-104Initial program 65.7%
hypot-define99.7%
Simplified99.7%
Taylor expanded in lambda2 around -inf 37.5%
mul-1-neg37.5%
distribute-rgt-neg-in37.5%
+-commutative37.5%
mul-1-neg37.5%
unsub-neg37.5%
associate-/l*34.2%
*-commutative34.2%
associate-/l*34.2%
Simplified34.2%
pow134.2%
Applied egg-rr32.8%
unpow132.8%
associate-*r*30.7%
*-commutative30.7%
*-commutative30.7%
Simplified30.7%
Taylor expanded in phi1 around 0 31.8%
if 8.6000000000000002e-104 < phi1 Initial program 61.0%
hypot-define95.2%
Simplified95.2%
Taylor expanded in phi2 around inf 11.8%
mul-1-neg11.8%
unsub-neg11.8%
Simplified11.8%
Final simplification33.3%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (- (* R (/ phi2 phi1)) R))))
(if (<= phi2 1.92e-196)
t_0
(if (<= phi2 1.15e-96)
(* (* R lambda1) (- (cos (* 0.5 (+ phi1 phi2)))))
(if (<= phi2 4.8e+40) t_0 (* R (* phi2 (- 1.0 (/ phi1 phi2)))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * ((R * (phi2 / phi1)) - R);
double tmp;
if (phi2 <= 1.92e-196) {
tmp = t_0;
} else if (phi2 <= 1.15e-96) {
tmp = (R * lambda1) * -cos((0.5 * (phi1 + phi2)));
} else if (phi2 <= 4.8e+40) {
tmp = t_0;
} else {
tmp = R * (phi2 * (1.0 - (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) :: t_0
real(8) :: tmp
t_0 = phi1 * ((r * (phi2 / phi1)) - r)
if (phi2 <= 1.92d-196) then
tmp = t_0
else if (phi2 <= 1.15d-96) then
tmp = (r * lambda1) * -cos((0.5d0 * (phi1 + phi2)))
else if (phi2 <= 4.8d+40) then
tmp = t_0
else
tmp = r * (phi2 * (1.0d0 - (phi1 / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * ((R * (phi2 / phi1)) - R);
double tmp;
if (phi2 <= 1.92e-196) {
tmp = t_0;
} else if (phi2 <= 1.15e-96) {
tmp = (R * lambda1) * -Math.cos((0.5 * (phi1 + phi2)));
} else if (phi2 <= 4.8e+40) {
tmp = t_0;
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * ((R * (phi2 / phi1)) - R) tmp = 0 if phi2 <= 1.92e-196: tmp = t_0 elif phi2 <= 1.15e-96: tmp = (R * lambda1) * -math.cos((0.5 * (phi1 + phi2))) elif phi2 <= 4.8e+40: tmp = t_0 else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)) tmp = 0.0 if (phi2 <= 1.92e-196) tmp = t_0; elseif (phi2 <= 1.15e-96) tmp = Float64(Float64(R * lambda1) * Float64(-cos(Float64(0.5 * Float64(phi1 + phi2))))); elseif (phi2 <= 4.8e+40) tmp = t_0; 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) t_0 = phi1 * ((R * (phi2 / phi1)) - R); tmp = 0.0; if (phi2 <= 1.92e-196) tmp = t_0; elseif (phi2 <= 1.15e-96) tmp = (R * lambda1) * -cos((0.5 * (phi1 + phi2))); elseif (phi2 <= 4.8e+40) tmp = t_0; else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 1.92e-196], t$95$0, If[LessEqual[phi2, 1.15e-96], N[(N[(R * lambda1), $MachinePrecision] * (-N[Cos[N[(0.5 * N[(phi1 + phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[phi2, 4.8e+40], t$95$0, N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{if}\;\phi_2 \leq 1.92 \cdot 10^{-196}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 1.15 \cdot 10^{-96}:\\
\;\;\;\;\left(R \cdot \lambda_1\right) \cdot \left(-\cos \left(0.5 \cdot \left(\phi_1 + \phi_2\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 4.8 \cdot 10^{+40}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi2 < 1.9200000000000001e-196 or 1.15e-96 < phi2 < 4.8e40Initial program 63.6%
hypot-define96.7%
Simplified96.7%
Taylor expanded in phi1 around -inf 22.1%
mul-1-neg22.1%
distribute-rgt-neg-in22.1%
mul-1-neg22.1%
unsub-neg22.1%
associate-/l*23.2%
Simplified23.2%
if 1.9200000000000001e-196 < phi2 < 1.15e-96Initial program 62.3%
hypot-define100.0%
Simplified100.0%
Taylor expanded in lambda2 around -inf 33.5%
mul-1-neg33.5%
distribute-rgt-neg-in33.5%
+-commutative33.5%
mul-1-neg33.5%
unsub-neg33.5%
associate-/l*33.5%
*-commutative33.5%
associate-/l*33.4%
Simplified33.4%
pow133.4%
Applied egg-rr41.9%
unpow141.9%
associate-*r*41.9%
*-commutative41.9%
*-commutative41.9%
Simplified41.9%
Taylor expanded in lambda2 around 0 42.0%
mul-1-neg42.0%
associate-*r*42.0%
distribute-rgt-neg-in42.0%
Simplified42.0%
if 4.8e40 < phi2 Initial program 54.5%
hypot-define93.7%
Simplified93.7%
Taylor expanded in phi2 around inf 67.7%
mul-1-neg67.7%
unsub-neg67.7%
Simplified67.7%
Final simplification34.1%
(FPCore (R lambda1 lambda2 phi1 phi2)
:precision binary64
(let* ((t_0 (* phi1 (- (* R (/ phi2 phi1)) R))))
(if (<= phi2 5.2e-201)
t_0
(if (<= phi2 1.1e-96)
(* R (* lambda1 (- (cos (* 0.5 (+ phi1 phi2))))))
(if (<= phi2 4.1e+40) t_0 (* R (* phi2 (- 1.0 (/ phi1 phi2)))))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * ((R * (phi2 / phi1)) - R);
double tmp;
if (phi2 <= 5.2e-201) {
tmp = t_0;
} else if (phi2 <= 1.1e-96) {
tmp = R * (lambda1 * -cos((0.5 * (phi1 + phi2))));
} else if (phi2 <= 4.1e+40) {
tmp = t_0;
} else {
tmp = R * (phi2 * (1.0 - (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) :: t_0
real(8) :: tmp
t_0 = phi1 * ((r * (phi2 / phi1)) - r)
if (phi2 <= 5.2d-201) then
tmp = t_0
else if (phi2 <= 1.1d-96) then
tmp = r * (lambda1 * -cos((0.5d0 * (phi1 + phi2))))
else if (phi2 <= 4.1d+40) then
tmp = t_0
else
tmp = r * (phi2 * (1.0d0 - (phi1 / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double t_0 = phi1 * ((R * (phi2 / phi1)) - R);
double tmp;
if (phi2 <= 5.2e-201) {
tmp = t_0;
} else if (phi2 <= 1.1e-96) {
tmp = R * (lambda1 * -Math.cos((0.5 * (phi1 + phi2))));
} else if (phi2 <= 4.1e+40) {
tmp = t_0;
} else {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): t_0 = phi1 * ((R * (phi2 / phi1)) - R) tmp = 0 if phi2 <= 5.2e-201: tmp = t_0 elif phi2 <= 1.1e-96: tmp = R * (lambda1 * -math.cos((0.5 * (phi1 + phi2)))) elif phi2 <= 4.1e+40: tmp = t_0 else: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) t_0 = Float64(phi1 * Float64(Float64(R * Float64(phi2 / phi1)) - R)) tmp = 0.0 if (phi2 <= 5.2e-201) tmp = t_0; elseif (phi2 <= 1.1e-96) tmp = Float64(R * Float64(lambda1 * Float64(-cos(Float64(0.5 * Float64(phi1 + phi2)))))); elseif (phi2 <= 4.1e+40) tmp = t_0; 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) t_0 = phi1 * ((R * (phi2 / phi1)) - R); tmp = 0.0; if (phi2 <= 5.2e-201) tmp = t_0; elseif (phi2 <= 1.1e-96) tmp = R * (lambda1 * -cos((0.5 * (phi1 + phi2)))); elseif (phi2 <= 4.1e+40) tmp = t_0; else tmp = R * (phi2 * (1.0 - (phi1 / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := Block[{t$95$0 = N[(phi1 * N[(N[(R * N[(phi2 / phi1), $MachinePrecision]), $MachinePrecision] - R), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[phi2, 5.2e-201], t$95$0, If[LessEqual[phi2, 1.1e-96], N[(R * N[(lambda1 * (-N[Cos[N[(0.5 * N[(phi1 + phi2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision], If[LessEqual[phi2, 4.1e+40], t$95$0, N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \phi_1 \cdot \left(R \cdot \frac{\phi_2}{\phi_1} - R\right)\\
\mathbf{if}\;\phi_2 \leq 5.2 \cdot 10^{-201}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;\phi_2 \leq 1.1 \cdot 10^{-96}:\\
\;\;\;\;R \cdot \left(\lambda_1 \cdot \left(-\cos \left(0.5 \cdot \left(\phi_1 + \phi_2\right)\right)\right)\right)\\
\mathbf{elif}\;\phi_2 \leq 4.1 \cdot 10^{+40}:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\end{array}
\end{array}
if phi2 < 5.19999999999999965e-201 or 1.0999999999999999e-96 < phi2 < 4.1000000000000002e40Initial program 63.6%
hypot-define96.7%
Simplified96.7%
Taylor expanded in phi1 around -inf 22.1%
mul-1-neg22.1%
distribute-rgt-neg-in22.1%
mul-1-neg22.1%
unsub-neg22.1%
associate-/l*23.2%
Simplified23.2%
if 5.19999999999999965e-201 < phi2 < 1.0999999999999999e-96Initial program 62.3%
hypot-define100.0%
Simplified100.0%
Taylor expanded in lambda1 around -inf 42.0%
mul-1-neg42.0%
distribute-rgt-neg-in42.0%
*-commutative42.0%
distribute-rgt-neg-in42.0%
Simplified42.0%
if 4.1000000000000002e40 < phi2 Initial program 54.5%
hypot-define93.7%
Simplified93.7%
Taylor expanded in phi2 around inf 67.7%
mul-1-neg67.7%
unsub-neg67.7%
Simplified67.7%
Final simplification34.1%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -1.2e-13) (* R (* phi1 (+ (/ phi2 phi1) -1.0))) (* phi2 (- R (* phi1 (/ R phi2))))))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.2e-13) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else {
tmp = phi2 * (R - (phi1 * (R / phi2)));
}
return tmp;
}
real(8) function code(r, lambda1, lambda2, phi1, phi2)
real(8), intent (in) :: r
real(8), intent (in) :: lambda1
real(8), intent (in) :: lambda2
real(8), intent (in) :: phi1
real(8), intent (in) :: phi2
real(8) :: tmp
if (phi1 <= (-1.2d-13)) then
tmp = r * (phi1 * ((phi2 / phi1) + (-1.0d0)))
else
tmp = phi2 * (r - (phi1 * (r / phi2)))
end if
code = tmp
end function
public static double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -1.2e-13) {
tmp = R * (phi1 * ((phi2 / phi1) + -1.0));
} else {
tmp = phi2 * (R - (phi1 * (R / phi2)));
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -1.2e-13: tmp = R * (phi1 * ((phi2 / phi1) + -1.0)) else: tmp = phi2 * (R - (phi1 * (R / phi2))) return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -1.2e-13) tmp = Float64(R * Float64(phi1 * Float64(Float64(phi2 / phi1) + -1.0))); else tmp = Float64(phi2 * Float64(R - Float64(phi1 * Float64(R / phi2)))); end return tmp end
function tmp_2 = code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0; if (phi1 <= -1.2e-13) tmp = R * (phi1 * ((phi2 / phi1) + -1.0)); else tmp = phi2 * (R - (phi1 * (R / phi2))); end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -1.2e-13], N[(R * N[(phi1 * N[(N[(phi2 / phi1), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(phi2 * N[(R - N[(phi1 * N[(R / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -1.2 \cdot 10^{-13}:\\
\;\;\;\;R \cdot \left(\phi_1 \cdot \left(\frac{\phi_2}{\phi_1} + -1\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\phi_2 \cdot \left(R - \phi_1 \cdot \frac{R}{\phi_2}\right)\\
\end{array}
\end{array}
if phi1 < -1.1999999999999999e-13Initial program 57.6%
hypot-define93.8%
Simplified93.8%
Taylor expanded in phi1 around -inf 62.3%
mul-1-neg62.3%
distribute-rgt-neg-in62.3%
mul-1-neg62.3%
unsub-neg62.3%
Simplified62.3%
if -1.1999999999999999e-13 < phi1 Initial program 63.3%
hypot-define97.4%
Simplified97.4%
Taylor expanded in phi2 around inf 15.7%
mul-1-neg15.7%
unsub-neg15.7%
*-commutative15.7%
associate-/l*17.8%
Simplified17.8%
Final simplification30.7%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 3.2e+194) (* phi2 (- R (* phi1 (/ R phi2)))) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 3.2e+194) {
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 <= 3.2d+194) 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 <= 3.2e+194) {
tmp = phi2 * (R - (phi1 * (R / phi2)));
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 3.2e+194: tmp = phi2 * (R - (phi1 * (R / phi2))) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 3.2e+194) 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 <= 3.2e+194) tmp = phi2 * (R - (phi1 * (R / phi2))); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 3.2e+194], 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 3.2 \cdot 10^{+194}:\\
\;\;\;\;\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 < 3.20000000000000021e194Initial program 62.6%
hypot-define96.5%
Simplified96.5%
Taylor expanded in phi2 around inf 31.7%
mul-1-neg31.7%
unsub-neg31.7%
*-commutative31.7%
associate-/l*29.8%
Simplified29.8%
if 3.20000000000000021e194 < lambda2 Initial program 50.5%
hypot-define95.5%
Simplified95.5%
Taylor expanded in lambda2 around -inf 37.9%
mul-1-neg37.9%
distribute-rgt-neg-in37.9%
*-commutative37.9%
distribute-rgt-neg-in37.9%
Simplified37.9%
Taylor expanded in phi1 around 0 33.9%
associate-*r*33.9%
neg-mul-133.9%
Simplified33.9%
Taylor expanded in phi2 around 0 0.3%
associate-*r*0.3%
mul-1-neg0.3%
Simplified0.3%
add-sqr-sqrt0.0%
sqrt-unprod23.0%
sqr-neg23.0%
sqrt-unprod24.9%
add-sqr-sqrt60.5%
*-un-lft-identity60.5%
Applied egg-rr60.5%
*-lft-identity60.5%
Simplified60.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 2.9e+199) (* phi2 (- R (* R (/ phi1 phi2)))) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 2.9e+199) {
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 <= 2.9d+199) 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 <= 2.9e+199) {
tmp = phi2 * (R - (R * (phi1 / phi2)));
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 2.9e+199: tmp = phi2 * (R - (R * (phi1 / phi2))) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 2.9e+199) 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 <= 2.9e+199) tmp = phi2 * (R - (R * (phi1 / phi2))); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 2.9e+199], 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 2.9 \cdot 10^{+199}:\\
\;\;\;\;\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 < 2.8999999999999999e199Initial program 62.4%
hypot-define96.5%
Simplified96.5%
add-log-exp96.4%
div-inv96.4%
metadata-eval96.4%
Applied egg-rr96.4%
Taylor expanded in phi2 around inf 31.6%
mul-1-neg31.6%
unsub-neg31.6%
associate-/l*28.2%
Simplified28.2%
if 2.8999999999999999e199 < lambda2 Initial program 52.7%
hypot-define95.4%
Simplified95.4%
Taylor expanded in lambda2 around -inf 34.9%
mul-1-neg34.9%
distribute-rgt-neg-in34.9%
*-commutative34.9%
distribute-rgt-neg-in34.9%
Simplified34.9%
Taylor expanded in phi1 around 0 30.6%
associate-*r*30.6%
neg-mul-130.6%
Simplified30.6%
Taylor expanded in phi2 around 0 0.3%
associate-*r*0.3%
mul-1-neg0.3%
Simplified0.3%
add-sqr-sqrt0.0%
sqrt-unprod23.4%
sqr-neg23.4%
sqrt-unprod25.4%
add-sqr-sqrt62.8%
*-un-lft-identity62.8%
Applied egg-rr62.8%
*-lft-identity62.8%
Simplified62.8%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= lambda2 1.05e+175) (* R (* phi2 (- 1.0 (/ phi1 phi2)))) (* R lambda2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (lambda2 <= 1.05e+175) {
tmp = R * (phi2 * (1.0 - (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 <= 1.05d+175) then
tmp = r * (phi2 * (1.0d0 - (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 <= 1.05e+175) {
tmp = R * (phi2 * (1.0 - (phi1 / phi2)));
} else {
tmp = R * lambda2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if lambda2 <= 1.05e+175: tmp = R * (phi2 * (1.0 - (phi1 / phi2))) else: tmp = R * lambda2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (lambda2 <= 1.05e+175) tmp = Float64(R * Float64(phi2 * Float64(1.0 - 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 <= 1.05e+175) tmp = R * (phi2 * (1.0 - (phi1 / phi2))); else tmp = R * lambda2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[lambda2, 1.05e+175], N[(R * N[(phi2 * N[(1.0 - N[(phi1 / phi2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(R * lambda2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\lambda_2 \leq 1.05 \cdot 10^{+175}:\\
\;\;\;\;R \cdot \left(\phi_2 \cdot \left(1 - \frac{\phi_1}{\phi_2}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \lambda_2\\
\end{array}
\end{array}
if lambda2 < 1.05e175Initial program 63.3%
hypot-define96.4%
Simplified96.4%
Taylor expanded in phi2 around inf 28.5%
mul-1-neg28.5%
unsub-neg28.5%
Simplified28.5%
if 1.05e175 < lambda2 Initial program 47.5%
hypot-define96.4%
Simplified96.4%
Taylor expanded in lambda2 around -inf 33.8%
mul-1-neg33.8%
distribute-rgt-neg-in33.8%
*-commutative33.8%
distribute-rgt-neg-in33.8%
Simplified33.8%
Taylor expanded in phi1 around 0 26.7%
associate-*r*26.7%
neg-mul-126.7%
Simplified26.7%
Taylor expanded in phi2 around 0 0.4%
associate-*r*0.4%
mul-1-neg0.4%
Simplified0.4%
add-sqr-sqrt0.1%
sqrt-unprod22.5%
sqr-neg22.5%
sqrt-unprod24.1%
add-sqr-sqrt56.6%
*-un-lft-identity56.6%
Applied egg-rr56.6%
*-lft-identity56.6%
Simplified56.6%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi1 -9.5e-50) (* R (- phi1)) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi1 <= -9.5e-50) {
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 <= (-9.5d-50)) 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 <= -9.5e-50) {
tmp = R * -phi1;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi1 <= -9.5e-50: tmp = R * -phi1 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi1 <= -9.5e-50) 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 <= -9.5e-50) tmp = R * -phi1; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi1, -9.5e-50], N[(R * (-phi1)), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_1 \leq -9.5 \cdot 10^{-50}:\\
\;\;\;\;R \cdot \left(-\phi_1\right)\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi1 < -9.4999999999999993e-50Initial program 56.5%
hypot-define94.2%
Simplified94.2%
Taylor expanded in phi1 around -inf 56.1%
mul-1-neg56.1%
distribute-rgt-neg-in56.1%
Simplified56.1%
if -9.4999999999999993e-50 < phi1 Initial program 64.0%
hypot-define97.4%
Simplified97.4%
Taylor expanded in phi2 around inf 16.5%
(FPCore (R lambda1 lambda2 phi1 phi2) :precision binary64 (if (<= phi2 920000000000.0) (* R lambda2) (* R phi2)))
double code(double R, double lambda1, double lambda2, double phi1, double phi2) {
double tmp;
if (phi2 <= 920000000000.0) {
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 <= 920000000000.0d0) 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 <= 920000000000.0) {
tmp = R * lambda2;
} else {
tmp = R * phi2;
}
return tmp;
}
def code(R, lambda1, lambda2, phi1, phi2): tmp = 0 if phi2 <= 920000000000.0: tmp = R * lambda2 else: tmp = R * phi2 return tmp
function code(R, lambda1, lambda2, phi1, phi2) tmp = 0.0 if (phi2 <= 920000000000.0) 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 <= 920000000000.0) tmp = R * lambda2; else tmp = R * phi2; end tmp_2 = tmp; end
code[R_, lambda1_, lambda2_, phi1_, phi2_] := If[LessEqual[phi2, 920000000000.0], N[(R * lambda2), $MachinePrecision], N[(R * phi2), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\phi_2 \leq 920000000000:\\
\;\;\;\;R \cdot \lambda_2\\
\mathbf{else}:\\
\;\;\;\;R \cdot \phi_2\\
\end{array}
\end{array}
if phi2 < 9.2e11Initial program 63.2%
hypot-define97.4%
Simplified97.4%
Taylor expanded in lambda2 around -inf 18.6%
mul-1-neg18.6%
distribute-rgt-neg-in18.6%
*-commutative18.6%
distribute-rgt-neg-in18.6%
Simplified18.6%
Taylor expanded in phi1 around 0 17.4%
associate-*r*17.4%
neg-mul-117.4%
Simplified17.4%
Taylor expanded in phi2 around 0 15.3%
associate-*r*15.3%
mul-1-neg15.3%
Simplified15.3%
add-sqr-sqrt5.6%
sqrt-unprod16.7%
sqr-neg16.7%
sqrt-unprod7.4%
add-sqr-sqrt14.1%
*-un-lft-identity14.1%
Applied egg-rr14.1%
*-lft-identity14.1%
Simplified14.1%
if 9.2e11 < phi2 Initial program 56.4%
hypot-define92.8%
Simplified92.8%
Taylor expanded in phi2 around inf 55.3%
(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.6%
hypot-define96.4%
Simplified96.4%
Taylor expanded in lambda2 around -inf 15.4%
mul-1-neg15.4%
distribute-rgt-neg-in15.4%
*-commutative15.4%
distribute-rgt-neg-in15.4%
Simplified15.4%
Taylor expanded in phi1 around 0 15.2%
associate-*r*15.2%
neg-mul-115.2%
Simplified15.2%
Taylor expanded in phi2 around 0 13.4%
associate-*r*13.4%
mul-1-neg13.4%
Simplified13.4%
add-sqr-sqrt5.1%
sqrt-unprod15.2%
sqr-neg15.2%
sqrt-unprod6.2%
add-sqr-sqrt12.0%
*-un-lft-identity12.0%
Applied egg-rr12.0%
*-lft-identity12.0%
Simplified12.0%
herbie shell --seed 2024136
(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))))))