FastDoubleParser
FastDoubleParser copied to clipboard
Introduction caching FFT of powers of ten.
Caching FFT of powers of ten improves performance as they can be reused during computation.
Some memory is wasted as the cache is permanent, but the same situation stands with existing cache of powers of ten or roots of unity.
More comprehensive solution should be considered allowing user to control the cache - what to store, how long, forcing flush etc.