![]() |
Cadabra
Computer algebra system for field theory problems
|
#include <Equals.hh>
Public Member Functions | |
Equals (const Kernel &, Ex &, Ex::iterator) | |
Ex::iterator | lhs () const |
Left-hand side. | |
Ex::iterator | rhs () const |
void | move_all_to_lhs () |
Move all terms in an equality to the left-hand side. | |
![]() | |
ReservedNode (const Kernel &, Ex &, Ex::iterator) | |
Ex::iterator | node () const |
![]() | |
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). | |
Additional Inherited Members | |
![]() | |
typedef Ex::iterator_base | iterator_base |
typedef Ex::iterator | iterator |
typedef Ex::post_order_iterator | post_order_iterator |
typedef Ex::sibling_iterator | sibling_iterator |
![]() | |
Ex::iterator | top |
![]() | |
const Kernel & | kernel |
Ex & | tr |
Ex::iterator visit::Equals::lhs | ( | ) | const |
Left-hand side.
void visit::Equals::move_all_to_lhs | ( | ) |
Move all terms in an equality to the left-hand side.
Ex::iterator visit::Equals::rhs | ( | ) | const |