* Utility functions. */
/*
- * GiNaC Copyright (C) 1999-2014 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
key[i] = var_i_pow;
pre_coeff = pre_coeff.coeff(vars[i], var_i_pow);
}
- ex_collect_priv_t::iterator i = ec.find(key);
+ auto i = ec.find(key);
if (i != ec.end())
i->second += pre_coeff;
else
static void wipe_out_zeros(ex_collect_priv_t& m)
{
- ex_collect_priv_t::iterator i = m.begin();
+ auto i = m.begin();
while (i != m.end()) {
- // be careful to not invalide iterator, use post-increment
+ // be careful to not invalidate the iterator, use post-increment
// for that, see e.g.
// http://coding.derkeiler.com/Archive/C_CPP/comp.lang.cpp/2004-02/0502.html
if (i->second.is_zero())
}
}
-GiNaC::ex
-ex_collect_to_ex(const ex_collect_t& ec, const GiNaC::exvector& vars)
+ex
+ex_collect_to_ex(const ex_collect_t& ec, const exvector& vars)
{
exvector ev;
ev.reserve(ec.size());
"expression has " << exp_vector.size() << " instead");
if (exp_vector[j] != 0)
- tv.push_back(power(vars[j], exp_vector[j]));
+ tv.push_back(pow(vars[j], exp_vector[j]));
}
tv.push_back(ec[i].second);
- ex tmp = (new mul(tv))->setflag(status_flags::dynallocated);
+ ex tmp = dynallocate<mul>(tv);
ev.push_back(tmp);
}
- ex ret = (new add(ev))->setflag(status_flags::dynallocated);
+ ex ret = dynallocate<add>(ev);
return ret;
}