* functions. */
/*
- * GiNaC Copyright (C) 1999-2015 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2016 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
for (const_iterator i = exp_arg.begin(); i != exp_arg.end(); ++i)
prodseq.push_back(exp(*i));
- return (new mul(prodseq))->setflag(status_flags::dynallocated | status_flags::expanded);
+ return dynallocate<mul>(prodseq).setflag(status_flags::expanded);
}
return exp(exp_arg).hold();
// in this case n more (or less) terms are needed
// (sadly, to generate them, we have to start from the beginning)
if (n == 0 && coeff == 1) {
- epvector epv;
- ex acc = (new pseries(rel, epv))->setflag(status_flags::dynallocated);
- epv.reserve(2);
- epv.push_back(expair(-1, _ex0));
- epv.push_back(expair(Order(_ex1), order));
- ex rest = pseries(rel, std::move(epv)).add_series(argser);
+ ex rest = pseries(rel, epvector{expair(-1, _ex0), expair(Order(_ex1), order)}).add_series(argser);
+ ex acc = dynallocate<pseries>(rel, epvector());
for (int i = order-1; i>0; --i) {
epvector cterm { expair(i%2 ? _ex1/i : _ex_1/i, _ex0) };
acc = pseries(rel, std::move(cterm)).add_series(ex_to<pseries>(acc));