_nmod_zip_eval_step, _n_fq_zip_eval_step, _n_fqp_zip_eval_step
Synopsis
#include <flint/n_poly.h>ulong _nmod_zip_eval_step(ulong * cur, const ulong * inc, const ulong * coeffs, slong length, nmod_t ctx)sourcevoid _n_fq_zip_eval_step(ulong * res, ulong * cur, const ulong * inc, const ulong * coeffs, slong length, const fq_nmod_ctx_t ctx)sourcevoid _n_fqp_zip_eval_step(ulong * res, ulong * cur, const ulong * inc, const ulong * coeffs, slong length, slong d, nmod_t mod)sourceOne evaluation step: return (or set res to) \sum_i c_i \mathit{cur}_i and multiply each cur[i] by inc[i]. The fq version works with \mathbb{F}_q elements throughout, the fqp version with cur and inc in the prime field and coeffs in \mathbb{F}_q.
Cite this page
The FLINT team, “_nmod_zip_eval_step, _n_fq_zip_eval_step, _n_fqp_zip_eval_step (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/_nmod_zip_eval_step.html (generated 2026-10-20).
@misc{flint-doc-n-poly-nmod-zip-eval-step,
author = {{The FLINT team}},
title = {{\_nmod\_zip\_eval\_step, \_n\_fq\_zip\_eval\_step, \_n\_fqp\_zip\_eval\_step (n\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/n_poly/_nmod_zip_eval_step.html},
note = {Generated 2026-10-20}
}