Cadabra
Computer algebra system for field theory problems
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
fierz.hh
Go to the documentation of this file.
1 
2 #pragma once
3 
4 #include "Algorithm.hh"
5 #include "properties/Indices.hh"
6 #include "properties/Spinor.hh"
7 
8 namespace cadabra {
9 
10  class fierz : public Algorithm {
11  public:
12  fierz(const Kernel&, Ex&, Ex&);
13 
14  virtual bool can_apply(iterator) override;
15  virtual result_t apply(iterator&) override;
16 
17  private:
19 
23  int dim, spinordim;
24  const Indices *indprop;
25  };
26 
27 }
Base class for all algorithms, containing generic routines and in particular the logic for index clas...
Definition: Algorithm.hh:58
const Spinor * prop2
Definition: fierz.hh:21
Basic storage class for symbolic mathemematical expressions.
Definition: Storage.hh:130
Ex spinor_list
Definition: fierz.hh:18
iterator spin4
Definition: fierz.hh:20
const Spinor * prop1
Definition: fierz.hh:21
Definition: Indices.hh:8
iterator spin2
Definition: fierz.hh:20
virtual result_t apply(iterator &) override
Definition: fierz.cc:115
Definition: fierz.hh:10
iterator spin3
Definition: fierz.hh:20
Ex::iterator iterator
Definition: Algorithm.hh:69
iterator gam2
Definition: fierz.hh:22
Definition: Spinor.hh:8
const Spinor * prop3
Definition: fierz.hh:21
virtual bool can_apply(iterator) override
Definition: fierz.cc:23
const Spinor * prop4
Definition: fierz.hh:21
int dim
Definition: fierz.hh:23
iterator spin1
Definition: fierz.hh:20
fierz(const Kernel &, Ex &, Ex &)
Definition: fierz.cc:13
const Indices * indprop
Definition: fierz.hh:24
Definition: Kernel.hh:15
int spinordim
Definition: fierz.hh:23
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:149
iterator gam1
Definition: fierz.hh:22