projects / mit-scheme.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 6b70fec) | patch
New definition of `complex:acos' preserves more precision and is more
authorChris Hanson <org/chris-hanson/cph>
Fri, 2 Feb 1990 17:25:50 +0000 (17:25 +0000)
committerChris Hanson <org/chris-hanson/cph>
Fri, 2 Feb 1990 17:25:50 +0000 (17:25 +0000)
commitbc5de6bb658cb62a272403a22f04f2f883823910
tree3c6a651855ba47d762a1e5aa482b86c7896271a4tree | snapshot
parent6b70fec4c371e5ee062eae09257d895f34ebfea8commit | diff
New definition of `complex:acos' preserves more precision and is more
efficient.  This one also does not introduce inexact real or imaginary
zero components in certain (important) boundary cases, such as:

(acos 2)
;Value: 0.+1.3169578969248166i
v7/src/runtime/arith.scm diff | blob | history
MIT/GNU Scheme, Pucked