In #19048, an iterator iterating over the cartesian product of two possibly infinite iterators is needed.
This can for instance be implemented by the Cantor pairing function https://en.wikipedia.org/wiki/Pairing_function#Cantor_pairing_function , i.e. the well-known proof that the product of two countable sets is countable. Does such an iterator exist in sage? I found the sage.misc.mrange module, but I do not have the impression that it deals with infinite iterators. Regards, Clemens Heuberger -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
