
(FPCore (a k m) :precision binary64 (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))
double code(double a, double k, double m) {
return (a * pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k));
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
code = (a * (k ** m)) / ((1.0d0 + (10.0d0 * k)) + (k * k))
end function
public static double code(double a, double k, double m) {
return (a * Math.pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k));
}
def code(a, k, m): return (a * math.pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k))
function code(a, k, m) return Float64(Float64(a * (k ^ m)) / Float64(Float64(1.0 + Float64(10.0 * k)) + Float64(k * k))) end
function tmp = code(a, k, m) tmp = (a * (k ^ m)) / ((1.0 + (10.0 * k)) + (k * k)); end
code[a_, k_, m_] := N[(N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + N[(10.0 * k), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a k m) :precision binary64 (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))
double code(double a, double k, double m) {
return (a * pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k));
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
code = (a * (k ** m)) / ((1.0d0 + (10.0d0 * k)) + (k * k))
end function
public static double code(double a, double k, double m) {
return (a * Math.pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k));
}
def code(a, k, m): return (a * math.pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k))
function code(a, k, m) return Float64(Float64(a * (k ^ m)) / Float64(Float64(1.0 + Float64(10.0 * k)) + Float64(k * k))) end
function tmp = code(a, k, m) tmp = (a * (k ^ m)) / ((1.0 + (10.0 * k)) + (k * k)); end
code[a_, k_, m_] := N[(N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + N[(10.0 * k), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}
\end{array}
(FPCore (a k m)
:precision binary64
(let* ((t_0 (* a (pow k m))))
(if (<= (/ t_0 (+ (+ 1.0 (* k 10.0)) (* k k))) 2e+270)
(* a (/ (pow k m) (+ 1.0 (* k (+ k 10.0)))))
t_0)))
double code(double a, double k, double m) {
double t_0 = a * pow(k, m);
double tmp;
if ((t_0 / ((1.0 + (k * 10.0)) + (k * k))) <= 2e+270) {
tmp = a * (pow(k, m) / (1.0 + (k * (k + 10.0))));
} else {
tmp = t_0;
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a * (k ** m)
if ((t_0 / ((1.0d0 + (k * 10.0d0)) + (k * k))) <= 2d+270) then
tmp = a * ((k ** m) / (1.0d0 + (k * (k + 10.0d0))))
else
tmp = t_0
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double t_0 = a * Math.pow(k, m);
double tmp;
if ((t_0 / ((1.0 + (k * 10.0)) + (k * k))) <= 2e+270) {
tmp = a * (Math.pow(k, m) / (1.0 + (k * (k + 10.0))));
} else {
tmp = t_0;
}
return tmp;
}
def code(a, k, m): t_0 = a * math.pow(k, m) tmp = 0 if (t_0 / ((1.0 + (k * 10.0)) + (k * k))) <= 2e+270: tmp = a * (math.pow(k, m) / (1.0 + (k * (k + 10.0)))) else: tmp = t_0 return tmp
function code(a, k, m) t_0 = Float64(a * (k ^ m)) tmp = 0.0 if (Float64(t_0 / Float64(Float64(1.0 + Float64(k * 10.0)) + Float64(k * k))) <= 2e+270) tmp = Float64(a * Float64((k ^ m) / Float64(1.0 + Float64(k * Float64(k + 10.0))))); else tmp = t_0; end return tmp end
function tmp_2 = code(a, k, m) t_0 = a * (k ^ m); tmp = 0.0; if ((t_0 / ((1.0 + (k * 10.0)) + (k * k))) <= 2e+270) tmp = a * ((k ^ m) / (1.0 + (k * (k + 10.0)))); else tmp = t_0; end tmp_2 = tmp; end
code[a_, k_, m_] := Block[{t$95$0 = N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 / N[(N[(1.0 + N[(k * 10.0), $MachinePrecision]), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+270], N[(a * N[(N[Power[k, m], $MachinePrecision] / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := a \cdot {k}^{m}\\
\mathbf{if}\;\frac{t\_0}{\left(1 + k \cdot 10\right) + k \cdot k} \leq 2 \cdot 10^{+270}:\\
\;\;\;\;a \cdot \frac{{k}^{m}}{1 + k \cdot \left(k + 10\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 #s(literal 1 binary64) (*.f64 #s(literal 10 binary64) k)) (*.f64 k k))) < 2.0000000000000001e270Initial program 98.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6498.0%
Simplified98.0%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6498.0%
Applied egg-rr98.0%
if 2.0000000000000001e270 < (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 #s(literal 1 binary64) (*.f64 #s(literal 10 binary64) k)) (*.f64 k k))) Initial program 60.3%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6460.3%
Simplified60.3%
Taylor expanded in k around 0
*-lowering-*.f64N/A
pow-lowering-pow.f64100.0%
Simplified100.0%
Final simplification98.5%
(FPCore (a k m)
:precision binary64
(let* ((t_0 (* a (pow k m))))
(if (<= m -2.5e-10)
t_0
(if (<= m 2.2e-15) (/ a (+ 1.0 (* k (+ k 10.0)))) t_0))))
double code(double a, double k, double m) {
double t_0 = a * pow(k, m);
double tmp;
if (m <= -2.5e-10) {
tmp = t_0;
} else if (m <= 2.2e-15) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = t_0;
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a * (k ** m)
if (m <= (-2.5d-10)) then
tmp = t_0
else if (m <= 2.2d-15) then
tmp = a / (1.0d0 + (k * (k + 10.0d0)))
else
tmp = t_0
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double t_0 = a * Math.pow(k, m);
double tmp;
if (m <= -2.5e-10) {
tmp = t_0;
} else if (m <= 2.2e-15) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = t_0;
}
return tmp;
}
def code(a, k, m): t_0 = a * math.pow(k, m) tmp = 0 if m <= -2.5e-10: tmp = t_0 elif m <= 2.2e-15: tmp = a / (1.0 + (k * (k + 10.0))) else: tmp = t_0 return tmp
function code(a, k, m) t_0 = Float64(a * (k ^ m)) tmp = 0.0 if (m <= -2.5e-10) tmp = t_0; elseif (m <= 2.2e-15) tmp = Float64(a / Float64(1.0 + Float64(k * Float64(k + 10.0)))); else tmp = t_0; end return tmp end
function tmp_2 = code(a, k, m) t_0 = a * (k ^ m); tmp = 0.0; if (m <= -2.5e-10) tmp = t_0; elseif (m <= 2.2e-15) tmp = a / (1.0 + (k * (k + 10.0))); else tmp = t_0; end tmp_2 = tmp; end
code[a_, k_, m_] := Block[{t$95$0 = N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[m, -2.5e-10], t$95$0, If[LessEqual[m, 2.2e-15], N[(a / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := a \cdot {k}^{m}\\
\mathbf{if}\;m \leq -2.5 \cdot 10^{-10}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;m \leq 2.2 \cdot 10^{-15}:\\
\;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if m < -2.50000000000000016e-10 or 2.19999999999999986e-15 < m Initial program 87.8%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6487.8%
Simplified87.8%
Taylor expanded in k around 0
*-lowering-*.f64N/A
pow-lowering-pow.f6498.5%
Simplified98.5%
if -2.50000000000000016e-10 < m < 2.19999999999999986e-15Initial program 94.3%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6494.3%
Simplified94.3%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified93.7%
(FPCore (a k m) :precision binary64 (if (<= k 7.5e-14) (* a (pow k m)) (* a (pow k (- m 2.0)))))
double code(double a, double k, double m) {
double tmp;
if (k <= 7.5e-14) {
tmp = a * pow(k, m);
} else {
tmp = a * pow(k, (m - 2.0));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (k <= 7.5d-14) then
tmp = a * (k ** m)
else
tmp = a * (k ** (m - 2.0d0))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (k <= 7.5e-14) {
tmp = a * Math.pow(k, m);
} else {
tmp = a * Math.pow(k, (m - 2.0));
}
return tmp;
}
def code(a, k, m): tmp = 0 if k <= 7.5e-14: tmp = a * math.pow(k, m) else: tmp = a * math.pow(k, (m - 2.0)) return tmp
function code(a, k, m) tmp = 0.0 if (k <= 7.5e-14) tmp = Float64(a * (k ^ m)); else tmp = Float64(a * (k ^ Float64(m - 2.0))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (k <= 7.5e-14) tmp = a * (k ^ m); else tmp = a * (k ^ (m - 2.0)); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[k, 7.5e-14], N[(a * N[Power[k, m], $MachinePrecision]), $MachinePrecision], N[(a * N[Power[k, N[(m - 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 7.5 \cdot 10^{-14}:\\
\;\;\;\;a \cdot {k}^{m}\\
\mathbf{else}:\\
\;\;\;\;a \cdot {k}^{\left(m - 2\right)}\\
\end{array}
\end{array}
if k < 7.4999999999999996e-14Initial program 92.8%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6492.8%
Simplified92.8%
Taylor expanded in k around 0
*-lowering-*.f64N/A
pow-lowering-pow.f64100.0%
Simplified100.0%
if 7.4999999999999996e-14 < k Initial program 83.5%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6483.5%
Simplified83.5%
Taylor expanded in k around inf
/-lowering-/.f64N/A
*-commutativeN/A
associate-*r*N/A
exp-prodN/A
neg-mul-1N/A
log-recN/A
remove-double-negN/A
rem-exp-logN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
unpow2N/A
*-lowering-*.f6482.3%
Simplified82.3%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow2N/A
pow-divN/A
pow-lowering-pow.f64N/A
--lowering--.f6495.1%
Applied egg-rr95.1%
Final simplification98.3%
(FPCore (a k m)
:precision binary64
(if (<= m -112000000.0)
(/ (- a (* (/ a k) (+ 10.0 (/ -99.0 k)))) (* k k))
(if (<= m 0.15)
(/ a (+ 1.0 (* k (+ k 10.0))))
(/
a
(+
1.0
(*
(/ (+ 1.0 (* (/ 1.0 (* k k)) (+ (/ 1000.0 k) -100.0))) k)
(/ k (/ 1.0 (+ (* k k) (- 100.0 (* k -10.0)))))))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k);
} else if (m <= 0.15) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a / (1.0 + (((1.0 + ((1.0 / (k * k)) * ((1000.0 / k) + -100.0))) / k) * (k / (1.0 / ((k * k) + (100.0 - (k * -10.0)))))));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-112000000.0d0)) then
tmp = (a - ((a / k) * (10.0d0 + ((-99.0d0) / k)))) / (k * k)
else if (m <= 0.15d0) then
tmp = a / (1.0d0 + (k * (k + 10.0d0)))
else
tmp = a / (1.0d0 + (((1.0d0 + ((1.0d0 / (k * k)) * ((1000.0d0 / k) + (-100.0d0)))) / k) * (k / (1.0d0 / ((k * k) + (100.0d0 - (k * (-10.0d0))))))))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k);
} else if (m <= 0.15) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a / (1.0 + (((1.0 + ((1.0 / (k * k)) * ((1000.0 / k) + -100.0))) / k) * (k / (1.0 / ((k * k) + (100.0 - (k * -10.0)))))));
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= -112000000.0: tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k) elif m <= 0.15: tmp = a / (1.0 + (k * (k + 10.0))) else: tmp = a / (1.0 + (((1.0 + ((1.0 / (k * k)) * ((1000.0 / k) + -100.0))) / k) * (k / (1.0 / ((k * k) + (100.0 - (k * -10.0))))))) return tmp
function code(a, k, m) tmp = 0.0 if (m <= -112000000.0) tmp = Float64(Float64(a - Float64(Float64(a / k) * Float64(10.0 + Float64(-99.0 / k)))) / Float64(k * k)); elseif (m <= 0.15) tmp = Float64(a / Float64(1.0 + Float64(k * Float64(k + 10.0)))); else tmp = Float64(a / Float64(1.0 + Float64(Float64(Float64(1.0 + Float64(Float64(1.0 / Float64(k * k)) * Float64(Float64(1000.0 / k) + -100.0))) / k) * Float64(k / Float64(1.0 / Float64(Float64(k * k) + Float64(100.0 - Float64(k * -10.0)))))))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= -112000000.0) tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k); elseif (m <= 0.15) tmp = a / (1.0 + (k * (k + 10.0))); else tmp = a / (1.0 + (((1.0 + ((1.0 / (k * k)) * ((1000.0 / k) + -100.0))) / k) * (k / (1.0 / ((k * k) + (100.0 - (k * -10.0))))))); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, -112000000.0], N[(N[(a - N[(N[(a / k), $MachinePrecision] * N[(10.0 + N[(-99.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 0.15], N[(a / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a / N[(1.0 + N[(N[(N[(1.0 + N[(N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision] * N[(N[(1000.0 / k), $MachinePrecision] + -100.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] * N[(k / N[(1.0 / N[(N[(k * k), $MachinePrecision] + N[(100.0 - N[(k * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -112000000:\\
\;\;\;\;\frac{a - \frac{a}{k} \cdot \left(10 + \frac{-99}{k}\right)}{k \cdot k}\\
\mathbf{elif}\;m \leq 0.15:\\
\;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{1 + \frac{1 + \frac{1}{k \cdot k} \cdot \left(\frac{1000}{k} + -100\right)}{k} \cdot \frac{k}{\frac{1}{k \cdot k + \left(100 - k \cdot -10\right)}}}\\
\end{array}
\end{array}
if m < -1.12e8Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
*-commutativeN/A
flip3-+N/A
div-invN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr73.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6413.5%
Simplified13.5%
Taylor expanded in k around inf
/-lowering-/.f64N/A
Simplified65.7%
if -1.12e8 < m < 0.149999999999999994Initial program 94.9%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6494.9%
Simplified94.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified88.0%
if 0.149999999999999994 < m Initial program 74.4%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6474.4%
Simplified74.4%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified2.9%
*-commutativeN/A
flip-+N/A
associate-*l/N/A
sub-negN/A
metadata-evalN/A
flip3-+N/A
div-invN/A
cube-unmultN/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr2.4%
Taylor expanded in k around inf
/-lowering-/.f64N/A
Simplified37.3%
Final simplification62.4%
(FPCore (a k m)
:precision binary64
(if (<= m -112000000.0)
(/ (- a (* (/ a k) (+ 10.0 (/ -99.0 k)))) (* k k))
(if (<= m 0.28)
(/ a (+ 1.0 (* k (+ k 10.0))))
(/
a
(+
1.0
(*
(/ k (/ 1.0 (+ (* k k) (- 100.0 (* k -10.0)))))
(/ (+ 1.0 (/ -100.0 (* k k))) k)))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k);
} else if (m <= 0.28) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a / (1.0 + ((k / (1.0 / ((k * k) + (100.0 - (k * -10.0))))) * ((1.0 + (-100.0 / (k * k))) / k)));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-112000000.0d0)) then
tmp = (a - ((a / k) * (10.0d0 + ((-99.0d0) / k)))) / (k * k)
else if (m <= 0.28d0) then
tmp = a / (1.0d0 + (k * (k + 10.0d0)))
else
tmp = a / (1.0d0 + ((k / (1.0d0 / ((k * k) + (100.0d0 - (k * (-10.0d0)))))) * ((1.0d0 + ((-100.0d0) / (k * k))) / k)))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k);
} else if (m <= 0.28) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a / (1.0 + ((k / (1.0 / ((k * k) + (100.0 - (k * -10.0))))) * ((1.0 + (-100.0 / (k * k))) / k)));
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= -112000000.0: tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k) elif m <= 0.28: tmp = a / (1.0 + (k * (k + 10.0))) else: tmp = a / (1.0 + ((k / (1.0 / ((k * k) + (100.0 - (k * -10.0))))) * ((1.0 + (-100.0 / (k * k))) / k))) return tmp
function code(a, k, m) tmp = 0.0 if (m <= -112000000.0) tmp = Float64(Float64(a - Float64(Float64(a / k) * Float64(10.0 + Float64(-99.0 / k)))) / Float64(k * k)); elseif (m <= 0.28) tmp = Float64(a / Float64(1.0 + Float64(k * Float64(k + 10.0)))); else tmp = Float64(a / Float64(1.0 + Float64(Float64(k / Float64(1.0 / Float64(Float64(k * k) + Float64(100.0 - Float64(k * -10.0))))) * Float64(Float64(1.0 + Float64(-100.0 / Float64(k * k))) / k)))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= -112000000.0) tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k); elseif (m <= 0.28) tmp = a / (1.0 + (k * (k + 10.0))); else tmp = a / (1.0 + ((k / (1.0 / ((k * k) + (100.0 - (k * -10.0))))) * ((1.0 + (-100.0 / (k * k))) / k))); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, -112000000.0], N[(N[(a - N[(N[(a / k), $MachinePrecision] * N[(10.0 + N[(-99.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 0.28], N[(a / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a / N[(1.0 + N[(N[(k / N[(1.0 / N[(N[(k * k), $MachinePrecision] + N[(100.0 - N[(k * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(-100.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -112000000:\\
\;\;\;\;\frac{a - \frac{a}{k} \cdot \left(10 + \frac{-99}{k}\right)}{k \cdot k}\\
\mathbf{elif}\;m \leq 0.28:\\
\;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{1 + \frac{k}{\frac{1}{k \cdot k + \left(100 - k \cdot -10\right)}} \cdot \frac{1 + \frac{-100}{k \cdot k}}{k}}\\
\end{array}
\end{array}
if m < -1.12e8Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
*-commutativeN/A
flip3-+N/A
div-invN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr73.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6413.5%
Simplified13.5%
Taylor expanded in k around inf
/-lowering-/.f64N/A
Simplified65.7%
if -1.12e8 < m < 0.28000000000000003Initial program 94.9%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6494.9%
Simplified94.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified88.0%
if 0.28000000000000003 < m Initial program 74.4%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6474.4%
Simplified74.4%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified2.9%
*-commutativeN/A
flip-+N/A
associate-*l/N/A
sub-negN/A
metadata-evalN/A
flip3-+N/A
div-invN/A
cube-unmultN/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr2.4%
Taylor expanded in k around inf
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6435.7%
Simplified35.7%
Final simplification61.9%
(FPCore (a k m)
:precision binary64
(if (<= m -112000000.0)
(/ (- a (* (/ a k) (+ 10.0 (/ -99.0 k)))) (* k k))
(if (<= m 0.9)
(/ a (+ 1.0 (* k (+ k 10.0))))
(/ a (+ 1.0 (* k (* k (+ 1.0 (/ (+ 10.0 (/ -1000.0 (* k k))) k)))))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k);
} else if (m <= 0.9) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a / (1.0 + (k * (k * (1.0 + ((10.0 + (-1000.0 / (k * k))) / k)))));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-112000000.0d0)) then
tmp = (a - ((a / k) * (10.0d0 + ((-99.0d0) / k)))) / (k * k)
else if (m <= 0.9d0) then
tmp = a / (1.0d0 + (k * (k + 10.0d0)))
else
tmp = a / (1.0d0 + (k * (k * (1.0d0 + ((10.0d0 + ((-1000.0d0) / (k * k))) / k)))))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k);
} else if (m <= 0.9) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a / (1.0 + (k * (k * (1.0 + ((10.0 + (-1000.0 / (k * k))) / k)))));
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= -112000000.0: tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k) elif m <= 0.9: tmp = a / (1.0 + (k * (k + 10.0))) else: tmp = a / (1.0 + (k * (k * (1.0 + ((10.0 + (-1000.0 / (k * k))) / k))))) return tmp
function code(a, k, m) tmp = 0.0 if (m <= -112000000.0) tmp = Float64(Float64(a - Float64(Float64(a / k) * Float64(10.0 + Float64(-99.0 / k)))) / Float64(k * k)); elseif (m <= 0.9) tmp = Float64(a / Float64(1.0 + Float64(k * Float64(k + 10.0)))); else tmp = Float64(a / Float64(1.0 + Float64(k * Float64(k * Float64(1.0 + Float64(Float64(10.0 + Float64(-1000.0 / Float64(k * k))) / k)))))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= -112000000.0) tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k); elseif (m <= 0.9) tmp = a / (1.0 + (k * (k + 10.0))); else tmp = a / (1.0 + (k * (k * (1.0 + ((10.0 + (-1000.0 / (k * k))) / k))))); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, -112000000.0], N[(N[(a - N[(N[(a / k), $MachinePrecision] * N[(10.0 + N[(-99.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 0.9], N[(a / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a / N[(1.0 + N[(k * N[(k * N[(1.0 + N[(N[(10.0 + N[(-1000.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -112000000:\\
\;\;\;\;\frac{a - \frac{a}{k} \cdot \left(10 + \frac{-99}{k}\right)}{k \cdot k}\\
\mathbf{elif}\;m \leq 0.9:\\
\;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{1 + k \cdot \left(k \cdot \left(1 + \frac{10 + \frac{-1000}{k \cdot k}}{k}\right)\right)}\\
\end{array}
\end{array}
if m < -1.12e8Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
*-commutativeN/A
flip3-+N/A
div-invN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr73.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6413.5%
Simplified13.5%
Taylor expanded in k around inf
/-lowering-/.f64N/A
Simplified65.7%
if -1.12e8 < m < 0.900000000000000022Initial program 94.9%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6494.9%
Simplified94.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified88.0%
if 0.900000000000000022 < m Initial program 74.4%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6474.4%
Simplified74.4%
*-commutativeN/A
flip3-+N/A
div-invN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr68.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f642.5%
Simplified2.5%
Taylor expanded in k around inf
metadata-evalN/A
pow-plusN/A
*-commutativeN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f642.5%
Simplified2.5%
Taylor expanded in k around -inf
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
Simplified35.0%
Final simplification61.7%
(FPCore (a k m)
:precision binary64
(if (<= m -112000000.0)
(/ (- a (* (/ a k) (+ 10.0 (/ -99.0 k)))) (* k k))
(if (<= m 0.086)
(/ a (+ 1.0 (* k (+ k 10.0))))
(+ a (* k (* a (- -10.0 (* k -99.0))))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k);
} else if (m <= 0.086) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a + (k * (a * (-10.0 - (k * -99.0))));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-112000000.0d0)) then
tmp = (a - ((a / k) * (10.0d0 + ((-99.0d0) / k)))) / (k * k)
else if (m <= 0.086d0) then
tmp = a / (1.0d0 + (k * (k + 10.0d0)))
else
tmp = a + (k * (a * ((-10.0d0) - (k * (-99.0d0)))))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k);
} else if (m <= 0.086) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a + (k * (a * (-10.0 - (k * -99.0))));
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= -112000000.0: tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k) elif m <= 0.086: tmp = a / (1.0 + (k * (k + 10.0))) else: tmp = a + (k * (a * (-10.0 - (k * -99.0)))) return tmp
function code(a, k, m) tmp = 0.0 if (m <= -112000000.0) tmp = Float64(Float64(a - Float64(Float64(a / k) * Float64(10.0 + Float64(-99.0 / k)))) / Float64(k * k)); elseif (m <= 0.086) tmp = Float64(a / Float64(1.0 + Float64(k * Float64(k + 10.0)))); else tmp = Float64(a + Float64(k * Float64(a * Float64(-10.0 - Float64(k * -99.0))))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= -112000000.0) tmp = (a - ((a / k) * (10.0 + (-99.0 / k)))) / (k * k); elseif (m <= 0.086) tmp = a / (1.0 + (k * (k + 10.0))); else tmp = a + (k * (a * (-10.0 - (k * -99.0)))); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, -112000000.0], N[(N[(a - N[(N[(a / k), $MachinePrecision] * N[(10.0 + N[(-99.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 0.086], N[(a / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(k * N[(a * N[(-10.0 - N[(k * -99.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -112000000:\\
\;\;\;\;\frac{a - \frac{a}{k} \cdot \left(10 + \frac{-99}{k}\right)}{k \cdot k}\\
\mathbf{elif}\;m \leq 0.086:\\
\;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\
\mathbf{else}:\\
\;\;\;\;a + k \cdot \left(a \cdot \left(-10 - k \cdot -99\right)\right)\\
\end{array}
\end{array}
if m < -1.12e8Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
*-commutativeN/A
flip3-+N/A
div-invN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr73.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6413.5%
Simplified13.5%
Taylor expanded in k around inf
/-lowering-/.f64N/A
Simplified65.7%
if -1.12e8 < m < 0.085999999999999993Initial program 94.9%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6494.9%
Simplified94.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified89.1%
if 0.085999999999999993 < m Initial program 74.7%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6474.7%
Simplified74.7%
*-commutativeN/A
flip3-+N/A
div-invN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr69.2%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f642.5%
Simplified2.5%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
distribute-rgt1-inN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
mul-1-negN/A
distribute-lft-neg-outN/A
unsub-negN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
metadata-eval25.3%
Simplified25.3%
Final simplification58.3%
(FPCore (a k m)
:precision binary64
(if (<= m -112000000.0)
(* a (/ 1.0 (* k k)))
(if (<= m 0.086)
(/ a (+ 1.0 (* k (+ k 10.0))))
(+ a (* k (* a (- -10.0 (* k -99.0))))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = a * (1.0 / (k * k));
} else if (m <= 0.086) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a + (k * (a * (-10.0 - (k * -99.0))));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-112000000.0d0)) then
tmp = a * (1.0d0 / (k * k))
else if (m <= 0.086d0) then
tmp = a / (1.0d0 + (k * (k + 10.0d0)))
else
tmp = a + (k * (a * ((-10.0d0) - (k * (-99.0d0)))))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = a * (1.0 / (k * k));
} else if (m <= 0.086) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a + (k * (a * (-10.0 - (k * -99.0))));
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= -112000000.0: tmp = a * (1.0 / (k * k)) elif m <= 0.086: tmp = a / (1.0 + (k * (k + 10.0))) else: tmp = a + (k * (a * (-10.0 - (k * -99.0)))) return tmp
function code(a, k, m) tmp = 0.0 if (m <= -112000000.0) tmp = Float64(a * Float64(1.0 / Float64(k * k))); elseif (m <= 0.086) tmp = Float64(a / Float64(1.0 + Float64(k * Float64(k + 10.0)))); else tmp = Float64(a + Float64(k * Float64(a * Float64(-10.0 - Float64(k * -99.0))))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= -112000000.0) tmp = a * (1.0 / (k * k)); elseif (m <= 0.086) tmp = a / (1.0 + (k * (k + 10.0))); else tmp = a + (k * (a * (-10.0 - (k * -99.0)))); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, -112000000.0], N[(a * N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 0.086], N[(a / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(k * N[(a * N[(-10.0 - N[(k * -99.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -112000000:\\
\;\;\;\;a \cdot \frac{1}{k \cdot k}\\
\mathbf{elif}\;m \leq 0.086:\\
\;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\
\mathbf{else}:\\
\;\;\;\;a + k \cdot \left(a \cdot \left(-10 - k \cdot -99\right)\right)\\
\end{array}
\end{array}
if m < -1.12e8Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified34.1%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6459.1%
Simplified59.1%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.2%
Applied egg-rr61.2%
if -1.12e8 < m < 0.085999999999999993Initial program 94.9%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6494.9%
Simplified94.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified89.1%
if 0.085999999999999993 < m Initial program 74.7%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6474.7%
Simplified74.7%
*-commutativeN/A
flip3-+N/A
div-invN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr69.2%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f642.5%
Simplified2.5%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
distribute-rgt1-inN/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
mul-1-negN/A
distribute-lft-neg-outN/A
unsub-negN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
metadata-eval25.3%
Simplified25.3%
Final simplification56.7%
(FPCore (a k m) :precision binary64 (if (<= m -112000000.0) (* a (/ 1.0 (* k k))) (if (<= m 4.4e+18) (/ a (+ 1.0 (* k (+ k 10.0)))) (+ a (* a (* k -10.0))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = a * (1.0 / (k * k));
} else if (m <= 4.4e+18) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a + (a * (k * -10.0));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-112000000.0d0)) then
tmp = a * (1.0d0 / (k * k))
else if (m <= 4.4d+18) then
tmp = a / (1.0d0 + (k * (k + 10.0d0)))
else
tmp = a + (a * (k * (-10.0d0)))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = a * (1.0 / (k * k));
} else if (m <= 4.4e+18) {
tmp = a / (1.0 + (k * (k + 10.0)));
} else {
tmp = a + (a * (k * -10.0));
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= -112000000.0: tmp = a * (1.0 / (k * k)) elif m <= 4.4e+18: tmp = a / (1.0 + (k * (k + 10.0))) else: tmp = a + (a * (k * -10.0)) return tmp
function code(a, k, m) tmp = 0.0 if (m <= -112000000.0) tmp = Float64(a * Float64(1.0 / Float64(k * k))); elseif (m <= 4.4e+18) tmp = Float64(a / Float64(1.0 + Float64(k * Float64(k + 10.0)))); else tmp = Float64(a + Float64(a * Float64(k * -10.0))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= -112000000.0) tmp = a * (1.0 / (k * k)); elseif (m <= 4.4e+18) tmp = a / (1.0 + (k * (k + 10.0))); else tmp = a + (a * (k * -10.0)); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, -112000000.0], N[(a * N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 4.4e+18], N[(a / N[(1.0 + N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(a * N[(k * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -112000000:\\
\;\;\;\;a \cdot \frac{1}{k \cdot k}\\
\mathbf{elif}\;m \leq 4.4 \cdot 10^{+18}:\\
\;\;\;\;\frac{a}{1 + k \cdot \left(k + 10\right)}\\
\mathbf{else}:\\
\;\;\;\;a + a \cdot \left(k \cdot -10\right)\\
\end{array}
\end{array}
if m < -1.12e8Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified34.1%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6459.1%
Simplified59.1%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.2%
Applied egg-rr61.2%
if -1.12e8 < m < 4.4e18Initial program 95.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6495.0%
Simplified95.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified86.9%
if 4.4e18 < m Initial program 74.2%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6474.2%
Simplified74.2%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified2.9%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f647.5%
Simplified7.5%
Final simplification50.4%
(FPCore (a k m) :precision binary64 (if (<= m -112000000.0) (* a (/ 1.0 (* k k))) (if (<= m 5.9e+18) (/ a (+ 1.0 (* k k))) (+ a (* a (* k -10.0))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = a * (1.0 / (k * k));
} else if (m <= 5.9e+18) {
tmp = a / (1.0 + (k * k));
} else {
tmp = a + (a * (k * -10.0));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-112000000.0d0)) then
tmp = a * (1.0d0 / (k * k))
else if (m <= 5.9d+18) then
tmp = a / (1.0d0 + (k * k))
else
tmp = a + (a * (k * (-10.0d0)))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= -112000000.0) {
tmp = a * (1.0 / (k * k));
} else if (m <= 5.9e+18) {
tmp = a / (1.0 + (k * k));
} else {
tmp = a + (a * (k * -10.0));
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= -112000000.0: tmp = a * (1.0 / (k * k)) elif m <= 5.9e+18: tmp = a / (1.0 + (k * k)) else: tmp = a + (a * (k * -10.0)) return tmp
function code(a, k, m) tmp = 0.0 if (m <= -112000000.0) tmp = Float64(a * Float64(1.0 / Float64(k * k))); elseif (m <= 5.9e+18) tmp = Float64(a / Float64(1.0 + Float64(k * k))); else tmp = Float64(a + Float64(a * Float64(k * -10.0))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= -112000000.0) tmp = a * (1.0 / (k * k)); elseif (m <= 5.9e+18) tmp = a / (1.0 + (k * k)); else tmp = a + (a * (k * -10.0)); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, -112000000.0], N[(a * N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 5.9e+18], N[(a / N[(1.0 + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(a * N[(k * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -112000000:\\
\;\;\;\;a \cdot \frac{1}{k \cdot k}\\
\mathbf{elif}\;m \leq 5.9 \cdot 10^{+18}:\\
\;\;\;\;\frac{a}{1 + k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;a + a \cdot \left(k \cdot -10\right)\\
\end{array}
\end{array}
if m < -1.12e8Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified34.1%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6459.1%
Simplified59.1%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.2%
Applied egg-rr61.2%
if -1.12e8 < m < 5.9e18Initial program 95.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6495.0%
Simplified95.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified86.9%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6485.6%
Simplified85.6%
if 5.9e18 < m Initial program 74.2%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6474.2%
Simplified74.2%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified2.9%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f647.5%
Simplified7.5%
Final simplification50.0%
(FPCore (a k m) :precision binary64 (if (<= k -4.7e-303) (* a (/ 1.0 (* k k))) (if (<= k 235000.0) (/ a (+ 1.0 (* k 10.0))) (/ a (* k (+ k 10.0))))))
double code(double a, double k, double m) {
double tmp;
if (k <= -4.7e-303) {
tmp = a * (1.0 / (k * k));
} else if (k <= 235000.0) {
tmp = a / (1.0 + (k * 10.0));
} else {
tmp = a / (k * (k + 10.0));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (k <= (-4.7d-303)) then
tmp = a * (1.0d0 / (k * k))
else if (k <= 235000.0d0) then
tmp = a / (1.0d0 + (k * 10.0d0))
else
tmp = a / (k * (k + 10.0d0))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (k <= -4.7e-303) {
tmp = a * (1.0 / (k * k));
} else if (k <= 235000.0) {
tmp = a / (1.0 + (k * 10.0));
} else {
tmp = a / (k * (k + 10.0));
}
return tmp;
}
def code(a, k, m): tmp = 0 if k <= -4.7e-303: tmp = a * (1.0 / (k * k)) elif k <= 235000.0: tmp = a / (1.0 + (k * 10.0)) else: tmp = a / (k * (k + 10.0)) return tmp
function code(a, k, m) tmp = 0.0 if (k <= -4.7e-303) tmp = Float64(a * Float64(1.0 / Float64(k * k))); elseif (k <= 235000.0) tmp = Float64(a / Float64(1.0 + Float64(k * 10.0))); else tmp = Float64(a / Float64(k * Float64(k + 10.0))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (k <= -4.7e-303) tmp = a * (1.0 / (k * k)); elseif (k <= 235000.0) tmp = a / (1.0 + (k * 10.0)); else tmp = a / (k * (k + 10.0)); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[k, -4.7e-303], N[(a * N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 235000.0], N[(a / N[(1.0 + N[(k * 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a / N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq -4.7 \cdot 10^{-303}:\\
\;\;\;\;a \cdot \frac{1}{k \cdot k}\\
\mathbf{elif}\;k \leq 235000:\\
\;\;\;\;\frac{a}{1 + k \cdot 10}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{k \cdot \left(k + 10\right)}\\
\end{array}
\end{array}
if k < -4.6999999999999997e-303Initial program 85.7%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6485.7%
Simplified85.7%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified20.6%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6428.2%
Simplified28.2%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6429.3%
Applied egg-rr29.3%
if -4.6999999999999997e-303 < k < 235000Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified41.4%
Taylor expanded in k around 0
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
+-lowering-+.f64N/A
unpow2N/A
associate-*r*N/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
*-commutativeN/A
*-lowering-*.f6441.4%
Simplified41.4%
if 235000 < k Initial program 82.7%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6482.7%
Simplified82.7%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified55.7%
Taylor expanded in k around inf
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
+-lowering-+.f6455.7%
Simplified55.7%
Final simplification42.2%
(FPCore (a k m) :precision binary64 (if (<= k -4.7e-303) (* a (/ 1.0 (* k k))) (if (<= k 0.074) (+ a (* a (* k -10.0))) (/ a (* k (+ k 10.0))))))
double code(double a, double k, double m) {
double tmp;
if (k <= -4.7e-303) {
tmp = a * (1.0 / (k * k));
} else if (k <= 0.074) {
tmp = a + (a * (k * -10.0));
} else {
tmp = a / (k * (k + 10.0));
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (k <= (-4.7d-303)) then
tmp = a * (1.0d0 / (k * k))
else if (k <= 0.074d0) then
tmp = a + (a * (k * (-10.0d0)))
else
tmp = a / (k * (k + 10.0d0))
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (k <= -4.7e-303) {
tmp = a * (1.0 / (k * k));
} else if (k <= 0.074) {
tmp = a + (a * (k * -10.0));
} else {
tmp = a / (k * (k + 10.0));
}
return tmp;
}
def code(a, k, m): tmp = 0 if k <= -4.7e-303: tmp = a * (1.0 / (k * k)) elif k <= 0.074: tmp = a + (a * (k * -10.0)) else: tmp = a / (k * (k + 10.0)) return tmp
function code(a, k, m) tmp = 0.0 if (k <= -4.7e-303) tmp = Float64(a * Float64(1.0 / Float64(k * k))); elseif (k <= 0.074) tmp = Float64(a + Float64(a * Float64(k * -10.0))); else tmp = Float64(a / Float64(k * Float64(k + 10.0))); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (k <= -4.7e-303) tmp = a * (1.0 / (k * k)); elseif (k <= 0.074) tmp = a + (a * (k * -10.0)); else tmp = a / (k * (k + 10.0)); end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[k, -4.7e-303], N[(a * N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 0.074], N[(a + N[(a * N[(k * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a / N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq -4.7 \cdot 10^{-303}:\\
\;\;\;\;a \cdot \frac{1}{k \cdot k}\\
\mathbf{elif}\;k \leq 0.074:\\
\;\;\;\;a + a \cdot \left(k \cdot -10\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{k \cdot \left(k + 10\right)}\\
\end{array}
\end{array}
if k < -4.6999999999999997e-303Initial program 85.7%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6485.7%
Simplified85.7%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified20.6%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6428.2%
Simplified28.2%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6429.3%
Applied egg-rr29.3%
if -4.6999999999999997e-303 < k < 0.0739999999999999963Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified42.3%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6442.3%
Simplified42.3%
if 0.0739999999999999963 < k Initial program 83.1%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6483.1%
Simplified83.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified54.5%
Taylor expanded in k around inf
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
+-lowering-+.f6454.5%
Simplified54.5%
Final simplification42.2%
(FPCore (a k m) :precision binary64 (let* ((t_0 (* a (/ 1.0 (* k k))))) (if (<= k -4.7e-303) t_0 (if (<= k 0.1) (+ a (* a (* k -10.0))) t_0))))
double code(double a, double k, double m) {
double t_0 = a * (1.0 / (k * k));
double tmp;
if (k <= -4.7e-303) {
tmp = t_0;
} else if (k <= 0.1) {
tmp = a + (a * (k * -10.0));
} else {
tmp = t_0;
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a * (1.0d0 / (k * k))
if (k <= (-4.7d-303)) then
tmp = t_0
else if (k <= 0.1d0) then
tmp = a + (a * (k * (-10.0d0)))
else
tmp = t_0
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double t_0 = a * (1.0 / (k * k));
double tmp;
if (k <= -4.7e-303) {
tmp = t_0;
} else if (k <= 0.1) {
tmp = a + (a * (k * -10.0));
} else {
tmp = t_0;
}
return tmp;
}
def code(a, k, m): t_0 = a * (1.0 / (k * k)) tmp = 0 if k <= -4.7e-303: tmp = t_0 elif k <= 0.1: tmp = a + (a * (k * -10.0)) else: tmp = t_0 return tmp
function code(a, k, m) t_0 = Float64(a * Float64(1.0 / Float64(k * k))) tmp = 0.0 if (k <= -4.7e-303) tmp = t_0; elseif (k <= 0.1) tmp = Float64(a + Float64(a * Float64(k * -10.0))); else tmp = t_0; end return tmp end
function tmp_2 = code(a, k, m) t_0 = a * (1.0 / (k * k)); tmp = 0.0; if (k <= -4.7e-303) tmp = t_0; elseif (k <= 0.1) tmp = a + (a * (k * -10.0)); else tmp = t_0; end tmp_2 = tmp; end
code[a_, k_, m_] := Block[{t$95$0 = N[(a * N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, -4.7e-303], t$95$0, If[LessEqual[k, 0.1], N[(a + N[(a * N[(k * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := a \cdot \frac{1}{k \cdot k}\\
\mathbf{if}\;k \leq -4.7 \cdot 10^{-303}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;k \leq 0.1:\\
\;\;\;\;a + a \cdot \left(k \cdot -10\right)\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if k < -4.6999999999999997e-303 or 0.10000000000000001 < k Initial program 84.4%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6484.4%
Simplified84.4%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified37.9%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6441.0%
Simplified41.0%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6441.6%
Applied egg-rr41.6%
if -4.6999999999999997e-303 < k < 0.10000000000000001Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified42.3%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6442.3%
Simplified42.3%
Final simplification41.8%
(FPCore (a k m) :precision binary64 (let* ((t_0 (* a (/ 1.0 (* k k))))) (if (<= k -4.7e-303) t_0 (if (<= k 235000.0) a t_0))))
double code(double a, double k, double m) {
double t_0 = a * (1.0 / (k * k));
double tmp;
if (k <= -4.7e-303) {
tmp = t_0;
} else if (k <= 235000.0) {
tmp = a;
} else {
tmp = t_0;
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a * (1.0d0 / (k * k))
if (k <= (-4.7d-303)) then
tmp = t_0
else if (k <= 235000.0d0) then
tmp = a
else
tmp = t_0
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double t_0 = a * (1.0 / (k * k));
double tmp;
if (k <= -4.7e-303) {
tmp = t_0;
} else if (k <= 235000.0) {
tmp = a;
} else {
tmp = t_0;
}
return tmp;
}
def code(a, k, m): t_0 = a * (1.0 / (k * k)) tmp = 0 if k <= -4.7e-303: tmp = t_0 elif k <= 235000.0: tmp = a else: tmp = t_0 return tmp
function code(a, k, m) t_0 = Float64(a * Float64(1.0 / Float64(k * k))) tmp = 0.0 if (k <= -4.7e-303) tmp = t_0; elseif (k <= 235000.0) tmp = a; else tmp = t_0; end return tmp end
function tmp_2 = code(a, k, m) t_0 = a * (1.0 / (k * k)); tmp = 0.0; if (k <= -4.7e-303) tmp = t_0; elseif (k <= 235000.0) tmp = a; else tmp = t_0; end tmp_2 = tmp; end
code[a_, k_, m_] := Block[{t$95$0 = N[(a * N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, -4.7e-303], t$95$0, If[LessEqual[k, 235000.0], a, t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := a \cdot \frac{1}{k \cdot k}\\
\mathbf{if}\;k \leq -4.7 \cdot 10^{-303}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;k \leq 235000:\\
\;\;\;\;a\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if k < -4.6999999999999997e-303 or 235000 < k Initial program 84.2%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6484.2%
Simplified84.2%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified38.4%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6441.5%
Simplified41.5%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.0%
Applied egg-rr42.0%
if -4.6999999999999997e-303 < k < 235000Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified41.4%
Taylor expanded in k around 0
Simplified41.3%
Final simplification41.8%
(FPCore (a k m) :precision binary64 (let* ((t_0 (/ a (* k k)))) (if (<= k -4.7e-303) t_0 (if (<= k 235000.0) a t_0))))
double code(double a, double k, double m) {
double t_0 = a / (k * k);
double tmp;
if (k <= -4.7e-303) {
tmp = t_0;
} else if (k <= 235000.0) {
tmp = a;
} else {
tmp = t_0;
}
return tmp;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a / (k * k)
if (k <= (-4.7d-303)) then
tmp = t_0
else if (k <= 235000.0d0) then
tmp = a
else
tmp = t_0
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double t_0 = a / (k * k);
double tmp;
if (k <= -4.7e-303) {
tmp = t_0;
} else if (k <= 235000.0) {
tmp = a;
} else {
tmp = t_0;
}
return tmp;
}
def code(a, k, m): t_0 = a / (k * k) tmp = 0 if k <= -4.7e-303: tmp = t_0 elif k <= 235000.0: tmp = a else: tmp = t_0 return tmp
function code(a, k, m) t_0 = Float64(a / Float64(k * k)) tmp = 0.0 if (k <= -4.7e-303) tmp = t_0; elseif (k <= 235000.0) tmp = a; else tmp = t_0; end return tmp end
function tmp_2 = code(a, k, m) t_0 = a / (k * k); tmp = 0.0; if (k <= -4.7e-303) tmp = t_0; elseif (k <= 235000.0) tmp = a; else tmp = t_0; end tmp_2 = tmp; end
code[a_, k_, m_] := Block[{t$95$0 = N[(a / N[(k * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, -4.7e-303], t$95$0, If[LessEqual[k, 235000.0], a, t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{a}{k \cdot k}\\
\mathbf{if}\;k \leq -4.7 \cdot 10^{-303}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;k \leq 235000:\\
\;\;\;\;a\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if k < -4.6999999999999997e-303 or 235000 < k Initial program 84.2%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6484.2%
Simplified84.2%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified38.4%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6441.5%
Simplified41.5%
if -4.6999999999999997e-303 < k < 235000Initial program 100.0%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0%
Simplified100.0%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified41.4%
Taylor expanded in k around 0
Simplified41.3%
(FPCore (a k m) :precision binary64 a)
double code(double a, double k, double m) {
return a;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
code = a
end function
public static double code(double a, double k, double m) {
return a;
}
def code(a, k, m): return a
function code(a, k, m) return a end
function tmp = code(a, k, m) tmp = a; end
code[a_, k_, m_] := a
\begin{array}{l}
\\
a
\end{array}
Initial program 89.5%
/-lowering-/.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f6489.5%
Simplified89.5%
Taylor expanded in m around 0
/-lowering-/.f64N/A
distribute-lft-inN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
unpow2N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
Simplified39.4%
Taylor expanded in k around 0
Simplified16.7%
herbie shell --seed 2024191
(FPCore (a k m)
:name "Falkner and Boettcher, Appendix A"
:precision binary64
(/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))