On Sun, Nov 28, 2010 at 8:09 PM, Doug Currie <doug.cur...@gmail.com> wrote:
> The paper compares the performance of sprintf from glibc 2.11 and Grisu. I
> don't know if glibc sprintf is based on Gay's code; at one point I thought
> it was, but I cannot find an authoritative reference.
>
> In any case, the Grisus benchmarked about 5x to 10x faster than sprintf on
> average for random double inputs. The code should be simpler than dtoa.c
> since there are no bignums involved, and fewer special cases.
>
>
I'm pretty sure glibc doesn't use Gay's code (the last I checked, its
implementation was "home grown", in /stdio-common/printf_fp.c).
Regarding the Grisus paper, this is from the abstract:
"For IEEE 754 double-precision numbers and 64-bit integers roughly
99.4% of all numbers can be processed efficiently. The remaining 0.6% are
rejected and need to be printed by a slower complete algorithm."
Hmmm. What's involved in the "slower complete algorithm" -- bignums?!
_______________________________________________
sqlite-users mailing list
sqlite-users@sqlite.org
http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
