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