1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/*
Copyright (C) 2023 Fredrik Johansson
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version. See <https://www.gnu.org/licenses/>.
*/
#include "gr_poly.h"
int
gr_poly_set_gr_poly_other(gr_poly_t res, const gr_poly_t x, gr_ctx_t x_ctx, gr_ctx_t ctx)
{
int status = GR_SUCCESS;
slong x_sz = x_ctx->sizeof_elem;
slong sz = ctx->sizeof_elem;
slong i, len = gr_poly_length(x, x_ctx);
if (len == 0)
{
/* Before converting the zero polynomial to the zero polynomial,
make sure that 0 -> 0 is a legal conversion between the
base rings. */
gr_ptr c, d;
GR_TMP_INIT(c, x_ctx);
GR_TMP_INIT(d, ctx);
status |= gr_poly_zero(res, ctx);
status |= gr_set_other(d, c, x_ctx, ctx);
GR_TMP_CLEAR(c, x_ctx);
GR_TMP_CLEAR(d, ctx);
}
else
{
gr_poly_fit_length(res, len, ctx);
_gr_poly_set_length(res, len, ctx);
for (i = 0; i < len; i++)
{
status |= gr_set_other(GR_ENTRY(res->coeffs, i, sz), GR_ENTRY(x->coeffs, i, x_sz), x_ctx, ctx);
}
if (status == GR_SUCCESS)
_gr_poly_normalise(res, ctx);
else
_gr_poly_set_length(res, 0, ctx);
}
return status;
}