, including all inherited members.
| backNodes | LinkedBraidStructure | [private] |
| checkIfStartsLeftHandle(int pos, BraidNode *bn) | LinkedBraidStructure | [private] |
| checkIfStartsRightHandle(int pos, BraidNode *bn) | LinkedBraidStructure | [private] |
| clear() | LinkedBraidStructure | |
| clear() | LinkedBraidStructure | |
| clearLinks() const | LinkedBraidStructure | [private] |
| frontNodes | LinkedBraidStructure | [private] |
| getWord() const | LinkedBraidStructure | |
| insert(const LinkedBraidStructureTransform &lbst) | LinkedBraidStructure | [private] |
| insertBackLeft(BraidNode *bn, int pos, bool type) | LinkedBraidStructure | [private] |
| insertBackRight(BraidNode *bn, int pos, bool type) | LinkedBraidStructure | [private] |
| LinkedBraidStructure(int N) | LinkedBraidStructure | |
| LinkedBraidStructure(int N, const Word &w) | LinkedBraidStructure | |
| LinkedBraidStructure(const LinkedBraidStructure &LBS) | LinkedBraidStructure | |
| LinkedBraidStructure(int N) | LinkedBraidStructure | |
| make_AddTransform(BraidNode *bn, int pos) const | LinkedBraidStructure | [private] |
| make_ChangeType(BraidNode *bn, int pos) const | LinkedBraidStructure | [private] |
| make_EraseTransform(BraidNode *bn, int pos) const | LinkedBraidStructure | [private] |
| maxNodeNumber | LinkedBraidStructure | [private] |
| operator<(const LinkedBraidStructure &lbs) const | LinkedBraidStructure | |
| operator=(const LinkedBraidStructure &LBS) | LinkedBraidStructure | |
| processNode(list< int > &result, int index, const BraidNode *bn) const | LinkedBraidStructure | [private] |
| processTree(int al, BraidNode *node, Word &result) const | LinkedBraidStructure | [private] |
| push_back(int g) | LinkedBraidStructure | |
| push_back(int i) | LinkedBraidStructure | |
| push_back(ConstIntIterator B, ConstIntIterator E) | LinkedBraidStructure | [inline] |
| push_front(int g) | LinkedBraidStructure | |
| push_front(int i) | LinkedBraidStructure | |
| removeLeftHandle(triple< int, int, BraidNode * > node, set< triple< int, int, BraidNode * > > &to_check, list< LinkedBraidStructureTransform > *lst) | LinkedBraidStructure | [private] |
| removeLeftHandles(list< LinkedBraidStructureTransform > *result=NULL) | LinkedBraidStructure | |
| removeNode(BraidNode *bn, int pos) | LinkedBraidStructure | [private] |
| removeRightHandle(triple< int, int, BraidNode * > node, set< triple< int, int, BraidNode * > > &to_check, list< LinkedBraidStructureTransform > *lst) | LinkedBraidStructure | [private] |
| removeRightHandles(list< LinkedBraidStructureTransform > *result=NULL) | LinkedBraidStructure | |
| size() const | LinkedBraidStructure | [inline] |
| theIndex | LinkedBraidStructure | [private] |
| theMark | LinkedBraidStructure | [mutable, private] |
| theNodes | LinkedBraidStructure | [private] |
| theRank | LinkedBraidStructure | [private] |
| transformToDehornoyForm() | LinkedBraidStructure | |
| translateIntoWord() const | LinkedBraidStructure | |
| undo(const list< LinkedBraidStructureTransform > &lbst_seq) | LinkedBraidStructure | |
| undo(const LinkedBraidStructureTransform &lbst) | LinkedBraidStructure | |
| ~LinkedBraidStructure() | LinkedBraidStructure | |
1.6.1
