Cadabra
Computer algebra system for field theory problems
sort_product.hh
Go to the documentation of this file.
1 
2 #pragma once
3 
4 #include "Algorithm.hh"
5 
6 namespace cadabra {
7 
8  class sort_product : public Algorithm {
9  public:
10  sort_product(const Kernel&, Ex&);
11 
12  virtual bool can_apply(iterator);
13  virtual result_t apply(iterator&);
14 
15  void dont_cleanup();
16 
17  private:
19  bool cleanup;
20  };
21 
22 }
Base class for all algorithms, containing generic routines and in particular the logic for index clas...
Definition: Algorithm.hh:58
Basic storage class for symbolic mathemematical expressions.
Definition: Storage.hh:139
Definition: sort_product.hh:8
bool ignore_numbers_
Definition: sort_product.hh:18
void dont_cleanup()
Definition: sort_product.cc:16
virtual bool can_apply(iterator)
Definition: sort_product.cc:21
Ex::iterator iterator
Definition: Algorithm.hh:69
virtual result_t apply(iterator &)
Definition: sort_product.cc:39
sort_product(const Kernel &, Ex &)
Definition: sort_product.cc:7
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Algorithm.cc:1626
Definition: Kernel.hh:14
bool cleanup
Definition: sort_product.hh:19
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:158