#include "test_helpers.h"
#include "nmod_mpoly.h"
TEST_FUNCTION_START(nmod_mpoly_get_term, state)
{
int i, j;
for (i = 0; i < 100 * flint_test_multiplier(); i++)
{
nmod_mpoly_ctx_t ctx;
nmod_mpoly_t f, g, h;
flint_bitcnt_t exp_bits1, exp_bits2, exp_bits3;
slong len1, len2, len3;
ulong modulus;
modulus = UWORD(2) + n_randint(state, -UWORD(2));
nmod_mpoly_ctx_init_rand(ctx, state, 20, modulus);
nmod_mpoly_init(f, ctx);
nmod_mpoly_init(g, ctx);
nmod_mpoly_init(h, ctx);
len1 = n_randint(state, 100);
len2 = n_randint(state, 100);
len3 = n_randint(state, 100);
exp_bits1 = n_randint(state, 200) + 2;
exp_bits2 = n_randint(state, 200) + 2;
exp_bits3 = n_randint(state, 200) + 2;
nmod_mpoly_randtest_bits(f, state, len1, exp_bits1, ctx);
nmod_mpoly_randtest_bits(g, state, len2, exp_bits2, ctx);
nmod_mpoly_randtest_bits(h, state, len3, exp_bits3, ctx);
nmod_mpoly_zero(h, ctx);
for (j = nmod_mpoly_length(f, ctx) - 1; j >= 0; j--)
{
nmod_mpoly_get_term(g, f, j, ctx);
nmod_mpoly_add(h, h, g, ctx);
}
if (!nmod_mpoly_equal(f, h, ctx))
{
flint_printf("FAIL\nCheck a polynomial is the sum of its terms\ni = %wd\n", i);
fflush(stdout);
flint_abort();
}
nmod_mpoly_clear(f, ctx);
nmod_mpoly_clear(g, ctx);
nmod_mpoly_clear(h, ctx);
nmod_mpoly_ctx_clear(ctx);
}
TEST_FUNCTION_END(state);
}