Cadabra
Computer algebra system for field theory problems
|
#include <Permutations.hh>
Public Member Functions | |
template<class iterator > | |
void | find (iterator start1, iterator end1, iterator start2, iterator end2) |
Find the permutation that takes [start1, end1> to [start2, end2>. More... | |
template<class iterator > | |
void | apply (iterator start1, iterator end1) |
Apply the permutation 'perm' on the given range. More... | |
Public Attributes | |
std::vector< int > | perm |
void Perm::apply | ( | iterator | start1, |
iterator | end1 | ||
) |
Apply the permutation 'perm' on the given range.
void Perm::find | ( | iterator | start1, |
iterator | end1, | ||
iterator | start2, | ||
iterator | end2 | ||
) |
Find the permutation that takes [start1, end1> to [start2, end2>.
This will be available in 'perm' afterwards.
std::vector<int> Perm::perm |