Cadabra
Computer algebra system for field theory problems
Loading...
Searching...
No Matches
indexsort.hh
Go to the documentation of this file.
1#pragma once
2
3#include "Algorithm.hh"
5
6namespace cadabra {
7
8 class indexsort : public Algorithm {
9 public:
10 indexsort(const Kernel&, Ex&);
11
12 virtual bool can_apply(iterator);
13 virtual result_t apply(iterator&);
14
16 public:
18 bool operator()(unsigned int, unsigned int) const;
19 private:
20 const Kernel& kernel;
21 // Ex& tr;
22 Ex::iterator it;
23 };
24 private:
26 };
27
28 }
Ex::iterator iterator
Definition Algorithm.hh:70
Algorithm(const Kernel &, Ex &)
Initialise the algorithm with a reference to the expression tree, but do not yet do anything with thi...
Definition Algorithm.cc:47
Ex::result_t result_t
Definition Algorithm.hh:73
Basic storage class for symbolic mathemematical expressions.
Definition Storage.hh:142
Definition Kernel.hh:15
Definition TableauBase.hh:9
const Kernel & kernel
Definition indexsort.hh:20
less_indexed_treenode(const Kernel &, Ex &, iterator it)
Definition indexsort.cc:21
Ex::iterator it
Definition indexsort.hh:22
bool operator()(unsigned int, unsigned int) const
Definition indexsort.cc:26
indexsort(const Kernel &, Ex &)
Definition indexsort.cc:8
virtual result_t apply(iterator &)
Definition indexsort.cc:33
const TableauBase * tb
Definition indexsort.hh:25
virtual bool can_apply(iterator)
Definition indexsort.cc:13
Functions to handle the exchange properties of two or more symbols in a product.
Definition Adjform.cc:83