Cadabra
Computer algebra system for field theory problems
PreClean.hh
Go to the documentation of this file.
1 
2 #pragma once
3 
4 #include "Algorithm.hh"
5 
19 
20 namespace cadabra {
21 
22  void pre_clean_dispatch(const Kernel& k, Ex&, Ex::iterator& it);
23  void pre_clean_dispatch_deep(const Kernel& k, Ex&);
24 
28 
29  void cleanup_updown(const Kernel& k, Ex&, Ex::iterator& it);
30  void cleanup_rational(const Kernel& k, Ex&, Ex::iterator& it);
31  void cleanup_frac(const Kernel& k, Ex&, Ex::iterator& it);
32  void cleanup_sqrt(const Kernel& k, Ex&, Ex::iterator& it);
33  void cleanup_sub(const Kernel& k, Ex&, Ex::iterator& it);
34 
37  void cleanup_indexbracket(const Kernel& k, Ex&, Ex::iterator& it);
38 
40  std::string replace_all(std::string const& original, std::string const& from, std::string const& to );
41 
42  }
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:83
void cleanup_indexbracket(const Kernel &, Ex &tr, Ex::iterator &it)
Convert parser output which indicates an indexbracket to an actual indexbracket node.
Definition: PreClean.cc:158
void cleanup_sqrt(const Kernel &, Ex &tr, Ex::iterator &st)
Definition: PreClean.cc:115
void pre_clean_dispatch_deep(const Kernel &k, Ex &tr)
Definition: PreClean.cc:19
void cleanup_frac(const Kernel &, Ex &tr, Ex::iterator &st)
Definition: PreClean.cc:48
void pre_clean_dispatch(const Kernel &kernel, Ex &ex, Ex::iterator &it)
Definition: PreClean.cc:7
std::string replace_all(std::string const &original, std::string const &from, std::string const &to)
Replace all occurrances of 'from' with 'to', return result (does not replace in-place).
Definition: PreClean.cc:198
void cleanup_sub(const Kernel &, Ex &tr, Ex::iterator &it)
Definition: PreClean.cc:121
void cleanup_updown(const Kernel &, Ex &, Ex::iterator &st)
Cleanup for individual node types.
Definition: PreClean.cc:24
void cleanup_rational(const Kernel &, Ex &, Ex::iterator &st)
Definition: PreClean.cc:40
int k
Definition: passing.cc:4