Date: Tue, 28 May 2013 07:03:16 -0500 From: Stephen Montgomery-Smith <stephen@missouri.edu> To: freebsd-numerics@freebsd.org Subject: Re: Use of C99 extra long double math functions after r236148 Message-ID: <51A49D04.5050409@missouri.edu> In-Reply-To: <51A49A40.3040505@missouri.edu> References: <500DAD41.5030104@missouri.edu> <20120724113214.G934@besplex.bde.org> <501204AD.30605@missouri.edu> <20120727032611.GB25690@server.rulingia.com> <20120728125824.GA26553@server.rulingia.com> <501460BB.30806@missouri.edu> <20120728231300.GA20741@server.rulingia.com> <50148F02.4020104@missouri.edu> <20120729222706.GA29048@server.rulingia.com> <5015BB9F.90807@missouri.edu> <20130528043205.GA3282@zim.MIT.EDU> <51A49A40.3040505@missouri.edu>
next in thread | previous in thread | raw e-mail | index | archive | help
On 05/28/2013 06:51 AM, Stephen Montgomery-Smith wrote: > On 05/27/2013 11:32 PM, David Schultz wrote: > >> Hi Stephen, >> >> I wrote some tests to cover the corner cases for the complex >> inverse trig functions. They don't find any nontrivial bugs in >> your implementations. :-) Now that you have a commit bit, would >> you like to commit your code, or shall I? > > I think I only have a commit bit for ports, not src. > > In any case, I would much prefer that you commit it. I have a lot on my > plate right now. > > Thank you for doing this. It would be great to see this in FreeBSD. > Also, if I can brag a little, I think the only other implementation of the complex arc-trig functions that is as accurate are the most recent boost library implementations, and then only because I submitted bug fixes to them. I also found a bug in the Hull, Fairgrieve, and Tang algorithm for cacos/cacaosh, which was faulty in certain extreme cases. This bug is documented here: https://svn.boost.org/trac/boost/ticket/7290
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?51A49D04.5050409>