
(FPCore (c x y) :precision binary64 (* c (log (+ 1.0 (* (- (pow (E) x) 1.0) y)))))
\begin{array}{l}
\\
c \cdot \log \left(1 + \left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (c x y) :precision binary64 (* c (log (+ 1.0 (* (- (pow (E) x) 1.0) y)))))
\begin{array}{l}
\\
c \cdot \log \left(1 + \left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y\right)
\end{array}
(FPCore (c x y) :precision binary64 (if (<= y -2.3e-96) (* c (log1p (* (expm1 x) y))) (if (<= y 5e+36) (* (* c (expm1 x)) y) (* (log1p (* x y)) c))))
double code(double c, double x, double y) {
double tmp;
if (y <= -2.3e-96) {
tmp = c * log1p((expm1(x) * y));
} else if (y <= 5e+36) {
tmp = (c * expm1(x)) * y;
} else {
tmp = log1p((x * y)) * c;
}
return tmp;
}
public static double code(double c, double x, double y) {
double tmp;
if (y <= -2.3e-96) {
tmp = c * Math.log1p((Math.expm1(x) * y));
} else if (y <= 5e+36) {
tmp = (c * Math.expm1(x)) * y;
} else {
tmp = Math.log1p((x * y)) * c;
}
return tmp;
}
def code(c, x, y): tmp = 0 if y <= -2.3e-96: tmp = c * math.log1p((math.expm1(x) * y)) elif y <= 5e+36: tmp = (c * math.expm1(x)) * y else: tmp = math.log1p((x * y)) * c return tmp
function code(c, x, y) tmp = 0.0 if (y <= -2.3e-96) tmp = Float64(c * log1p(Float64(expm1(x) * y))); elseif (y <= 5e+36) tmp = Float64(Float64(c * expm1(x)) * y); else tmp = Float64(log1p(Float64(x * y)) * c); end return tmp end
code[c_, x_, y_] := If[LessEqual[y, -2.3e-96], N[(c * N[Log[1 + N[(N[(Exp[x] - 1), $MachinePrecision] * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 5e+36], N[(N[(c * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], N[(N[Log[1 + N[(x * y), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2.3 \cdot 10^{-96}:\\
\;\;\;\;c \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(x\right) \cdot y\right)\\
\mathbf{elif}\;y \leq 5 \cdot 10^{+36}:\\
\;\;\;\;\left(c \cdot \mathsf{expm1}\left(x\right)\right) \cdot y\\
\mathbf{else}:\\
\;\;\;\;\mathsf{log1p}\left(x \cdot y\right) \cdot c\\
\end{array}
\end{array}
if y < -2.3e-96Initial program 56.1%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6456.1
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6461.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6461.7
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6499.8
Applied rewrites99.8%
if -2.3e-96 < y < 4.99999999999999977e36Initial program 48.9%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6448.9
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6468.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6468.9
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6488.8
Applied rewrites88.8%
Taylor expanded in y around 0
*-commutativeN/A
*-lft-identityN/A
exp-prodN/A
e-exp-1N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
e-exp-1N/A
exp-prodN/A
*-lft-identityN/A
lower-expm1.f6499.9
Applied rewrites99.9%
if 4.99999999999999977e36 < y Initial program 10.8%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6410.8
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6410.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6410.8
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6499.6
Applied rewrites99.6%
Taylor expanded in x around 0
lower-*.f6499.6
Applied rewrites99.6%
Final simplification99.8%
(FPCore (c x y) :precision binary64 (let* ((t_0 (* (log1p (* x y)) c))) (if (<= y -250.0) t_0 (if (<= y 5e+36) (* (* c (expm1 x)) y) t_0))))
double code(double c, double x, double y) {
double t_0 = log1p((x * y)) * c;
double tmp;
if (y <= -250.0) {
tmp = t_0;
} else if (y <= 5e+36) {
tmp = (c * expm1(x)) * y;
} else {
tmp = t_0;
}
return tmp;
}
public static double code(double c, double x, double y) {
double t_0 = Math.log1p((x * y)) * c;
double tmp;
if (y <= -250.0) {
tmp = t_0;
} else if (y <= 5e+36) {
tmp = (c * Math.expm1(x)) * y;
} else {
tmp = t_0;
}
return tmp;
}
def code(c, x, y): t_0 = math.log1p((x * y)) * c tmp = 0 if y <= -250.0: tmp = t_0 elif y <= 5e+36: tmp = (c * math.expm1(x)) * y else: tmp = t_0 return tmp
function code(c, x, y) t_0 = Float64(log1p(Float64(x * y)) * c) tmp = 0.0 if (y <= -250.0) tmp = t_0; elseif (y <= 5e+36) tmp = Float64(Float64(c * expm1(x)) * y); else tmp = t_0; end return tmp end
code[c_, x_, y_] := Block[{t$95$0 = N[(N[Log[1 + N[(x * y), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]}, If[LessEqual[y, -250.0], t$95$0, If[LessEqual[y, 5e+36], N[(N[(c * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{log1p}\left(x \cdot y\right) \cdot c\\
\mathbf{if}\;y \leq -250:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;y \leq 5 \cdot 10^{+36}:\\
\;\;\;\;\left(c \cdot \mathsf{expm1}\left(x\right)\right) \cdot y\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if y < -250 or 4.99999999999999977e36 < y Initial program 44.9%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6444.9
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6444.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6444.9
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6499.7
Applied rewrites99.7%
Taylor expanded in x around 0
lower-*.f6473.0
Applied rewrites73.0%
if -250 < y < 4.99999999999999977e36Initial program 47.9%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6447.9
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6468.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6468.5
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6490.5
Applied rewrites90.5%
Taylor expanded in y around 0
*-commutativeN/A
*-lft-identityN/A
exp-prodN/A
e-exp-1N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
e-exp-1N/A
exp-prodN/A
*-lft-identityN/A
lower-expm1.f6498.4
Applied rewrites98.4%
Final simplification87.9%
(FPCore (c x y) :precision binary64 (if (<= c 3.9e+74) (* (* c y) (expm1 x)) (* (* c (expm1 x)) y)))
double code(double c, double x, double y) {
double tmp;
if (c <= 3.9e+74) {
tmp = (c * y) * expm1(x);
} else {
tmp = (c * expm1(x)) * y;
}
return tmp;
}
public static double code(double c, double x, double y) {
double tmp;
if (c <= 3.9e+74) {
tmp = (c * y) * Math.expm1(x);
} else {
tmp = (c * Math.expm1(x)) * y;
}
return tmp;
}
def code(c, x, y): tmp = 0 if c <= 3.9e+74: tmp = (c * y) * math.expm1(x) else: tmp = (c * math.expm1(x)) * y return tmp
function code(c, x, y) tmp = 0.0 if (c <= 3.9e+74) tmp = Float64(Float64(c * y) * expm1(x)); else tmp = Float64(Float64(c * expm1(x)) * y); end return tmp end
code[c_, x_, y_] := If[LessEqual[c, 3.9e+74], N[(N[(c * y), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], N[(N[(c * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;c \leq 3.9 \cdot 10^{+74}:\\
\;\;\;\;\left(c \cdot y\right) \cdot \mathsf{expm1}\left(x\right)\\
\mathbf{else}:\\
\;\;\;\;\left(c \cdot \mathsf{expm1}\left(x\right)\right) \cdot y\\
\end{array}
\end{array}
if c < 3.90000000000000008e74Initial program 54.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6454.7
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6464.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6464.3
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6496.1
Applied rewrites96.1%
Taylor expanded in y around 0
*-commutativeN/A
*-lft-identityN/A
exp-prodN/A
e-exp-1N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
e-exp-1N/A
exp-prodN/A
*-lft-identityN/A
lower-expm1.f6473.6
Applied rewrites73.6%
Applied rewrites74.7%
if 3.90000000000000008e74 < c Initial program 17.4%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6417.4
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6438.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6438.4
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6487.7
Applied rewrites87.7%
Taylor expanded in y around 0
*-commutativeN/A
*-lft-identityN/A
exp-prodN/A
e-exp-1N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
e-exp-1N/A
exp-prodN/A
*-lft-identityN/A
lower-expm1.f6476.2
Applied rewrites76.2%
Final simplification75.0%
(FPCore (c x y) :precision binary64 (* (* c y) (expm1 x)))
double code(double c, double x, double y) {
return (c * y) * expm1(x);
}
public static double code(double c, double x, double y) {
return (c * y) * Math.expm1(x);
}
def code(c, x, y): return (c * y) * math.expm1(x)
function code(c, x, y) return Float64(Float64(c * y) * expm1(x)) end
code[c_, x_, y_] := N[(N[(c * y), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(c \cdot y\right) \cdot \mathsf{expm1}\left(x\right)
\end{array}
Initial program 46.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6446.7
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6458.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6458.7
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6494.3
Applied rewrites94.3%
Taylor expanded in y around 0
*-commutativeN/A
*-lft-identityN/A
exp-prodN/A
e-exp-1N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
e-exp-1N/A
exp-prodN/A
*-lft-identityN/A
lower-expm1.f6474.1
Applied rewrites74.1%
Applied rewrites73.6%
(FPCore (c x y) :precision binary64 (if (<= c 4.8e+41) (* (* (fma (* -0.5 y) x (fma 0.5 x 1.0)) (* c y)) x) (* (* c x) y)))
double code(double c, double x, double y) {
double tmp;
if (c <= 4.8e+41) {
tmp = (fma((-0.5 * y), x, fma(0.5, x, 1.0)) * (c * y)) * x;
} else {
tmp = (c * x) * y;
}
return tmp;
}
function code(c, x, y) tmp = 0.0 if (c <= 4.8e+41) tmp = Float64(Float64(fma(Float64(-0.5 * y), x, fma(0.5, x, 1.0)) * Float64(c * y)) * x); else tmp = Float64(Float64(c * x) * y); end return tmp end
code[c_, x_, y_] := If[LessEqual[c, 4.8e+41], N[(N[(N[(N[(-0.5 * y), $MachinePrecision] * x + N[(0.5 * x + 1.0), $MachinePrecision]), $MachinePrecision] * N[(c * y), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], N[(N[(c * x), $MachinePrecision] * y), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;c \leq 4.8 \cdot 10^{+41}:\\
\;\;\;\;\left(\mathsf{fma}\left(-0.5 \cdot y, x, \mathsf{fma}\left(0.5, x, 1\right)\right) \cdot \left(c \cdot y\right)\right) \cdot x\\
\mathbf{else}:\\
\;\;\;\;\left(c \cdot x\right) \cdot y\\
\end{array}
\end{array}
if c < 4.8000000000000003e41Initial program 54.7%
Taylor expanded in x around 0
Applied rewrites58.1%
Taylor expanded in y around 0
Applied rewrites61.7%
Applied rewrites64.1%
if 4.8000000000000003e41 < c Initial program 20.8%
Taylor expanded in x around 0
associate-*r*N/A
log-EN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lft-identityN/A
*-commutativeN/A
metadata-evalN/A
log-EN/A
log-EN/A
metadata-evalN/A
log-EN/A
lower-*.f64N/A
*-commutativeN/A
log-EN/A
*-commutativeN/A
*-lft-identityN/A
lower-*.f6450.4
Applied rewrites50.4%
Applied rewrites56.1%
Final simplification62.2%
(FPCore (c x y) :precision binary64 (if (<= c 4100000.0) (* (* c y) x) (* (* (* (fma (fma 0.16666666666666666 x 0.5) x 1.0) x) c) y)))
double code(double c, double x, double y) {
double tmp;
if (c <= 4100000.0) {
tmp = (c * y) * x;
} else {
tmp = ((fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x) * c) * y;
}
return tmp;
}
function code(c, x, y) tmp = 0.0 if (c <= 4100000.0) tmp = Float64(Float64(c * y) * x); else tmp = Float64(Float64(Float64(fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x) * c) * y); end return tmp end
code[c_, x_, y_] := If[LessEqual[c, 4100000.0], N[(N[(c * y), $MachinePrecision] * x), $MachinePrecision], N[(N[(N[(N[(N[(0.16666666666666666 * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;c \leq 4100000:\\
\;\;\;\;\left(c \cdot y\right) \cdot x\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, x, 0.5\right), x, 1\right) \cdot x\right) \cdot c\right) \cdot y\\
\end{array}
\end{array}
if c < 4.1e6Initial program 55.9%
Taylor expanded in x around 0
associate-*r*N/A
log-EN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lft-identityN/A
*-commutativeN/A
metadata-evalN/A
log-EN/A
log-EN/A
metadata-evalN/A
log-EN/A
lower-*.f64N/A
*-commutativeN/A
log-EN/A
*-commutativeN/A
*-lft-identityN/A
lower-*.f6464.7
Applied rewrites64.7%
if 4.1e6 < c Initial program 22.6%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6422.6
lift-log.f64N/A
lift-+.f64N/A
lower-log1p.f6439.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6439.8
lift--.f64N/A
lift-pow.f64N/A
pow-to-expN/A
lift-E.f64N/A
log-EN/A
*-lft-identityN/A
lower-expm1.f6487.8
Applied rewrites87.8%
Taylor expanded in y around 0
*-commutativeN/A
*-lft-identityN/A
exp-prodN/A
e-exp-1N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
e-exp-1N/A
exp-prodN/A
*-lft-identityN/A
lower-expm1.f6474.4
Applied rewrites74.4%
Taylor expanded in x around 0
Applied rewrites57.6%
Final simplification62.7%
(FPCore (c x y) :precision binary64 (if (<= c 3.9e+74) (* (* c y) x) (* (* c x) y)))
double code(double c, double x, double y) {
double tmp;
if (c <= 3.9e+74) {
tmp = (c * y) * x;
} else {
tmp = (c * x) * y;
}
return tmp;
}
real(8) function code(c, x, y)
real(8), intent (in) :: c
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8) :: tmp
if (c <= 3.9d+74) then
tmp = (c * y) * x
else
tmp = (c * x) * y
end if
code = tmp
end function
public static double code(double c, double x, double y) {
double tmp;
if (c <= 3.9e+74) {
tmp = (c * y) * x;
} else {
tmp = (c * x) * y;
}
return tmp;
}
def code(c, x, y): tmp = 0 if c <= 3.9e+74: tmp = (c * y) * x else: tmp = (c * x) * y return tmp
function code(c, x, y) tmp = 0.0 if (c <= 3.9e+74) tmp = Float64(Float64(c * y) * x); else tmp = Float64(Float64(c * x) * y); end return tmp end
function tmp_2 = code(c, x, y) tmp = 0.0; if (c <= 3.9e+74) tmp = (c * y) * x; else tmp = (c * x) * y; end tmp_2 = tmp; end
code[c_, x_, y_] := If[LessEqual[c, 3.9e+74], N[(N[(c * y), $MachinePrecision] * x), $MachinePrecision], N[(N[(c * x), $MachinePrecision] * y), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;c \leq 3.9 \cdot 10^{+74}:\\
\;\;\;\;\left(c \cdot y\right) \cdot x\\
\mathbf{else}:\\
\;\;\;\;\left(c \cdot x\right) \cdot y\\
\end{array}
\end{array}
if c < 3.90000000000000008e74Initial program 54.7%
Taylor expanded in x around 0
associate-*r*N/A
log-EN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lft-identityN/A
*-commutativeN/A
metadata-evalN/A
log-EN/A
log-EN/A
metadata-evalN/A
log-EN/A
lower-*.f64N/A
*-commutativeN/A
log-EN/A
*-commutativeN/A
*-lft-identityN/A
lower-*.f6464.7
Applied rewrites64.7%
if 3.90000000000000008e74 < c Initial program 17.4%
Taylor expanded in x around 0
associate-*r*N/A
log-EN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lft-identityN/A
*-commutativeN/A
metadata-evalN/A
log-EN/A
log-EN/A
metadata-evalN/A
log-EN/A
lower-*.f64N/A
*-commutativeN/A
log-EN/A
*-commutativeN/A
*-lft-identityN/A
lower-*.f6448.4
Applied rewrites48.4%
Applied rewrites54.8%
Final simplification62.6%
(FPCore (c x y) :precision binary64 (* (* c x) y))
double code(double c, double x, double y) {
return (c * x) * y;
}
real(8) function code(c, x, y)
real(8), intent (in) :: c
real(8), intent (in) :: x
real(8), intent (in) :: y
code = (c * x) * y
end function
public static double code(double c, double x, double y) {
return (c * x) * y;
}
def code(c, x, y): return (c * x) * y
function code(c, x, y) return Float64(Float64(c * x) * y) end
function tmp = code(c, x, y) tmp = (c * x) * y; end
code[c_, x_, y_] := N[(N[(c * x), $MachinePrecision] * y), $MachinePrecision]
\begin{array}{l}
\\
\left(c \cdot x\right) \cdot y
\end{array}
Initial program 46.7%
Taylor expanded in x around 0
associate-*r*N/A
log-EN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lft-identityN/A
*-commutativeN/A
metadata-evalN/A
log-EN/A
log-EN/A
metadata-evalN/A
log-EN/A
lower-*.f64N/A
*-commutativeN/A
log-EN/A
*-commutativeN/A
*-lft-identityN/A
lower-*.f6461.2
Applied rewrites61.2%
Applied rewrites59.9%
(FPCore (c x y) :precision binary64 (* c (log1p (* (expm1 x) y))))
double code(double c, double x, double y) {
return c * log1p((expm1(x) * y));
}
public static double code(double c, double x, double y) {
return c * Math.log1p((Math.expm1(x) * y));
}
def code(c, x, y): return c * math.log1p((math.expm1(x) * y))
function code(c, x, y) return Float64(c * log1p(Float64(expm1(x) * y))) end
code[c_, x_, y_] := N[(c * N[Log[1 + N[(N[(Exp[x] - 1), $MachinePrecision] * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(x\right) \cdot y\right)
\end{array}
herbie shell --seed 2024268
(FPCore (c x y)
:name "Logarithmic Transform"
:precision binary64
:alt
(* c (log1p (* (expm1 x) y)))
(* c (log (+ 1.0 (* (- (pow (E) x) 1.0) y)))))