Cadabra
Computer algebra system for field theory problems
Loading...
Searching...
No Matches
map_sympy.hh
Go to the documentation of this file.
1
2#pragma once
3
4#include "Algorithm.hh"
5
6namespace cadabra {
7
13
14 class map_sympy : public Algorithm {
15 public:
16 map_sympy(const Kernel&, Ex&, const std::string& head, std::vector<std::string> args);
17
18 virtual bool can_apply(iterator);
19 virtual result_t apply(iterator&);
20
21 private:
22 std::string head_;
23 std::vector<std::string> args_;
24 std::vector<Ex::iterator> left;
25 std::set<Ex::iterator> index_factors;
26 };
27
28 }
29
Base class for all algorithms, containing generic routines and in particular the logic for index clas...
Definition Algorithm.hh:59
Ex::iterator iterator
Definition Algorithm.hh:70
Basic storage class for symbolic mathemematical expressions.
Definition Storage.hh:142
result_t
Keeping track of what algorithms have done to this expression.
Definition Storage.hh:168
Definition Kernel.hh:15
Functionality to act with Sympy on all scalar parts of an expression, and keep the result in-place.
Definition map_sympy.hh:14
std::vector< Ex::iterator > left
Definition map_sympy.hh:24
std::string head_
Definition map_sympy.hh:22
virtual bool can_apply(iterator)
Definition map_sympy.cc:16
std::vector< std::string > args_
Definition map_sympy.hh:23
virtual result_t apply(iterator &)
Definition map_sympy.cc:82
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:83