#17548: Partitions() is buggy
---------------------------------+---------------------------
Reporter: ferriszorro | Owner: ferriszorro
Type: defect | Status: needs_work
Priority: major | Milestone: sage-6.5
Component: combinatorics | Resolution:
Keywords: Partitions | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps: #17637
---------------------------------+---------------------------
Comment (by was):
Replying to [comment:32 jdemeyer]:
> Replying to [comment:30 tscrim]:
> > It does, but it is doing it by lex ordering, which is different than
by length-then-lex ordering.
> OK, listing all elements in lex ordering might not be possible. Fine,
then '''raise an exception''' instead of returning a wrong answer.
>
> > Its the same as doing a Cartesian product of `{1,2} x NN` and getting
`[1, 0]`, `[1, 1]`, `[1, 2]`, ... Is that a bug to you then too?
> Of course that's a bug.
+1 -- It is a reasonable basic principle that when iterating over a set S,
for every x in S the iterator must eventually return x, as (Jereon said
above). If this is impossible due to constraints on the order of
iteration, there should be an error...
--
Ticket URL: <http://trac.sagemath.org/ticket/17548#comment:34>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
