_fft_small_np2_crt_recompose
Synopsis
#include <flint/fft_small.h>void _fft_small_np2_crt_recompose(const mpn_ctx_struct * R, nn_ptr z, ulong zl, ulong zh, double * d0, double * d1, ulong nchunks, ulong navail8, ulong bits, ulong depth)sourceWrites to z the limbs [z_l, z_h) of \sum_j v_j 2^{j \cdot \mathtt{bits}} over nchunks chunk values v_j given by their residues modulo p_0 in d0 and modulo p_1 in d1, which it overwrites. Unless depth is UWORD_MAX, the residues are raw inverse transform outputs and are multiplied by 2^{-\mathtt{depth}}. navail8 is the number of entries available to the vectorised Garner step.
Cite this page
The FLINT team, “_fft_small_np2_crt_recompose (fft_small.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fft_small/_fft_small_np2_crt_recompose.html (generated 2026-10-20).
@misc{flint-doc-fft-small-fft-small-np2-crt-recompose,
author = {{The FLINT team}},
title = {{\_fft\_small\_np2\_crt\_recompose (fft\_small.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fft_small/_fft_small_np2_crt_recompose.html},
note = {Generated 2026-10-20}
}