https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=1.12.0 2016-01-12T21:25:16+00:00 2016-01-12T21:25:16+00:00 Robin Kruppe robin.kruppe@gmail.com 2015-12-30T13:01:42+00:00 urn:sha1:dad1df6c1ab8fa06e9c5a28a6849e61fcdaa5008 Add tables of small powers of ten used in the fast path. The tables are redundant: We could also use the big, more accurate table and round the value to the correct type (in fact we did just that before this commit). However, the rounding is extra work and slows down the fast path. Because only very small exponents enter the fast path, the table and thus the space overhead is negligible. Speed-wise, this is a clear win on a [benchmark] comparing the fast path to a naive, hand-optimized, inaccurate algorithm. Specifically, this change narrows the gap from a roughly 5x difference to a roughly 3.4x difference. [benchmark]: https://gist.github.com/Veedrac/dbb0c07994bc7882098e 2015-08-08T15:15:31+00:00 Robin Kruppe robin.kruppe@gmail.com 2015-07-26T15:50:29+00:00 urn:sha1:ba792a4baa856d83c3001afa181db91c5b4c9732 This commit primarily adds implementations of the algorithms from William Clinger's paper "How to Read Floating Point Numbers Accurately". It also includes a lot of infrastructure necessary for those algorithms, and some unit tests. Since these algorithms reject a few (extreme) inputs that were previously accepted, this could be seen as a [breaking-change]