Fast Number Parsing Without Fallback [r-libre/2902]

Mushtak, Noble, & Lemire, Daniel (2023). Fast Number Parsing Without Fallback. Software: Practice and Experience, 53 (7), 1467-1471. https://doi.org/10.1002/spe.3198

File(s) available for this item:

PDF - view.pdf
Content : Submitted Version
License : Creative Commons Attribution.

Download

Item Type:	Journal Articles
Refereed:	Yes
Status:	Published
Abstract:	In recent work, Lemire (2021) presented a fast algorithm to convert number strings into binary floating-point numbers. The algorithm has been adopted by several important systems: e.g., it is part of the runtime libraries of GCC 12, Rust 1.55, and Go 1.16. The algorithm parses any number string with a significand containing no more than 19 digits into an IEEE floating-point number. However, there is a check leading to a fallback function to ensure correctness. This fallback function is never called in practice. We prove that the fallback is unnecessary. Thus we can slightly simplify the algorithm and its implementation.
Official URL:	https://onlinelibrary.wiley.com/doi/10.1002/spe.31...
Depositor:	Lemire, Daniel
Owner / Manager:	Daniel Lemire
Deposited:	27 Feb 2023 20:28
Last Modified:	05 Jun 2023 16:32

Actions (login required)

RÉVISER