* Implementation of GiNaC's ABC. */
/*
- * GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2008 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
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <iostream>
#include <stdexcept>
-#ifdef DO_GINAC_ASSERT
-# include <typeinfo>
-#endif
+#include <typeinfo>
#include "basic.h"
#include "ex.h"
#include "numeric.h"
#include "power.h"
+#include "add.h"
#include "symbol.h"
#include "lst.h"
#include "ncmul.h"
#include "wildcard.h"
#include "archive.h"
#include "utils.h"
+#include "inifcns.h"
namespace GiNaC {
const basic & basic::operator=(const basic & other)
{
unsigned fl = other.flags & ~status_flags::dynallocated;
- if (tinfo_key != other.tinfo_key) {
+ if (typeid(*this) != typeid(other)) {
// The other object is of a derived class, so clear the flags as they
// might no longer apply (especially hash_calculated). Oh, and don't
// copy the tinfo_key: it is already set correctly for this object.
* the pattern itself or one of the children 'has' it. As a consequence
* (according to the definition of children) given e=x+y+z, e.has(x) is true
* but e.has(x+y) is false. */
-bool basic::has(const ex & pattern) const
+bool basic::has(const ex & pattern, unsigned options) const
{
- lst repl_lst;
+ exmap repl_lst;
if (match(pattern, repl_lst))
return true;
for (size_t i=0; i<nops(); i++)
- if (op(i).has(pattern))
+ if (op(i).has(pattern, options))
return true;
return false;
return *this;
}
+/** Check whether this is a polynomial in the given variables. */
+bool basic::is_polynomial(const ex & var) const
+{
+ return !has(var) || is_equal(ex_to<basic>(var));
+}
+
/** Return degree of highest power in object s. */
int basic::degree(const ex & s) const
{
else if (distributed) {
- // Get lower/upper degree of all symbols in list
- size_t num = s.nops();
- struct sym_info {
- ex sym;
- int ldeg, deg;
- int cnt; // current degree, 'counter'
- ex coeff; // coefficient for degree 'cnt'
- };
- sym_info *si = new sym_info[num];
- ex c = *this;
- for (size_t i=0; i<num; i++) {
- si[i].sym = s.op(i);
- si[i].ldeg = si[i].cnt = this->ldegree(si[i].sym);
- si[i].deg = this->degree(si[i].sym);
- c = si[i].coeff = c.coeff(si[i].sym, si[i].cnt);
- }
-
- while (true) {
-
- // Calculate coeff*x1^c1*...*xn^cn
- ex y = _ex1;
- for (size_t i=0; i<num; i++) {
- int cnt = si[i].cnt;
- y *= power(si[i].sym, cnt);
- }
- x += y * si[num - 1].coeff;
-
- // Increment counters
- size_t n = num - 1;
- while (true) {
- ++si[n].cnt;
- if (si[n].cnt <= si[n].deg) {
- // Update coefficients
- ex c;
- if (n == 0)
- c = *this;
- else
- c = si[n - 1].coeff;
- for (size_t i=n; i<num; i++)
- c = si[i].coeff = c.coeff(si[i].sym, si[i].cnt);
- break;
- }
- if (n == 0)
- goto done;
- si[n].cnt = si[n].ldeg;
- n--;
+ x = this->expand();
+ if (! is_a<add>(x))
+ return x;
+ const lst& l(ex_to<lst>(s));
+
+ exmap cmap;
+ cmap[_ex1] = _ex0;
+ for (const_iterator xi=x.begin(); xi!=x.end(); ++xi) {
+ ex key = _ex1;
+ ex pre_coeff = *xi;
+ for (lst::const_iterator li=l.begin(); li!=l.end(); ++li) {
+ int cexp = pre_coeff.degree(*li);
+ pre_coeff = pre_coeff.coeff(*li, cexp);
+ key *= pow(*li, cexp);
}
+ exmap::iterator ci = cmap.find(key);
+ if (ci != cmap.end())
+ ci->second += pre_coeff;
+ else
+ cmap.insert(exmap::value_type(key, pre_coeff));
}
-done: delete[] si;
+ exvector resv;
+ for (exmap::const_iterator mi=cmap.begin(); mi != cmap.end(); ++mi)
+ resv.push_back((mi->first)*(mi->second));
+ return (new add(resv))->setflag(status_flags::dynallocated);
} else {
}
/** Check whether the expression matches a given pattern. For every wildcard
- * object in the pattern, an expression of the form "wildcard == matching_expression"
- * is added to repl_lst. */
-bool basic::match(const ex & pattern, lst & repl_lst) const
+ * object in the pattern, a pair with the wildcard as a key and matching
+ * expression as a value is added to repl_lst. */
+bool basic::match(const ex & pattern, exmap& repl_lst) const
{
/*
Sweet sweet shapes, sweet sweet shapes,
// Wildcard matches anything, but check whether we already have found
// a match for that wildcard first (if so, the earlier match must be
// the same expression)
- for (lst::const_iterator it = repl_lst.begin(); it != repl_lst.end(); ++it) {
- if (it->op(0).is_equal(pattern))
- return is_equal(ex_to<basic>(it->op(1)));
+ for (exmap::const_iterator it = repl_lst.begin(); it != repl_lst.end(); ++it) {
+ if (it->first.is_equal(pattern))
+ return is_equal(ex_to<basic>(it->second));
}
- repl_lst.append(pattern == *this);
+ repl_lst[pattern] = *this;
return true;
} else {
// Expression must be of the same type as the pattern
- if (tinfo() != ex_to<basic>(pattern).tinfo())
+ if (typeid(*this) != typeid(ex_to<basic>(pattern)))
return false;
// Number of subexpressions must match
if (!match_same_type(ex_to<basic>(pattern)))
return false;
+ // Even if the expression does not match the pattern, some of
+ // its subexpressions could match it. For example, x^5*y^(-1)
+ // does not match the pattern $0^5, but its subexpression x^5
+ // does. So, save repl_lst in order to not add bogus entries.
+ exmap tmp_repl = repl_lst;
// Otherwise the subexpressions must match one-to-one
for (size_t i=0; i<nops(); i++)
- if (!op(i).match(pattern.op(i), repl_lst))
+ if (!op(i).match(pattern.op(i), tmp_repl))
return false;
// Looks similar enough, match found
+ repl_lst = tmp_repl;
return true;
}
}
exmap::const_iterator it;
if (options & subs_options::no_pattern) {
- it = m.find(*this);
+ ex thisex = *this;
+ it = m.find(thisex);
if (it != m.end())
return it->second;
+ return thisex;
} else {
for (it = m.begin(); it != m.end(); ++it) {
- lst repl_lst;
+ exmap repl_lst;
if (match(ex_to<basic>(it->first), repl_lst))
- return it->second.subs(repl_lst, options | subs_options::no_pattern); // avoid infinite recursion when re-substituting the wildcards
+ return it->second.subs(repl_lst, options | subs_options::no_pattern);
+ // avoid infinite recursion when re-substituting the wildcards
}
}
return *this;
}
+ex basic::real_part() const
+{
+ return real_part_function(*this).hold();
+}
+
+ex basic::imag_part() const
+{
+ return imag_part_function(*this).hold();
+}
+
ex basic::eval_ncmul(const exvector & v) const
{
return hold_ncmul(v);
return return_types::commutative;
}
-unsigned basic::return_type_tinfo() const
+tinfo_t basic::return_type_tinfo() const
{
- return tinfo();
+ return tinfo_key;
}
/** Compute the hash value of an object and if it makes sense to store it in
* would all end up with the same hashvalue. */
unsigned basic::calchash() const
{
- unsigned v = golden_ratio_hash(tinfo());
+ unsigned v = golden_ratio_hash((p_int)tinfo());
for (size_t i=0; i<nops(); i++) {
v = rotate_left(v);
v ^= this->op(i).gethash();
compare_statistics.compare_same_hashvalue++;
#endif
- const unsigned typeid_this = tinfo();
- const unsigned typeid_other = other.tinfo();
- if (typeid_this==typeid_other) {
- GINAC_ASSERT(typeid(*this)==typeid(other));
+ const std::type_info& typeid_this = typeid(*this);
+ const std::type_info& typeid_other = typeid(other);
+ if (typeid_this == typeid_other) {
// int cmpval = compare_same_type(other);
// if (cmpval!=0) {
// std::cout << "hash collision, same type: "
// std::cout << " and ";
// other.print(print_tree(std::cout));
// std::cout << std::endl;
- return (typeid_this<typeid_other ? -1 : 1);
+ return (typeid_this.before(typeid_other) ? -1 : 1);
}
}
#ifdef GINAC_COMPARE_STATISTICS
compare_statistics.is_equal_same_hashvalue++;
#endif
- if (this->tinfo()!=other.tinfo())
+ if (typeid(*this) != typeid(other))
return false;
- GINAC_ASSERT(typeid(*this)==typeid(other));
-
#ifdef GINAC_COMPARE_STATISTICS
compare_statistics.is_equal_same_type++;
#endif
git://www.ginac.de / ginac.git / blobdiff