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
/*
Copyright (C) 2023 Albin Ahlbäck
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/>.
*/
#ifndef FMPQ_TYPES_H
#define FMPQ_TYPES_H
#include "fmpz_types.h"
#ifdef __cplusplus
extern "C" {
#endif
typedef struct
{
fmpq * entries;
slong r;
slong c;
slong stride;
}
fmpq_mat_struct;
typedef fmpq_mat_struct fmpq_mat_t[1];
typedef struct
{
fmpz * coeffs;
slong alloc;
slong length;
fmpz_t den;
}
fmpq_poly_struct;
typedef fmpq_poly_struct fmpq_poly_t[1];
/*
A polynomial f is represented as
content * zpoly,
where zpoly should have positive leading coefficient and trivial content.
If f is zero, then the representation should have
content = 0 and zpoly = 0
*/
typedef struct
{ /* non zero case: | zero case: */
fmpq_t content; /* positive or negative content | zero */
fmpz_mpoly_t zpoly; /* contentless poly, lc is positive | zero */
}
fmpq_mpoly_struct;
typedef fmpq_mpoly_struct fmpq_mpoly_t[1];
typedef struct
{
fmpq_t constant;
fmpq_mpoly_struct * poly;
fmpz * exp;
slong num;
slong alloc;
}
fmpq_mpoly_factor_struct;
typedef fmpq_mpoly_factor_struct fmpq_mpoly_factor_t[1];
#ifdef __cplusplus
}
#endif
#endif /* FMPQ_TYPES_H */