, including all inherited members.
| _sub_meet(const Permutation &p, const Permutation &ip1, const Permutation &ip2, Permutation &cur, int *left_indeces_a, int *left_indeces_b, int *right_indeces_a, int *right_indeces_b, int beg, int end) const | Permutation | [private] |
| BraidGroup class | Permutation | [friend] |
| change(int i, int j) | Permutation | [inline] |
| computeConjugacyClassRepresentative(Permutation &conj) const | Permutation | |
| computeConjugator(const Permutation &p) const | Permutation | |
| CYCLE(int N, const vector< int > &cycle) | Permutation | [static] |
| difference(const Permutation &p) const | Permutation | |
| flip() const | Permutation | |
| geodesic() const | Permutation | |
| geodesicWord() const | Permutation | |
| getCyclePermutation(int size) | Permutation | [static] |
| getHalfTwistPermutation(int size) | Permutation | [static] |
| getVector() const | Permutation | [inline] |
| getWordPresentation() const | Permutation | |
| increaseSize(int N) const | Permutation | |
| inverse() const | Permutation | |
| isTrivial() const | Permutation | |
| join2(const Permutation &p) const | Permutation | |
| left_mult_by_cycle(const vector< int > &cycle) | Permutation | |
| LeftGCD(const Permutation &p) const | Permutation | |
| LeftLCM(const Permutation &p) const | Permutation | |
| length() const | Permutation | |
| lr_multiply_by_cycles(Permutation &P, Permutation &I, const vector< int > &M1, const vector< int > &M2) | Permutation | [static] |
| meet2(const Permutation &p) const | Permutation | |
| mixable(const Permutation &p1, const Permutation &p2) | Permutation | [static] |
| operator!=(const Permutation &p) const | Permutation | |
| operator*(const Permutation &p) const | Permutation | |
| operator*=(const Permutation &p) | Permutation | |
| operator-() const | Permutation | [inline] |
| operator<(const Permutation &p) const | Permutation | |
| operator<<(ostream &os, const Permutation &p) | Permutation | [friend] |
| operator==(const Permutation &p) const | Permutation | |
| operator[](int ind) const | Permutation | [inline] |
| operator[](int ind) | Permutation | [inline] |
| Permutation(int size=0) | Permutation | |
| Permutation(int size, const int *p) | Permutation | |
| Permutation(const vector< int > &p) | Permutation | |
| Permutation(const IntIterator &B, const IntIterator &E) | Permutation | [inline] |
| power(int p) const | Permutation | |
| prepare_pairs(int N, Permutation &P, vector< pair< int, int > > &pairs) const | Permutation | [private] |
| random(int size) | Permutation | [static] |
| RightGCD(const Permutation &p) const | Permutation | |
| RightLCM(const Permutation &p) const | Permutation | |
| size() const | Permutation | [inline] |
| theValue | Permutation | [private] |
| tinyFlip(int sh) const | Permutation | |
1.6.1
