[PD] fft algorithms revisited

[Orm Finnendahl]

Hi,

I found another fft algorithm in the sources (mayer-buneman with
hartley transform), which I found in benchmark tests from 1993 

(http://www.geocities.com/ResearchTriangle/8869/1993_fft_summary.html)

being ahead for vectors of size 64. I presume that is the one pd is
using for dsp computing or am I wrong? What's the other one for?
How does it compare to fftw? In another benchmark test 

(http://www.fftw.org/benchfft/results/pii-300.html)

this one seems to be faster, but those tests can be deceiptive.

Orm