Cadabra
Computer algebra system for field theory problems
tab_basics.hh
Go to the documentation of this file.
1 #pragma once
2 
3 #include "Algorithm.hh"
4 #include "YoungTab.hh"
5 
6 namespace cadabra {
7 
8  class tab_basics : public Algorithm {
9  public:
10  tab_basics(const Kernel&, Ex&);
11 
14 
17  unsigned int find_obj(const Ex& other);
18 
20  void tabs_to_tree(uinttabs_t&, iterator, iterator, bool even_only);
22 
23  std::vector<Ex::iterator> num_to_it;
24  };
25 
26  }
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
Definition: Kernel.hh:15
Definition: tab_basics.hh:8
yngtab::filled_tableau< unsigned int > uinttab_t
Definition: tab_basics.hh:12
tab_basics(const Kernel &, Ex &)
Definition: tab_basics.cc:6
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
std::vector< Ex::iterator > num_to_it
Definition: tab_basics.hh:23
yngtab::tableaux< uinttab_t > uinttabs_t
Definition: tab_basics.hh:13
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 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:90
Definition: YoungTab.hh:350
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:83