mpoly_monomials_repack_wider, mpoly_monomials_repack_wider_cmpmask
#include <flint/mpoly.h>ulong * mpoly_monomials_repack_wider(flint_bitcnt_t * bits_ptr, slong * N_ptr, const ulong * old_exps, flint_bitcnt_t old_bits, slong len, slong alloc, const mpoly_ctx_t mctx)sourceulong * mpoly_monomials_repack_wider_cmpmask(flint_bitcnt_t * bits_ptr, slong * N_ptr, ulong ** cmpmask_ptr, const ulong * old_exps, flint_bitcnt_t old_bits, slong len, slong alloc, const mpoly_ctx_t mctx)sourceHelpers for algorithms that detect exponent overflow while producing their output. They replace *bits_ptr by mpoly_fix_bits(*bits_ptr + 1, mctx), update *N_ptr, and return a new array, allocated with flint_malloc with room for alloc monomials, containing the first len monomials of old_exps (packed with old_bits bits) repacked to the new width. old_exps is not freed. The second version also reallocates *cmpmask_ptr with flint_realloc and refills it, so it must have been allocated with flint_malloc.
The FLINT team, “mpoly_monomials_repack_wider, mpoly_monomials_repack_wider_cmpmask (mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpoly/mpoly_monomials_repack_wider.html (generated 2026-10-20).
@misc{flint-doc-mpoly-mpoly-monomials-repack-wider,
author = {{The FLINT team}},
title = {{mpoly\_monomials\_repack\_wider, mpoly\_monomials\_repack\_wider\_cmpmask (mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpoly/mpoly_monomials_repack_wider.html},
note = {Generated 2026-10-20}
}