* Interface to GiNaC's light-weight expression handles. */
/*
- * GiNaC Copyright (C) 1999-2005 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2006 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
ex lhs() const;
ex rhs() const;
- // complex conjugation
+ // function for complex expressions
ex conjugate() const { return bp->conjugate(); }
+ ex real_part() const { return bp->real_part(); }
+ ex imag_part() const { return bp->imag_part(); }
// pattern matching
- bool has(const ex & pattern) const { return bp->has(pattern); }
+ bool has(const ex & pattern, unsigned options = 0) const { return bp->has(pattern, options); }
bool find(const ex & pattern, lst & found) const;
bool match(const ex & pattern) const;
bool match(const ex & pattern, lst & repl_lst) const { return bp->match(pattern, repl_lst); }
void traverse(visitor & v) const { traverse_preorder(v); }
// degree/coeff
+ bool is_polynomial(const ex & vars) const;
int degree(const ex & s) const { return bp->degree(s); }
int ldegree(const ex & s) const { return bp->ldegree(s); }
ex coeff(const ex & s, int n = 1) const { return bp->coeff(s, n); }
// noncommutativity
unsigned return_type() const { return bp->return_type(); }
- unsigned return_type_tinfo() const { return bp->return_type_tinfo(); }
+ tinfo_t return_type_tinfo() const { return bp->return_type_tinfo(); }
unsigned gethash() const { return bp->gethash(); }
inline ex conjugate(const ex & thisex)
{ return thisex.conjugate(); }
-inline bool has(const ex & thisex, const ex & pattern)
-{ return thisex.has(pattern); }
+inline ex real_part(const ex & thisex)
+{ return thisex.real_part(); }
+
+inline ex imag_part(const ex & thisex)
+{ return thisex.imag_part(); }
+
+inline bool has(const ex & thisex, const ex & pattern, unsigned options = 0)
+{ return thisex.has(pattern, options); }
inline bool find(const ex & thisex, const ex & pattern, lst & found)
{ return thisex.find(pattern, found); }
+inline bool is_polynomial(const ex & thisex, const ex & vars)
+{ return thisex.is_polynomial(vars); }
+
inline int degree(const ex & thisex, const ex & s)
{ return thisex.degree(s); }
ex operator()(const ex & e) { return ptr(e, arg1, arg2, arg3); }
};
+template<class C>
+class pointer_to_member_to_map_function_0args : public map_function {
+protected:
+ ex (C::*ptr)(const ex &);
+ C &c;
+public:
+ explicit pointer_to_member_to_map_function_0args(ex (C::*member)(const ex &), C &obj) : ptr(member), c(obj) {}
+ ex operator()(const ex & e) { return (c.*ptr)(e); }
+};
+
+template<class C, class T1>
+class pointer_to_member_to_map_function_1args : public map_function {
+protected:
+ ex (C::*ptr)(const ex &, T1);
+ C &c;
+ T1 arg1;
+public:
+ explicit pointer_to_member_to_map_function_1args(ex (C::*member)(const ex &, T1), C &obj, T1 a1) : ptr(member), c(obj), arg1(a1) {}
+ ex operator()(const ex & e) { return (c.*ptr)(e, arg1); }
+};
+
+template<class C, class T1, class T2>
+class pointer_to_member_to_map_function_2args : public map_function {
+protected:
+ ex (C::*ptr)(const ex &, T1, T2);
+ C &c;
+ T1 arg1;
+ T2 arg2;
+public:
+ explicit pointer_to_member_to_map_function_2args(ex (C::*member)(const ex&, T1, T2), C &obj, T1 a1, T2 a2) : ptr(member), c(obj), arg1(a1), arg2(a2) {}
+ ex operator()(const ex & e) { return (c.*ptr)(e, arg1, arg2); }
+};
+
+template<class C, class T1, class T2, class T3>
+class pointer_to_member_to_map_function_3args : public map_function {
+protected:
+ ex (C::*ptr)(const ex &, T1, T2, T3);
+ C &c;
+ T1 arg1;
+ T2 arg2;
+ T3 arg3;
+public:
+ explicit pointer_to_member_to_map_function_3args(ex (C::*member)(const ex &, T1, T2, T3), C &obj, T1 a1, T2 a2, T3 a3) : ptr(member), c(obj), arg1(a1), arg2(a2), arg3(a3) {}
+ ex operator()(const ex & e) { return (c.*ptr)(e, arg1, arg2, arg3); }
+};
+
inline ex ex::map(ex f(const ex &)) const
{
pointer_to_map_function fcn(f);