base change by conjugation and, if necessary, transpositions More...
#include <conjugating_base_change.h>
Public Member Functions | |
ConjugatingBaseChange (const BSGSCore< PERM, TRANS > &) | |
constructor | |
template<class InputIterator > | |
uint | change (BSGS< PERM, TRANS > &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant=false) const |
changes base of bsgs so that it starts with the sequence given by baseBegin to baseEnd | |
template<class InputIterator > | |
uint | change (SymmetricGroup< PERM > &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant=false) const |
changes base of symmetric group so that it starts with the sequence given by baseBegin to baseEnd | |
ConjugatingBaseChange (const BSGSCore< PERM, TRANS > &) | |
constructor | |
template<class InputIterator > | |
uint | change (BSGS< PERM, TRANS > &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant=false) const |
changes base of bsgs so that it starts with the sequence given by baseBegin to baseEnd | |
template<class InputIterator > | |
uint | change (SymmetricGroup< PERM > &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant=false) const |
changes base of symmetric group so that it starts with the sequence given by baseBegin to baseEnd |
base change by conjugation and, if necessary, transpositions
uint permlib::ConjugatingBaseChange< PERM, TRANS, BASETRANSPOSE >::change | ( | BSGS< PERM, TRANS > & | bsgs, | |
InputIterator | baseBegin, | |||
InputIterator | baseEnd, | |||
bool | skipRedundant = false | |||
) | const [inline] |
changes base of bsgs so that it starts with the sequence given by baseBegin to baseEnd
true iff we multiply c with another permutation (and thus c is no longer with absolute certainty the identity)
true iff we multiply c with another permutation (and thus c is no longer with absolute certainty the identity)