Closed duvenaud closed 1 year ago
Not sure if this could be a test, but to put your mind at ease, here are the old and new functions:
for req_size:(Fin 17). f_to_n $ 2.0 `pow` (ceil $ log2 $ n_to_f (ordinal req_size))
[0, 1, 2, 4, 4, 8, 8, 8, 8, 16, 16, 16, 16, 16, 16, 16, 16]
for req_size:(Fin 17). intpow2 $ nextpow2 (ordinal req_size)
[1, 1, 2, 4, 4, 8, 8, 8, 8, 16, 16, 16, 16, 16, 16, 16, 16]
The required code was already in the FFT demo.