 |
Cadabra
Computer algebra system for field theory problems
|
Ex::iterator iterator
Definition: Algorithm.hh:70
Ex_comparator comparator
Definition: substitute.hh:37
substitute(const Kernel &, Ex &tr, Ex &args, bool partial=true)
Definition: substitute.cc:16
std::map< iterator, bool > lhs_contains_dummies
Definition: substitute.hh:44
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:159
Generic substitution algorithm.
Definition: substitute.hh:13
virtual bool can_apply(iterator st)
Match the lhs of the replacement rule to the subtree 'st' under consideration.
Definition: substitute.cc:83
Ex & args
Definition: substitute.hh:39
iterator use_rule
Definition: substitute.hh:41
std::map< iterator, bool > rhs_contains_dummies
Definition: substitute.hh:44
iterator conditions
Definition: substitute.hh:42
virtual result_t apply(iterator &)
Definition: substitute.cc:145
Base class for all algorithms, containing generic routines and in particular the logic for index clas...
Definition: Algorithm.hh:59
Definition: sort_product.hh:8
Basic storage class for symbolic mathemematical expressions.
Definition: Storage.hh:140
sort_product sort_product_
Definition: substitute.hh:47
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:80
Ex & tr
Definition: Algorithm.hh:139
bool partial
Definition: substitute.hh:48
A generic tree comparison class which will take into account index contractions and will also keep tr...
Definition: Compare.hh:189