* Implementation of GiNaC's ABC. */
/*
- * GiNaC Copyright (C) 1999-2016 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2024 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
pre_coeff = pre_coeff.coeff(li, cexp);
key *= pow(li, cexp);
}
- exmap::iterator ci = cmap.find(key);
+ auto ci = cmap.find(key);
if (ci != cmap.end())
ci->second += pre_coeff;
else
ex basic::subs_one_level(const exmap & m, unsigned options) const
{
if (options & subs_options::no_pattern) {
- auto it = m.find(*this);
+ ex thisex = *this; // NB: *this may be deleted here.
+ auto it = m.find(thisex);
if (it != m.end())
return it->second;
- return *this;
+ return thisex;
} else {
for (auto & it : m) {
exmap repl_lst;
// global variables
//////////
-int max_recursion_level = 1024;
-
-
#ifdef GINAC_COMPARE_STATISTICS
compare_statistics_t::~compare_statistics_t()
{