Cadabra
Computer algebra system for field theory problems
indexsort.hh
Go to the documentation of this file.
1 #pragma once
2 
3 #include "Algorithm.hh"
5 
6 namespace 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:
25  const TableauBase *tb;
26  };
27 
28  }
cadabra::Algorithm::iterator
Ex::iterator iterator
Definition: Algorithm.hh:70
cadabra::indexsort
Definition: indexsort.hh:8
cadabra::Kernel
Definition: Kernel.hh:14
Algorithm.hh
cadabra::Ex::result_t
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:159
cadabra::indexsort::less_indexed_treenode::kernel
const Kernel & kernel
Definition: indexsort.hh:20
cadabra::indexsort::less_indexed_treenode
Definition: indexsort.hh:15
cadabra::indexsort::apply
virtual result_t apply(iterator &)
Definition: indexsort.cc:33
cadabra::Algorithm
Definition: Algorithm.hh:59
cadabra::indexsort::less_indexed_treenode::operator()
bool operator()(unsigned int, unsigned int) const
Definition: indexsort.cc:26
cadabra::indexsort::tb
const TableauBase * tb
Definition: indexsort.hh:25
TableauBase.hh
cadabra::TableauBase
Definition: TableauBase.hh:9
cadabra::Ex
Definition: Storage.hh:140
cadabra
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:80
cadabra::indexsort::indexsort
indexsort(const Kernel &, Ex &)
Definition: indexsort.cc:8
cadabra::indexsort::can_apply
virtual bool can_apply(iterator)
Definition: indexsort.cc:13
cadabra::indexsort::less_indexed_treenode::it
Ex::iterator it
Definition: indexsort.hh:22
cadabra::indexsort::less_indexed_treenode::less_indexed_treenode
less_indexed_treenode(const Kernel &, Ex &, iterator it)
Definition: indexsort.cc:21