#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):
NOnonononoo I know ! But I was thinking of something like that :
You can easily build an iterator over the elements of `N^15` : you first
need to enumerate the elements of `[0] x ... x [0]`. Then, once you are
done, you can enumerate the elements of `[0,1] x ... x [0,1]` that you
have not enumerate before. Then, once you are done, you can enumerate the
elements of `[0,1,2] x .... x [0,1,2]` that you have not enumerated
before, etc, etc. You see what I mean ? What I mean is of course a bit
more complicated than that, because in this situation you do not know the
cardinality of your iterators, you do not even know (and cannot, as you
say) decide whether they are finite, etc... But if you "ask a new element
from an iterator" only when you need it, you can always remember a finite
partial list from the elements of each iterator, and still iterate over
ALL elements !
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13764#comment:6>
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.
