#13764: CartesianProduct with generators -> silent wrong answer
---------------------------------+------------------------------------------
Reporter: vbraun | Owner: sage-combinat
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.6
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Volker Braun | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
> Iterators (objects implementing `__iter__`) are fine , only generators
(the `yield` keyword) don't work.
Oops, I see. I thought that the problem came from infinite sets, sorry..
But right now iterators are copied, and so the elements they iterate over
are generated several times... Scary `O_o`
> I don't see the point in an extra flag to install different workarounds
to generators, if you want to convert the input to a list then just do it
yourself.
Well, you cannot convert them to lists when they are infinite, and you do
not want to cache stuff when you already stored it once.
Anyway, sorry for the misunderstanding. I'll look at the code and start
making sense, if possible.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13764#comment:11>
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.
