Use C++11 'auto' and range-based for loops where possible.

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

diff --git a/ginac/polynomial/primpart_content.cpp b/ginac/polynomial/primpart_content.cpp
index 1e2cda8360b26c1a790e346f5efb08845b393987..54a6f1704ae61037708c776c2ae7ea83b440739b 100644 (file)
--- a/ginac/polynomial/primpart_content.cpp
+++ b/ginac/polynomial/primpart_content.cpp
@@ -68,7 +68,7 @@ void primpart_content(ex& pp, ex& c, ex e, const exvector& vars,
 
        // 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;