* Chinese remainder algorithm. */
/*
- * GiNaC Copyright (C) 1999-2011 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2015 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
{
static const cln::cl_I n1(1);
const numeric icont_ = A.integer_content();
+ GINAC_ASSERT(cln::instanceof(icont_.to_cl_N(), cln::cl_RA_ring));
if (cln::instanceof(icont_.to_cl_N(), cln::cl_I_ring)) {
const cln::cl_I icont = cln::the<cln::cl_I>(icont_.to_cl_N());
if (icont != 1) {
Apr = A;
return n1;
}
- }
- if (cln::instanceof(icont_.to_cl_N(), cln::cl_RA_ring)) {
+ } else {
Apr = (A/icont_).expand();
// A is a polynomail over rationals, so GCD is defined
// up to arbitrary rational number.
return n1;
}
- GINAC_ASSERT(NULL == "expected polynomial over integers or rationals");
}
ex chinrem_gcd(const ex& A_, const ex& B_, const exvector& vars)
const cln::cl_I b_lc = integer_lcoeff(B, vars);
const cln::cl_I g_lc = cln::gcd(a_lc, b_lc);
- const ex& x(vars.back());
exp_vector_t n = std::min(degree_vector(A, vars), degree_vector(B, vars));
const int nTot = std::accumulate(n.begin(), n.end(), 0);
const cln::cl_I A_max_coeff = to_cl_I(A.max_coefficient());