about summary refs log tree commit diff
path: root/README
diff options
context:
space:
mode:
authorSzabolcs Nagy <nsz@port70.net>2012-12-16 19:23:51 +0100
committerSzabolcs Nagy <nsz@port70.net>2012-12-16 19:23:51 +0100
commit1aec620f9366c29d761fe42b3e02bd8024685db3 (patch)
treeacc8bf057796851982e830b9ad1265d4b5dacab3 /README
parent58bba42d1bd14e1ab01f3249ffc98afdbf841a6a (diff)
downloadmusl-1aec620f9366c29d761fe42b3e02bd8024685db3.tar.gz
musl-1aec620f9366c29d761fe42b3e02bd8024685db3.tar.xz
musl-1aec620f9366c29d761fe42b3e02bd8024685db3.zip
math: finished cosh.c cleanup
changed the algorithm: large input is not special cased
(when exp(-x) is small compared to exp(x))
and the threshold values are reevaluated
(fdlibm code had a log(2)/2 cutoff for which i could not find
justification, log(2) seems to be a better threshold and this
was verified empirically)

the new code is simpler, makes smaller binaries and should be
faster for common cases

the old comments were removed as they are no longer true for the
new algorithm and the fdlibm copyright was dropped as well
because there is no common code or idea with the original anymore
except for trivial ones.
Diffstat (limited to 'README')
0 files changed, 0 insertions, 0 deletions