Cadabra
Computer algebra system for field theory problems
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
indexsort.hh
Go to the documentation of this file.
1 
2 #include "Algorithm.hh"
4 
5 namespace cadabra {
6 
7  class indexsort : public Algorithm {
8  public:
9  indexsort(const Kernel&, Ex&);
10 
11  virtual bool can_apply(iterator);
12  virtual result_t apply(iterator&);
13 
15  public:
17  bool operator()(unsigned int, unsigned int) const;
18  private:
19  const Kernel& kernel;
20  Ex& tr;
21  Ex::iterator it;
22  };
23  private:
24  const TableauBase *tb;
25  };
26 
27 }
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:130
bool operator()(unsigned int, unsigned int) const
Definition: indexsort.cc:26
const Kernel & kernel
Definition: indexsort.hh:19
Ex & tr
Definition: indexsort.hh:20
virtual result_t apply(iterator &)
Definition: indexsort.cc:33
Definition: TableauBase.hh:9
Ex::iterator iterator
Definition: Algorithm.hh:69
const TableauBase * tb
Definition: indexsort.hh:24
virtual bool can_apply(iterator)
Definition: indexsort.cc:13
Definition: indexsort.hh:7
less_indexed_treenode(const Kernel &, Ex &, iterator it)
Definition: indexsort.cc:21
Definition: Kernel.hh:15
indexsort(const Kernel &, Ex &)
Definition: indexsort.cc:8
Ex::iterator it
Definition: indexsort.hh:21
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:149