Cadabra
Computer algebra system for field theory problems
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
tab_basics.hh
Go to the documentation of this file.
1 
2 #include "Algorithm.hh"
3 #include "YoungTab.hh"
4 
5 namespace cadabra {
6 
7 class tab_basics : public Algorithm {
8  public:
9  tab_basics(const Kernel&, Ex&);
10 
13 
16  unsigned int find_obj(const Ex& other);
17 
19  void tabs_to_tree(uinttabs_t&, iterator, iterator, bool even_only);
21 
22  std::vector<Ex::iterator> num_to_it;
23 };
24 
25 }
Base class for all algorithms, containing generic routines and in particular the logic for index clas...
Definition: Algorithm.hh:58
yngtab::filled_tableau< unsigned int > uinttab_t
Definition: tab_basics.hh:11
Basic storage class for symbolic mathemematical expressions.
Definition: Storage.hh:130
tab_basics(const Kernel &, Ex &)
Definition: tab_basics.cc:6
Definition: YoungTab.hh:81
std::vector< Ex::iterator > num_to_it
Definition: tab_basics.hh:22
void tabs_to_tree(uinttabs_t &, iterator, iterator, bool even_only)
The inverse, converting tableaux to Ex objects attached as children of the iterator.
Definition: tab_basics.cc:91
void tabs_to_singlet_rules(uinttabs_t &, iterator)
Definition: tab_basics.cc:64
unsigned int find_obj(const Ex &other)
Definition: tab_basics.cc:11
void tree_to_numerical_tab(iterator, uinttab_t &)
Convert an Ex to a numerical Young tableau, using num_to_it below.
Definition: tab_basics.cc:20
Ex::iterator iterator
Definition: Algorithm.hh:69
Definition: tab_basics.hh:7
Definition: Kernel.hh:15
yngtab::tableaux< uinttab_t > uinttabs_t
Definition: tab_basics.hh:12