| 1 | | Ok, done, now addressing the remaining: |
| 2 | | {{{ |
| 3 | | 6898- A class to create a callable from a list of words. The concatenation of |
| 4 | | 1050- Alias for ``implicit_suffix_tree()``. |
| 5 | | 6943- A list subclass having a nicer representation for factorization of words. |
| 6 | | 5959- An iterator for :func:`~sage.combinat.rsk.RSK`. |
| 7 | | 6298- Applies the inverse of the phi function to ``self``. |
| 8 | | 6253- Applies the phi function to ``self`` and returns the result. This is |
| 9 | | 1061- Counts the number of distinct factors of ``self``. |
| 10 | | 5224- Counts the number of occurrences of ``letter`` in ``self``. |
| 11 | | 1130- Generates distinct factors of ``self``. |
| 12 | | 4927- Implements Lascoux and Schützenberger `s_i` operator, swapping the |
| 13 | | 6084- Lifts ``self`` via the delta operator to obtain a word containing the |
| 14 | | 6328- Specialized version of ``phi_inv()`` for long or incremental words. |
| 15 | | 5498- Sturmian desubstitutes the word ``self`` as much as possible. |
| 16 | | 5651- Tells whether ``self`` is a factor of a Sturmian word. |
| 17 | | 5722- Tells whether ``self`` is a tangent word. |
| 18 | | 6903- TESTS:: |
| 19 | | 889- Tests whether ``self`` has ``other`` as a prefix. |
| 20 | | 276- Tries to return a pair of words with a common parent; raises an |
| 21 | | }}} |
| 22 | | ;-) Afterwards will push... |
| 23 | | |
| 24 | | How about `Alias for ...` and `An iterator for ...`, `Specialized version of ...`? |
| 25 | | |
| | 1 | [Post to wrong ticket deleted.] |
