Re: Performance of tables slower than built in?

[Ola Fosheim Grøstad via Digitalmars-d-learn]

On Saturday, 25 May 2019 at 09:04:31 UTC, NaN wrote:
It's bit extra work to calculate the the waveform but actual 
works out faster than having huge LUTs since you're typically 
only producing maybe 100 samples in each interrupt callback

Another hybrid option when filling a buffer might be to fill two 
buffers with an approximation that is crossfaded between the 
end-points.

A bit tricky, but say you have a taylor polynomial (or even a 
recurrence relation) that  is "correct" near the beginning of the 
buffer, and another one that is correct near the end of the 
buffer.

Then you could fill two buffers from each end and cross fade 
between the buffers. You might get some phase-cancellation errors 
and phasing-like distortion though.