
(FPCore (re im) :precision binary64 (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))
double code(double re, double im) {
return (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(re, im)
use fmin_fmax_functions
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function
public static double code(double re, double im) {
return (0.5 * Math.sin(re)) * (Math.exp((0.0 - im)) + Math.exp(im));
}
def code(re, im): return (0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))
function code(re, im) return Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(0.0 - im)) + exp(im))) end
function tmp = code(re, im) tmp = (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im)); end
code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(0.0 - im), $MachinePrecision]], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot \sin re\right) \cdot \left(e^{0 - im} + e^{im}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (re im) :precision binary64 (* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))
double code(double re, double im) {
return (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im));
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(re, im)
use fmin_fmax_functions
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (0.5d0 * sin(re)) * (exp((0.0d0 - im)) + exp(im))
end function
public static double code(double re, double im) {
return (0.5 * Math.sin(re)) * (Math.exp((0.0 - im)) + Math.exp(im));
}
def code(re, im): return (0.5 * math.sin(re)) * (math.exp((0.0 - im)) + math.exp(im))
function code(re, im) return Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(0.0 - im)) + exp(im))) end
function tmp = code(re, im) tmp = (0.5 * sin(re)) * (exp((0.0 - im)) + exp(im)); end
code[re_, im_] := N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(0.0 - im), $MachinePrecision]], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot \sin re\right) \cdot \left(e^{0 - im} + e^{im}\right)
\end{array}
(FPCore (re im) :precision binary64 (* (sin re) (cosh im)))
double code(double re, double im) {
return sin(re) * cosh(im);
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(re, im)
use fmin_fmax_functions
real(8), intent (in) :: re
real(8), intent (in) :: im
code = sin(re) * cosh(im)
end function
public static double code(double re, double im) {
return Math.sin(re) * Math.cosh(im);
}
def code(re, im): return math.sin(re) * math.cosh(im)
function code(re, im) return Float64(sin(re) * cosh(im)) end
function tmp = code(re, im) tmp = sin(re) * cosh(im); end
code[re_, im_] := N[(N[Sin[re], $MachinePrecision] * N[Cosh[im], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sin re \cdot \cosh im
\end{array}
Initial program 100.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
lift-+.f64N/A
+-commutativeN/A
lift-exp.f64N/A
lift-exp.f64N/A
lift--.f64N/A
sub0-negN/A
cosh-undefN/A
lower-*.f64N/A
lower-cosh.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
metadata-evalN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
*-lft-identity100.0
Applied rewrites100.0%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))))
(t_1 (+ 1.0 (exp im))))
(if (<= t_0 (- INFINITY))
(* (* (fma (* re re) -0.08333333333333333 0.5) re) t_1)
(if (<= t_0 1.0)
(*
(sin re)
(fma
(fma
(fma 0.001388888888888889 (* im im) 0.041666666666666664)
(* im im)
0.5)
(* im im)
1.0))
(* (* 0.5 re) t_1)))))
double code(double re, double im) {
double t_0 = (0.5 * sin(re)) * (exp(-im) + exp(im));
double t_1 = 1.0 + exp(im);
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * t_1;
} else if (t_0 <= 1.0) {
tmp = sin(re) * fma(fma(fma(0.001388888888888889, (im * im), 0.041666666666666664), (im * im), 0.5), (im * im), 1.0);
} else {
tmp = (0.5 * re) * t_1;
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) t_1 = Float64(1.0 + exp(im)) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * t_1); elseif (t_0 <= 1.0) tmp = Float64(sin(re) * fma(fma(fma(0.001388888888888889, Float64(im * im), 0.041666666666666664), Float64(im * im), 0.5), Float64(im * im), 1.0)); else tmp = Float64(Float64(0.5 * re) * t_1); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[Sin[re], $MachinePrecision] * N[(N[(N[(0.001388888888888889 * N[(im * im), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] * N[(im * im), $MachinePrecision] + 0.5), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right)\\
t_1 := 1 + e^{im}\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot t\_1\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\sin re \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.001388888888888889, im \cdot im, 0.041666666666666664\right), im \cdot im, 0.5\right), im \cdot im, 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot re\right) \cdot t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites47.6%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6450.1
Applied rewrites50.1%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
lift-+.f64N/A
+-commutativeN/A
lift-exp.f64N/A
lift-exp.f64N/A
lift--.f64N/A
sub0-negN/A
cosh-undefN/A
lower-*.f64N/A
lower-cosh.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
metadata-evalN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
*-lft-identity100.0
Applied rewrites100.0%
Taylor expanded in im around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6498.2
Applied rewrites98.2%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites59.1%
Taylor expanded in re around 0
lower-*.f6449.0
Applied rewrites49.0%
Final simplification76.4%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))))
(t_1 (+ 1.0 (exp im))))
(if (<= t_0 (- INFINITY))
(* (* (fma (* re re) -0.08333333333333333 0.5) re) t_1)
(if (<= t_0 1.0)
(*
(fma (fma (* im im) 0.041666666666666664 0.5) (* im im) 1.0)
(sin re))
(* (* 0.5 re) t_1)))))
double code(double re, double im) {
double t_0 = (0.5 * sin(re)) * (exp(-im) + exp(im));
double t_1 = 1.0 + exp(im);
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * t_1;
} else if (t_0 <= 1.0) {
tmp = fma(fma((im * im), 0.041666666666666664, 0.5), (im * im), 1.0) * sin(re);
} else {
tmp = (0.5 * re) * t_1;
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) t_1 = Float64(1.0 + exp(im)) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * t_1); elseif (t_0 <= 1.0) tmp = Float64(fma(fma(Float64(im * im), 0.041666666666666664, 0.5), Float64(im * im), 1.0) * sin(re)); else tmp = Float64(Float64(0.5 * re) * t_1); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[(N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision] * N[Sin[re], $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right)\\
t_1 := 1 + e^{im}\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot t\_1\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right), im \cdot im, 1\right) \cdot \sin re\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot re\right) \cdot t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites47.6%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6450.1
Applied rewrites50.1%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sin.f6498.0
Applied rewrites98.0%
Taylor expanded in re around 0
Applied rewrites45.9%
Taylor expanded in re around inf
Applied rewrites98.0%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites59.1%
Taylor expanded in re around 0
lower-*.f6449.0
Applied rewrites49.0%
Final simplification76.3%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* 0.5 (sin re)))
(t_1 (* t_0 (+ (exp (- im)) (exp im))))
(t_2 (+ 1.0 (exp im))))
(if (<= t_1 (- INFINITY))
(* (* (fma (* re re) -0.08333333333333333 0.5) re) t_2)
(if (<= t_1 1.0) (* t_0 (fma im im 2.0)) (* (* 0.5 re) t_2)))))
double code(double re, double im) {
double t_0 = 0.5 * sin(re);
double t_1 = t_0 * (exp(-im) + exp(im));
double t_2 = 1.0 + exp(im);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * t_2;
} else if (t_1 <= 1.0) {
tmp = t_0 * fma(im, im, 2.0);
} else {
tmp = (0.5 * re) * t_2;
}
return tmp;
}
function code(re, im) t_0 = Float64(0.5 * sin(re)) t_1 = Float64(t_0 * Float64(exp(Float64(-im)) + exp(im))) t_2 = Float64(1.0 + exp(im)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * t_2); elseif (t_1 <= 1.0) tmp = Float64(t_0 * fma(im, im, 2.0)); else tmp = Float64(Float64(0.5 * re) * t_2); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * t$95$2), $MachinePrecision], If[LessEqual[t$95$1, 1.0], N[(t$95$0 * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * t$95$2), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.5 \cdot \sin re\\
t_1 := t\_0 \cdot \left(e^{-im} + e^{im}\right)\\
t_2 := 1 + e^{im}\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot t\_2\\
\mathbf{elif}\;t\_1 \leq 1:\\
\;\;\;\;t\_0 \cdot \mathsf{fma}\left(im, im, 2\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot re\right) \cdot t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites47.6%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6450.1
Applied rewrites50.1%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6497.7
Applied rewrites97.7%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites59.1%
Taylor expanded in re around 0
lower-*.f6449.0
Applied rewrites49.0%
Final simplification76.1%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* 0.5 (sin re))) (t_1 (* t_0 (+ (exp (- im)) (exp im)))))
(if (<= t_1 (- INFINITY))
(*
(*
(fma
(fma
(fma -9.92063492063492e-5 (* re re) 0.004166666666666667)
(* re re)
-0.08333333333333333)
(* re re)
0.5)
re)
(fma im im 2.0))
(if (<= t_1 1.0)
(* t_0 (fma im im 2.0))
(* (* 0.5 re) (+ 1.0 (exp im)))))))
double code(double re, double im) {
double t_0 = 0.5 * sin(re);
double t_1 = t_0 * (exp(-im) + exp(im));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (fma(fma(fma(-9.92063492063492e-5, (re * re), 0.004166666666666667), (re * re), -0.08333333333333333), (re * re), 0.5) * re) * fma(im, im, 2.0);
} else if (t_1 <= 1.0) {
tmp = t_0 * fma(im, im, 2.0);
} else {
tmp = (0.5 * re) * (1.0 + exp(im));
}
return tmp;
}
function code(re, im) t_0 = Float64(0.5 * sin(re)) t_1 = Float64(t_0 * Float64(exp(Float64(-im)) + exp(im))) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(fma(fma(fma(-9.92063492063492e-5, Float64(re * re), 0.004166666666666667), Float64(re * re), -0.08333333333333333), Float64(re * re), 0.5) * re) * fma(im, im, 2.0)); elseif (t_1 <= 1.0) tmp = Float64(t_0 * fma(im, im, 2.0)); else tmp = Float64(Float64(0.5 * re) * Float64(1.0 + exp(im))); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[(N[(N[(-9.92063492063492e-5 * N[(re * re), $MachinePrecision] + 0.004166666666666667), $MachinePrecision] * N[(re * re), $MachinePrecision] + -0.08333333333333333), $MachinePrecision] * N[(re * re), $MachinePrecision] + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1.0], N[(t$95$0 * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.5 \cdot \sin re\\
t_1 := t\_0 \cdot \left(e^{-im} + e^{im}\right)\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right), re \cdot re, -0.08333333333333333\right), re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\
\mathbf{elif}\;t\_1 \leq 1:\\
\;\;\;\;t\_0 \cdot \mathsf{fma}\left(im, im, 2\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot re\right) \cdot \left(1 + e^{im}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6452.9
Applied rewrites52.9%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
Applied rewrites54.9%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6497.7
Applied rewrites97.7%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites59.1%
Taylor expanded in re around 0
lower-*.f6449.0
Applied rewrites49.0%
Final simplification77.3%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im)))))
(if (<= t_0 (- INFINITY))
(*
(*
(fma
(fma
(fma -9.92063492063492e-5 (* re re) 0.004166666666666667)
(* re re)
-0.08333333333333333)
(* re re)
0.5)
re)
(fma im im 2.0))
(if (<= t_0 1.0) (* (sin re) 1.0) (* (* 0.5 re) (+ 1.0 (exp im)))))))
double code(double re, double im) {
double t_0 = (0.5 * sin(re)) * (exp(-im) + exp(im));
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = (fma(fma(fma(-9.92063492063492e-5, (re * re), 0.004166666666666667), (re * re), -0.08333333333333333), (re * re), 0.5) * re) * fma(im, im, 2.0);
} else if (t_0 <= 1.0) {
tmp = sin(re) * 1.0;
} else {
tmp = (0.5 * re) * (1.0 + exp(im));
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(Float64(fma(fma(fma(-9.92063492063492e-5, Float64(re * re), 0.004166666666666667), Float64(re * re), -0.08333333333333333), Float64(re * re), 0.5) * re) * fma(im, im, 2.0)); elseif (t_0 <= 1.0) tmp = Float64(sin(re) * 1.0); else tmp = Float64(Float64(0.5 * re) * Float64(1.0 + exp(im))); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(N[(N[(-9.92063492063492e-5 * N[(re * re), $MachinePrecision] + 0.004166666666666667), $MachinePrecision] * N[(re * re), $MachinePrecision] + -0.08333333333333333), $MachinePrecision] * N[(re * re), $MachinePrecision] + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[Sin[re], $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * N[(1.0 + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right)\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right), re \cdot re, -0.08333333333333333\right), re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\sin re \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot re\right) \cdot \left(1 + e^{im}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6452.9
Applied rewrites52.9%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
Applied rewrites54.9%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
lift-+.f64N/A
+-commutativeN/A
lift-exp.f64N/A
lift-exp.f64N/A
lift--.f64N/A
sub0-negN/A
cosh-undefN/A
lower-*.f64N/A
lower-cosh.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
metadata-evalN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
*-lft-identity100.0
Applied rewrites100.0%
Taylor expanded in im around 0
Applied rewrites97.2%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites59.1%
Taylor expanded in re around 0
lower-*.f6449.0
Applied rewrites49.0%
Final simplification77.0%
(FPCore (re im)
:precision binary64
(let* ((t_0 (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im)))))
(if (<= t_0 (- INFINITY))
(*
(*
(fma
(fma
(fma -9.92063492063492e-5 (* re re) 0.004166666666666667)
(* re re)
-0.08333333333333333)
(* re re)
0.5)
re)
(fma im im 2.0))
(if (<= t_0 1.0)
(* (sin re) 1.0)
(* (fma (* (fma (* im im) 0.041666666666666664 0.5) im) im 1.0) re)))))
double code(double re, double im) {
double t_0 = (0.5 * sin(re)) * (exp(-im) + exp(im));
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = (fma(fma(fma(-9.92063492063492e-5, (re * re), 0.004166666666666667), (re * re), -0.08333333333333333), (re * re), 0.5) * re) * fma(im, im, 2.0);
} else if (t_0 <= 1.0) {
tmp = sin(re) * 1.0;
} else {
tmp = fma((fma((im * im), 0.041666666666666664, 0.5) * im), im, 1.0) * re;
}
return tmp;
}
function code(re, im) t_0 = Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(Float64(fma(fma(fma(-9.92063492063492e-5, Float64(re * re), 0.004166666666666667), Float64(re * re), -0.08333333333333333), Float64(re * re), 0.5) * re) * fma(im, im, 2.0)); elseif (t_0 <= 1.0) tmp = Float64(sin(re) * 1.0); else tmp = Float64(fma(Float64(fma(Float64(im * im), 0.041666666666666664, 0.5) * im), im, 1.0) * re); end return tmp end
code[re_, im_] := Block[{t$95$0 = N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(N[(N[(N[(-9.92063492063492e-5 * N[(re * re), $MachinePrecision] + 0.004166666666666667), $MachinePrecision] * N[(re * re), $MachinePrecision] + -0.08333333333333333), $MachinePrecision] * N[(re * re), $MachinePrecision] + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.0], N[(N[Sin[re], $MachinePrecision] * 1.0), $MachinePrecision], N[(N[(N[(N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] * im), $MachinePrecision] * im + 1.0), $MachinePrecision] * re), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right)\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right), re \cdot re, -0.08333333333333333\right), re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\
\mathbf{elif}\;t\_0 \leq 1:\\
\;\;\;\;\sin re \cdot 1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right) \cdot im, im, 1\right) \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -inf.0Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6452.9
Applied rewrites52.9%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
Applied rewrites54.9%
if -inf.0 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1Initial program 100.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
lift-+.f64N/A
+-commutativeN/A
lift-exp.f64N/A
lift-exp.f64N/A
lift--.f64N/A
sub0-negN/A
cosh-undefN/A
lower-*.f64N/A
lower-cosh.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
metadata-evalN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64100.0
Applied rewrites100.0%
lift-*.f64N/A
*-lft-identity100.0
Applied rewrites100.0%
Taylor expanded in im around 0
Applied rewrites97.2%
if 1 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sin.f6471.3
Applied rewrites71.3%
Taylor expanded in re around 0
Applied rewrites62.7%
Applied rewrites62.7%
Final simplification79.7%
(FPCore (re im)
:precision binary64
(if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) -0.02)
(*
(*
(fma
(fma
(fma -9.92063492063492e-5 (* re re) 0.004166666666666667)
(* re re)
-0.08333333333333333)
(* re re)
0.5)
re)
(fma im im 2.0))
(fma (* (* (fma (* im im) 0.041666666666666664 0.5) im) im) re re)))
double code(double re, double im) {
double tmp;
if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= -0.02) {
tmp = (fma(fma(fma(-9.92063492063492e-5, (re * re), 0.004166666666666667), (re * re), -0.08333333333333333), (re * re), 0.5) * re) * fma(im, im, 2.0);
} else {
tmp = fma(((fma((im * im), 0.041666666666666664, 0.5) * im) * im), re, re);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) <= -0.02) tmp = Float64(Float64(fma(fma(fma(-9.92063492063492e-5, Float64(re * re), 0.004166666666666667), Float64(re * re), -0.08333333333333333), Float64(re * re), 0.5) * re) * fma(im, im, 2.0)); else tmp = fma(Float64(Float64(fma(Float64(im * im), 0.041666666666666664, 0.5) * im) * im), re, re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.02], N[(N[(N[(N[(N[(-9.92063492063492e-5 * N[(re * re), $MachinePrecision] + 0.004166666666666667), $MachinePrecision] * N[(re * re), $MachinePrecision] + -0.08333333333333333), $MachinePrecision] * N[(re * re), $MachinePrecision] + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] * im), $MachinePrecision] * im), $MachinePrecision] * re + re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.02:\\
\;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-9.92063492063492 \cdot 10^{-5}, re \cdot re, 0.004166666666666667\right), re \cdot re, -0.08333333333333333\right), re \cdot re, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(\mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right) \cdot im\right) \cdot im, re, re\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -0.0200000000000000004Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6470.3
Applied rewrites70.3%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
Applied rewrites34.8%
if -0.0200000000000000004 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sin.f6488.9
Applied rewrites88.9%
Taylor expanded in re around 0
Applied rewrites62.8%
Applied rewrites62.8%
Final simplification51.3%
(FPCore (re im) :precision binary64 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) -0.02) (* (* (fma (* re re) -0.08333333333333333 0.5) re) (fma im im 2.0)) (fma (* (* (fma (* im im) 0.041666666666666664 0.5) im) im) re re)))
double code(double re, double im) {
double tmp;
if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= -0.02) {
tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0);
} else {
tmp = fma(((fma((im * im), 0.041666666666666664, 0.5) * im) * im), re, re);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) <= -0.02) tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0)); else tmp = fma(Float64(Float64(fma(Float64(im * im), 0.041666666666666664, 0.5) * im) * im), re, re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.02], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] * im), $MachinePrecision] * im), $MachinePrecision] * re + re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.02:\\
\;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(\mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right) \cdot im\right) \cdot im, re, re\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -0.0200000000000000004Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6470.3
Applied rewrites70.3%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6434.0
Applied rewrites34.0%
if -0.0200000000000000004 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sin.f6488.9
Applied rewrites88.9%
Taylor expanded in re around 0
Applied rewrites62.8%
Applied rewrites62.8%
Final simplification51.0%
(FPCore (re im) :precision binary64 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) -0.02) (* (* (fma (* re re) -0.08333333333333333 0.5) re) (fma im im 2.0)) (* (fma (* (fma (* im im) 0.041666666666666664 0.5) im) im 1.0) re)))
double code(double re, double im) {
double tmp;
if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= -0.02) {
tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0);
} else {
tmp = fma((fma((im * im), 0.041666666666666664, 0.5) * im), im, 1.0) * re;
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) <= -0.02) tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * fma(im, im, 2.0)); else tmp = Float64(fma(Float64(fma(Float64(im * im), 0.041666666666666664, 0.5) * im), im, 1.0) * re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.02], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] * im), $MachinePrecision] * im + 1.0), $MachinePrecision] * re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.02:\\
\;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right) \cdot im, im, 1\right) \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -0.0200000000000000004Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6470.3
Applied rewrites70.3%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6434.0
Applied rewrites34.0%
if -0.0200000000000000004 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sin.f6488.9
Applied rewrites88.9%
Taylor expanded in re around 0
Applied rewrites62.8%
Applied rewrites62.8%
Final simplification51.0%
(FPCore (re im) :precision binary64 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) -0.02) (* (* (fma (* re re) -0.08333333333333333 0.5) re) 2.0) (* (fma (* (fma (* im im) 0.041666666666666664 0.5) im) im 1.0) re)))
double code(double re, double im) {
double tmp;
if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= -0.02) {
tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * 2.0;
} else {
tmp = fma((fma((im * im), 0.041666666666666664, 0.5) * im), im, 1.0) * re;
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) <= -0.02) tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * 2.0); else tmp = Float64(fma(Float64(fma(Float64(im * im), 0.041666666666666664, 0.5) * im), im, 1.0) * re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.02], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[(N[(N[(im * im), $MachinePrecision] * 0.041666666666666664 + 0.5), $MachinePrecision] * im), $MachinePrecision] * im + 1.0), $MachinePrecision] * re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.02:\\
\;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot 2\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(im \cdot im, 0.041666666666666664, 0.5\right) \cdot im, im, 1\right) \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -0.0200000000000000004Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites39.0%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6412.4
Applied rewrites12.4%
if -0.0200000000000000004 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sin.f6488.9
Applied rewrites88.9%
Taylor expanded in re around 0
Applied rewrites62.8%
Applied rewrites62.8%
Final simplification42.1%
(FPCore (re im) :precision binary64 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) 2e-6) (* (* (fma (* re re) -0.08333333333333333 0.5) re) 2.0) (* (fma (* (* im im) 0.041666666666666664) (* im im) 1.0) re)))
double code(double re, double im) {
double tmp;
if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= 2e-6) {
tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * 2.0;
} else {
tmp = fma(((im * im) * 0.041666666666666664), (im * im), 1.0) * re;
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) <= 2e-6) tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * 2.0); else tmp = Float64(fma(Float64(Float64(im * im) * 0.041666666666666664), Float64(im * im), 1.0) * re); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e-6], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[(N[(im * im), $MachinePrecision] * 0.041666666666666664), $MachinePrecision] * N[(im * im), $MachinePrecision] + 1.0), $MachinePrecision] * re), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq 2 \cdot 10^{-6}:\\
\;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot 2\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(im \cdot im\right) \cdot 0.041666666666666664, im \cdot im, 1\right) \cdot re\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < 1.99999999999999991e-6Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites60.5%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6444.1
Applied rewrites44.1%
if 1.99999999999999991e-6 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
lower-sin.f64N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-sin.f6483.3
Applied rewrites83.3%
Taylor expanded in re around 0
Applied rewrites37.7%
Taylor expanded in im around inf
Applied rewrites37.7%
Final simplification41.9%
(FPCore (re im) :precision binary64 (if (<= (* (* 0.5 (sin re)) (+ (exp (- im)) (exp im))) -0.02) (* (* (fma (* re re) -0.08333333333333333 0.5) re) 2.0) (* (* 0.5 re) (fma im im 2.0))))
double code(double re, double im) {
double tmp;
if (((0.5 * sin(re)) * (exp(-im) + exp(im))) <= -0.02) {
tmp = (fma((re * re), -0.08333333333333333, 0.5) * re) * 2.0;
} else {
tmp = (0.5 * re) * fma(im, im, 2.0);
}
return tmp;
}
function code(re, im) tmp = 0.0 if (Float64(Float64(0.5 * sin(re)) * Float64(exp(Float64(-im)) + exp(im))) <= -0.02) tmp = Float64(Float64(fma(Float64(re * re), -0.08333333333333333, 0.5) * re) * 2.0); else tmp = Float64(Float64(0.5 * re) * fma(im, im, 2.0)); end return tmp end
code[re_, im_] := If[LessEqual[N[(N[(0.5 * N[Sin[re], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[(-im)], $MachinePrecision] + N[Exp[im], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.02], N[(N[(N[(N[(re * re), $MachinePrecision] * -0.08333333333333333 + 0.5), $MachinePrecision] * re), $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(0.5 * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\left(0.5 \cdot \sin re\right) \cdot \left(e^{-im} + e^{im}\right) \leq -0.02:\\
\;\;\;\;\left(\mathsf{fma}\left(re \cdot re, -0.08333333333333333, 0.5\right) \cdot re\right) \cdot 2\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) < -0.0200000000000000004Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites39.0%
Taylor expanded in re around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6412.4
Applied rewrites12.4%
if -0.0200000000000000004 < (*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))) Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6483.7
Applied rewrites83.7%
Taylor expanded in re around 0
lower-*.f6459.4
Applied rewrites59.4%
Final simplification40.2%
(FPCore (re im) :precision binary64 (* (* 0.5 re) (fma im im 2.0)))
double code(double re, double im) {
return (0.5 * re) * fma(im, im, 2.0);
}
function code(re, im) return Float64(Float64(0.5 * re) * fma(im, im, 2.0)) end
code[re_, im_] := N[(N[(0.5 * re), $MachinePrecision] * N[(im * im + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot re\right) \cdot \mathsf{fma}\left(im, im, 2\right)
\end{array}
Initial program 100.0%
Taylor expanded in im around 0
+-commutativeN/A
unpow2N/A
lower-fma.f6478.2
Applied rewrites78.2%
Taylor expanded in re around 0
lower-*.f6446.4
Applied rewrites46.4%
(FPCore (re im) :precision binary64 (* (* 0.5 re) 2.0))
double code(double re, double im) {
return (0.5 * re) * 2.0;
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(re, im)
use fmin_fmax_functions
real(8), intent (in) :: re
real(8), intent (in) :: im
code = (0.5d0 * re) * 2.0d0
end function
public static double code(double re, double im) {
return (0.5 * re) * 2.0;
}
def code(re, im): return (0.5 * re) * 2.0
function code(re, im) return Float64(Float64(0.5 * re) * 2.0) end
function tmp = code(re, im) tmp = (0.5 * re) * 2.0; end
code[re_, im_] := N[(N[(0.5 * re), $MachinePrecision] * 2.0), $MachinePrecision]
\begin{array}{l}
\\
\left(0.5 \cdot re\right) \cdot 2
\end{array}
Initial program 100.0%
Taylor expanded in im around 0
Applied rewrites54.7%
Taylor expanded in re around 0
lower-*.f6426.0
Applied rewrites26.0%
herbie shell --seed 2025017
(FPCore (re im)
:name "math.sin on complex, real part"
:precision binary64
(* (* 0.5 (sin re)) (+ (exp (- 0.0 im)) (exp im))))