Cadabra Computer algebra system for field theory problems
young_project.hh
Go to the documentation of this file.
1
2 #pragma once
3
4 #include "Algorithm.hh"
5 #include "YoungTab.hh"
6
8
9  class young_project : public Algorithm {
10  public:
11  young_project(const Kernel&, Ex&);
12  young_project(const Kernel&, Ex&, const std::vector<int>& shape, const std::vector<int>& indices);
13
14  virtual bool can_apply(iterator);
15  virtual result_t apply(iterator&);
16
17  // Boxes represent tensor slots, the values in them
18  // give the location in the tensor.
24
25  // Implicit antisymmetry; used by tableaux.cc only so far. These
26  // store index locations, so these are "values" from the
27  // combinatorics.hh point of view.
30
31  private:
32  iterator nth_index_node(iterator, unsigned int);
33  };
34
35  }
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:164
Definition: Kernel.hh:15
Definition: young_project.hh:9
yngtab::filled_tableau< unsigned int > pos_tab_t
Definition: young_project.hh:19
pos_tab_t tab
Definition: young_project.hh:21
virtual result_t apply(iterator &)
Definition: young_project.cc:71
young_project(const Kernel &, Ex &)
Definition: young_project.cc:7
virtual bool can_apply(iterator)
Definition: young_project.cc:27
combin::symmetriser< unsigned int > sym
Definition: young_project.hh:23
name_tab_t nametab
Definition: young_project.hh:22
bool remove_traces
Definition: young_project.hh:29
iterator nth_index_node(iterator, unsigned int)
Definition: young_project.cc:64
yngtab::filled_tableau< iterator > name_tab_t
Definition: young_project.hh:20
combin::combinations< unsigned int >::permuted_sets_t asym_ranges
Definition: young_project.hh:28
std::vector< std::vector< T > > permuted_sets_t
Definition: Combinatorics.hh:103
Functions to handle the exchange properties of two or more symbols in a product.