Right. It's probably better to use IterableFunctionCall: then it would > not fill up the memory at construction time. Of course the fill up > will eventually occur when running through the CartesianProduct; but > then the caller is just getting what he asked for :-) > > In fact, Vincent's Enumerated set from iterator would probably be > better than IterableFunctionCall, but #12518 is still in needs review > (volunteers?). >
I'm sorry to play the boring guy again, but a patch which contains these lines is not ready for review : #TODO: what should we do for comparisons of infinite sets #TODO: think about what should be done at that point #TODO: move it in sage.misc ? Nathann -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To view this discussion on the web visit https://groups.google.com/d/msg/sage-combinat-devel/-/Fm_1nQunk5YJ. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
