#include "symbol.h"
#include "lst.h"
#include "ncmul.h"
+#include "relational.h"
#include "print.h"
#include "archive.h"
#include "utils.h"
c.s << "[" << class_name() << " object]";
}
-/** Little wrapper arount print to be called within a debugger.
+/** Little wrapper around print to be called within a debugger.
* This is needed because you cannot call foo.print(cout) from within the
* debugger because it might not know what cout is. This method can be
* invoked with no argument and it will simply print to stdout.
std::cerr << std::endl;
}
-/** Little wrapper arount printtree to be called within a debugger.
+/** Little wrapper around printtree to be called within a debugger.
*
* @see basic::dbgprint
* @see basic::printtree */
this->print(print_tree(std::cerr));
}
+/** Return relative operator precedence (for parenthizing output). */
+unsigned basic::precedence(void) const
+{
+ return 70;
+}
+
/** Create a new copy of this on the heap. One can think of this as simulating
* a virtual copy constructor which is needed for instance by the refcounted
* construction of an ex from a basic. */
return op(i);
}
-/** Search ocurrences. An object 'has' an expression if it is the expression
+/** Search ocurrences. An object 'has' an expression if it is the expression
* 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. */
+ * is false. The expression can also contain wildcards. */
bool basic::has(const ex & other) const
{
GINAC_ASSERT(other.bp!=0);
- if (is_equal(*other.bp)) return true;
- if (nops()>0) {
- for (unsigned i=0; i<nops(); i++)
- if (op(i).has(other))
- return true;
- }
+ lst repl_lst;
+ if (match(*other.bp, repl_lst))
+ return true;
+ for (unsigned i=0; i<nops(); i++)
+ if (op(i).has(other))
+ return true;
return false;
}
+/** Construct new expression by applying the specified function to all
+ * sub-expressions (one level only, not recursively). */
+ex basic::map(map_func f) const
+{
+ unsigned num = nops();
+ if (num == 0)
+ return *this;
+
+ basic *copy = duplicate();
+ copy->setflag(status_flags::dynallocated);
+ copy->clearflag(status_flags::hash_calculated);
+ ex e(*copy);
+ for (unsigned i=0; i<num; i++)
+ e.let_op(i) = f(e.op(i));
+ return e.eval();
+}
+
/** Return degree of highest power in object s. */
int basic::degree(const ex & s) const
{
return n==0 ? *this : _ex0();
}
-/** Sort expression in terms of powers of some object(s).
+/** Sort expanded expression in terms of powers of some object(s).
* @param s object(s) to sort in
* @param distributed recursive or distributed form (only used when s is a list) */
ex basic::collect(const ex & s, bool distributed) const
return *this;
}
+/** Evaluate sums and products of matrices. */
+ex basic::evalm(void) const
+{
+ if (nops() == 0)
+ return *this;
+ else
+ return map(GiNaC::evalm);
+}
+
/** Perform automatic symbolic evaluations on indexed expression that
* contains this object as the base expression. */
ex basic::eval_indexed(const basic & i) const
return false;
}
+/** 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
+{
+/*
+ Sweet sweet shapes, sweet sweet shapes,
+ That's the key thing, right right.
+ Feed feed face, feed feed shapes,
+ But who is the king tonight?
+ Who is the king tonight?
+ Pattern is the thing, the key thing-a-ling,
+ But who is the king of pattern?
+ But who is the king, the king thing-a-ling,
+ Who is the king of Pattern?
+ Bog is the king, the king thing-a-ling,
+ Bog is the king of Pattern.
+ Ba bu-bu-bu-bu bu-bu-bu-bu-bu-bu bu-bu
+ Bog is the king of Pattern.
+*/
+
+ if (is_ex_exactly_of_type(pattern, wildcard)) {
+
+ // Wildcard matches anything, but check whether we already have found
+ // a match for that wildcard first (if so, it the earlier match must
+ // be the same expression)
+ for (unsigned i=0; i<repl_lst.nops(); i++) {
+ if (repl_lst.op(i).op(0).is_equal(pattern))
+ return is_equal(*repl_lst.op(i).op(1).bp);
+ }
+ repl_lst.append(pattern == *this);
+ return true;
+
+ } else {
+
+ // Expression must be of the same type as the pattern
+ if (tinfo() != pattern.bp->tinfo())
+ return false;
+
+ // Number of subexpressions must match
+ if (nops() != pattern.nops())
+ return false;
+
+ // No subexpressions? Then just compare the objects (there can't be
+ // wildcards in the pattern)
+ if (nops() == 0)
+ return is_equal(*pattern.bp);
+
+ // Otherwise the subexpressions must match one-to-one
+ for (unsigned i=0; i<nops(); i++)
+ if (!op(i).match(pattern.op(i), repl_lst))
+ return false;
+
+ // Looks similar enough, match found
+ return true;
+ }
+}
+
/** Substitute a set of objects by arbitrary expressions. The ex returned
* will already be evaluated. */
-ex basic::subs(const lst & ls, const lst & lr) const
+ex basic::subs(const lst & ls, const lst & lr, bool no_pattern) const
{
GINAC_ASSERT(ls.nops() == lr.nops());
- for (unsigned i=0; i<ls.nops(); i++) {
- if (is_equal(*ls.op(i).bp))
- return lr.op(i);
+ if (no_pattern) {
+ for (unsigned i=0; i<ls.nops(); i++) {
+ if (is_equal(*ls.op(i).bp))
+ return lr.op(i);
+ }
+ } else {
+ for (unsigned i=0; i<ls.nops(); i++) {
+ lst repl_lst;
+ if (match(*ls.op(i).bp, repl_lst))
+ return lr.op(i).bp->subs(repl_lst, true); // avoid infinite recursion when re-substituting the wildcards
+ }
}
return *this;
* replacement arguments: 1) a relational like object==ex and 2) a list of
* relationals lst(object1==ex1,object2==ex2,...), which is converted to
* subs(lst(object1,object2,...),lst(ex1,ex2,...)). */
-ex basic::subs(const ex & e) const
+ex basic::subs(const ex & e, bool no_pattern) const
{
if (e.info(info_flags::relation_equal)) {
- return subs(lst(e));
+ return subs(lst(e), no_pattern);
}
if (!e.info(info_flags::list)) {
throw(std::invalid_argument("basic::subs(ex): argument must be a list"));
ls.append(r.op(0));
lr.append(r.op(1));
}
- return subs(ls, lr);
+ return subs(ls, lr, no_pattern);
}
/** Compare objects to establish canonical ordering.
throw(std::runtime_error("cannot modify multiply referenced object"));
}
-//////////
-// static member variables
-//////////
-
-// protected
-
-unsigned basic::precedence = 70;
-
//////////
// global variables
//////////