On Fri, Nov 15, 2013 at 02:43:29PM -0500, Vincent Delecroix wrote:
> Thanks for taking care of it. I would like cartesian products to be
> smarter about iteration... especially when one of the factor is
> infinite. I have a working implementation of the iterator that you can
> use on the sage-combinat misc repo.
I assume this is some diagonal iterator, right? IIRC, Nicolas B. also
has some similar stuff (Nicolas?). I guess this is a good candidate to
go in EnumeratedSets.Infinite.CartesianProducts.ParentMethods.
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-combinat-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-combinat-devel.
For more options, visit https://groups.google.com/groups/opt_out.
