
(FPCore (x) :precision binary64 (let* ((t_0 (* (tan x) (tan x)))) (/ (- 1.0 t_0) (+ 1.0 t_0))))
double code(double x) {
double t_0 = tan(x) * tan(x);
return (1.0 - t_0) / (1.0 + t_0);
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
t_0 = tan(x) * tan(x)
code = (1.0d0 - t_0) / (1.0d0 + t_0)
end function
public static double code(double x) {
double t_0 = Math.tan(x) * Math.tan(x);
return (1.0 - t_0) / (1.0 + t_0);
}
def code(x): t_0 = math.tan(x) * math.tan(x) return (1.0 - t_0) / (1.0 + t_0)
function code(x) t_0 = Float64(tan(x) * tan(x)) return Float64(Float64(1.0 - t_0) / Float64(1.0 + t_0)) end
function tmp = code(x) t_0 = tan(x) * tan(x); tmp = (1.0 - t_0) / (1.0 + t_0); end
code[x_] := Block[{t$95$0 = N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 - t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \tan x \cdot \tan x\\
\frac{1 - t_0}{1 + t_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (let* ((t_0 (* (tan x) (tan x)))) (/ (- 1.0 t_0) (+ 1.0 t_0))))
double code(double x) {
double t_0 = tan(x) * tan(x);
return (1.0 - t_0) / (1.0 + t_0);
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
t_0 = tan(x) * tan(x)
code = (1.0d0 - t_0) / (1.0d0 + t_0)
end function
public static double code(double x) {
double t_0 = Math.tan(x) * Math.tan(x);
return (1.0 - t_0) / (1.0 + t_0);
}
def code(x): t_0 = math.tan(x) * math.tan(x) return (1.0 - t_0) / (1.0 + t_0)
function code(x) t_0 = Float64(tan(x) * tan(x)) return Float64(Float64(1.0 - t_0) / Float64(1.0 + t_0)) end
function tmp = code(x) t_0 = tan(x) * tan(x); tmp = (1.0 - t_0) / (1.0 + t_0); end
code[x_] := Block[{t$95$0 = N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 - t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \tan x \cdot \tan x\\
\frac{1 - t_0}{1 + t_0}
\end{array}
\end{array}
(FPCore (x) :precision binary64 (/ (fma (tan x) (tan x) -1.0) (- -1.0 (pow (tan x) 2.0))))
double code(double x) {
return fma(tan(x), tan(x), -1.0) / (-1.0 - pow(tan(x), 2.0));
}
function code(x) return Float64(fma(tan(x), tan(x), -1.0) / Float64(-1.0 - (tan(x) ^ 2.0))) end
code[x_] := N[(N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision] + -1.0), $MachinePrecision] / N[(-1.0 - N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\mathsf{fma}\left(\tan x, \tan x, -1\right)}{-1 - {\tan x}^{2}}
\end{array}
Initial program 99.5%
frac-2neg99.5%
div-inv99.4%
pow299.4%
+-commutative99.4%
distribute-neg-in99.4%
neg-mul-199.4%
metadata-eval99.4%
fma-def99.4%
pow299.4%
Applied egg-rr99.4%
associate-*r/99.5%
*-rgt-identity99.5%
neg-sub099.5%
associate--r-99.5%
metadata-eval99.5%
+-commutative99.5%
unpow299.5%
fma-udef99.5%
fma-udef99.5%
neg-mul-199.5%
+-commutative99.5%
unsub-neg99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (x) :precision binary64 (if (<= (tan x) -1.0) -1.0 (if (<= (tan x) 1.0) (pow (/ 1.0 (hypot 1.0 (tan x))) 2.0) -1.0)))
double code(double x) {
double tmp;
if (tan(x) <= -1.0) {
tmp = -1.0;
} else if (tan(x) <= 1.0) {
tmp = pow((1.0 / hypot(1.0, tan(x))), 2.0);
} else {
tmp = -1.0;
}
return tmp;
}
public static double code(double x) {
double tmp;
if (Math.tan(x) <= -1.0) {
tmp = -1.0;
} else if (Math.tan(x) <= 1.0) {
tmp = Math.pow((1.0 / Math.hypot(1.0, Math.tan(x))), 2.0);
} else {
tmp = -1.0;
}
return tmp;
}
def code(x): tmp = 0 if math.tan(x) <= -1.0: tmp = -1.0 elif math.tan(x) <= 1.0: tmp = math.pow((1.0 / math.hypot(1.0, math.tan(x))), 2.0) else: tmp = -1.0 return tmp
function code(x) tmp = 0.0 if (tan(x) <= -1.0) tmp = -1.0; elseif (tan(x) <= 1.0) tmp = Float64(1.0 / hypot(1.0, tan(x))) ^ 2.0; else tmp = -1.0; end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (tan(x) <= -1.0) tmp = -1.0; elseif (tan(x) <= 1.0) tmp = (1.0 / hypot(1.0, tan(x))) ^ 2.0; else tmp = -1.0; end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[Tan[x], $MachinePrecision], -1.0], -1.0, If[LessEqual[N[Tan[x], $MachinePrecision], 1.0], N[Power[N[(1.0 / N[Sqrt[1.0 ^ 2 + N[Tan[x], $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision], -1.0]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\tan x \leq -1:\\
\;\;\;\;-1\\
\mathbf{elif}\;\tan x \leq 1:\\
\;\;\;\;{\left(\frac{1}{\mathsf{hypot}\left(1, \tan x\right)}\right)}^{2}\\
\mathbf{else}:\\
\;\;\;\;-1\\
\end{array}
\end{array}
if (tan.f64 x) < -1 or 1 < (tan.f64 x) Initial program 99.4%
+-commutative99.4%
fma-def99.4%
Simplified99.4%
add-log-exp96.7%
*-un-lft-identity96.7%
log-prod96.7%
metadata-eval96.7%
add-log-exp99.4%
pow299.4%
Applied egg-rr99.4%
+-lft-identity99.4%
Simplified99.4%
Applied egg-rr20.6%
*-inverses20.6%
metadata-eval20.6%
metadata-eval20.6%
Simplified20.6%
if -1 < (tan.f64 x) < 1Initial program 99.5%
frac-2neg99.5%
div-inv99.5%
pow299.5%
+-commutative99.5%
distribute-neg-in99.5%
neg-mul-199.5%
metadata-eval99.5%
fma-def99.5%
pow299.5%
Applied egg-rr99.5%
associate-*r/99.5%
*-rgt-identity99.5%
neg-sub099.5%
associate--r-99.5%
metadata-eval99.5%
+-commutative99.5%
unpow299.5%
fma-udef99.6%
fma-udef99.6%
neg-mul-199.6%
+-commutative99.6%
unsub-neg99.6%
Simplified99.6%
Taylor expanded in x around 0 69.7%
sub-neg69.7%
metadata-eval69.7%
distribute-neg-in69.7%
metadata-eval69.7%
frac-2neg69.7%
add-sqr-sqrt69.7%
pow269.7%
sqrt-div69.7%
metadata-eval69.7%
pow269.7%
hypot-1-def69.7%
Applied egg-rr69.7%
Final simplification56.1%
(FPCore (x) :precision binary64 (/ (- 1.0 (pow (tan x) 2.0)) (fma (tan x) (tan x) 1.0)))
double code(double x) {
return (1.0 - pow(tan(x), 2.0)) / fma(tan(x), tan(x), 1.0);
}
function code(x) return Float64(Float64(1.0 - (tan(x) ^ 2.0)) / fma(tan(x), tan(x), 1.0)) end
code[x_] := N[(N[(1.0 - N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1 - {\tan x}^{2}}{\mathsf{fma}\left(\tan x, \tan x, 1\right)}
\end{array}
Initial program 99.5%
+-commutative99.5%
fma-def99.5%
Simplified99.5%
add-log-exp98.7%
*-un-lft-identity98.7%
log-prod98.7%
metadata-eval98.7%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (x) :precision binary64 (if (<= (tan x) -1.0) -1.0 (if (<= (tan x) 1.0) (pow (hypot 1.0 (tan x)) -2.0) -1.0)))
double code(double x) {
double tmp;
if (tan(x) <= -1.0) {
tmp = -1.0;
} else if (tan(x) <= 1.0) {
tmp = pow(hypot(1.0, tan(x)), -2.0);
} else {
tmp = -1.0;
}
return tmp;
}
public static double code(double x) {
double tmp;
if (Math.tan(x) <= -1.0) {
tmp = -1.0;
} else if (Math.tan(x) <= 1.0) {
tmp = Math.pow(Math.hypot(1.0, Math.tan(x)), -2.0);
} else {
tmp = -1.0;
}
return tmp;
}
def code(x): tmp = 0 if math.tan(x) <= -1.0: tmp = -1.0 elif math.tan(x) <= 1.0: tmp = math.pow(math.hypot(1.0, math.tan(x)), -2.0) else: tmp = -1.0 return tmp
function code(x) tmp = 0.0 if (tan(x) <= -1.0) tmp = -1.0; elseif (tan(x) <= 1.0) tmp = hypot(1.0, tan(x)) ^ -2.0; else tmp = -1.0; end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (tan(x) <= -1.0) tmp = -1.0; elseif (tan(x) <= 1.0) tmp = hypot(1.0, tan(x)) ^ -2.0; else tmp = -1.0; end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[Tan[x], $MachinePrecision], -1.0], -1.0, If[LessEqual[N[Tan[x], $MachinePrecision], 1.0], N[Power[N[Sqrt[1.0 ^ 2 + N[Tan[x], $MachinePrecision] ^ 2], $MachinePrecision], -2.0], $MachinePrecision], -1.0]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\tan x \leq -1:\\
\;\;\;\;-1\\
\mathbf{elif}\;\tan x \leq 1:\\
\;\;\;\;{\left(\mathsf{hypot}\left(1, \tan x\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;-1\\
\end{array}
\end{array}
if (tan.f64 x) < -1 or 1 < (tan.f64 x) Initial program 99.4%
+-commutative99.4%
fma-def99.4%
Simplified99.4%
add-log-exp96.7%
*-un-lft-identity96.7%
log-prod96.7%
metadata-eval96.7%
add-log-exp99.4%
pow299.4%
Applied egg-rr99.4%
+-lft-identity99.4%
Simplified99.4%
Applied egg-rr20.6%
*-inverses20.6%
metadata-eval20.6%
metadata-eval20.6%
Simplified20.6%
if -1 < (tan.f64 x) < 1Initial program 99.5%
frac-2neg99.5%
div-inv99.5%
pow299.5%
+-commutative99.5%
distribute-neg-in99.5%
neg-mul-199.5%
metadata-eval99.5%
fma-def99.5%
pow299.5%
Applied egg-rr99.5%
associate-*r/99.5%
*-rgt-identity99.5%
neg-sub099.5%
associate--r-99.5%
metadata-eval99.5%
+-commutative99.5%
unpow299.5%
fma-udef99.6%
fma-udef99.6%
neg-mul-199.6%
+-commutative99.6%
unsub-neg99.6%
Simplified99.6%
Taylor expanded in x around 0 69.7%
sub-neg69.7%
metadata-eval69.7%
distribute-neg-in69.7%
metadata-eval69.7%
frac-2neg69.7%
add-sqr-sqrt69.7%
sqrt-div69.7%
metadata-eval69.7%
pow269.7%
hypot-1-def69.7%
sqrt-div69.7%
metadata-eval69.7%
pow269.7%
hypot-1-def69.7%
Applied egg-rr69.7%
unpow-169.7%
unpow-169.7%
pow-sqr69.7%
metadata-eval69.7%
Simplified69.7%
Final simplification56.1%
(FPCore (x) :precision binary64 (if (<= (tan x) -1.0) -1.0 (if (<= (tan x) 1.0) (/ -1.0 (- -1.0 (pow (tan x) 2.0))) -1.0)))
double code(double x) {
double tmp;
if (tan(x) <= -1.0) {
tmp = -1.0;
} else if (tan(x) <= 1.0) {
tmp = -1.0 / (-1.0 - pow(tan(x), 2.0));
} else {
tmp = -1.0;
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if (tan(x) <= (-1.0d0)) then
tmp = -1.0d0
else if (tan(x) <= 1.0d0) then
tmp = (-1.0d0) / ((-1.0d0) - (tan(x) ** 2.0d0))
else
tmp = -1.0d0
end if
code = tmp
end function
public static double code(double x) {
double tmp;
if (Math.tan(x) <= -1.0) {
tmp = -1.0;
} else if (Math.tan(x) <= 1.0) {
tmp = -1.0 / (-1.0 - Math.pow(Math.tan(x), 2.0));
} else {
tmp = -1.0;
}
return tmp;
}
def code(x): tmp = 0 if math.tan(x) <= -1.0: tmp = -1.0 elif math.tan(x) <= 1.0: tmp = -1.0 / (-1.0 - math.pow(math.tan(x), 2.0)) else: tmp = -1.0 return tmp
function code(x) tmp = 0.0 if (tan(x) <= -1.0) tmp = -1.0; elseif (tan(x) <= 1.0) tmp = Float64(-1.0 / Float64(-1.0 - (tan(x) ^ 2.0))); else tmp = -1.0; end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (tan(x) <= -1.0) tmp = -1.0; elseif (tan(x) <= 1.0) tmp = -1.0 / (-1.0 - (tan(x) ^ 2.0)); else tmp = -1.0; end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[Tan[x], $MachinePrecision], -1.0], -1.0, If[LessEqual[N[Tan[x], $MachinePrecision], 1.0], N[(-1.0 / N[(-1.0 - N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\tan x \leq -1:\\
\;\;\;\;-1\\
\mathbf{elif}\;\tan x \leq 1:\\
\;\;\;\;\frac{-1}{-1 - {\tan x}^{2}}\\
\mathbf{else}:\\
\;\;\;\;-1\\
\end{array}
\end{array}
if (tan.f64 x) < -1 or 1 < (tan.f64 x) Initial program 99.4%
+-commutative99.4%
fma-def99.4%
Simplified99.4%
add-log-exp96.7%
*-un-lft-identity96.7%
log-prod96.7%
metadata-eval96.7%
add-log-exp99.4%
pow299.4%
Applied egg-rr99.4%
+-lft-identity99.4%
Simplified99.4%
Applied egg-rr20.6%
*-inverses20.6%
metadata-eval20.6%
metadata-eval20.6%
Simplified20.6%
if -1 < (tan.f64 x) < 1Initial program 99.5%
frac-2neg99.5%
div-inv99.5%
pow299.5%
+-commutative99.5%
distribute-neg-in99.5%
neg-mul-199.5%
metadata-eval99.5%
fma-def99.5%
pow299.5%
Applied egg-rr99.5%
associate-*r/99.5%
*-rgt-identity99.5%
neg-sub099.5%
associate--r-99.5%
metadata-eval99.5%
+-commutative99.5%
unpow299.5%
fma-udef99.6%
fma-udef99.6%
neg-mul-199.6%
+-commutative99.6%
unsub-neg99.6%
Simplified99.6%
Taylor expanded in x around 0 69.7%
Final simplification56.1%
(FPCore (x) :precision binary64 (let* ((t_0 (pow (tan x) 2.0))) (/ (- 1.0 t_0) (+ t_0 1.0))))
double code(double x) {
double t_0 = pow(tan(x), 2.0);
return (1.0 - t_0) / (t_0 + 1.0);
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
t_0 = tan(x) ** 2.0d0
code = (1.0d0 - t_0) / (t_0 + 1.0d0)
end function
public static double code(double x) {
double t_0 = Math.pow(Math.tan(x), 2.0);
return (1.0 - t_0) / (t_0 + 1.0);
}
def code(x): t_0 = math.pow(math.tan(x), 2.0) return (1.0 - t_0) / (t_0 + 1.0)
function code(x) t_0 = tan(x) ^ 2.0 return Float64(Float64(1.0 - t_0) / Float64(t_0 + 1.0)) end
function tmp = code(x) t_0 = tan(x) ^ 2.0; tmp = (1.0 - t_0) / (t_0 + 1.0); end
code[x_] := Block[{t$95$0 = N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]}, N[(N[(1.0 - t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {\tan x}^{2}\\
\frac{1 - t_0}{t_0 + 1}
\end{array}
\end{array}
Initial program 99.5%
frac-2neg99.5%
div-inv99.4%
pow299.4%
+-commutative99.4%
distribute-neg-in99.4%
neg-mul-199.4%
metadata-eval99.4%
fma-def99.4%
pow299.4%
Applied egg-rr99.4%
associate-*r/99.5%
*-rgt-identity99.5%
neg-sub099.5%
associate--r-99.5%
metadata-eval99.5%
+-commutative99.5%
unpow299.5%
fma-udef99.5%
fma-udef99.5%
neg-mul-199.5%
+-commutative99.5%
unsub-neg99.5%
Simplified99.5%
expm1-log1p-u99.5%
expm1-udef99.3%
fma-udef99.3%
pow299.3%
Applied egg-rr99.3%
expm1-def99.4%
expm1-log1p99.5%
*-lft-identity99.5%
metadata-eval99.5%
times-frac99.5%
+-commutative99.5%
neg-mul-199.5%
distribute-neg-in99.5%
metadata-eval99.5%
sub-neg99.5%
neg-mul-199.5%
neg-sub099.5%
associate--r-99.5%
metadata-eval99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (x) :precision binary64 -1.0)
double code(double x) {
return -1.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = -1.0d0
end function
public static double code(double x) {
return -1.0;
}
def code(x): return -1.0
function code(x) return -1.0 end
function tmp = code(x) tmp = -1.0; end
code[x_] := -1.0
\begin{array}{l}
\\
-1
\end{array}
Initial program 99.5%
+-commutative99.5%
fma-def99.5%
Simplified99.5%
add-log-exp98.7%
*-un-lft-identity98.7%
log-prod98.7%
metadata-eval98.7%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
Applied egg-rr6.8%
*-inverses6.8%
metadata-eval6.8%
metadata-eval6.8%
Simplified6.8%
Final simplification6.8%
(FPCore (x) :precision binary64 1.0)
double code(double x) {
return 1.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0
end function
public static double code(double x) {
return 1.0;
}
def code(x): return 1.0
function code(x) return 1.0 end
function tmp = code(x) tmp = 1.0; end
code[x_] := 1.0
\begin{array}{l}
\\
1
\end{array}
Initial program 99.5%
Taylor expanded in x around 0 50.4%
Final simplification50.4%
herbie shell --seed 2023189
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))