2 #ifndef LIBPOLYS_POLYS_FLINTCONV_H
3 #define LIBPOLYS_POLYS_FLINTCONV_H
28 #include <flint/flint.h>
32 #include <flint/fmpz.h>
33 #include <flint/fmpq.h>
34 #include <flint/fmpq_mat.h>
35 #include <flint/fmpz_poly.h>
36 #include <flint/fmpq_poly.h>
37 #include <flint/fmpz_poly_mat.h>
38 #if __FLINT_RELEASE >= 20500
39 #include <flint/fmpz_lll.h>
41 #include <flint/fq_poly.h>
42 #include <flint/fq_nmod.h>
43 #include <flint/fq_nmod_poly.h>
44 #include <flint/fq_nmod_mat.h>
69 #if __FLINT_RELEASE >= 20500
70 void convSingPFlintnmod_poly_t(nmod_poly_t
result,
const poly
p,
const ring r);
71 void convSingMFlintFq_nmod_mat(
matrix m, fq_nmod_mat_t
M,
const fq_nmod_ctx_t
fq_con,
const ring r);
72 poly convFlintFq_nmodSingP(
const fq_nmod_t Fp,
const fq_nmod_ctx_t ctx,
const ring r);
73 matrix convFlintFq_nmod_matSingM(fq_nmod_mat_t
m,
const fq_nmod_ctx_t
fq_con,
const ring r);
void convSingPFlintP(fmpq_poly_t res, poly p, const ring r)
void convSingNFlintN(fmpz_t f, mpz_t z)
bigintmat * singflint_LLL(bigintmat *A, bigintmat *T)
matrix convFlintNmod_matSingM(nmod_mat_t m, const ring r)
void convSingNFlintNN(fmpq_t re, fmpq_t im, number n, const coeffs cf)
void convSingIFlintI(fmpz_t f, int p)
void convSingNFlintN_QQ(fmpq_t f, number n)
void convFlintNSingN(mpz_t z, fmpz_t f)
matrix singflint_rref(matrix m, const ring R)
poly convFlintPSingP(fmpq_poly_t f, const ring r)
void convSingImPFlintP(fmpq_poly_t res, poly p, const ring r)
int convFlintISingI(fmpz_t f)
number convFlintNSingN_QQ(fmpq_t f, const coeffs cf)
void convSingMFlintNmod_mat(matrix m, nmod_mat_t M, const ring r)
The main handler for Singular numbers which are suitable for Singular polynomials.