-
-
Notifications
You must be signed in to change notification settings - Fork 670
Unify and fix approaches in dtoa & strtod #843
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Comments
Currently we use Grisu2 algorithm which precise in 99.5% cases and require fallback to Dragon4 algorithm for rest of cases. I guess better investigate time to new Ryū algorithm which faster and always precise but require 10kb lookup table which possible avoid for |
Also new great paper about father research Ryu alghoritm and integrate it to |
yes, sure |
Instead Ryu we could implement more novel and faster Schubfach algorithm: or Dragonbox: |
We have some misprisions and failed tests for #768 and mentioned in #337.
dtoa
andstrtod
should utilize same big float point math which could be shared. Refactor and fix thisThe text was updated successfully, but these errors were encountered: