On Thu, 30 Nov 2006 17:32:31 -0800, Robert Bradshaw <[EMAIL PROTECTED]> wrote:
> > For anyone who noticed the dismal performance of Integers(389) vs. > RDF arithmetic in this worksheet, there's a patch that should fix > this up at > > http://sage.math.washington.edu/home/robertwb/integer_mod_caching.hg > > IntegerModRing now has a method precompute_table() which will create > a cached table of all ring elements which cuts down on the overhead a I've applied your patch and it does indeed speed things up. Thanks. > lot. Perhaps this should be automatically called in the constructor > on rings of a certain size or less. Yes, it should be automatic. I did some tests, and making it automatic up to say 10^4 would certainly make sense. Then it costs at most 0.10 seconds and 1MB RAM. William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
