
(FPCore (x) :precision binary64 (asinh x))
double code(double x) {
return asinh(x);
}
def code(x): return math.asinh(x)
function code(x) return asinh(x) end
function tmp = code(x) tmp = asinh(x); end
code[x_] := N[ArcSinh[x], $MachinePrecision]
\begin{array}{l}
\\
\sinh^{-1} x
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x))
double code(double x) {
return copysign(log((fabs(x) + sqrt(((x * x) + 1.0)))), x);
}
public static double code(double x) {
return Math.copySign(Math.log((Math.abs(x) + Math.sqrt(((x * x) + 1.0)))), x);
}
def code(x): return math.copysign(math.log((math.fabs(x) + math.sqrt(((x * x) + 1.0)))), x)
function code(x) return copysign(log(Float64(abs(x) + sqrt(Float64(Float64(x * x) + 1.0)))), x) end
function tmp = code(x) tmp = sign(x) * abs(log((abs(x) + sqrt(((x * x) + 1.0))))); end
code[x_] := N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] + N[Sqrt[N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
\begin{array}{l}
\\
\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right)
\end{array}
(FPCore (x)
:precision binary64
(let* ((t_0 (copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x)))
(if (<= t_0 -10.0)
(copysign (log (- (* x (/ (fabs x) x)) x)) x)
(if (<= t_0 2e-6)
(copysign (log1p (+ (fabs x) (* (* x x) (+ 0.5 (* (* x x) -0.125))))) x)
(copysign (log (+ (fabs x) (hypot 1.0 x))) x)))))
double code(double x) {
double t_0 = copysign(log((fabs(x) + sqrt(((x * x) + 1.0)))), x);
double tmp;
if (t_0 <= -10.0) {
tmp = copysign(log(((x * (fabs(x) / x)) - x)), x);
} else if (t_0 <= 2e-6) {
tmp = copysign(log1p((fabs(x) + ((x * x) * (0.5 + ((x * x) * -0.125))))), x);
} else {
tmp = copysign(log((fabs(x) + hypot(1.0, x))), x);
}
return tmp;
}
public static double code(double x) {
double t_0 = Math.copySign(Math.log((Math.abs(x) + Math.sqrt(((x * x) + 1.0)))), x);
double tmp;
if (t_0 <= -10.0) {
tmp = Math.copySign(Math.log(((x * (Math.abs(x) / x)) - x)), x);
} else if (t_0 <= 2e-6) {
tmp = Math.copySign(Math.log1p((Math.abs(x) + ((x * x) * (0.5 + ((x * x) * -0.125))))), x);
} else {
tmp = Math.copySign(Math.log((Math.abs(x) + Math.hypot(1.0, x))), x);
}
return tmp;
}
def code(x): t_0 = math.copysign(math.log((math.fabs(x) + math.sqrt(((x * x) + 1.0)))), x) tmp = 0 if t_0 <= -10.0: tmp = math.copysign(math.log(((x * (math.fabs(x) / x)) - x)), x) elif t_0 <= 2e-6: tmp = math.copysign(math.log1p((math.fabs(x) + ((x * x) * (0.5 + ((x * x) * -0.125))))), x) else: tmp = math.copysign(math.log((math.fabs(x) + math.hypot(1.0, x))), x) return tmp
function code(x) t_0 = copysign(log(Float64(abs(x) + sqrt(Float64(Float64(x * x) + 1.0)))), x) tmp = 0.0 if (t_0 <= -10.0) tmp = copysign(log(Float64(Float64(x * Float64(abs(x) / x)) - x)), x); elseif (t_0 <= 2e-6) tmp = copysign(log1p(Float64(abs(x) + Float64(Float64(x * x) * Float64(0.5 + Float64(Float64(x * x) * -0.125))))), x); else tmp = copysign(log(Float64(abs(x) + hypot(1.0, x))), x); end return tmp end
code[x_] := Block[{t$95$0 = N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] + N[Sqrt[N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]}, If[LessEqual[t$95$0, -10.0], N[With[{TMP1 = Abs[N[Log[N[(N[(x * N[(N[Abs[x], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[t$95$0, 2e-6], N[With[{TMP1 = Abs[N[Log[1 + N[(N[Abs[x], $MachinePrecision] + N[(N[(x * x), $MachinePrecision] * N[(0.5 + N[(N[(x * x), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] + N[Sqrt[1.0 ^ 2 + x ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right)\\
\mathbf{if}\;t\_0 \leq -10:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x \cdot \frac{\left|x\right|}{x} - x\right), x\right)\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{-6}:\\
\;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(\left|x\right| + \left(x \cdot x\right) \cdot \left(0.5 + \left(x \cdot x\right) \cdot -0.125\right)\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(\left|x\right| + \mathsf{hypot}\left(1, x\right)\right), x\right)\\
\end{array}
\end{array}
if (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) < -10Initial program 44.7%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
associate--r+N/A
neg-sub0N/A
mul-1-negN/A
distribute-rgt-neg-outN/A
remove-double-negN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
fabs-lowering-fabs.f64100.0%
Simplified100.0%
if -10 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) < 1.99999999999999991e-6Initial program 8.5%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f648.6%
Simplified8.6%
Taylor expanded in x around 0
associate-+r+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.6%
Simplified8.6%
Taylor expanded in x around 0
copysign-lowering-copysign.f64N/A
Simplified100.0%
if 1.99999999999999991e-6 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) Initial program 44.2%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
(FPCore (x)
:precision binary64
(if (<= x -1.5)
(copysign (log (- (* x (/ (fabs x) x)) x)) x)
(if (<= x 1.45)
(copysign (log1p (+ (fabs x) (* (* x x) (+ 0.5 (* (* x x) -0.125))))) x)
(copysign (log (+ x (fabs x))) x))))
double code(double x) {
double tmp;
if (x <= -1.5) {
tmp = copysign(log(((x * (fabs(x) / x)) - x)), x);
} else if (x <= 1.45) {
tmp = copysign(log1p((fabs(x) + ((x * x) * (0.5 + ((x * x) * -0.125))))), x);
} else {
tmp = copysign(log((x + fabs(x))), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -1.5) {
tmp = Math.copySign(Math.log(((x * (Math.abs(x) / x)) - x)), x);
} else if (x <= 1.45) {
tmp = Math.copySign(Math.log1p((Math.abs(x) + ((x * x) * (0.5 + ((x * x) * -0.125))))), x);
} else {
tmp = Math.copySign(Math.log((x + Math.abs(x))), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.5: tmp = math.copysign(math.log(((x * (math.fabs(x) / x)) - x)), x) elif x <= 1.45: tmp = math.copysign(math.log1p((math.fabs(x) + ((x * x) * (0.5 + ((x * x) * -0.125))))), x) else: tmp = math.copysign(math.log((x + math.fabs(x))), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.5) tmp = copysign(log(Float64(Float64(x * Float64(abs(x) / x)) - x)), x); elseif (x <= 1.45) tmp = copysign(log1p(Float64(abs(x) + Float64(Float64(x * x) * Float64(0.5 + Float64(Float64(x * x) * -0.125))))), x); else tmp = copysign(log(Float64(x + abs(x))), x); end return tmp end
code[x_] := If[LessEqual[x, -1.5], N[With[{TMP1 = Abs[N[Log[N[(N[(x * N[(N[Abs[x], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 1.45], N[With[{TMP1 = Abs[N[Log[1 + N[(N[Abs[x], $MachinePrecision] + N[(N[(x * x), $MachinePrecision] * N[(0.5 + N[(N[(x * x), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.5:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x \cdot \frac{\left|x\right|}{x} - x\right), x\right)\\
\mathbf{elif}\;x \leq 1.45:\\
\;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(\left|x\right| + \left(x \cdot x\right) \cdot \left(0.5 + \left(x \cdot x\right) \cdot -0.125\right)\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x + \left|x\right|\right), x\right)\\
\end{array}
\end{array}
if x < -1.5Initial program 44.7%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
associate--r+N/A
neg-sub0N/A
mul-1-negN/A
distribute-rgt-neg-outN/A
remove-double-negN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
fabs-lowering-fabs.f64100.0%
Simplified100.0%
if -1.5 < x < 1.44999999999999996Initial program 9.2%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f649.3%
Simplified9.3%
Taylor expanded in x around 0
associate-+r+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.9%
Simplified8.9%
Taylor expanded in x around 0
copysign-lowering-copysign.f64N/A
Simplified99.5%
if 1.44999999999999996 < x Initial program 43.4%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
fabs-lowering-fabs.f64100.0%
Simplified100.0%
+-commutativeN/A
distribute-rgt-inN/A
div-invN/A
associate-*l*N/A
lft-mult-inverseN/A
*-rgt-identityN/A
*-lft-identityN/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64100.0%
Applied egg-rr100.0%
Final simplification99.8%
(FPCore (x)
:precision binary64
(if (<= x -1.16)
(copysign (log (- (* x (/ (fabs x) x)) x)) x)
(if (<= x 1.45)
(copysign (log1p (+ x (* (* x x) (+ 0.5 (* (* x x) -0.125))))) x)
(copysign (log (+ x (fabs x))) x))))
double code(double x) {
double tmp;
if (x <= -1.16) {
tmp = copysign(log(((x * (fabs(x) / x)) - x)), x);
} else if (x <= 1.45) {
tmp = copysign(log1p((x + ((x * x) * (0.5 + ((x * x) * -0.125))))), x);
} else {
tmp = copysign(log((x + fabs(x))), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -1.16) {
tmp = Math.copySign(Math.log(((x * (Math.abs(x) / x)) - x)), x);
} else if (x <= 1.45) {
tmp = Math.copySign(Math.log1p((x + ((x * x) * (0.5 + ((x * x) * -0.125))))), x);
} else {
tmp = Math.copySign(Math.log((x + Math.abs(x))), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.16: tmp = math.copysign(math.log(((x * (math.fabs(x) / x)) - x)), x) elif x <= 1.45: tmp = math.copysign(math.log1p((x + ((x * x) * (0.5 + ((x * x) * -0.125))))), x) else: tmp = math.copysign(math.log((x + math.fabs(x))), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.16) tmp = copysign(log(Float64(Float64(x * Float64(abs(x) / x)) - x)), x); elseif (x <= 1.45) tmp = copysign(log1p(Float64(x + Float64(Float64(x * x) * Float64(0.5 + Float64(Float64(x * x) * -0.125))))), x); else tmp = copysign(log(Float64(x + abs(x))), x); end return tmp end
code[x_] := If[LessEqual[x, -1.16], N[With[{TMP1 = Abs[N[Log[N[(N[(x * N[(N[Abs[x], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[x, 1.45], N[With[{TMP1 = Abs[N[Log[1 + N[(x + N[(N[(x * x), $MachinePrecision] * N[(0.5 + N[(N[(x * x), $MachinePrecision] * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.16:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x \cdot \frac{\left|x\right|}{x} - x\right), x\right)\\
\mathbf{elif}\;x \leq 1.45:\\
\;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(x + \left(x \cdot x\right) \cdot \left(0.5 + \left(x \cdot x\right) \cdot -0.125\right)\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x + \left|x\right|\right), x\right)\\
\end{array}
\end{array}
if x < -1.15999999999999992Initial program 44.7%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
associate--r+N/A
neg-sub0N/A
mul-1-negN/A
distribute-rgt-neg-outN/A
remove-double-negN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
fabs-lowering-fabs.f64100.0%
Simplified100.0%
if -1.15999999999999992 < x < 1.44999999999999996Initial program 9.2%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f649.3%
Simplified9.3%
Taylor expanded in x around 0
associate-+r+N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f648.9%
Simplified8.9%
copysign-lowering-copysign.f64N/A
Applied egg-rr99.5%
if 1.44999999999999996 < x Initial program 43.4%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
fabs-lowering-fabs.f64100.0%
Simplified100.0%
+-commutativeN/A
distribute-rgt-inN/A
div-invN/A
associate-*l*N/A
lft-mult-inverseN/A
*-rgt-identityN/A
*-lft-identityN/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64100.0%
Applied egg-rr100.0%
Final simplification99.8%
(FPCore (x) :precision binary64 (if (<= x 1.0) (copysign (log1p (fabs x)) x) (copysign (log (+ x (fabs x))) x)))
double code(double x) {
double tmp;
if (x <= 1.0) {
tmp = copysign(log1p(fabs(x)), x);
} else {
tmp = copysign(log((x + fabs(x))), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= 1.0) {
tmp = Math.copySign(Math.log1p(Math.abs(x)), x);
} else {
tmp = Math.copySign(Math.log((x + Math.abs(x))), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= 1.0: tmp = math.copysign(math.log1p(math.fabs(x)), x) else: tmp = math.copysign(math.log((x + math.fabs(x))), x) return tmp
function code(x) tmp = 0.0 if (x <= 1.0) tmp = copysign(log1p(abs(x)), x); else tmp = copysign(log(Float64(x + abs(x))), x); end return tmp end
code[x_] := If[LessEqual[x, 1.0], N[With[{TMP1 = Abs[N[Log[1 + N[Abs[x], $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 1:\\
\;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(\left|x\right|\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(x + \left|x\right|\right), x\right)\\
\end{array}
\end{array}
if x < 1Initial program 20.9%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f6439.2%
Simplified39.2%
Taylor expanded in x around 0
log1p-defineN/A
log1p-lowering-log1p.f64N/A
fabs-lowering-fabs.f6475.7%
Simplified75.7%
if 1 < x Initial program 43.4%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
fabs-lowering-fabs.f64100.0%
Simplified100.0%
+-commutativeN/A
distribute-rgt-inN/A
div-invN/A
associate-*l*N/A
lft-mult-inverseN/A
*-rgt-identityN/A
*-lft-identityN/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64100.0%
Applied egg-rr100.0%
Final simplification81.9%
(FPCore (x) :precision binary64 (copysign (log1p (fabs x)) x))
double code(double x) {
return copysign(log1p(fabs(x)), x);
}
public static double code(double x) {
return Math.copySign(Math.log1p(Math.abs(x)), x);
}
def code(x): return math.copysign(math.log1p(math.fabs(x)), x)
function code(x) return copysign(log1p(abs(x)), x) end
code[x_] := N[With[{TMP1 = Abs[N[Log[1 + N[Abs[x], $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
\begin{array}{l}
\\
\mathsf{copysign}\left(\mathsf{log1p}\left(\left|x\right|\right), x\right)
\end{array}
Initial program 26.6%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f6454.6%
Simplified54.6%
Taylor expanded in x around 0
log1p-defineN/A
log1p-lowering-log1p.f64N/A
fabs-lowering-fabs.f6464.6%
Simplified64.6%
(FPCore (x) :precision binary64 (if (<= x -1.0) (copysign (log (- 0.0 x)) x) (copysign (log1p x) x)))
double code(double x) {
double tmp;
if (x <= -1.0) {
tmp = copysign(log((0.0 - x)), x);
} else {
tmp = copysign(log1p(x), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= -1.0) {
tmp = Math.copySign(Math.log((0.0 - x)), x);
} else {
tmp = Math.copySign(Math.log1p(x), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= -1.0: tmp = math.copysign(math.log((0.0 - x)), x) else: tmp = math.copysign(math.log1p(x), x) return tmp
function code(x) tmp = 0.0 if (x <= -1.0) tmp = copysign(log(Float64(0.0 - x)), x); else tmp = copysign(log1p(x), x); end return tmp end
code[x_] := If[LessEqual[x, -1.0], N[With[{TMP1 = Abs[N[Log[N[(0.0 - x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[1 + x], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1:\\
\;\;\;\;\mathsf{copysign}\left(\log \left(0 - x\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(x\right), x\right)\\
\end{array}
\end{array}
if x < -1Initial program 44.7%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f6431.6%
Simplified31.6%
sub0-negN/A
neg-lowering-neg.f6431.6%
Applied egg-rr31.6%
if -1 < x Initial program 20.7%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f6439.8%
Simplified39.8%
Taylor expanded in x around 0
associate-+r+N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f649.0%
Simplified9.0%
+-commutativeN/A
associate-+l+N/A
log1p-defineN/A
log1p-lowering-log1p.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f6469.0%
Applied egg-rr69.0%
neg-fabsN/A
sub0-negN/A
flip3--N/A
fabs-divN/A
metadata-evalN/A
cube-unmultN/A
neg-sub0N/A
fabs-negN/A
mul-fabsN/A
mul-fabsN/A
cube-multN/A
metadata-evalN/A
pow-powN/A
pow2N/A
sqr-absN/A
pow2N/A
pow-powN/A
metadata-evalN/A
metadata-evalN/A
+-lft-identityN/A
distribute-rgt-outN/A
+-commutativeN/A
+-lft-identityN/A
fabs-sqrN/A
Applied egg-rr69.0%
Taylor expanded in x around 0
Simplified75.4%
Final simplification64.6%
(FPCore (x) :precision binary64 (if (<= x 1.5) (copysign (* x (+ 1.0 (* (* x x) -0.16666666666666666))) x) (copysign (log1p x) x)))
double code(double x) {
double tmp;
if (x <= 1.5) {
tmp = copysign((x * (1.0 + ((x * x) * -0.16666666666666666))), x);
} else {
tmp = copysign(log1p(x), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= 1.5) {
tmp = Math.copySign((x * (1.0 + ((x * x) * -0.16666666666666666))), x);
} else {
tmp = Math.copySign(Math.log1p(x), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= 1.5: tmp = math.copysign((x * (1.0 + ((x * x) * -0.16666666666666666))), x) else: tmp = math.copysign(math.log1p(x), x) return tmp
function code(x) tmp = 0.0 if (x <= 1.5) tmp = copysign(Float64(x * Float64(1.0 + Float64(Float64(x * x) * -0.16666666666666666))), x); else tmp = copysign(log1p(x), x); end return tmp end
code[x_] := If[LessEqual[x, 1.5], N[With[{TMP1 = Abs[N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[1 + x], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 1.5:\\
\;\;\;\;\mathsf{copysign}\left(x \cdot \left(1 + \left(x \cdot x\right) \cdot -0.16666666666666666\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(x\right), x\right)\\
\end{array}
\end{array}
if x < 1.5Initial program 20.9%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f6439.2%
Simplified39.2%
Taylor expanded in x around 0
associate-+r+N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f649.0%
Simplified9.0%
+-commutativeN/A
associate-+l+N/A
log1p-defineN/A
log1p-lowering-log1p.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f6469.7%
Applied egg-rr69.7%
neg-fabsN/A
sub0-negN/A
flip3--N/A
fabs-divN/A
metadata-evalN/A
cube-unmultN/A
neg-sub0N/A
fabs-negN/A
mul-fabsN/A
mul-fabsN/A
cube-multN/A
metadata-evalN/A
pow-powN/A
pow2N/A
sqr-absN/A
pow2N/A
pow-powN/A
metadata-evalN/A
metadata-evalN/A
+-lft-identityN/A
distribute-rgt-outN/A
+-commutativeN/A
+-lft-identityN/A
fabs-sqrN/A
Applied egg-rr69.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6467.9%
Simplified67.9%
if 1.5 < x Initial program 43.4%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around 0
associate-+r+N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f649.6%
Simplified9.6%
+-commutativeN/A
associate-+l+N/A
log1p-defineN/A
log1p-lowering-log1p.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f649.6%
Applied egg-rr9.6%
neg-fabsN/A
sub0-negN/A
flip3--N/A
fabs-divN/A
metadata-evalN/A
cube-unmultN/A
neg-sub0N/A
fabs-negN/A
mul-fabsN/A
mul-fabsN/A
cube-multN/A
metadata-evalN/A
pow-powN/A
pow2N/A
sqr-absN/A
pow2N/A
pow-powN/A
metadata-evalN/A
metadata-evalN/A
+-lft-identityN/A
distribute-rgt-outN/A
+-commutativeN/A
+-lft-identityN/A
fabs-sqrN/A
Applied egg-rr9.6%
Taylor expanded in x around 0
Simplified32.0%
(FPCore (x) :precision binary64 (if (<= x 2.0) (copysign (* x (+ 1.0 (* (* x x) -0.16666666666666666))) x) (copysign (log x) x)))
double code(double x) {
double tmp;
if (x <= 2.0) {
tmp = copysign((x * (1.0 + ((x * x) * -0.16666666666666666))), x);
} else {
tmp = copysign(log(x), x);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (x <= 2.0) {
tmp = Math.copySign((x * (1.0 + ((x * x) * -0.16666666666666666))), x);
} else {
tmp = Math.copySign(Math.log(x), x);
}
return tmp;
}
def code(x): tmp = 0 if x <= 2.0: tmp = math.copysign((x * (1.0 + ((x * x) * -0.16666666666666666))), x) else: tmp = math.copysign(math.log(x), x) return tmp
function code(x) tmp = 0.0 if (x <= 2.0) tmp = copysign(Float64(x * Float64(1.0 + Float64(Float64(x * x) * -0.16666666666666666))), x); else tmp = copysign(log(x), x); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if (x <= 2.0) tmp = sign(x) * abs((x * (1.0 + ((x * x) * -0.16666666666666666)))); else tmp = sign(x) * abs(log(x)); end tmp_2 = tmp; end
code[x_] := If[LessEqual[x, 2.0], N[With[{TMP1 = Abs[N[(x * N[(1.0 + N[(N[(x * x), $MachinePrecision] * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[x], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 2:\\
\;\;\;\;\mathsf{copysign}\left(x \cdot \left(1 + \left(x \cdot x\right) \cdot -0.16666666666666666\right), x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{copysign}\left(\log x, x\right)\\
\end{array}
\end{array}
if x < 2Initial program 20.9%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f6439.2%
Simplified39.2%
Taylor expanded in x around 0
associate-+r+N/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f649.0%
Simplified9.0%
+-commutativeN/A
associate-+l+N/A
log1p-defineN/A
log1p-lowering-log1p.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
fabs-lowering-fabs.f6469.7%
Applied egg-rr69.7%
neg-fabsN/A
sub0-negN/A
flip3--N/A
fabs-divN/A
metadata-evalN/A
cube-unmultN/A
neg-sub0N/A
fabs-negN/A
mul-fabsN/A
mul-fabsN/A
cube-multN/A
metadata-evalN/A
pow-powN/A
pow2N/A
sqr-absN/A
pow2N/A
pow-powN/A
metadata-evalN/A
metadata-evalN/A
+-lft-identityN/A
distribute-rgt-outN/A
+-commutativeN/A
+-lft-identityN/A
fabs-sqrN/A
Applied egg-rr69.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6467.9%
Simplified67.9%
if 2 < x Initial program 43.4%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f64100.0%
Simplified100.0%
Taylor expanded in x around inf
mul-1-negN/A
log-recN/A
remove-double-negN/A
log-lowering-log.f6432.0%
Simplified32.0%
(FPCore (x) :precision binary64 (copysign x x))
double code(double x) {
return copysign(x, x);
}
public static double code(double x) {
return Math.copySign(x, x);
}
def code(x): return math.copysign(x, x)
function code(x) return copysign(x, x) end
function tmp = code(x) tmp = sign(x) * abs(x); end
code[x_] := N[With[{TMP1 = Abs[x], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
\begin{array}{l}
\\
\mathsf{copysign}\left(x, x\right)
\end{array}
Initial program 26.6%
copysign-lowering-copysign.f64N/A
log-lowering-log.f64N/A
+-lowering-+.f64N/A
fabs-lowering-fabs.f64N/A
+-commutativeN/A
hypot-1-defN/A
hypot-lowering-hypot.f6454.6%
Simplified54.6%
Taylor expanded in x around 0
log1p-defineN/A
log1p-lowering-log1p.f64N/A
fabs-lowering-fabs.f6464.6%
Simplified64.6%
Applied egg-rr3.2%
Taylor expanded in x around 0
Simplified51.9%
(FPCore (x) :precision binary64 (let* ((t_0 (/ 1.0 (fabs x)))) (copysign (log1p (+ (fabs x) (/ (fabs x) (+ (hypot 1.0 t_0) t_0)))) x)))
double code(double x) {
double t_0 = 1.0 / fabs(x);
return copysign(log1p((fabs(x) + (fabs(x) / (hypot(1.0, t_0) + t_0)))), x);
}
public static double code(double x) {
double t_0 = 1.0 / Math.abs(x);
return Math.copySign(Math.log1p((Math.abs(x) + (Math.abs(x) / (Math.hypot(1.0, t_0) + t_0)))), x);
}
def code(x): t_0 = 1.0 / math.fabs(x) return math.copysign(math.log1p((math.fabs(x) + (math.fabs(x) / (math.hypot(1.0, t_0) + t_0)))), x)
function code(x) t_0 = Float64(1.0 / abs(x)) return copysign(log1p(Float64(abs(x) + Float64(abs(x) / Float64(hypot(1.0, t_0) + t_0)))), x) end
code[x_] := Block[{t$95$0 = N[(1.0 / N[Abs[x], $MachinePrecision]), $MachinePrecision]}, N[With[{TMP1 = Abs[N[Log[1 + N[(N[Abs[x], $MachinePrecision] + N[(N[Abs[x], $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + t$95$0 ^ 2], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{1}{\left|x\right|}\\
\mathsf{copysign}\left(\mathsf{log1p}\left(\left|x\right| + \frac{\left|x\right|}{\mathsf{hypot}\left(1, t\_0\right) + t\_0}\right), x\right)
\end{array}
\end{array}
herbie shell --seed 2024160
(FPCore (x)
:name "Rust f64::asinh"
:precision binary64
:alt
(! :herbie-platform default (let* ((ax (fabs x)) (ix (/ 1 ax))) (copysign (log1p (+ ax (/ ax (+ (hypot 1 ix) ix)))) x)))
(copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x))