Cadabra
Computer algebra system for field theory problems
young_project_tensor.hh
Go to the documentation of this file.
1 
2 #pragma once
3 
4 #include "Algorithm.hh"
6 
7 namespace cadabra {
8 
9  class young_project_tensor : public Algorithm {
10  public:
11  young_project_tensor(const Kernel&, Ex&, bool);
12 
13  virtual bool can_apply(iterator);
14  virtual result_t apply(iterator&);
15 
18  private:
19  const TableauBase *tb;
20  };
21 
22  }
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: TableauBase.hh:9
Definition: young_project_tensor.hh:9
virtual bool can_apply(iterator)
Definition: young_project_tensor.cc:18
bool modulo_monoterm
Definition: young_project_tensor.hh:16
combin::symmetriser< unsigned int > sym
Definition: young_project_tensor.hh:17
virtual result_t apply(iterator &)
Definition: young_project_tensor.cc:30
const TableauBase * tb
Definition: young_project_tensor.hh:19
young_project_tensor(const Kernel &, Ex &, bool)
Definition: young_project_tensor.cc:13
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:83