, including all inherited members.
| adjust() | ThRightNormalForm | [inline] |
| adjustDecomposition(int rank, int &power, list< Permutation > &decomp) | ThRightNormalForm | [static] |
| areConjugate(const ThRightNormalForm &rep) const | ThRightNormalForm | |
| computeCentralizer() const | ThRightNormalForm | |
| cycle() const | ThRightNormalForm | |
| decycle() const | ThRightNormalForm | |
| findSSSRepresentative() const | ThRightNormalForm | |
| findUSSRepresentative() const | ThRightNormalForm | |
| getDecomposition() const | ThRightNormalForm | [inline] |
| getPower() const | ThRightNormalForm | [inline] |
| getPullback(const Permutation &s) const | ThRightNormalForm | |
| getPullback(const Permutation &u, int period) const | ThRightNormalForm | |
| getRank() const | ThRightNormalForm | [inline] |
| getShortWord() const | ThRightNormalForm | |
| getSimpleConjugator(const Permutation &start) const | ThRightNormalForm | |
| getSimpleConjugators() const | ThRightNormalForm | |
| getSimpleSummitConjugator(const Permutation &start) const | ThRightNormalForm | |
| getSimpleSummitConjugators() const | ThRightNormalForm | |
| getSimpleUltraConjugator(int period, const Permutation &start) | ThRightNormalForm | |
| getSimpleUltraConjugators(int period) | ThRightNormalForm | |
| getTransport(const ThRightNormalForm &B, const Permutation &u) const | ThRightNormalForm | |
| getTransports(const Permutation &u, int period) const | ThRightNormalForm | |
| getWord() const | ThRightNormalForm | |
| increaseRank(int N) 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 NF() const | ThRightNormalForm | [inline] |
| operator ThLeftNormalForm() const | ThRightNormalForm | |
| operator!=(const ThRightNormalForm &rep) const | ThRightNormalForm | [inline] |
| operator*(const ThRightNormalForm &rep) const | ThRightNormalForm | [inline] |
| operator*=(const ThRightNormalForm &rep) | 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] |
| randomPositive(int rank, int decomp_length) | ThRightNormalForm | [static] |
| setDecomposition(const list< Permutation > &d) | ThRightNormalForm | [inline] |
| setPower(int p) | ThRightNormalForm | [inline] |
| sssConstructionIteration(map< ThRightNormalForm, ThRightNormalForm > &sss_new1, map< ThRightNormalForm, ThRightNormalForm > &sss_checked1, const map< ThRightNormalForm, ThRightNormalForm > &sss_new2, const map< ThRightNormalForm, ThRightNormalForm > &sss_checked2) const | ThRightNormalForm | [private] |
| 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 | |
| ThRightNormalForm(const Permutation &p) | ThRightNormalForm | [inline] |
| transform(int theIndex, Permutation &p1, Permutation &p2) | ThRightNormalForm | [private, static] |
| transformationResult enum name | ThRightNormalForm | [private] |
| TWO_MULTIPLIERS enum value | ThRightNormalForm | [private] |
1.6.1
