 |
Cadabra
Computer algebra system for field theory problems
|
Go to the documentation of this file.
16 map_sympy(
const Kernel&,
Ex&,
const std::string& head, std::vector<std::string> args);
24 std::vector<Ex::iterator>
left;
Ex::iterator iterator
Definition: Algorithm.hh:70
virtual result_t apply(iterator &)
Definition: map_sympy.cc:81
virtual bool can_apply(iterator)
Definition: map_sympy.cc:16
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:159
Base class for all algorithms, containing generic routines and in particular the logic for index clas...
Definition: Algorithm.hh:59
std::vector< std::string > args_
Definition: map_sympy.hh:23
std::vector< Ex::iterator > left
Definition: map_sympy.hh:24
std::string head_
Definition: map_sympy.hh:22
Basic storage class for symbolic mathemematical expressions.
Definition: Storage.hh:140
map_sympy(const Kernel &, Ex &, const std::string &head, std::vector< std::string > args)
Definition: map_sympy.cc:11
std::set< Ex::iterator > index_factors
Definition: map_sympy.hh:25
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:80
Functionality to act with Sympy on all scalar parts of an expression, and keep the result in-place.
Definition: map_sympy.hh:14