_fmpz_mpoly_addmul_array1_slong1, _fmpz_mpoly_addmul_array1_slong2, _fmpz_mpoly_addmul_array1_slong, _fmpz_mpoly_addmul_array1_fmpz
Synopsis
#include <flint/fmpz_mpoly.h>void _fmpz_mpoly_addmul_array1_slong1(ulong * poly1, const slong * poly2, const ulong * exp2, slong len2, const slong * poly3, const ulong * exp3, slong len3)sourcevoid _fmpz_mpoly_addmul_array1_slong2(ulong * poly1, const slong * poly2, const ulong * exp2, slong len2, const slong * poly3, const ulong * exp3, slong len3)sourcevoid _fmpz_mpoly_addmul_array1_slong(ulong * poly1, const slong * poly2, const ulong * exp2, slong len2, const slong * poly3, const ulong * exp3, slong len3)sourcevoid _fmpz_mpoly_addmul_array1_fmpz(fmpz * poly1, const fmpz * poly2, const ulong * exp2, slong len2, const fmpz * poly3, const ulong * exp3, slong len3)sourceAdd the products of all pairs of terms of the two term lists, whose monomials are tightly packed array indices, to the dense array poly1, with coefficients of one, two or three words (two's complement), or of type fmpz. The inputs are processed in blocks for cache locality.
Cite this page
The FLINT team, “_fmpz_mpoly_addmul_array1_slong1, _fmpz_mpoly_addmul_array1_slong2, _fmpz_mpoly_addmul_array1_slong, _fmpz_mpoly_addmul_array1_fmpz (fmpz_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly/_fmpz_mpoly_addmul_array1_slong1.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-fmpz-mpoly-addmul-array1-slong1,
author = {{The FLINT team}},
title = {{\_fmpz\_mpoly\_addmul\_array1\_slong1, \_fmpz\_mpoly\_addmul\_array1\_slong2, \_fmpz\_mpoly\_addmul\_array1\_slong, \_fmpz\_mpoly\_addmul\_array1\_fmpz (fmpz\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly/_fmpz_mpoly_addmul_array1_slong1.html},
note = {Generated 2026-10-20}
}