Happy New Year!

[ginac.git] / ginac / polynomial / primpart_content.cpp

diff --git a/ginac/polynomial/primpart_content.cpp b/ginac/polynomial/primpart_content.cpp
index f703ee709d38a2874ec78384a817b5a3baf7015d..2db82588f3a744315a6393f3428cb7ccfbb27678 100644 (file)
--- a/ginac/polynomial/primpart_content.cpp
+++ b/ginac/polynomial/primpart_content.cpp
@@ -3,7 +3,7 @@
  *  Function to find primitive part of a multivariate polynomial. */
 
 /*
- *  GiNaC Copyright (C) 1999-2010 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2019 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
@@ -62,13 +62,13 @@ void primpart_content(ex& pp, ex& c, ex e, const exvector& vars,
                // 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;