#20008: Implement non-recursive iterator for compositions
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: combinatorics | Resolution:
Keywords: iterator | Merged in:
Authors: Travis Scrimshaw | Reviewers: Darij Grinberg
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/composition_iterator-20008|
c6ba3e7f4d3414877fdce12128d36b40bd5e7834
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by darij):
* reviewer: => Darij Grinberg
Comment:
LGTM! This is actually a nice lexicographic iterator over all compositions
of size `\leq n`.
If you doctest sage/combinat (this iterator is used a lot, and who knows
what could happen), feel free to set this to positive review.
--
Ticket URL: <http://trac.sagemath.org/ticket/20008#comment:9>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
