Is the large significands table (~19KB) an issue for cache contention in practic... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		Scaevolus 28 days ago \| parent \| context \| favorite \| on: Zmij: Faster floating point double-to-string conve... Is the large significands table (~19KB) an issue for cache contention in practical use, or are only a small range of significands generally accessed?

vitaut 28 days ago [–]

It depends on the input distribution, specifically exponents. It is also possible to compress the table at the cost of additional computation using the method from Dragonbox.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact