1 #ifndef GINAC_PGCD_EUCLID_GCD_H
2 #define GINAC_PGCD_EUCLID_GCD_H
4 #include "gcd_euclid.tcc"
5 #include "smod_helpers.h"
10 #include "relational.h"
16 static void ex2upoly(umodpoly& u, ex e, const ex& var, const long p)
19 cln::cl_modint_ring R = cln::find_modint_ring(cln::cl_I(p));
20 u.resize(e.degree(var) + 1);
21 for (int i = 0; i <= e.degree(var); ++i) {
22 ex ce = e.coeff(var, i);
23 bug_on(!is_a<numeric>(ce), "i = " << i << ", " <<
24 "coefficient is not a number: " << ce);
25 const cln::cl_I c = to_cl_I(ce);
26 u[i] = R->canonhom(c);
30 static ex umodpoly2ex(const umodpoly& a, const ex& var, const long p)
32 cln::cl_modint_ring R = cln::find_modint_ring(cln::cl_I(p));
33 const numeric pnum(p);
34 exvector ev(a.size());
35 for (std::size_t i = a.size(); i-- != 0; ) {
36 const cln::cl_I c = smod(R->retract(a[i]), p);
37 const ex term = numeric(c)*power(var, i);
40 ex ret = (new add(ev))->setflag(status_flags::dynallocated);
44 static ex euclid_gcd(ex A, ex B, const ex& var, const long p)
50 ex2upoly(a, A, var, p);
51 ex2upoly(b, B, var, p);
54 ex ge = umodpoly2ex(g, var, p);