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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*
Copyright (C) 2020 Daniel Schultz
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/>.
*/
int fq_zech_mpoly_repack_bits(fq_zech_mpoly_t A, const fq_zech_mpoly_t B,
flint_bitcnt_t Abits, const fq_zech_mpoly_ctx_t ctx)
{
slong i;
int success;
fq_zech_mpoly_t T;
Abits = mpoly_fix_bits(Abits, ctx->minfo);
if (B->bits == Abits || B->length == 0)
{
fq_zech_mpoly_set(A, B, ctx);
return 1;
}
/* must use B->alloc because we are going to swap coeff in aliasing case */
fq_zech_mpoly_init3(T, B->alloc, Abits, ctx);
success = mpoly_repack_monomials(T->exps, Abits, B->exps, B->bits,
B->length, ctx->minfo);
if (success)
{
if (A == B)
{
fq_zech_struct * temp = A->coeffs;
A->coeffs = T->coeffs;
T->coeffs = temp;
}
else
{
for (i = 0; i < B->length; i++)
{
fq_zech_set(T->coeffs + i, B->coeffs + i, ctx->fqctx);
}
}
_fq_zech_mpoly_set_length(T, B->length, ctx);
fq_zech_mpoly_swap(A, T, ctx);
}
fq_zech_mpoly_clear(T, ctx);
return success;
}
int