#8227: Improving iterated palindromic closure computation
---------------------------------------+------------------------------------
Reporter: abmasse | Owner: abmasse
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.4
Component: combinatorics | Keywords: iterated palindromic
closure
Author: Alexandre Blondin-Massé | Upstream: N/A
Reviewer: Sébastien Labbé | Merged:
Work_issues: |
---------------------------------------+------------------------------------
Changes (by newvalueoldvalue):
* reviewer: => Sébastien Labbé
* author: abmasse => Alexandre Blondin-Massé
Comment:
I just tested the patch. All test passed in sage/combinat/words. The speed
of the function is greatly improved. Doc builds fine. I am giving a
positive review to this ticket.
Althought, I added a patch fixing some small sphinx editing and replace
`l` for `L` because I was reading `1` at first glance. Alexandre, if you
agree with my patch, I allow you to change the status of this ticket to
positive review.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8227#comment:10>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
