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