On Nov 29, 2010, at 9:37 AM, Rick Regan wrote: > "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?!
That quote refers to Grisu3 which produces the shortest string or else indicates failure, in which case Dragon4 or something similar using bignums is needed. But for Grisu2, no bignums are needed, and a correct string is always returned, though it is not the shortest string in 0.4% of cases. The Grisu2 strings do "round trip" correctly, which I think is where this thread started. e _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
