adjust() | ThRightNormalForm | [inline] |
adjustDecomposition(int rank, int &power, list< Permutation > &decomp) | ThRightNormalForm | [static] |
areConjugate(const ThRightNormalForm &rep) const | ThRightNormalForm | |
computeNormalizer() const | ThRightNormalForm | |
cycle(const NF &rep) | ThRightNormalForm | [static] |
decycle(const NF &rep) | ThRightNormalForm | [static] |
findSSSRepresentative(ThRightNormalForm &conjugator) const | ThRightNormalForm | |
findSSSRepresentative() const | ThRightNormalForm | [inline] |
findSSSRepresentative(int rank, const NF &rep) | ThRightNormalForm | [private, static] |
getDecomposition() const | ThRightNormalForm | [inline] |
getHalfTwistPermutation(int theIndex) | ThRightNormalForm | [inline, static] |
getPower() const | ThRightNormalForm | [inline] |
getRank() const | ThRightNormalForm | [inline] |
getShortWord() const | ThRightNormalForm | |
getSimpleConjugators(int rank, const NF &rep) | ThRightNormalForm | [private, static] |
getSimpleSummitConjugators(int rank, const NF &rep) | ThRightNormalForm | [private, static] |
getWord() const | ThRightNormalForm | |
inverse() const | ThRightNormalForm | [private] |
isTrivial() const | ThRightNormalForm | [inline] |
multiply(const ThRightNormalForm &rep) const | ThRightNormalForm | [private] |
NF typedef | ThRightNormalForm | |
NO_CHANGE enum value | ThRightNormalForm | [private] |
ONE_MULTIPLIER enum value | ThRightNormalForm | [private] |
operator *(const ThRightNormalForm &rep) const | ThRightNormalForm | [inline] |
operator *=(const ThRightNormalForm &rep) | ThRightNormalForm | [inline] |
operator NF() const | ThRightNormalForm | [inline] |
operator!=(const ThRightNormalForm &rep) const | ThRightNormalForm | [inline] |
operator-() const | ThRightNormalForm | [inline] |
operator<(const ThRightNormalForm &rep) const | ThRightNormalForm | [inline] |
operator=(const NF &tr) | ThRightNormalForm | [inline] |
operator==(const ThRightNormalForm &rep) const | ThRightNormalForm | [inline] |
setDecomposition(const list< Permutation > &d) | ThRightNormalForm | [inline] |
setPower(int p) | ThRightNormalForm | [inline] |
sssConstructionIteration(int rank, map< NF, NF > &sss_new1, map< NF, NF > &sss_checked1, const map< NF, NF > &sss_new2, const map< NF, NF > &sss_checked2) | ThRightNormalForm | [private, static] |
theDecomposition | ThRightNormalForm | [private] |
theOmegaPower | ThRightNormalForm | [private] |
theRank | ThRightNormalForm | [private] |
ThRightNormalForm(int rank=0) | ThRightNormalForm | [inline] |
ThRightNormalForm(int rank, int p, const list< Permutation > &d) | ThRightNormalForm | [inline] |
ThRightNormalForm(const NF &tr) | ThRightNormalForm | [inline] |
ThRightNormalForm(const BraidGroup &G, const Word &w) | ThRightNormalForm | |
transform(int theIndex, Permutation &p1, Permutation &p2) | ThRightNormalForm | [private, static] |
transformationResult enum name | ThRightNormalForm | [private] |
TWO_MULTIPLIERS enum value | ThRightNormalForm | [private] |