#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):
> Thats how the cartesian product works. Shouldn't come as a surprise.
Yeah, but you could want to cache them sometimes.. Do not generate them
over and over if it takes time to generate them... Of course the opposite
may also be true : it is very cheap to generate them, even over and over,
but you do not want to store them.
> But you can wrap your generator into an `IterableFunctionCall` if it is
potentially infinite.
Yepyep. Right.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13764#comment:13>
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.
