
(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 19 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}
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(let* ((t_0 (* a_m (pow k m))))
(*
a_s
(if (<= (/ t_0 (+ (+ (* k 10.0) 1.0) (* k k))) 2e+102)
(/ (pow k m) (+ (/ 1.0 a_m) (* k (+ (/ k a_m) (/ 10.0 a_m)))))
t_0))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double t_0 = a_m * pow(k, m);
double tmp;
if ((t_0 / (((k * 10.0) + 1.0) + (k * k))) <= 2e+102) {
tmp = pow(k, m) / ((1.0 / a_m) + (k * ((k / a_m) + (10.0 / a_m))));
} else {
tmp = t_0;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a_m * (k ** m)
if ((t_0 / (((k * 10.0d0) + 1.0d0) + (k * k))) <= 2d+102) then
tmp = (k ** m) / ((1.0d0 / a_m) + (k * ((k / a_m) + (10.0d0 / a_m))))
else
tmp = t_0
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double t_0 = a_m * Math.pow(k, m);
double tmp;
if ((t_0 / (((k * 10.0) + 1.0) + (k * k))) <= 2e+102) {
tmp = Math.pow(k, m) / ((1.0 / a_m) + (k * ((k / a_m) + (10.0 / a_m))));
} else {
tmp = t_0;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): t_0 = a_m * math.pow(k, m) tmp = 0 if (t_0 / (((k * 10.0) + 1.0) + (k * k))) <= 2e+102: tmp = math.pow(k, m) / ((1.0 / a_m) + (k * ((k / a_m) + (10.0 / a_m)))) else: tmp = t_0 return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) t_0 = Float64(a_m * (k ^ m)) tmp = 0.0 if (Float64(t_0 / Float64(Float64(Float64(k * 10.0) + 1.0) + Float64(k * k))) <= 2e+102) tmp = Float64((k ^ m) / Float64(Float64(1.0 / a_m) + Float64(k * Float64(Float64(k / a_m) + Float64(10.0 / a_m))))); else tmp = t_0; end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) t_0 = a_m * (k ^ m); tmp = 0.0; if ((t_0 / (((k * 10.0) + 1.0) + (k * k))) <= 2e+102) tmp = (k ^ m) / ((1.0 / a_m) + (k * ((k / a_m) + (10.0 / a_m)))); else tmp = t_0; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := Block[{t$95$0 = N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[N[(t$95$0 / N[(N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+102], N[(N[Power[k, m], $MachinePrecision] / N[(N[(1.0 / a$95$m), $MachinePrecision] + N[(k * N[(N[(k / a$95$m), $MachinePrecision] + N[(10.0 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
\begin{array}{l}
t_0 := a\_m \cdot {k}^{m}\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;\frac{t\_0}{\left(k \cdot 10 + 1\right) + k \cdot k} \leq 2 \cdot 10^{+102}:\\
\;\;\;\;\frac{{k}^{m}}{\frac{1}{a\_m} + k \cdot \left(\frac{k}{a\_m} + \frac{10}{a\_m}\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\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))) < 1.99999999999999995e102Initial program 97.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-+.f6497.3%
Simplified97.3%
distribute-rgt-inN/A
+-commutativeN/A
associate-+l+N/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6497.3%
Applied egg-rr97.3%
div-invN/A
associate-*l*N/A
associate-/r/N/A
un-div-invN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6495.4%
Applied egg-rr95.4%
Taylor expanded in k around 0
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6497.7%
Simplified97.7%
if 1.99999999999999995e102 < (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 #s(literal 1 binary64) (*.f64 #s(literal 10 binary64) k)) (*.f64 k k))) Initial program 66.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-+.f6466.1%
Simplified66.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
pow-lowering-pow.f64100.0%
Simplified100.0%
Final simplification98.2%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(let* ((t_0 (* a_m (pow k m))))
(*
a_s
(if (<= (/ t_0 (+ (+ (* k 10.0) 1.0) (* k k))) 2e+102)
(/ (pow k m) (+ (/ 1.0 a_m) (* k (/ k a_m))))
t_0))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double t_0 = a_m * pow(k, m);
double tmp;
if ((t_0 / (((k * 10.0) + 1.0) + (k * k))) <= 2e+102) {
tmp = pow(k, m) / ((1.0 / a_m) + (k * (k / a_m)));
} else {
tmp = t_0;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a_m * (k ** m)
if ((t_0 / (((k * 10.0d0) + 1.0d0) + (k * k))) <= 2d+102) then
tmp = (k ** m) / ((1.0d0 / a_m) + (k * (k / a_m)))
else
tmp = t_0
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double t_0 = a_m * Math.pow(k, m);
double tmp;
if ((t_0 / (((k * 10.0) + 1.0) + (k * k))) <= 2e+102) {
tmp = Math.pow(k, m) / ((1.0 / a_m) + (k * (k / a_m)));
} else {
tmp = t_0;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): t_0 = a_m * math.pow(k, m) tmp = 0 if (t_0 / (((k * 10.0) + 1.0) + (k * k))) <= 2e+102: tmp = math.pow(k, m) / ((1.0 / a_m) + (k * (k / a_m))) else: tmp = t_0 return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) t_0 = Float64(a_m * (k ^ m)) tmp = 0.0 if (Float64(t_0 / Float64(Float64(Float64(k * 10.0) + 1.0) + Float64(k * k))) <= 2e+102) tmp = Float64((k ^ m) / Float64(Float64(1.0 / a_m) + Float64(k * Float64(k / a_m)))); else tmp = t_0; end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) t_0 = a_m * (k ^ m); tmp = 0.0; if ((t_0 / (((k * 10.0) + 1.0) + (k * k))) <= 2e+102) tmp = (k ^ m) / ((1.0 / a_m) + (k * (k / a_m))); else tmp = t_0; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := Block[{t$95$0 = N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[N[(t$95$0 / N[(N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+102], N[(N[Power[k, m], $MachinePrecision] / N[(N[(1.0 / a$95$m), $MachinePrecision] + N[(k * N[(k / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
\begin{array}{l}
t_0 := a\_m \cdot {k}^{m}\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;\frac{t\_0}{\left(k \cdot 10 + 1\right) + k \cdot k} \leq 2 \cdot 10^{+102}:\\
\;\;\;\;\frac{{k}^{m}}{\frac{1}{a\_m} + k \cdot \frac{k}{a\_m}}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\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))) < 1.99999999999999995e102Initial program 97.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-+.f6497.3%
Simplified97.3%
distribute-rgt-inN/A
+-commutativeN/A
associate-+l+N/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6497.3%
Applied egg-rr97.3%
div-invN/A
associate-*l*N/A
associate-/r/N/A
un-div-invN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6495.4%
Applied egg-rr95.4%
Taylor expanded in k around 0
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6497.7%
Simplified97.7%
Taylor expanded in k around inf
/-lowering-/.f6496.9%
Simplified96.9%
if 1.99999999999999995e102 < (/.f64 (*.f64 a (pow.f64 k m)) (+.f64 (+.f64 #s(literal 1 binary64) (*.f64 #s(literal 10 binary64) k)) (*.f64 k k))) Initial program 66.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-+.f6466.1%
Simplified66.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
pow-lowering-pow.f64100.0%
Simplified100.0%
Final simplification97.6%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= m 1.38e-18)
(/ (* a_m (pow k m)) (+ (* k (+ k 10.0)) 1.0))
(/ (pow k m) (/ 1.0 a_m)))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= 1.38e-18) {
tmp = (a_m * pow(k, m)) / ((k * (k + 10.0)) + 1.0);
} else {
tmp = pow(k, m) / (1.0 / a_m);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= 1.38d-18) then
tmp = (a_m * (k ** m)) / ((k * (k + 10.0d0)) + 1.0d0)
else
tmp = (k ** m) / (1.0d0 / a_m)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= 1.38e-18) {
tmp = (a_m * Math.pow(k, m)) / ((k * (k + 10.0)) + 1.0);
} else {
tmp = Math.pow(k, m) / (1.0 / a_m);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= 1.38e-18: tmp = (a_m * math.pow(k, m)) / ((k * (k + 10.0)) + 1.0) else: tmp = math.pow(k, m) / (1.0 / a_m) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= 1.38e-18) tmp = Float64(Float64(a_m * (k ^ m)) / Float64(Float64(k * Float64(k + 10.0)) + 1.0)); else tmp = Float64((k ^ m) / Float64(1.0 / a_m)); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= 1.38e-18) tmp = (a_m * (k ^ m)) / ((k * (k + 10.0)) + 1.0); else tmp = (k ^ m) / (1.0 / a_m); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, 1.38e-18], N[(N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision] / N[(N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[Power[k, m], $MachinePrecision] / N[(1.0 / a$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq 1.38 \cdot 10^{-18}:\\
\;\;\;\;\frac{a\_m \cdot {k}^{m}}{k \cdot \left(k + 10\right) + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{{k}^{m}}{\frac{1}{a\_m}}\\
\end{array}
\end{array}
if m < 1.38e-18Initial program 96.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-+.f6496.9%
Simplified96.9%
if 1.38e-18 < m Initial program 75.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-+.f6475.8%
Simplified75.8%
distribute-rgt-inN/A
+-commutativeN/A
associate-+l+N/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6475.8%
Applied egg-rr75.8%
div-invN/A
associate-*l*N/A
associate-/r/N/A
un-div-invN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6467.8%
Applied egg-rr67.8%
Taylor expanded in k around 0
/-lowering-/.f64100.0%
Simplified100.0%
Final simplification98.0%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= m 1.38e-18)
(* a_m (/ (pow k m) (+ (* k (+ k 10.0)) 1.0)))
(/ (pow k m) (/ 1.0 a_m)))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= 1.38e-18) {
tmp = a_m * (pow(k, m) / ((k * (k + 10.0)) + 1.0));
} else {
tmp = pow(k, m) / (1.0 / a_m);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= 1.38d-18) then
tmp = a_m * ((k ** m) / ((k * (k + 10.0d0)) + 1.0d0))
else
tmp = (k ** m) / (1.0d0 / a_m)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= 1.38e-18) {
tmp = a_m * (Math.pow(k, m) / ((k * (k + 10.0)) + 1.0));
} else {
tmp = Math.pow(k, m) / (1.0 / a_m);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= 1.38e-18: tmp = a_m * (math.pow(k, m) / ((k * (k + 10.0)) + 1.0)) else: tmp = math.pow(k, m) / (1.0 / a_m) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= 1.38e-18) tmp = Float64(a_m * Float64((k ^ m) / Float64(Float64(k * Float64(k + 10.0)) + 1.0))); else tmp = Float64((k ^ m) / Float64(1.0 / a_m)); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= 1.38e-18) tmp = a_m * ((k ^ m) / ((k * (k + 10.0)) + 1.0)); else tmp = (k ^ m) / (1.0 / a_m); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, 1.38e-18], N[(a$95$m * N[(N[Power[k, m], $MachinePrecision] / N[(N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Power[k, m], $MachinePrecision] / N[(1.0 / a$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq 1.38 \cdot 10^{-18}:\\
\;\;\;\;a\_m \cdot \frac{{k}^{m}}{k \cdot \left(k + 10\right) + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{{k}^{m}}{\frac{1}{a\_m}}\\
\end{array}
\end{array}
if m < 1.38e-18Initial program 96.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-+.f6496.9%
Simplified96.9%
distribute-rgt-inN/A
+-commutativeN/A
associate-+l+N/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6496.9%
Applied egg-rr96.9%
if 1.38e-18 < m Initial program 75.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-+.f6475.8%
Simplified75.8%
distribute-rgt-inN/A
+-commutativeN/A
associate-+l+N/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-+l+N/A
distribute-rgt-inN/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6475.8%
Applied egg-rr75.8%
div-invN/A
associate-*l*N/A
associate-/r/N/A
un-div-invN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6467.8%
Applied egg-rr67.8%
Taylor expanded in k around 0
/-lowering-/.f64100.0%
Simplified100.0%
Final simplification98.0%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(let* ((t_0 (* a_m (pow k m))))
(*
a_s
(if (<= m -0.245)
t_0
(if (<= m 2.8e-19) (/ a_m (+ (+ (* k 10.0) 1.0) (* k k))) t_0)))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double t_0 = a_m * pow(k, m);
double tmp;
if (m <= -0.245) {
tmp = t_0;
} else if (m <= 2.8e-19) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = t_0;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a_m * (k ** m)
if (m <= (-0.245d0)) then
tmp = t_0
else if (m <= 2.8d-19) then
tmp = a_m / (((k * 10.0d0) + 1.0d0) + (k * k))
else
tmp = t_0
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double t_0 = a_m * Math.pow(k, m);
double tmp;
if (m <= -0.245) {
tmp = t_0;
} else if (m <= 2.8e-19) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = t_0;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): t_0 = a_m * math.pow(k, m) tmp = 0 if m <= -0.245: tmp = t_0 elif m <= 2.8e-19: tmp = a_m / (((k * 10.0) + 1.0) + (k * k)) else: tmp = t_0 return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) t_0 = Float64(a_m * (k ^ m)) tmp = 0.0 if (m <= -0.245) tmp = t_0; elseif (m <= 2.8e-19) tmp = Float64(a_m / Float64(Float64(Float64(k * 10.0) + 1.0) + Float64(k * k))); else tmp = t_0; end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) t_0 = a_m * (k ^ m); tmp = 0.0; if (m <= -0.245) tmp = t_0; elseif (m <= 2.8e-19) tmp = a_m / (((k * 10.0) + 1.0) + (k * k)); else tmp = t_0; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := Block[{t$95$0 = N[(a$95$m * N[Power[k, m], $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[m, -0.245], t$95$0, If[LessEqual[m, 2.8e-19], N[(a$95$m / N[(N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
\begin{array}{l}
t_0 := a\_m \cdot {k}^{m}\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq -0.245:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;m \leq 2.8 \cdot 10^{-19}:\\
\;\;\;\;\frac{a\_m}{\left(k \cdot 10 + 1\right) + k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
\end{array}
if m < -0.245 or 2.80000000000000003e-19 < m Initial program 87.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-+.f6487.7%
Simplified87.7%
Taylor expanded in k around 0
*-lowering-*.f64N/A
pow-lowering-pow.f64100.0%
Simplified100.0%
if -0.245 < m < 2.80000000000000003e-19Initial program 93.9%
Taylor expanded in m around 0
Simplified93.7%
Final simplification97.9%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= m -0.66)
(/ (- a_m (/ (- a_m (/ a_m (* k k))) (* k k))) (* k k))
(if (<= m 2.8e-19)
(/ a_m (+ (+ (* k 10.0) 1.0) (* k k)))
(+ a_m (* (* k k) (* a_m (+ (* k k) -1.0))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.66) {
tmp = (a_m - ((a_m - (a_m / (k * k))) / (k * k))) / (k * k);
} else if (m <= 2.8e-19) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0)));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-0.66d0)) then
tmp = (a_m - ((a_m - (a_m / (k * k))) / (k * k))) / (k * k)
else if (m <= 2.8d-19) then
tmp = a_m / (((k * 10.0d0) + 1.0d0) + (k * k))
else
tmp = a_m + ((k * k) * (a_m * ((k * k) + (-1.0d0))))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.66) {
tmp = (a_m - ((a_m - (a_m / (k * k))) / (k * k))) / (k * k);
} else if (m <= 2.8e-19) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0)));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= -0.66: tmp = (a_m - ((a_m - (a_m / (k * k))) / (k * k))) / (k * k) elif m <= 2.8e-19: tmp = a_m / (((k * 10.0) + 1.0) + (k * k)) else: tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0))) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= -0.66) tmp = Float64(Float64(a_m - Float64(Float64(a_m - Float64(a_m / Float64(k * k))) / Float64(k * k))) / Float64(k * k)); elseif (m <= 2.8e-19) tmp = Float64(a_m / Float64(Float64(Float64(k * 10.0) + 1.0) + Float64(k * k))); else tmp = Float64(a_m + Float64(Float64(k * k) * Float64(a_m * Float64(Float64(k * k) + -1.0)))); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= -0.66) tmp = (a_m - ((a_m - (a_m / (k * k))) / (k * k))) / (k * k); elseif (m <= 2.8e-19) tmp = a_m / (((k * 10.0) + 1.0) + (k * k)); else tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0))); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, -0.66], N[(N[(a$95$m - N[(N[(a$95$m - N[(a$95$m / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 2.8e-19], N[(a$95$m / N[(N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m + N[(N[(k * k), $MachinePrecision] * N[(a$95$m * N[(N[(k * k), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq -0.66:\\
\;\;\;\;\frac{a\_m - \frac{a\_m - \frac{a\_m}{k \cdot k}}{k \cdot k}}{k \cdot k}\\
\mathbf{elif}\;m \leq 2.8 \cdot 10^{-19}:\\
\;\;\;\;\frac{a\_m}{\left(k \cdot 10 + 1\right) + k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;a\_m + \left(k \cdot k\right) \cdot \left(a\_m \cdot \left(k \cdot k + -1\right)\right)\\
\end{array}
\end{array}
if m < -0.660000000000000031Initial 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
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified40.9%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6440.9%
Simplified40.9%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f6444.2%
Applied egg-rr44.2%
Taylor expanded in k around inf
sub-negN/A
+-commutativeN/A
mul-1-negN/A
associate-+l+N/A
remove-double-negN/A
mul-1-negN/A
/-lowering-/.f64N/A
Simplified72.4%
if -0.660000000000000031 < m < 2.80000000000000003e-19Initial program 93.9%
Taylor expanded in m around 0
Simplified93.7%
if 2.80000000000000003e-19 < m Initial program 76.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-+.f6476.1%
Simplified76.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified5.1%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f645.1%
Simplified5.1%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
mul-1-negN/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6439.9%
Simplified39.9%
Final simplification68.3%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= m -0.39)
(/ (- a_m (/ (/ (* a_m -99.0) k) k)) (* k k))
(if (<= m 2.8e-19)
(/ a_m (+ (+ (* k 10.0) 1.0) (* k k)))
(+ a_m (* (* k k) (* a_m (+ (* k k) -1.0))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.39) {
tmp = (a_m - (((a_m * -99.0) / k) / k)) / (k * k);
} else if (m <= 2.8e-19) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0)));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-0.39d0)) then
tmp = (a_m - (((a_m * (-99.0d0)) / k) / k)) / (k * k)
else if (m <= 2.8d-19) then
tmp = a_m / (((k * 10.0d0) + 1.0d0) + (k * k))
else
tmp = a_m + ((k * k) * (a_m * ((k * k) + (-1.0d0))))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.39) {
tmp = (a_m - (((a_m * -99.0) / k) / k)) / (k * k);
} else if (m <= 2.8e-19) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0)));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= -0.39: tmp = (a_m - (((a_m * -99.0) / k) / k)) / (k * k) elif m <= 2.8e-19: tmp = a_m / (((k * 10.0) + 1.0) + (k * k)) else: tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0))) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= -0.39) tmp = Float64(Float64(a_m - Float64(Float64(Float64(a_m * -99.0) / k) / k)) / Float64(k * k)); elseif (m <= 2.8e-19) tmp = Float64(a_m / Float64(Float64(Float64(k * 10.0) + 1.0) + Float64(k * k))); else tmp = Float64(a_m + Float64(Float64(k * k) * Float64(a_m * Float64(Float64(k * k) + -1.0)))); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= -0.39) tmp = (a_m - (((a_m * -99.0) / k) / k)) / (k * k); elseif (m <= 2.8e-19) tmp = a_m / (((k * 10.0) + 1.0) + (k * k)); else tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0))); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, -0.39], N[(N[(a$95$m - N[(N[(N[(a$95$m * -99.0), $MachinePrecision] / k), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision] / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 2.8e-19], N[(a$95$m / N[(N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m + N[(N[(k * k), $MachinePrecision] * N[(a$95$m * N[(N[(k * k), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq -0.39:\\
\;\;\;\;\frac{a\_m - \frac{\frac{a\_m \cdot -99}{k}}{k}}{k \cdot k}\\
\mathbf{elif}\;m \leq 2.8 \cdot 10^{-19}:\\
\;\;\;\;\frac{a\_m}{\left(k \cdot 10 + 1\right) + k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;a\_m + \left(k \cdot k\right) \cdot \left(a\_m \cdot \left(k \cdot k + -1\right)\right)\\
\end{array}
\end{array}
if m < -0.39000000000000001Initial 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
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified40.9%
Taylor expanded in k around -inf
/-lowering-/.f64N/A
Simplified49.3%
Taylor expanded in k around 0
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-outN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6437.2%
Simplified37.2%
Taylor expanded in k around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6468.9%
Simplified68.9%
if -0.39000000000000001 < m < 2.80000000000000003e-19Initial program 93.9%
Taylor expanded in m around 0
Simplified93.7%
if 2.80000000000000003e-19 < m Initial program 76.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-+.f6476.1%
Simplified76.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified5.1%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f645.1%
Simplified5.1%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
mul-1-negN/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6439.9%
Simplified39.9%
Final simplification67.2%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= m -0.29)
(/ 1.0 (/ (* k k) a_m))
(if (<= m 2.3)
(/ a_m (+ (+ (* k 10.0) 1.0) (* k k)))
(+ a_m (* (* k k) (* a_m (+ (* k k) -1.0))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.29) {
tmp = 1.0 / ((k * k) / a_m);
} else if (m <= 2.3) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0)));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-0.29d0)) then
tmp = 1.0d0 / ((k * k) / a_m)
else if (m <= 2.3d0) then
tmp = a_m / (((k * 10.0d0) + 1.0d0) + (k * k))
else
tmp = a_m + ((k * k) * (a_m * ((k * k) + (-1.0d0))))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.29) {
tmp = 1.0 / ((k * k) / a_m);
} else if (m <= 2.3) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0)));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= -0.29: tmp = 1.0 / ((k * k) / a_m) elif m <= 2.3: tmp = a_m / (((k * 10.0) + 1.0) + (k * k)) else: tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0))) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= -0.29) tmp = Float64(1.0 / Float64(Float64(k * k) / a_m)); elseif (m <= 2.3) tmp = Float64(a_m / Float64(Float64(Float64(k * 10.0) + 1.0) + Float64(k * k))); else tmp = Float64(a_m + Float64(Float64(k * k) * Float64(a_m * Float64(Float64(k * k) + -1.0)))); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= -0.29) tmp = 1.0 / ((k * k) / a_m); elseif (m <= 2.3) tmp = a_m / (((k * 10.0) + 1.0) + (k * k)); else tmp = a_m + ((k * k) * (a_m * ((k * k) + -1.0))); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, -0.29], N[(1.0 / N[(N[(k * k), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 2.3], N[(a$95$m / N[(N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m + N[(N[(k * k), $MachinePrecision] * N[(a$95$m * N[(N[(k * k), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq -0.29:\\
\;\;\;\;\frac{1}{\frac{k \cdot k}{a\_m}}\\
\mathbf{elif}\;m \leq 2.3:\\
\;\;\;\;\frac{a\_m}{\left(k \cdot 10 + 1\right) + k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;a\_m + \left(k \cdot k\right) \cdot \left(a\_m \cdot \left(k \cdot k + -1\right)\right)\\
\end{array}
\end{array}
if m < -0.28999999999999998Initial 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
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified40.9%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6464.3%
Simplified64.3%
associate-/r*N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6467.6%
Applied egg-rr67.6%
if -0.28999999999999998 < m < 2.2999999999999998Initial program 94.1%
Taylor expanded in m around 0
Simplified93.8%
if 2.2999999999999998 < m Initial program 75.6%
/-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-+.f6475.6%
Simplified75.6%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified3.0%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f643.0%
Simplified3.0%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
mul-1-negN/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6438.6%
Simplified38.6%
Final simplification66.7%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= m -0.41)
(/ 1.0 (/ (* k k) a_m))
(if (<= m 2.8e-19)
(/ a_m (+ (+ (* k 10.0) 1.0) (* k k)))
(+ a_m (* k (+ (* k (* a_m 99.0)) (* a_m -10.0))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.41) {
tmp = 1.0 / ((k * k) / a_m);
} else if (m <= 2.8e-19) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = a_m + (k * ((k * (a_m * 99.0)) + (a_m * -10.0)));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-0.41d0)) then
tmp = 1.0d0 / ((k * k) / a_m)
else if (m <= 2.8d-19) then
tmp = a_m / (((k * 10.0d0) + 1.0d0) + (k * k))
else
tmp = a_m + (k * ((k * (a_m * 99.0d0)) + (a_m * (-10.0d0))))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.41) {
tmp = 1.0 / ((k * k) / a_m);
} else if (m <= 2.8e-19) {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
} else {
tmp = a_m + (k * ((k * (a_m * 99.0)) + (a_m * -10.0)));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= -0.41: tmp = 1.0 / ((k * k) / a_m) elif m <= 2.8e-19: tmp = a_m / (((k * 10.0) + 1.0) + (k * k)) else: tmp = a_m + (k * ((k * (a_m * 99.0)) + (a_m * -10.0))) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= -0.41) tmp = Float64(1.0 / Float64(Float64(k * k) / a_m)); elseif (m <= 2.8e-19) tmp = Float64(a_m / Float64(Float64(Float64(k * 10.0) + 1.0) + Float64(k * k))); else tmp = Float64(a_m + Float64(k * Float64(Float64(k * Float64(a_m * 99.0)) + Float64(a_m * -10.0)))); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= -0.41) tmp = 1.0 / ((k * k) / a_m); elseif (m <= 2.8e-19) tmp = a_m / (((k * 10.0) + 1.0) + (k * k)); else tmp = a_m + (k * ((k * (a_m * 99.0)) + (a_m * -10.0))); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, -0.41], N[(1.0 / N[(N[(k * k), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 2.8e-19], N[(a$95$m / N[(N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a$95$m + N[(k * N[(N[(k * N[(a$95$m * 99.0), $MachinePrecision]), $MachinePrecision] + N[(a$95$m * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq -0.41:\\
\;\;\;\;\frac{1}{\frac{k \cdot k}{a\_m}}\\
\mathbf{elif}\;m \leq 2.8 \cdot 10^{-19}:\\
\;\;\;\;\frac{a\_m}{\left(k \cdot 10 + 1\right) + k \cdot k}\\
\mathbf{else}:\\
\;\;\;\;a\_m + k \cdot \left(k \cdot \left(a\_m \cdot 99\right) + a\_m \cdot -10\right)\\
\end{array}
\end{array}
if m < -0.409999999999999976Initial 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
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified40.9%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6464.3%
Simplified64.3%
associate-/r*N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6467.6%
Applied egg-rr67.6%
if -0.409999999999999976 < m < 2.80000000000000003e-19Initial program 93.9%
Taylor expanded in m around 0
Simplified93.7%
if 2.80000000000000003e-19 < m Initial program 76.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-+.f6476.1%
Simplified76.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified5.1%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
mul-1-negN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
distribute-rgt1-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
*-commutativeN/A
*-lowering-*.f6431.3%
Simplified31.3%
Final simplification63.8%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= k -3e-308)
(/ 1.0 (/ (* k k) a_m))
(if (<= k 10.0) (/ a_m (+ (* k 10.0) 1.0)) (/ (/ a_m k) k)))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = 1.0 / ((k * k) / a_m);
} else if (k <= 10.0) {
tmp = a_m / ((k * 10.0) + 1.0);
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (k <= (-3d-308)) then
tmp = 1.0d0 / ((k * k) / a_m)
else if (k <= 10.0d0) then
tmp = a_m / ((k * 10.0d0) + 1.0d0)
else
tmp = (a_m / k) / k
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = 1.0 / ((k * k) / a_m);
} else if (k <= 10.0) {
tmp = a_m / ((k * 10.0) + 1.0);
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if k <= -3e-308: tmp = 1.0 / ((k * k) / a_m) elif k <= 10.0: tmp = a_m / ((k * 10.0) + 1.0) else: tmp = (a_m / k) / k return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (k <= -3e-308) tmp = Float64(1.0 / Float64(Float64(k * k) / a_m)); elseif (k <= 10.0) tmp = Float64(a_m / Float64(Float64(k * 10.0) + 1.0)); else tmp = Float64(Float64(a_m / k) / k); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (k <= -3e-308) tmp = 1.0 / ((k * k) / a_m); elseif (k <= 10.0) tmp = a_m / ((k * 10.0) + 1.0); else tmp = (a_m / k) / k; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[k, -3e-308], N[(1.0 / N[(N[(k * k), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 10.0], N[(a$95$m / N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(a$95$m / k), $MachinePrecision] / k), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;k \leq -3 \cdot 10^{-308}:\\
\;\;\;\;\frac{1}{\frac{k \cdot k}{a\_m}}\\
\mathbf{elif}\;k \leq 10:\\
\;\;\;\;\frac{a\_m}{k \cdot 10 + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{a\_m}{k}}{k}\\
\end{array}
\end{array}
if k < -3.00000000000000022e-308Initial program 88.6%
/-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-+.f6488.6%
Simplified88.6%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified23.4%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6433.9%
Simplified33.9%
associate-/r*N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6434.5%
Applied egg-rr34.5%
if -3.00000000000000022e-308 < k < 10Initial 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-+.f6499.9%
Simplified99.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified54.1%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6453.4%
Simplified53.4%
if 10 < k Initial program 80.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-+.f6480.1%
Simplified80.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified58.5%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6458.0%
Simplified58.0%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7%
Applied egg-rr60.7%
Final simplification50.1%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= k -3e-308)
(/ 1.0 (/ (* k k) a_m))
(if (<= k 0.14) (+ a_m (* a_m (* k -10.0))) (/ (/ a_m k) k)))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = 1.0 / ((k * k) / a_m);
} else if (k <= 0.14) {
tmp = a_m + (a_m * (k * -10.0));
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (k <= (-3d-308)) then
tmp = 1.0d0 / ((k * k) / a_m)
else if (k <= 0.14d0) then
tmp = a_m + (a_m * (k * (-10.0d0)))
else
tmp = (a_m / k) / k
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = 1.0 / ((k * k) / a_m);
} else if (k <= 0.14) {
tmp = a_m + (a_m * (k * -10.0));
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if k <= -3e-308: tmp = 1.0 / ((k * k) / a_m) elif k <= 0.14: tmp = a_m + (a_m * (k * -10.0)) else: tmp = (a_m / k) / k return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (k <= -3e-308) tmp = Float64(1.0 / Float64(Float64(k * k) / a_m)); elseif (k <= 0.14) tmp = Float64(a_m + Float64(a_m * Float64(k * -10.0))); else tmp = Float64(Float64(a_m / k) / k); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (k <= -3e-308) tmp = 1.0 / ((k * k) / a_m); elseif (k <= 0.14) tmp = a_m + (a_m * (k * -10.0)); else tmp = (a_m / k) / k; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[k, -3e-308], N[(1.0 / N[(N[(k * k), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 0.14], N[(a$95$m + N[(a$95$m * N[(k * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a$95$m / k), $MachinePrecision] / k), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;k \leq -3 \cdot 10^{-308}:\\
\;\;\;\;\frac{1}{\frac{k \cdot k}{a\_m}}\\
\mathbf{elif}\;k \leq 0.14:\\
\;\;\;\;a\_m + a\_m \cdot \left(k \cdot -10\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{a\_m}{k}}{k}\\
\end{array}
\end{array}
if k < -3.00000000000000022e-308Initial program 88.6%
/-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-+.f6488.6%
Simplified88.6%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified23.4%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6433.9%
Simplified33.9%
associate-/r*N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6434.5%
Applied egg-rr34.5%
if -3.00000000000000022e-308 < k < 0.14000000000000001Initial 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-+.f6499.9%
Simplified99.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified54.1%
*-commutativeN/A
flip-+N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval54.1%
Applied egg-rr54.1%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6453.3%
Simplified53.3%
if 0.14000000000000001 < k Initial program 80.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-+.f6480.1%
Simplified80.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified58.5%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6458.0%
Simplified58.0%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7%
Applied egg-rr60.7%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= k -3e-308)
(/ a_m (* k k))
(if (<= k 0.14) (+ a_m (* a_m (* k -10.0))) (/ (/ a_m k) k)))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = a_m / (k * k);
} else if (k <= 0.14) {
tmp = a_m + (a_m * (k * -10.0));
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (k <= (-3d-308)) then
tmp = a_m / (k * k)
else if (k <= 0.14d0) then
tmp = a_m + (a_m * (k * (-10.0d0)))
else
tmp = (a_m / k) / k
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = a_m / (k * k);
} else if (k <= 0.14) {
tmp = a_m + (a_m * (k * -10.0));
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if k <= -3e-308: tmp = a_m / (k * k) elif k <= 0.14: tmp = a_m + (a_m * (k * -10.0)) else: tmp = (a_m / k) / k return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (k <= -3e-308) tmp = Float64(a_m / Float64(k * k)); elseif (k <= 0.14) tmp = Float64(a_m + Float64(a_m * Float64(k * -10.0))); else tmp = Float64(Float64(a_m / k) / k); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (k <= -3e-308) tmp = a_m / (k * k); elseif (k <= 0.14) tmp = a_m + (a_m * (k * -10.0)); else tmp = (a_m / k) / k; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[k, -3e-308], N[(a$95$m / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 0.14], N[(a$95$m + N[(a$95$m * N[(k * -10.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a$95$m / k), $MachinePrecision] / k), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;k \leq -3 \cdot 10^{-308}:\\
\;\;\;\;\frac{a\_m}{k \cdot k}\\
\mathbf{elif}\;k \leq 0.14:\\
\;\;\;\;a\_m + a\_m \cdot \left(k \cdot -10\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{a\_m}{k}}{k}\\
\end{array}
\end{array}
if k < -3.00000000000000022e-308Initial program 88.6%
/-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-+.f6488.6%
Simplified88.6%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified23.4%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6433.9%
Simplified33.9%
if -3.00000000000000022e-308 < k < 0.14000000000000001Initial 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-+.f6499.9%
Simplified99.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified54.1%
*-commutativeN/A
flip-+N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-evalN/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval54.1%
Applied egg-rr54.1%
Taylor expanded in k around 0
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6453.3%
Simplified53.3%
if 0.14000000000000001 < k Initial program 80.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-+.f6480.1%
Simplified80.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified58.5%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6458.0%
Simplified58.0%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7%
Applied egg-rr60.7%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= k -3e-308)
(/ a_m (* k k))
(if (<= k 1.0) (* a_m (- 1.0 (* k k))) (/ (/ a_m k) k)))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = a_m / (k * k);
} else if (k <= 1.0) {
tmp = a_m * (1.0 - (k * k));
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (k <= (-3d-308)) then
tmp = a_m / (k * k)
else if (k <= 1.0d0) then
tmp = a_m * (1.0d0 - (k * k))
else
tmp = (a_m / k) / k
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = a_m / (k * k);
} else if (k <= 1.0) {
tmp = a_m * (1.0 - (k * k));
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if k <= -3e-308: tmp = a_m / (k * k) elif k <= 1.0: tmp = a_m * (1.0 - (k * k)) else: tmp = (a_m / k) / k return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (k <= -3e-308) tmp = Float64(a_m / Float64(k * k)); elseif (k <= 1.0) tmp = Float64(a_m * Float64(1.0 - Float64(k * k))); else tmp = Float64(Float64(a_m / k) / k); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (k <= -3e-308) tmp = a_m / (k * k); elseif (k <= 1.0) tmp = a_m * (1.0 - (k * k)); else tmp = (a_m / k) / k; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[k, -3e-308], N[(a$95$m / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 1.0], N[(a$95$m * N[(1.0 - N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a$95$m / k), $MachinePrecision] / k), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;k \leq -3 \cdot 10^{-308}:\\
\;\;\;\;\frac{a\_m}{k \cdot k}\\
\mathbf{elif}\;k \leq 1:\\
\;\;\;\;a\_m \cdot \left(1 - k \cdot k\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{a\_m}{k}}{k}\\
\end{array}
\end{array}
if k < -3.00000000000000022e-308Initial program 88.6%
/-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-+.f6488.6%
Simplified88.6%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified23.4%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6433.9%
Simplified33.9%
if -3.00000000000000022e-308 < k < 1Initial 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-+.f6499.9%
Simplified99.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified54.1%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6452.9%
Simplified52.9%
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f6452.7%
Applied egg-rr52.7%
Taylor expanded in k around 0
mul-1-negN/A
unsub-negN/A
*-lft-identityN/A
*-commutativeN/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6452.9%
Simplified52.9%
if 1 < k Initial program 80.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-+.f6480.1%
Simplified80.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified58.5%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6458.0%
Simplified58.0%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7%
Applied egg-rr60.7%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
(FPCore (a_s a_m k m)
:precision binary64
(*
a_s
(if (<= m -0.35)
(/ 1.0 (/ (* k k) a_m))
(/ a_m (+ (+ (* k 10.0) 1.0) (* k k))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.35) {
tmp = 1.0 / ((k * k) / a_m);
} else {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-0.35d0)) then
tmp = 1.0d0 / ((k * k) / a_m)
else
tmp = a_m / (((k * 10.0d0) + 1.0d0) + (k * k))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.35) {
tmp = 1.0 / ((k * k) / a_m);
} else {
tmp = a_m / (((k * 10.0) + 1.0) + (k * k));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= -0.35: tmp = 1.0 / ((k * k) / a_m) else: tmp = a_m / (((k * 10.0) + 1.0) + (k * k)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= -0.35) tmp = Float64(1.0 / Float64(Float64(k * k) / a_m)); else tmp = Float64(a_m / Float64(Float64(Float64(k * 10.0) + 1.0) + Float64(k * k))); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= -0.35) tmp = 1.0 / ((k * k) / a_m); else tmp = a_m / (((k * 10.0) + 1.0) + (k * k)); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, -0.35], N[(1.0 / N[(N[(k * k), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(a$95$m / N[(N[(N[(k * 10.0), $MachinePrecision] + 1.0), $MachinePrecision] + N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq -0.35:\\
\;\;\;\;\frac{1}{\frac{k \cdot k}{a\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{a\_m}{\left(k \cdot 10 + 1\right) + k \cdot k}\\
\end{array}
\end{array}
if m < -0.34999999999999998Initial 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
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified40.9%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6464.3%
Simplified64.3%
associate-/r*N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6467.6%
Applied egg-rr67.6%
if -0.34999999999999998 < m Initial program 84.9%
Taylor expanded in m around 0
Simplified48.6%
Final simplification54.8%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) (FPCore (a_s a_m k m) :precision binary64 (* a_s (if (<= k -3e-308) (/ a_m (* k k)) (if (<= k 1.0) a_m (/ (/ a_m k) k)))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = a_m / (k * k);
} else if (k <= 1.0) {
tmp = a_m;
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (k <= (-3d-308)) then
tmp = a_m / (k * k)
else if (k <= 1.0d0) then
tmp = a_m
else
tmp = (a_m / k) / k
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (k <= -3e-308) {
tmp = a_m / (k * k);
} else if (k <= 1.0) {
tmp = a_m;
} else {
tmp = (a_m / k) / k;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if k <= -3e-308: tmp = a_m / (k * k) elif k <= 1.0: tmp = a_m else: tmp = (a_m / k) / k return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (k <= -3e-308) tmp = Float64(a_m / Float64(k * k)); elseif (k <= 1.0) tmp = a_m; else tmp = Float64(Float64(a_m / k) / k); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (k <= -3e-308) tmp = a_m / (k * k); elseif (k <= 1.0) tmp = a_m; else tmp = (a_m / k) / k; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[k, -3e-308], N[(a$95$m / N[(k * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 1.0], a$95$m, N[(N[(a$95$m / k), $MachinePrecision] / k), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;k \leq -3 \cdot 10^{-308}:\\
\;\;\;\;\frac{a\_m}{k \cdot k}\\
\mathbf{elif}\;k \leq 1:\\
\;\;\;\;a\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{a\_m}{k}}{k}\\
\end{array}
\end{array}
if k < -3.00000000000000022e-308Initial program 88.6%
/-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-+.f6488.6%
Simplified88.6%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified23.4%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6433.9%
Simplified33.9%
if -3.00000000000000022e-308 < k < 1Initial 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-+.f6499.9%
Simplified99.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified54.1%
Taylor expanded in k around 0
Simplified52.9%
if 1 < k Initial program 80.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-+.f6480.1%
Simplified80.1%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified58.5%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6458.0%
Simplified58.0%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7%
Applied egg-rr60.7%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) (FPCore (a_s a_m k m) :precision binary64 (let* ((t_0 (/ a_m (* k k)))) (* a_s (if (<= k -3e-308) t_0 (if (<= k 1.0) a_m t_0)))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double t_0 = a_m / (k * k);
double tmp;
if (k <= -3e-308) {
tmp = t_0;
} else if (k <= 1.0) {
tmp = a_m;
} else {
tmp = t_0;
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: t_0
real(8) :: tmp
t_0 = a_m / (k * k)
if (k <= (-3d-308)) then
tmp = t_0
else if (k <= 1.0d0) then
tmp = a_m
else
tmp = t_0
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double t_0 = a_m / (k * k);
double tmp;
if (k <= -3e-308) {
tmp = t_0;
} else if (k <= 1.0) {
tmp = a_m;
} else {
tmp = t_0;
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): t_0 = a_m / (k * k) tmp = 0 if k <= -3e-308: tmp = t_0 elif k <= 1.0: tmp = a_m else: tmp = t_0 return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) t_0 = Float64(a_m / Float64(k * k)) tmp = 0.0 if (k <= -3e-308) tmp = t_0; elseif (k <= 1.0) tmp = a_m; else tmp = t_0; end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) t_0 = a_m / (k * k); tmp = 0.0; if (k <= -3e-308) tmp = t_0; elseif (k <= 1.0) tmp = a_m; else tmp = t_0; end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := Block[{t$95$0 = N[(a$95$m / N[(k * k), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[k, -3e-308], t$95$0, If[LessEqual[k, 1.0], a$95$m, t$95$0]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
\begin{array}{l}
t_0 := \frac{a\_m}{k \cdot k}\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;k \leq -3 \cdot 10^{-308}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;k \leq 1:\\
\;\;\;\;a\_m\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
\end{array}
if k < -3.00000000000000022e-308 or 1 < 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
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified41.7%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6446.5%
Simplified46.5%
if -3.00000000000000022e-308 < k < 1Initial 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-+.f6499.9%
Simplified99.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified54.1%
Taylor expanded in k around 0
Simplified52.9%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) (FPCore (a_s a_m k m) :precision binary64 (* a_s (if (<= m -0.32) (/ 1.0 (/ (* k k) a_m)) (/ a_m (+ (* k (+ k 10.0)) 1.0)))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.32) {
tmp = 1.0 / ((k * k) / a_m);
} else {
tmp = a_m / ((k * (k + 10.0)) + 1.0);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-0.32d0)) then
tmp = 1.0d0 / ((k * k) / a_m)
else
tmp = a_m / ((k * (k + 10.0d0)) + 1.0d0)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.32) {
tmp = 1.0 / ((k * k) / a_m);
} else {
tmp = a_m / ((k * (k + 10.0)) + 1.0);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= -0.32: tmp = 1.0 / ((k * k) / a_m) else: tmp = a_m / ((k * (k + 10.0)) + 1.0) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= -0.32) tmp = Float64(1.0 / Float64(Float64(k * k) / a_m)); else tmp = Float64(a_m / Float64(Float64(k * Float64(k + 10.0)) + 1.0)); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= -0.32) tmp = 1.0 / ((k * k) / a_m); else tmp = a_m / ((k * (k + 10.0)) + 1.0); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, -0.32], N[(1.0 / N[(N[(k * k), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(a$95$m / N[(N[(k * N[(k + 10.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq -0.32:\\
\;\;\;\;\frac{1}{\frac{k \cdot k}{a\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{a\_m}{k \cdot \left(k + 10\right) + 1}\\
\end{array}
\end{array}
if m < -0.320000000000000007Initial 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
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified40.9%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6464.3%
Simplified64.3%
associate-/r*N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6467.6%
Applied egg-rr67.6%
if -0.320000000000000007 < m Initial program 84.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-+.f6484.9%
Simplified84.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified48.6%
Final simplification54.8%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) (FPCore (a_s a_m k m) :precision binary64 (* a_s (if (<= m -0.62) (/ 1.0 (/ (* k k) a_m)) (/ a_m (+ (* k k) 1.0)))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.62) {
tmp = 1.0 / ((k * k) / a_m);
} else {
tmp = a_m / ((k * k) + 1.0);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8) :: tmp
if (m <= (-0.62d0)) then
tmp = 1.0d0 / ((k * k) / a_m)
else
tmp = a_m / ((k * k) + 1.0d0)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
double tmp;
if (m <= -0.62) {
tmp = 1.0 / ((k * k) / a_m);
} else {
tmp = a_m / ((k * k) + 1.0);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): tmp = 0 if m <= -0.62: tmp = 1.0 / ((k * k) / a_m) else: tmp = a_m / ((k * k) + 1.0) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) tmp = 0.0 if (m <= -0.62) tmp = Float64(1.0 / Float64(Float64(k * k) / a_m)); else tmp = Float64(a_m / Float64(Float64(k * k) + 1.0)); end return Float64(a_s * tmp) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp_2 = code(a_s, a_m, k, m) tmp = 0.0; if (m <= -0.62) tmp = 1.0 / ((k * k) / a_m); else tmp = a_m / ((k * k) + 1.0); end tmp_2 = a_s * tmp; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * If[LessEqual[m, -0.62], N[(1.0 / N[(N[(k * k), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(a$95$m / N[(N[(k * k), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;m \leq -0.62:\\
\;\;\;\;\frac{1}{\frac{k \cdot k}{a\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{a\_m}{k \cdot k + 1}\\
\end{array}
\end{array}
if m < -0.619999999999999996Initial 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
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified40.9%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6464.3%
Simplified64.3%
associate-/r*N/A
clear-numN/A
un-div-invN/A
clear-numN/A
/-lowering-/.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6467.6%
Applied egg-rr67.6%
if -0.619999999999999996 < m Initial program 84.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-+.f6484.9%
Simplified84.9%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified48.6%
Taylor expanded in k around inf
unpow2N/A
*-lowering-*.f6447.7%
Simplified47.7%
Final simplification54.2%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) (FPCore (a_s a_m k m) :precision binary64 (* a_s a_m))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
double code(double a_s, double a_m, double k, double m) {
return a_s * a_m;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
real(8) function code(a_s, a_m, k, m)
real(8), intent (in) :: a_s
real(8), intent (in) :: a_m
real(8), intent (in) :: k
real(8), intent (in) :: m
code = a_s * a_m
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
public static double code(double a_s, double a_m, double k, double m) {
return a_s * a_m;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) def code(a_s, a_m, k, m): return a_s * a_m
a\_m = abs(a) a\_s = copysign(1.0, a) function code(a_s, a_m, k, m) return Float64(a_s * a_m) end
a\_m = abs(a); a\_s = sign(a) * abs(1.0); function tmp = code(a_s, a_m, k, m) tmp = a_s * a_m; end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[a$95$s_, a$95$m_, k_, m_] := N[(a$95$s * a$95$m), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
a\_s \cdot a\_m
\end{array}
Initial program 89.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-+.f6489.8%
Simplified89.8%
Taylor expanded in m around 0
/-lowering-/.f64N/A
+-commutativeN/A
fma-defineN/A
metadata-evalN/A
lft-mult-inverseN/A
associate-*l*N/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
lft-mult-inverseN/A
fma-defineN/A
associate-*l*N/A
unpow2N/A
lft-mult-inverseN/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-inN/A
Simplified46.1%
Taylor expanded in k around 0
Simplified21.2%
herbie shell --seed 2024145
(FPCore (a k m)
:name "Falkner and Boettcher, Appendix A"
:precision binary64
(/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))