On Friday, March 6, 2015 at 1:35:12 PM UTC-8, Travis Scrimshaw wrote: > > The lower-case version is meant to be a functorial construction and > IIRC eventually replace the CamelCase version. The closest thing to getting > it to work currently is: > > sage: C = cartesian_product([Set([1,2,3]), Set([1,2,3])]) > > but it currently doesn't have a working iterator. >
sage: C = cartesian_product([FiniteEnumeratedSet([1,2,3]), FiniteEnumeratedSet([1,2,3])]) works better. Good thing we have tab-completion. John On Friday, March 6, 2015 at 1:19:14 PM UTC-8, Volker Braun wrote: > > I've never used the lower-case version, but always this: > > sage: CartesianProduct([1,2,3], [1,2,3]) > Cartesian product of [1, 2, 3], [1, 2, 3] > sage: list(_) > [[1, 1], [1, 2], [1, 3], [2, 1], [2, 2], [2, 3], [3, 1], [3, 2], [3, 3]] > > > > On Friday, March 6, 2015 at 8:00:06 PM UTC+1, William wrote: >> >> Hi, >> >> I'm unhappy that this doesn't work: >> >> sage: cartesian_product([[1,2,3], [1,2,3]]) >> BOOM! >> >> It seems clear from the docstring that this not working is >> intentional. Is anybody opposed to making the above work (again? I >> think it did for years, but not sure). >> >> William >> >> >> >> -- >> William (http://wstein.org) >> > -- 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.