Oh dear, which implementation are you using? The new code doesn't call fft_radix2_twiddle.
I hope you are using the implementation here: https://github.com/wbhart/flint2/tree/trunk/fft The other implementation is extremely messy in comparison. Bill. On 3 January 2012 01:15, Cactus <[email protected]> wrote: > Only one test now fails: > > mul_mfa_truncate_sqrt2 > > It runs out of memory after a huge number of recursive calls > to fft_radix2_twiddle > > Brian > > -- > You received this message because you are subscribed to the Google Groups > "mpir-devel" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/mpir-devel/-/8F-vCR84hjAJ. > > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/mpir-devel?hl=en. -- You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en.
