#5478: [with patch, needs review] RestrictedPartitions is very slow and a huge
memory hog
---------------------------+------------------------------------------------
Reporter: ddrake | Owner: ddrake
Type: defect | Status: new
Priority: major | Milestone: sage-combinat
Component: combinatorics | Keywords: combinat, partitions, gap
---------------------------+------------------------------------------------
Comment(by hivert):
Some comment on the first patch:
I'm not a native English speaker but it seems to me that
If ``starting=p`` is passed, then the combinatorial class of partitions
greater than or equal to `p` in lexicographic order is returned.
is clearer if phrased
If ``starting=p`` is passed, then the combinatorial class of partitions
with part greater than or equal to `p` in lexicographic order is returned.
In the same way
If ``ending=p`` is passed, then the combinatorial class of partitions at
most `p` in lexicographic order is returned.
is better phrased
If ``ending=p`` is passed, then the combinatorial class of partitions
with part at most `p` in lexicographic order is returned.
Otherwise the rest of the first patch looks good. I'm working on the
second one.
Florent
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5478#comment:10>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
