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:
18  // bool ignore_numbers_;
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: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:164
Definition: Kernel.hh:15
Definition: sort_product.hh:8
virtual result_t apply(iterator &)
Definition: sort_product.cc:42
virtual bool can_apply(iterator)
Definition: sort_product.cc:24
sort_product(const Kernel &, Ex &)
Definition: sort_product.cc:10
bool cleanup
Definition: sort_product.hh:19
void dont_cleanup()
Definition: sort_product.cc:19
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:83