* Function to find primitive part of a multivariate polynomial. */
/*
- * GiNaC Copyright (C) 1999-2010 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2018 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
// p_1(x_n) p_2(x_0, \ldots, x_{n-1})
c = ec.rbegin()->second;
ec.rbegin()->second = ex1;
- pp = ex_collect_to_ex(ec, vars).expand().smod(numeric(p));
+ pp = ex_collect_to_ex(ec, rest_vars).expand().smod(numeric(p));
return;
}
// Start from the leading coefficient (which is stored as a last
// element of the terms array)
- ex_collect_t::reverse_iterator i = ec.rbegin();
+ auto i = ec.rbegin();
ex g = i->second;
// there are at least two terms, so it's safe to...
++i;