Perhaps the question is how to speed up the Cartesian product of rings in the case of rings being small, without resorting to having internal structures which would basically use addition and multiplication tables.That is, Cartesian product should be smart enough to dispatch the case of components being of specific type, say, whenever the order of the result is at most 5000, to something non generic.
Right now it seems to be implemented in the slowest possible way, where elements are just dumb Python tuples and a lot of the time is spent just in looking up the methods to be used on components. -- 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.
