#include "test_helpers.h"
#include "ulong_extras.h"
#include "gr_poly.h"
TEST_FUNCTION_START(gr_poly_divrem, state)
{
slong iter;
for (iter = 0; iter < 1000; iter++)
{
int status;
gr_ctx_t ctx;
gr_poly_t A, B, Q, R, QBR;
gr_ctx_init_random_commutative_ring(ctx, state);
gr_poly_init(A, ctx);
gr_poly_init(B, ctx);
gr_poly_init(Q, ctx);
gr_poly_init(R, ctx);
gr_poly_init(QBR, ctx);
status = GR_SUCCESS;
status |= gr_poly_randtest(A, state, 1 + n_randint(state, 6), ctx);
status |= gr_poly_randtest(B, state, 1 + n_randint(state, 6), ctx);
status |= gr_poly_randtest(Q, state, 1 + n_randint(state, 6), ctx);
status |= gr_poly_randtest(R, state, 1 + n_randint(state, 6), ctx);
if (n_randint(state, 3) == 0)
{
status |= gr_poly_mul(A, A, B, ctx);
status |= gr_poly_add(A, A, R, ctx);
}
switch (n_randint(state, 5))
{
case 0:
status |= gr_poly_set(Q, A, ctx);
status |= gr_poly_divrem(Q, R, Q, B, ctx);
break;
case 1:
status |= gr_poly_set(R, A, ctx);
status |= gr_poly_divrem(Q, R, R, B, ctx);
break;
case 2:
status |= gr_poly_set(Q, B, ctx);
status |= gr_poly_divrem(Q, R, A, Q, ctx);
break;
case 3:
status |= gr_poly_set(R, B, ctx);
status |= gr_poly_divrem(Q, R, A, R, ctx);
break;
default:
status |= gr_poly_divrem(Q, R, A, B, ctx);
break;
}
if (status == GR_SUCCESS)
{
status |= gr_poly_mul(QBR, Q, B, ctx);
status |= gr_poly_add(QBR, QBR, R, ctx);
if (status == GR_SUCCESS && gr_poly_equal(QBR, A, ctx) == T_FALSE)
{
flint_printf("FAIL\n\n");
flint_printf("A = "); gr_poly_print(A, ctx); flint_printf("\n");
flint_printf("B = "); gr_poly_print(B, ctx); flint_printf("\n");
flint_printf("Q = "); gr_poly_print(Q, ctx); flint_printf("\n");
flint_printf("R = "); gr_poly_print(R, ctx); flint_printf("\n");
flint_printf("Q*B + R = "); gr_poly_print(QBR, ctx); flint_printf("\n");
flint_abort();
}
}
gr_poly_clear(A, ctx);
gr_poly_clear(B, ctx);
gr_poly_clear(Q, ctx);
gr_poly_clear(R, ctx);
gr_poly_clear(QBR, ctx);
gr_ctx_clear(ctx);
}
TEST_FUNCTION_END(state);
}