fmpz_mod_vec.h

Sets the entries of $(A, \mathit{len})$ to the entries of $(B, \mathit{len})$ reduced modulo $n$; $B$ may contain any integers and may alias $A$.

Given canonical residues $(\mathit{vec}, \mathit{len})$, sets $(\mathit{res}, \mathit{len})$ to the symmetric residues in $(-n/2, n/2]$. This is the same as _fmpz_vec_scalar_smod_fmpz but faster, since the input is known to be reduced: each entry costs one comparison and at most one subtraction.

Sets $(A, \mathit{len})$ to $-(B, \mathit{len})$.

Set $(a, n)$ to $(b, n) + (c, n)$ and $(b, n) - (c, n)$, elementwise. Here $n$ is the length of the vectors, not the modulus.

Sets $(A, \mathit{len})$ to the elementwise product of $(B, \mathit{len})$ and $(C, \mathit{len})$.

Sets $(A, \mathit{len})$ to $c \cdot (B, \mathit{len})$, for canonical $c$. For $c = 1$ this is a copy.

Sets $(A, \mathit{len})$ to $(A, \mathit{len}) + c \cdot (B, \mathit{len})$, for canonical $c$. Each entry is updated with one exact fmpz_addmul and one reduction.

Sets $(A, \mathit{len})$ to $c^{-1} \cdot (B, \mathit{len})$. Throws an exception (from fmpz_mod_inv) if $c$ is not invertible modulo $n$.

Set the output to $\sum_{i} A_i B_i$, respectively $\sum_i a_i b_{\mathit{len} - 1 - i}$, modulo $n$.