 |
Cadabra
Computer algebra system for field theory problems
|
yngtab::filled_tableau< unsigned int > pos_tab_t
Definition: young_project.hh:19
combin::symmetriser< unsigned int > sym
Definition: young_project.hh:23
iterator nth_index_node(iterator, unsigned int)
Definition: young_project.cc:64
bool remove_traces
Definition: young_project.hh:29
young_project(const Kernel &, Ex &)
Definition: young_project.cc:7
combin::combinations< unsigned int >::permuted_sets_t asym_ranges
Definition: young_project.hh:28
Definition: young_project.hh:9
pos_tab_t tab
Definition: young_project.hh:21
yngtab::filled_tableau< iterator > name_tab_t
Definition: young_project.hh:20
Ex::iterator iterator
Definition: Algorithm.hh:70
Definition: Algorithm.hh:59
name_tab_t nametab
Definition: young_project.hh:22
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:83
Definition: Storage.hh:141
virtual bool can_apply(iterator)
Definition: young_project.cc:27
virtual result_t apply(iterator &)
Definition: young_project.cc:71
std::vector< std::vector< T > > permuted_sets_t
Definition: Combinatorics.hh:103
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:160