FLINT3.7.0-dev
/

_fq_zech_mpoly_radix_sort1, _fq_zech_mpoly_radix_sort, _fq_zech_mpoly_add, _fq_zech_mpoly_mul_johnson, _fq_zech_mpoly_eval_all_fq_zech

Synopsis#include <flint/fq_zech_mpoly.h>
void _fq_zech_mpoly_radix_sort1(fq_zech_mpoly_t A, slong left, slong right, flint_bitcnt_t pos, ulong cmpmask, ulong totalmask)source
void _fq_zech_mpoly_radix_sort(fq_zech_mpoly_t A, slong left, slong right, flint_bitcnt_t pos, slong N, ulong * cmpmask)source
slong _fq_zech_mpoly_add(fq_zech_struct * coeff1, ulong * exp1, fq_zech_struct * coeff2, const ulong * exp2, slong len2, fq_zech_struct * coeff3, const ulong * exp3, slong len3, slong N, const ulong * cmpmask, const fq_zech_ctx_t fqctx)source
slong _fq_zech_mpoly_mul_johnson(fq_zech_struct ** coeff1, ulong ** exp1, slong * alloc, const fq_zech_struct * coeff2, const ulong * exp2, slong len2, const fq_zech_struct * coeff3, const ulong * exp3, slong len3, flint_bitcnt_t bits, slong N, const ulong * cmpmask, const fq_zech_ctx_t fqctx)source
void _fq_zech_mpoly_eval_all_fq_zech(fq_zech_t eval, const fq_zech_struct * Acoeffs, const ulong * Aexps, slong Alen, flint_bitcnt_t Abits, fq_zech_struct * const * alphas, const mpoly_ctx_t mctx, const fq_zech_ctx_t fqctx)source

Radix sort of terms, merge-addition and heap multiplication of term arrays, and evaluation at a point.

Cite this page

The FLINT team, “_fq_zech_mpoly_radix_sort1, _fq_zech_mpoly_radix_sort, _fq_zech_mpoly_add, _fq_zech_mpoly_mul_johnson, _fq_zech_mpoly_eval_all_fq_zech (fq_zech_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_zech_mpoly/_fq_zech_mpoly_radix_sort1.html (generated 2026-10-20).