FLINT3.7.0-dev

_fmpz_mpoly_from_ulong_array1, _fmpz_mpoly_from_ulong_array2, _fmpz_mpoly_from_ulong_array, _fmpz_mpoly_from_fmpz_array

Synopsis#include <flint/fmpz_mpoly.h>
slong _fmpz_mpoly_from_ulong_array1(fmpz ** poly1, ulong ** exp1, slong * alloc, ulong * poly2, const slong * mults, slong num, slong bits, slong k)source
slong _fmpz_mpoly_from_ulong_array2(fmpz ** poly1, ulong ** exp1, slong * alloc, ulong * poly2, const slong * mults, slong num, slong bits, slong k)source
slong _fmpz_mpoly_from_ulong_array(fmpz ** poly1, ulong ** exp1, slong * alloc, ulong * poly2, const slong * mults, slong num, slong bits, slong k)source
slong _fmpz_mpoly_from_fmpz_array(fmpz ** poly1, ulong ** exp1, slong * alloc, fmpz * poly2, const slong * mults, slong num, slong bits, slong k)source

Convert a dense coefficient array indexed by tightly packed monomials with the bases mults (one, two or three words per coefficient, or fmpz) into a term list with exponents packed into bits bits, starting at term index k, and return the new length. Used by the array division.

Cite this page

The FLINT team, “_fmpz_mpoly_from_ulong_array1, _fmpz_mpoly_from_ulong_array2, _fmpz_mpoly_from_ulong_array, _fmpz_mpoly_from_fmpz_array (fmpz_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly/_fmpz_mpoly_from_ulong_array1.html (generated 2026-10-20).