mpoly_total_degree_fits_si, mpoly_total_degree_si, mpoly_total_degree_fmpz, mpoly_total_degree_fmpz_ref
Synopsis
#include <flint/mpoly.h>int mpoly_total_degree_fits_si(const ulong * exps, slong len, flint_bitcnt_t bits, const mpoly_ctx_t mctx)sourceslong mpoly_total_degree_si(const ulong * exps, slong len, flint_bitcnt_t bits, const mpoly_ctx_t mctx)sourcevoid mpoly_total_degree_fmpz(fmpz_t totdeg, const ulong * exps, slong len, flint_bitcnt_t bits, const mpoly_ctx_t mctx)sourcevoid mpoly_total_degree_fmpz_ref(fmpz_t totdeg, const ulong * exps, slong len, flint_bitcnt_t bits, const mpoly_ctx_t mctx)sourceCompute the total degree, the maximum over the monomials of the sum of the exponents, which is -1 for an empty array. For degree orderings mpoly_total_degree_fmpz reads it from the degree field of the first monomial; mpoly_total_degree_fmpz_ref always scans all monomials and serves as a reference implementation for testing. mpoly_total_degree_si assumes that the result fits.
Cite this page
The FLINT team, “mpoly_total_degree_fits_si, mpoly_total_degree_si, mpoly_total_degree_fmpz, mpoly_total_degree_fmpz_ref (mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpoly/mpoly_total_degree_fits_si.html (generated 2026-10-20).
@misc{flint-doc-mpoly-mpoly-total-degree-fits-si,
author = {{The FLINT team}},
title = {{mpoly\_total\_degree\_fits\_si, mpoly\_total\_degree\_si, mpoly\_total\_degree\_fmpz, mpoly\_total\_degree\_fmpz\_ref (mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpoly/mpoly_total_degree_fits_si.html},
note = {Generated 2026-10-20}
}