#include "fmpz_mod.h"
#include "mpoly.h"
#include "fmpz_mod_mpoly.h"
int fmpz_mod_mpoly_is_canonical(
const fmpz_mod_mpoly_t A,
const fmpz_mod_mpoly_ctx_t ctx)
{
slong N = mpoly_words_per_exp(A->bits, ctx->minfo);
slong i;
if (A->length > A->coeffs_alloc)
return 0;
if (N*A->length > A->exps_alloc)
return 0;
if (!mpoly_monomials_valid_test(A->exps, A->length, A->bits, ctx->minfo))
return 0;
if (mpoly_monomials_overflow_test(A->exps, A->length, A->bits, ctx->minfo))
return 0;
if (!mpoly_monomials_inorder_test(A->exps, A->length, A->bits, ctx->minfo))
return 0;
for (i = 0; i < A->length; i++)
{
if (!fmpz_mod_is_canonical(A->coeffs + i, ctx->ffinfo))
return 0;
if (fmpz_is_zero(A->coeffs + i))
return 0;
}
return 1;
}
void fmpz_mod_mpoly_assert_canonical(
const fmpz_mod_mpoly_t A,
const fmpz_mod_mpoly_ctx_t ctx)
{
slong N = mpoly_words_per_exp(A->bits, ctx->minfo);
slong i;
if (A->length > A->coeffs_alloc)
flint_throw(FLINT_ERROR, "Polynomial coefficient allocation is bad");
if (N*A->length > A->exps_alloc)
flint_throw(FLINT_ERROR, "Polynomial exponent allocation is bad");
if (!mpoly_monomials_valid_test(A->exps, A->length, A->bits, ctx->minfo))
flint_throw(FLINT_ERROR, "Polynomial exponents invalid");
if (mpoly_monomials_overflow_test(A->exps, A->length, A->bits, ctx->minfo))
flint_throw(FLINT_ERROR, "Polynomial exponents overflow");
if (!mpoly_monomials_inorder_test(A->exps, A->length, A->bits, ctx->minfo))
flint_throw(FLINT_ERROR, "Polynomial exponents out of order");
for (i = 0; i < A->length; i++)
{
if (!fmpz_mod_is_canonical(A->coeffs + i, ctx->ffinfo))
flint_throw(FLINT_ERROR, "Polynomial has a bad coefficient");
if (fmpz_is_zero(A->coeffs + i))
flint_throw(FLINT_ERROR, "Polynomial has a zero coefficient");
}
}