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  }
Algorithm.hh
cadabra::Kernel
Definition: Kernel.hh:15
cadabra::lower_free_indices::apply
virtual result_t apply(iterator &) override
Definition: lower_free_indices.cc:16
cadabra::lower_free_indices::lower
bool lower
Definition: lower_free_indices.hh:16
cadabra::lower_free_indices
Definition: lower_free_indices.hh:8
cadabra::lower_free_indices::lower_free_indices
lower_free_indices(const Kernel &, Ex &, bool lower)
Definition: lower_free_indices.cc:6
cadabra::Algorithm::iterator
Ex::iterator iterator
Definition: Algorithm.hh:70
cadabra::Algorithm
Definition: Algorithm.hh:59
cadabra
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:83
cadabra::Ex
Definition: Storage.hh:140
cadabra::Ex::result_t
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:159
cadabra::lower_free_indices::can_apply
virtual bool can_apply(iterator) override
Definition: lower_free_indices.cc:11