<commit_before># Tiny FFT
A tiny implementation of Fast Fourier Transform for sizes power of 2

    clang -O3 tinyfft.c -c

## List of provided functions

    void init(int k, double complex *w);

Initializing a table w of twiddle factors for FFT of length 2^k.

    void fft(int k, double complex *x, const double complex *w);

A complex vector x of length 2^k is Fourier transformed by using a table w. After the transform, elements are in bitreversal order.

    void ifft(int k, double complex *x, const double complex *w);

A complex vector x of length 2^k is inverse Fourier transformed by using a table w. Before the transform, elements are assumed to be in bitreversal order.

    void convolver(int k, double complex *x, const double complex *w);<commit_msg>revised<commit_after># Tiny FFT
A tiny implementation of Fast Fourier Transform for sizes power of 2

    clang -O3 tinyfft.c -c

## List of provided functions

    void init(int k, double complex *w);

A table w of twiddle factors is initialized for FFT of length 2^k.

    void fft(int k, double complex *x, const double complex *w);

A complex vector x of length 2^k is Fourier transformed by using a table w. After the transform, elements are in bitreversal order.

    void ifft(int k, double complex *x, const double complex *w);

A complex vector x of length 2^k is inverse Fourier transformed by using a table w. Before the transform, elements are assumed to be in bitreversal order.

    void convolver(int k, double complex *x, const double complex *w);
{'fraction_non_alphanumeric': 0.058823529411764705, 'fraction_numerical': 0.006535947712418301, 'mean_word_length': 3.8144654088050314, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '431743', 'n_tokens_mistral': 450, 'n_tokens_neox': 415, 'n_words': 242}