#include "nmod_poly.h"
#include "gr_poly.h"
void
_nmod_poly_compose_series(nn_ptr res, nn_srcptr poly1, slong len1,
nn_srcptr poly2, slong len2, slong n, nmod_t mod)
{
gr_ctx_t ctx;
_gr_ctx_init_nmod(ctx, &mod);
GR_MUST_SUCCEED(_gr_poly_compose_series(res, poly1, len1, poly2, len2, n, ctx));
}
void
nmod_poly_compose_series(nmod_poly_t res,
const nmod_poly_t poly1, const nmod_poly_t poly2, slong n)
{
slong len1 = poly1->length;
slong len2 = poly2->length;
slong lenr;
if (len2 != 0 && poly2->coeffs[0] != 0)
{
flint_throw(FLINT_ERROR, "(nmod_poly_compose_series): "
"Inner polynomial must have zero constant term.\n");
}
if (len1 == 0 || n == 0)
{
nmod_poly_zero(res);
return;
}
if (len2 == 0 || len1 == 1)
{
nmod_poly_fit_length(res, 1);
res->coeffs[0] = poly1->coeffs[0];
res->length = 1;
_nmod_poly_normalise(res);
return;
}
lenr = FLINT_MIN((len1 - 1) * (len2 - 1) + 1, n);
len1 = FLINT_MIN(len1, lenr);
len2 = FLINT_MIN(len2, lenr);
if ((res != poly1) && (res != poly2))
{
nmod_poly_fit_length(res, lenr);
_nmod_poly_compose_series(res->coeffs, poly1->coeffs, len1,
poly2->coeffs, len2, lenr, res->mod);
res->length = lenr;
_nmod_poly_normalise(res);
}
else
{
nmod_poly_t t;
nmod_poly_init2_preinv(t, res->mod.n, res->mod.ninv, lenr);
_nmod_poly_compose_series(t->coeffs, poly1->coeffs, len1,
poly2->coeffs, len2, lenr, res->mod);
t->length = lenr;
_nmod_poly_normalise(t);
nmod_poly_swap(res, t);
nmod_poly_clear(t);
}
}