
(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 14 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
(if (<= m -9.8e-8)
(pow (/ (pow k (- m)) a) -1.0)
(if (<= m 2.7e-27)
(pow (fma (/ k a) (+ 10.0 k) (pow a -1.0)) -1.0)
(* a (pow k (+ -1.0 (+ -1.0 m)))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -9.8e-8) {
tmp = pow((pow(k, -m) / a), -1.0);
} else if (m <= 2.7e-27) {
tmp = pow(fma((k / a), (10.0 + k), pow(a, -1.0)), -1.0);
} else {
tmp = a * pow(k, (-1.0 + (-1.0 + m)));
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if (m <= -9.8e-8) tmp = Float64((k ^ Float64(-m)) / a) ^ -1.0; elseif (m <= 2.7e-27) tmp = fma(Float64(k / a), Float64(10.0 + k), (a ^ -1.0)) ^ -1.0; else tmp = Float64(a * (k ^ Float64(-1.0 + Float64(-1.0 + m)))); end return tmp end
code[a_, k_, m_] := If[LessEqual[m, -9.8e-8], N[Power[N[(N[Power[k, (-m)], $MachinePrecision] / a), $MachinePrecision], -1.0], $MachinePrecision], If[LessEqual[m, 2.7e-27], N[Power[N[(N[(k / a), $MachinePrecision] * N[(10.0 + k), $MachinePrecision] + N[Power[a, -1.0], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision], N[(a * N[Power[k, N[(-1.0 + N[(-1.0 + m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -9.8 \cdot 10^{-8}:\\
\;\;\;\;{\left(\frac{{k}^{\left(-m\right)}}{a}\right)}^{-1}\\
\mathbf{elif}\;m \leq 2.7 \cdot 10^{-27}:\\
\;\;\;\;{\left(\mathsf{fma}\left(\frac{k}{a}, 10 + k, {a}^{-1}\right)\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;a \cdot {k}^{\left(-1 + \left(-1 + m\right)\right)}\\
\end{array}
\end{array}
if m < -9.8000000000000004e-8Initial program 100.0%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f64100.0
lift-+.f64N/A
lift-+.f64N/A
associate-+l+N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-rgt-outN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64100.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
Taylor expanded in k around 0
*-commutativeN/A
associate-/r*N/A
rem-exp-logN/A
remove-double-negN/A
log-recN/A
mul-1-negN/A
exp-prodN/A
associate-*r*N/A
*-commutativeN/A
mul-1-negN/A
exp-negN/A
remove-double-divN/A
lower-/.f64N/A
Applied rewrites100.0%
if -9.8000000000000004e-8 < m < 2.69999999999999989e-27Initial program 92.7%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites92.7%
Applied rewrites92.7%
Taylor expanded in k around 0
Applied rewrites99.8%
if 2.69999999999999989e-27 < m Initial program 80.0%
Taylor expanded in k around inf
*-rgt-identityN/A
times-fracN/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
/-rgt-identityN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6450.5
Applied rewrites50.5%
Applied rewrites67.4%
Applied rewrites100.0%
Final simplification99.9%
(FPCore (a k m) :precision binary64 (if (or (<= m -9.8e-8) (not (<= m 1.6e-7))) (* (pow k m) a) (pow (fma (/ k a) (+ 10.0 k) (pow a -1.0)) -1.0)))
double code(double a, double k, double m) {
double tmp;
if ((m <= -9.8e-8) || !(m <= 1.6e-7)) {
tmp = pow(k, m) * a;
} else {
tmp = pow(fma((k / a), (10.0 + k), pow(a, -1.0)), -1.0);
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if ((m <= -9.8e-8) || !(m <= 1.6e-7)) tmp = Float64((k ^ m) * a); else tmp = fma(Float64(k / a), Float64(10.0 + k), (a ^ -1.0)) ^ -1.0; end return tmp end
code[a_, k_, m_] := If[Or[LessEqual[m, -9.8e-8], N[Not[LessEqual[m, 1.6e-7]], $MachinePrecision]], N[(N[Power[k, m], $MachinePrecision] * a), $MachinePrecision], N[Power[N[(N[(k / a), $MachinePrecision] * N[(10.0 + k), $MachinePrecision] + N[Power[a, -1.0], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -9.8 \cdot 10^{-8} \lor \neg \left(m \leq 1.6 \cdot 10^{-7}\right):\\
\;\;\;\;{k}^{m} \cdot a\\
\mathbf{else}:\\
\;\;\;\;{\left(\mathsf{fma}\left(\frac{k}{a}, 10 + k, {a}^{-1}\right)\right)}^{-1}\\
\end{array}
\end{array}
if m < -9.8000000000000004e-8 or 1.6e-7 < m Initial program 89.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6489.1
lift-+.f64N/A
lift-+.f64N/A
associate-+l+N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-rgt-outN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f6489.1
Applied rewrites89.1%
Taylor expanded in k around 0
lower-pow.f64100.0
Applied rewrites100.0%
if -9.8000000000000004e-8 < m < 1.6e-7Initial program 92.9%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites92.8%
Applied rewrites92.7%
Taylor expanded in k around 0
Applied rewrites99.6%
Final simplification99.9%
(FPCore (a k m)
:precision binary64
(if (<= m -9.8e-8)
(* (pow k m) a)
(if (<= m 2.7e-27)
(pow (fma (/ k a) (+ 10.0 k) (pow a -1.0)) -1.0)
(* a (pow k (+ -1.0 (+ -1.0 m)))))))
double code(double a, double k, double m) {
double tmp;
if (m <= -9.8e-8) {
tmp = pow(k, m) * a;
} else if (m <= 2.7e-27) {
tmp = pow(fma((k / a), (10.0 + k), pow(a, -1.0)), -1.0);
} else {
tmp = a * pow(k, (-1.0 + (-1.0 + m)));
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if (m <= -9.8e-8) tmp = Float64((k ^ m) * a); elseif (m <= 2.7e-27) tmp = fma(Float64(k / a), Float64(10.0 + k), (a ^ -1.0)) ^ -1.0; else tmp = Float64(a * (k ^ Float64(-1.0 + Float64(-1.0 + m)))); end return tmp end
code[a_, k_, m_] := If[LessEqual[m, -9.8e-8], N[(N[Power[k, m], $MachinePrecision] * a), $MachinePrecision], If[LessEqual[m, 2.7e-27], N[Power[N[(N[(k / a), $MachinePrecision] * N[(10.0 + k), $MachinePrecision] + N[Power[a, -1.0], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision], N[(a * N[Power[k, N[(-1.0 + N[(-1.0 + m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -9.8 \cdot 10^{-8}:\\
\;\;\;\;{k}^{m} \cdot a\\
\mathbf{elif}\;m \leq 2.7 \cdot 10^{-27}:\\
\;\;\;\;{\left(\mathsf{fma}\left(\frac{k}{a}, 10 + k, {a}^{-1}\right)\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;a \cdot {k}^{\left(-1 + \left(-1 + m\right)\right)}\\
\end{array}
\end{array}
if m < -9.8000000000000004e-8Initial program 100.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64100.0
lift-+.f64N/A
lift-+.f64N/A
associate-+l+N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-rgt-outN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64100.0
Applied rewrites100.0%
Taylor expanded in k around 0
lower-pow.f64100.0
Applied rewrites100.0%
if -9.8000000000000004e-8 < m < 2.69999999999999989e-27Initial program 92.7%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites92.7%
Applied rewrites92.7%
Taylor expanded in k around 0
Applied rewrites99.8%
if 2.69999999999999989e-27 < m Initial program 80.0%
Taylor expanded in k around inf
*-rgt-identityN/A
times-fracN/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
/-rgt-identityN/A
lower-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-pow.f6450.5
Applied rewrites50.5%
Applied rewrites67.4%
Applied rewrites100.0%
Final simplification99.9%
(FPCore (a k m)
:precision binary64
(if (<= m -1.05e+15)
(* (- a) (/ (- (/ (- 10.0 (/ 99.0 k)) k) 1.0) (* k k)))
(if (<= m 1.35)
(pow (fma (/ k a) (+ 10.0 k) (pow a -1.0)) -1.0)
(* (* (* 99.0 k) a) k))))
double code(double a, double k, double m) {
double tmp;
if (m <= -1.05e+15) {
tmp = -a * ((((10.0 - (99.0 / k)) / k) - 1.0) / (k * k));
} else if (m <= 1.35) {
tmp = pow(fma((k / a), (10.0 + k), pow(a, -1.0)), -1.0);
} else {
tmp = ((99.0 * k) * a) * k;
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if (m <= -1.05e+15) tmp = Float64(Float64(-a) * Float64(Float64(Float64(Float64(10.0 - Float64(99.0 / k)) / k) - 1.0) / Float64(k * k))); elseif (m <= 1.35) tmp = fma(Float64(k / a), Float64(10.0 + k), (a ^ -1.0)) ^ -1.0; else tmp = Float64(Float64(Float64(99.0 * k) * a) * k); end return tmp end
code[a_, k_, m_] := If[LessEqual[m, -1.05e+15], N[((-a) * N[(N[(N[(N[(10.0 - N[(99.0 / k), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision] - 1.0), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 1.35], N[Power[N[(N[(k / a), $MachinePrecision] * N[(10.0 + k), $MachinePrecision] + N[Power[a, -1.0], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision], N[(N[(N[(99.0 * k), $MachinePrecision] * a), $MachinePrecision] * k), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -1.05 \cdot 10^{+15}:\\
\;\;\;\;\left(-a\right) \cdot \frac{\frac{10 - \frac{99}{k}}{k} - 1}{k \cdot k}\\
\mathbf{elif}\;m \leq 1.35:\\
\;\;\;\;{\left(\mathsf{fma}\left(\frac{k}{a}, 10 + k, {a}^{-1}\right)\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(99 \cdot k\right) \cdot a\right) \cdot k\\
\end{array}
\end{array}
if m < -1.05e15Initial program 100.0%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites35.5%
Taylor expanded in k around inf
Applied rewrites54.1%
Taylor expanded in a around -inf
Applied rewrites64.8%
if -1.05e15 < m < 1.3500000000000001Initial program 93.1%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites91.1%
Applied rewrites91.0%
Taylor expanded in k around 0
Applied rewrites97.7%
if 1.3500000000000001 < m Initial program 79.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites3.0%
Taylor expanded in k around 0
Applied rewrites17.9%
Taylor expanded in k around inf
Applied rewrites46.2%
Final simplification68.8%
(FPCore (a k m)
:precision binary64
(if (<= m -13.5)
(/ (/ (* (/ (/ a k) k) 99.0) k) k)
(if (<= m 1.35)
(pow (fma (/ k a) (+ 10.0 k) (pow a -1.0)) -1.0)
(* (* (* 99.0 k) a) k))))
double code(double a, double k, double m) {
double tmp;
if (m <= -13.5) {
tmp = ((((a / k) / k) * 99.0) / k) / k;
} else if (m <= 1.35) {
tmp = pow(fma((k / a), (10.0 + k), pow(a, -1.0)), -1.0);
} else {
tmp = ((99.0 * k) * a) * k;
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if (m <= -13.5) tmp = Float64(Float64(Float64(Float64(Float64(a / k) / k) * 99.0) / k) / k); elseif (m <= 1.35) tmp = fma(Float64(k / a), Float64(10.0 + k), (a ^ -1.0)) ^ -1.0; else tmp = Float64(Float64(Float64(99.0 * k) * a) * k); end return tmp end
code[a_, k_, m_] := If[LessEqual[m, -13.5], N[(N[(N[(N[(N[(a / k), $MachinePrecision] / k), $MachinePrecision] * 99.0), $MachinePrecision] / k), $MachinePrecision] / k), $MachinePrecision], If[LessEqual[m, 1.35], N[Power[N[(N[(k / a), $MachinePrecision] * N[(10.0 + k), $MachinePrecision] + N[Power[a, -1.0], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision], N[(N[(N[(99.0 * k), $MachinePrecision] * a), $MachinePrecision] * k), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -13.5:\\
\;\;\;\;\frac{\frac{\frac{\frac{a}{k}}{k} \cdot 99}{k}}{k}\\
\mathbf{elif}\;m \leq 1.35:\\
\;\;\;\;{\left(\mathsf{fma}\left(\frac{k}{a}, 10 + k, {a}^{-1}\right)\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(99 \cdot k\right) \cdot a\right) \cdot k\\
\end{array}
\end{array}
if m < -13.5Initial program 100.0%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites35.1%
Taylor expanded in k around inf
Applied rewrites53.5%
Taylor expanded in k around 0
Applied rewrites63.2%
if -13.5 < m < 1.3500000000000001Initial program 93.1%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites92.2%
Applied rewrites92.1%
Taylor expanded in k around 0
Applied rewrites98.9%
if 1.3500000000000001 < m Initial program 79.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites3.0%
Taylor expanded in k around 0
Applied rewrites17.9%
Taylor expanded in k around inf
Applied rewrites46.2%
Final simplification68.6%
(FPCore (a k m)
:precision binary64
(if (<= m -1.05e+15)
(/ a (* k k))
(if (<= m 1.35)
(pow (fma (/ k a) (+ 10.0 k) (pow a -1.0)) -1.0)
(* (* (* 99.0 k) a) k))))
double code(double a, double k, double m) {
double tmp;
if (m <= -1.05e+15) {
tmp = a / (k * k);
} else if (m <= 1.35) {
tmp = pow(fma((k / a), (10.0 + k), pow(a, -1.0)), -1.0);
} else {
tmp = ((99.0 * k) * a) * k;
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if (m <= -1.05e+15) tmp = Float64(a / Float64(k * k)); elseif (m <= 1.35) tmp = fma(Float64(k / a), Float64(10.0 + k), (a ^ -1.0)) ^ -1.0; else tmp = Float64(Float64(Float64(99.0 * k) * a) * k); end return tmp end
code[a_, k_, m_] := If[LessEqual[m, -1.05e+15], N[(a / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 1.35], N[Power[N[(N[(k / a), $MachinePrecision] * N[(10.0 + k), $MachinePrecision] + N[Power[a, -1.0], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision], N[(N[(N[(99.0 * k), $MachinePrecision] * a), $MachinePrecision] * k), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -1.05 \cdot 10^{+15}:\\
\;\;\;\;\frac{a}{k \cdot k}\\
\mathbf{elif}\;m \leq 1.35:\\
\;\;\;\;{\left(\mathsf{fma}\left(\frac{k}{a}, 10 + k, {a}^{-1}\right)\right)}^{-1}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(99 \cdot k\right) \cdot a\right) \cdot k\\
\end{array}
\end{array}
if m < -1.05e15Initial program 100.0%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites35.5%
Applied rewrites35.5%
Taylor expanded in k around inf
Applied rewrites52.7%
if -1.05e15 < m < 1.3500000000000001Initial program 93.1%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites91.1%
Applied rewrites91.0%
Taylor expanded in k around 0
Applied rewrites97.7%
if 1.3500000000000001 < m Initial program 79.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites3.0%
Taylor expanded in k around 0
Applied rewrites17.9%
Taylor expanded in k around inf
Applied rewrites46.2%
Final simplification65.1%
(FPCore (a k m) :precision binary64 (if (<= (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))) 0.0) (* (* a k) -10.0) (* (fma -10.0 k 1.0) a)))
double code(double a, double k, double m) {
double tmp;
if (((a * pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k))) <= 0.0) {
tmp = (a * k) * -10.0;
} else {
tmp = fma(-10.0, k, 1.0) * a;
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if (Float64(Float64(a * (k ^ m)) / Float64(Float64(1.0 + Float64(10.0 * k)) + Float64(k * k))) <= 0.0) tmp = Float64(Float64(a * k) * -10.0); else tmp = Float64(fma(-10.0, k, 1.0) * a); end return tmp end
code[a_, k_, m_] := If[LessEqual[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], 0.0], N[(N[(a * k), $MachinePrecision] * -10.0), $MachinePrecision], N[(N[(-10.0 * k + 1.0), $MachinePrecision] * a), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k} \leq 0:\\
\;\;\;\;\left(a \cdot k\right) \cdot -10\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-10, k, 1\right) \cdot a\\
\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))) < 0.0Initial program 96.9%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites41.0%
Taylor expanded in k around 0
Applied rewrites14.9%
Taylor expanded in k around inf
Applied rewrites8.9%
if 0.0 < (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 #s(literal 1 binary64) (*.f64 #s(literal 10 binary64) k)) (*.f64 k k))) Initial program 74.5%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites44.3%
Taylor expanded in k around 0
Applied rewrites32.7%
Taylor expanded in k around 0
Applied rewrites32.7%
(FPCore (a k m) :precision binary64 (if (<= m -1.05e+15) (/ a (* k k)) (if (<= m 1.35) (/ a (fma (+ 10.0 k) k 1.0)) (* (* (* 99.0 k) a) k))))
double code(double a, double k, double m) {
double tmp;
if (m <= -1.05e+15) {
tmp = a / (k * k);
} else if (m <= 1.35) {
tmp = a / fma((10.0 + k), k, 1.0);
} else {
tmp = ((99.0 * k) * a) * k;
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if (m <= -1.05e+15) tmp = Float64(a / Float64(k * k)); elseif (m <= 1.35) tmp = Float64(a / fma(Float64(10.0 + k), k, 1.0)); else tmp = Float64(Float64(Float64(99.0 * k) * a) * k); end return tmp end
code[a_, k_, m_] := If[LessEqual[m, -1.05e+15], N[(a / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 1.35], N[(a / N[(N[(10.0 + k), $MachinePrecision] * k + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(99.0 * k), $MachinePrecision] * a), $MachinePrecision] * k), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -1.05 \cdot 10^{+15}:\\
\;\;\;\;\frac{a}{k \cdot k}\\
\mathbf{elif}\;m \leq 1.35:\\
\;\;\;\;\frac{a}{\mathsf{fma}\left(10 + k, k, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(99 \cdot k\right) \cdot a\right) \cdot k\\
\end{array}
\end{array}
if m < -1.05e15Initial program 100.0%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites35.5%
Applied rewrites35.5%
Taylor expanded in k around inf
Applied rewrites52.7%
if -1.05e15 < m < 1.3500000000000001Initial program 93.1%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites91.1%
if 1.3500000000000001 < m Initial program 79.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites3.0%
Taylor expanded in k around 0
Applied rewrites17.9%
Taylor expanded in k around inf
Applied rewrites46.2%
(FPCore (a k m) :precision binary64 (if (<= m -13.5) (/ a (* k k)) (if (<= m 1.35) (/ a (fma 10.0 k 1.0)) (* (* (* 99.0 k) a) k))))
double code(double a, double k, double m) {
double tmp;
if (m <= -13.5) {
tmp = a / (k * k);
} else if (m <= 1.35) {
tmp = a / fma(10.0, k, 1.0);
} else {
tmp = ((99.0 * k) * a) * k;
}
return tmp;
}
function code(a, k, m) tmp = 0.0 if (m <= -13.5) tmp = Float64(a / Float64(k * k)); elseif (m <= 1.35) tmp = Float64(a / fma(10.0, k, 1.0)); else tmp = Float64(Float64(Float64(99.0 * k) * a) * k); end return tmp end
code[a_, k_, m_] := If[LessEqual[m, -13.5], N[(a / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 1.35], N[(a / N[(10.0 * k + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(99.0 * k), $MachinePrecision] * a), $MachinePrecision] * k), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -13.5:\\
\;\;\;\;\frac{a}{k \cdot k}\\
\mathbf{elif}\;m \leq 1.35:\\
\;\;\;\;\frac{a}{\mathsf{fma}\left(10, k, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(99 \cdot k\right) \cdot a\right) \cdot k\\
\end{array}
\end{array}
if m < -13.5Initial program 100.0%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites35.1%
Applied rewrites35.1%
Taylor expanded in k around inf
Applied rewrites52.1%
if -13.5 < m < 1.3500000000000001Initial program 93.1%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites92.2%
Taylor expanded in k around 0
Applied rewrites67.5%
if 1.3500000000000001 < m Initial program 79.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites3.0%
Taylor expanded in k around 0
Applied rewrites17.9%
Taylor expanded in k around inf
Applied rewrites46.2%
(FPCore (a k m) :precision binary64 (if (<= m -9.8e-23) (/ a (* k k)) (if (<= m 0.41) (/ a 1.0) (* (* (* 99.0 k) a) k))))
double code(double a, double k, double m) {
double tmp;
if (m <= -9.8e-23) {
tmp = a / (k * k);
} else if (m <= 0.41) {
tmp = a / 1.0;
} else {
tmp = ((99.0 * k) * a) * 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 <= (-9.8d-23)) then
tmp = a / (k * k)
else if (m <= 0.41d0) then
tmp = a / 1.0d0
else
tmp = ((99.0d0 * k) * a) * k
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= -9.8e-23) {
tmp = a / (k * k);
} else if (m <= 0.41) {
tmp = a / 1.0;
} else {
tmp = ((99.0 * k) * a) * k;
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= -9.8e-23: tmp = a / (k * k) elif m <= 0.41: tmp = a / 1.0 else: tmp = ((99.0 * k) * a) * k return tmp
function code(a, k, m) tmp = 0.0 if (m <= -9.8e-23) tmp = Float64(a / Float64(k * k)); elseif (m <= 0.41) tmp = Float64(a / 1.0); else tmp = Float64(Float64(Float64(99.0 * k) * a) * k); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= -9.8e-23) tmp = a / (k * k); elseif (m <= 0.41) tmp = a / 1.0; else tmp = ((99.0 * k) * a) * k; end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, -9.8e-23], N[(a / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 0.41], N[(a / 1.0), $MachinePrecision], N[(N[(N[(99.0 * k), $MachinePrecision] * a), $MachinePrecision] * k), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -9.8 \cdot 10^{-23}:\\
\;\;\;\;\frac{a}{k \cdot k}\\
\mathbf{elif}\;m \leq 0.41:\\
\;\;\;\;\frac{a}{1}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(99 \cdot k\right) \cdot a\right) \cdot k\\
\end{array}
\end{array}
if m < -9.7999999999999996e-23Initial program 100.0%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites38.2%
Applied rewrites38.2%
Taylor expanded in k around inf
Applied rewrites52.7%
if -9.7999999999999996e-23 < m < 0.409999999999999976Initial program 92.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites92.5%
Applied rewrites92.4%
Taylor expanded in k around 0
Applied rewrites57.6%
if 0.409999999999999976 < m Initial program 79.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites3.0%
Taylor expanded in k around 0
Applied rewrites17.9%
Taylor expanded in k around inf
Applied rewrites46.2%
(FPCore (a k m) :precision binary64 (if (<= m 0.41) (/ a 1.0) (* (* (* 99.0 k) a) k)))
double code(double a, double k, double m) {
double tmp;
if (m <= 0.41) {
tmp = a / 1.0;
} else {
tmp = ((99.0 * k) * a) * 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 <= 0.41d0) then
tmp = a / 1.0d0
else
tmp = ((99.0d0 * k) * a) * k
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= 0.41) {
tmp = a / 1.0;
} else {
tmp = ((99.0 * k) * a) * k;
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= 0.41: tmp = a / 1.0 else: tmp = ((99.0 * k) * a) * k return tmp
function code(a, k, m) tmp = 0.0 if (m <= 0.41) tmp = Float64(a / 1.0); else tmp = Float64(Float64(Float64(99.0 * k) * a) * k); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= 0.41) tmp = a / 1.0; else tmp = ((99.0 * k) * a) * k; end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, 0.41], N[(a / 1.0), $MachinePrecision], N[(N[(N[(99.0 * k), $MachinePrecision] * a), $MachinePrecision] * k), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq 0.41:\\
\;\;\;\;\frac{a}{1}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(99 \cdot k\right) \cdot a\right) \cdot k\\
\end{array}
\end{array}
if m < 0.409999999999999976Initial program 96.5%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites64.2%
Applied rewrites64.1%
Taylor expanded in k around 0
Applied rewrites30.4%
if 0.409999999999999976 < m Initial program 79.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites3.0%
Taylor expanded in k around 0
Applied rewrites17.9%
Taylor expanded in k around inf
Applied rewrites46.2%
(FPCore (a k m) :precision binary64 (if (<= m 0.41) (/ a 1.0) (* (* a k) -10.0)))
double code(double a, double k, double m) {
double tmp;
if (m <= 0.41) {
tmp = a / 1.0;
} else {
tmp = (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 <= 0.41d0) then
tmp = a / 1.0d0
else
tmp = (a * k) * (-10.0d0)
end if
code = tmp
end function
public static double code(double a, double k, double m) {
double tmp;
if (m <= 0.41) {
tmp = a / 1.0;
} else {
tmp = (a * k) * -10.0;
}
return tmp;
}
def code(a, k, m): tmp = 0 if m <= 0.41: tmp = a / 1.0 else: tmp = (a * k) * -10.0 return tmp
function code(a, k, m) tmp = 0.0 if (m <= 0.41) tmp = Float64(a / 1.0); else tmp = Float64(Float64(a * k) * -10.0); end return tmp end
function tmp_2 = code(a, k, m) tmp = 0.0; if (m <= 0.41) tmp = a / 1.0; else tmp = (a * k) * -10.0; end tmp_2 = tmp; end
code[a_, k_, m_] := If[LessEqual[m, 0.41], N[(a / 1.0), $MachinePrecision], N[(N[(a * k), $MachinePrecision] * -10.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq 0.41:\\
\;\;\;\;\frac{a}{1}\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot k\right) \cdot -10\\
\end{array}
\end{array}
if m < 0.409999999999999976Initial program 96.5%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites64.2%
Applied rewrites64.1%
Taylor expanded in k around 0
Applied rewrites30.4%
if 0.409999999999999976 < m Initial program 79.6%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites3.0%
Taylor expanded in k around 0
Applied rewrites4.0%
Taylor expanded in k around inf
Applied rewrites15.9%
(FPCore (a k m) :precision binary64 (* (* a k) -10.0))
double code(double a, double k, double m) {
return (a * k) * -10.0;
}
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) * (-10.0d0)
end function
public static double code(double a, double k, double m) {
return (a * k) * -10.0;
}
def code(a, k, m): return (a * k) * -10.0
function code(a, k, m) return Float64(Float64(a * k) * -10.0) end
function tmp = code(a, k, m) tmp = (a * k) * -10.0; end
code[a_, k_, m_] := N[(N[(a * k), $MachinePrecision] * -10.0), $MachinePrecision]
\begin{array}{l}
\\
\left(a \cdot k\right) \cdot -10
\end{array}
Initial program 90.3%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites41.9%
Taylor expanded in k around 0
Applied rewrites20.1%
Taylor expanded in k around inf
Applied rewrites7.2%
(FPCore (a k m) :precision binary64 (* (* -10.0 a) k))
double code(double a, double k, double m) {
return (-10.0 * a) * k;
}
real(8) function code(a, k, m)
real(8), intent (in) :: a
real(8), intent (in) :: k
real(8), intent (in) :: m
code = ((-10.0d0) * a) * k
end function
public static double code(double a, double k, double m) {
return (-10.0 * a) * k;
}
def code(a, k, m): return (-10.0 * a) * k
function code(a, k, m) return Float64(Float64(-10.0 * a) * k) end
function tmp = code(a, k, m) tmp = (-10.0 * a) * k; end
code[a_, k_, m_] := N[(N[(-10.0 * a), $MachinePrecision] * k), $MachinePrecision]
\begin{array}{l}
\\
\left(-10 \cdot a\right) \cdot k
\end{array}
Initial program 90.3%
Taylor expanded in m around 0
lower-/.f64N/A
associate-+r+N/A
+-commutativeN/A
+-commutativeN/A
associate-+l+N/A
+-commutativeN/A
associate-+l+N/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
associate-*r*N/A
unpow2N/A
associate-+l+N/A
distribute-lft1-inN/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites41.9%
Taylor expanded in k around 0
Applied rewrites20.1%
Taylor expanded in k around inf
Applied rewrites7.2%
Applied rewrites7.2%
herbie shell --seed 2024303
(FPCore (a k m)
:name "Falkner and Boettcher, Appendix A"
:precision binary64
(/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))