printf() metaprogramming challenge

Ola Fosheim Grøstad ola.fosheim.grostad at gmail.com
Sat May 25 07:26:47 UTC 2019


On Friday, 24 May 2019 at 23:55:13 UTC, Jonathan Marler wrote:
> Ulf's algorithm can be implemented in only a few hundred lines 
> and apparently is the fastest implementation to-date that 
> maintains a 100% robust algorithm.

It is quite interesting that you get that performance without 
bloat.

I wonder if it is faster than the special cased float 
implementations. (using an estimator that chooses a faster 
floating point version where it works).

> But's it's very new, only a year old I think.  Cool innovation.

Yes:

ACM SIGPLAN Notices - PLDI '18
Volume 53 Issue 4, April 2018
Pages 270-282



More information about the Digitalmars-d mailing list