![]() |
Cadabra
Computer algebra system for field theory problems
|
#include <ExManip.hh>
Public Types | |
| typedef Ex::iterator_base | iterator_base |
| typedef Ex::iterator | iterator |
| typedef Ex::post_order_iterator | post_order_iterator |
| typedef Ex::sibling_iterator | sibling_iterator |
Public Member Functions | |
| ExManip (const Kernel &, Ex &) | |
| bool | prod_wrap_single_term (iterator &) |
| Take a single non-product node in a sum and wrap it in a product node, so it can be handled on the same footing as a proper product. | |
| bool | prod_unwrap_single_term (iterator &) |
| bool | sum_wrap_single_term (iterator &) |
| bool | sum_unwrap_single_term (iterator &) |
| bool | is_single_term (iterator) |
| Is the indicated node a single term in an expression? | |
| bool | is_nonprod_factor_in_prod (iterator) |
| void | force_node_wrap (iterator &, std::string) |
| Wrap a term in a product or sum in a node with indicated name, irrespective of its parent (it usually makes more sense to call the safer prod_wrap_single_term or sum_wrap_single_term above). | |
Protected Attributes | |
| const Kernel & | kernel |
| Ex & | tr |
| typedef Ex::iterator cadabra::ExManip::iterator |
| typedef Ex::iterator_base cadabra::ExManip::iterator_base |
| typedef Ex::post_order_iterator cadabra::ExManip::post_order_iterator |
| typedef Ex::sibling_iterator cadabra::ExManip::sibling_iterator |
| ExManip::ExManip | ( | const Kernel & | k, |
| Ex & | e ) |
| void ExManip::force_node_wrap | ( | iterator & | it, |
| std::string | nm ) |
Wrap a term in a product or sum in a node with indicated name, irrespective of its parent (it usually makes more sense to call the safer prod_wrap_single_term or sum_wrap_single_term above).
Sets the iterator to the new node.
| bool ExManip::is_nonprod_factor_in_prod | ( | iterator | it | ) |
| bool ExManip::is_single_term | ( | iterator | it | ) |
Is the indicated node a single term in an expression?
Returns true if the indicated node is a single non-reserved node (non-prod, non-sum, ...) at the top level of an expression (real top, top of equation lhs/rhs, top of integral argument, ...).
| bool ExManip::prod_unwrap_single_term | ( | iterator & | it | ) |
| bool ExManip::prod_wrap_single_term | ( | iterator & | it | ) |
Take a single non-product node in a sum and wrap it in a product node, so it can be handled on the same footing as a proper product.
| bool ExManip::sum_unwrap_single_term | ( | iterator & | it | ) |
| bool ExManip::sum_wrap_single_term | ( | iterator & | it | ) |
|
protected |
|
protected |