Cadabra
Computer algebra system for field theory problems
Loading...
Searching...
No Matches
Public Member Functions | List of all members
cadabra::visit::Equals Class Reference

#include <Equals.hh>

Inheritance diagram for cadabra::visit::Equals:
cadabra::visit::ReservedNode cadabra::ExManip

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.
 
- Public Member Functions inherited from cadabra::visit::ReservedNode
 ReservedNode (const Kernel &, Ex &, Ex::iterator)
 
Ex::iterator node () const
 
- Public Member Functions inherited from cadabra::ExManip
 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

- Public Types inherited from cadabra::ExManip
typedef Ex::iterator_base iterator_base
 
typedef Ex::iterator iterator
 
typedef Ex::post_order_iterator post_order_iterator
 
typedef Ex::sibling_iterator sibling_iterator
 
- Protected Attributes inherited from cadabra::visit::ReservedNode
Ex::iterator top
 
- Protected Attributes inherited from cadabra::ExManip
const Kernelkernel
 
Extr
 

Constructor & Destructor Documentation

◆ Equals()

visit::Equals::Equals ( const Kernel k,
Ex e,
Ex::iterator  i 
)

Member Function Documentation

◆ lhs()

Ex::iterator visit::Equals::lhs ( ) const

Left-hand side.

◆ move_all_to_lhs()

void visit::Equals::move_all_to_lhs ( )

Move all terms in an equality to the left-hand side.

◆ rhs()

Ex::iterator visit::Equals::rhs ( ) const

The documentation for this class was generated from the following files: