#include "gr_vec.h"
#include "gr_poly.h"
int
_gr_poly_divexact_generic(gr_ptr Q, gr_srcptr A, slong lenA, gr_srcptr B, slong lenB, gr_ctx_t ctx)
{
if (lenB <= 2)
return _gr_poly_divexact_basecase(Q, A, lenA, B, lenB, ctx);
else
return _gr_poly_divexact_bidirectional(Q, A, lenA, B, lenB, ctx);
}
int
gr_poly_divexact(gr_poly_t Q, const gr_poly_t A, const gr_poly_t B, gr_ctx_t ctx)
{
slong Alen, Blen, Qlen;
int status = GR_SUCCESS;
slong sz = ctx->sizeof_elem;
Alen = A->length;
Blen = B->length;
if (Blen == 0)
return GR_DOMAIN;
if (gr_is_zero(GR_ENTRY(B->coeffs, Blen - 1, sz), ctx) != T_FALSE)
return GR_UNABLE;
if (Alen < Blen)
return gr_poly_zero(Q, ctx);
Qlen = Alen - Blen + 1;
if (Q == A || Q == B)
{
gr_poly_t t;
gr_poly_init2(t, Qlen, ctx);
status = _gr_poly_divexact(t->coeffs, A->coeffs, A->length, B->coeffs, B->length, ctx);
gr_poly_swap(Q, t, ctx);
gr_poly_clear(t, ctx);
}
else
{
gr_poly_fit_length(Q, Qlen, ctx);
status = _gr_poly_divexact(Q->coeffs, A->coeffs, A->length, B->coeffs, B->length, ctx);
}
_gr_poly_set_length(Q, Qlen, ctx);
_gr_poly_normalise(Q, ctx);
return status;
}