Cadabra Computer algebra system for field theory problems
split_index.hh
Go to the documentation of this file.
1
2 #pragma once
3
4 #include "Algorithm.hh"
5 #include "properties/Indices.hh"
7
8 namespace cadabra {
9
10  class split_index : public Algorithm {
11  public:
12  split_index(const Kernel&, Ex&, Ex&);
13
14  virtual bool can_apply(iterator);
15  virtual result_t apply(iterator&);
16
17  private:
21  long num1, num2;
22
24  };
25
26  }
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
Definition: Coordinate.hh:8
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: Indices.hh:8
Definition: Kernel.hh:15
Definition: split_index.hh:10
bool part2_is_number
Definition: split_index.hh:20
const Coordinate * part1_coord
Definition: split_index.hh:19
virtual bool can_apply(iterator)
Definition: split_index.cc:50
iterator part1_coord_node
Definition: split_index.hh:23
iterator part2_coord_node
Definition: split_index.hh:23
const Indices * part2_class
Definition: split_index.hh:18
const Indices * full_class
Definition: split_index.hh:18
virtual result_t apply(iterator &)
Definition: split_index.cc:68
long num1
Definition: split_index.hh:21
long num2
Definition: split_index.hh:21
const Coordinate * part2_coord
Definition: split_index.hh:19
const Indices * part1_class
Definition: split_index.hh:18
split_index(const Kernel &, Ex &, Ex &)
Definition: split_index.cc:8
bool part1_is_number
Definition: split_index.hh:20
Functions to handle the exchange properties of two or more symbols in a product.