Public Member Functions |
| | LinkedBraidStructure (int N) |
| | LinkedBraidStructure (int N, const Word &w) |
| | LinkedBraidStructure (const LinkedBraidStructure &LBS) |
| LinkedBraidStructure & | operator= (const LinkedBraidStructure &LBS) |
| bool | operator< (const LinkedBraidStructure &lbs) const |
| int | size () const |
| void | clear () |
| LinkedBraidStructureTransform | push_back (int g) |
| LinkedBraidStructureTransform | push_front (int g) |
| void | removeLeftHandles (list< LinkedBraidStructureTransform > *result=NULL) |
| void | removeRightHandles (list< LinkedBraidStructureTransform > *result=NULL) |
| Word | translateIntoWord () const |
| void | undo (const list< LinkedBraidStructureTransform > &lbst_seq) |
| void | undo (const LinkedBraidStructureTransform &lbst) |
| | LinkedBraidStructure (int N) |
| | ~LinkedBraidStructure () |
| void | push_back (int i) |
| template<class ConstIntIterator > |
| void | push_back (ConstIntIterator B, ConstIntIterator E) |
| void | clear () |
| void | push_front (int i) |
| void | transformToDehornoyForm () |
| list< int > | getWord () const |
Private Member Functions |
| LinkedBraidStructureTransform | make_EraseTransform (BraidNode *bn, int pos) const |
| LinkedBraidStructureTransform | make_AddTransform (BraidNode *bn, int pos) const |
| LinkedBraidStructureTransform | make_ChangeType (BraidNode *bn, int pos) const |
| int | checkIfStartsLeftHandle (int pos, BraidNode *bn) |
| int | checkIfStartsRightHandle (int pos, BraidNode *bn) |
| void | removeLeftHandle (triple< int, int, BraidNode * > node, set< triple< int, int, BraidNode * > > &to_check, list< LinkedBraidStructureTransform > *lst) |
| void | removeRightHandle (triple< int, int, BraidNode * > node, set< triple< int, int, BraidNode * > > &to_check, list< LinkedBraidStructureTransform > *lst) |
| LinkedBraidStructureTransform | removeNode (BraidNode *bn, int pos) |
| BraidNode * | insertBackRight (BraidNode *bn, int pos, bool type) |
| BraidNode * | insertBackLeft (BraidNode *bn, int pos, bool type) |
| BraidNode * | insert (const LinkedBraidStructureTransform &lbst) |
| void | processTree (int al, BraidNode *node, Word &result) const |
| void | clearLinks () const |
| void | processNode (list< int > &result, int index, const BraidNode *bn) const |
| | Function used in getWord( ).
|
Private Attributes |
| int | theIndex |
| | Number of generators!!!
|
| vector< BraidNode * > | frontNodes |
| vector< BraidNode * > | backNodes |
| map< int, BraidNode > | theNodes |
| int | maxNodeNumber |
| int | theRank |
| bool | theMark |