On Mar 20, 2007, at 11:04 PM, David Harvey wrote: > On Mar 21, 2007, at 1:37 AM, Robert Bradshaw wrote: > >> One could also force all keys of a >> hashtable to live in a given ring. > > I don't think you'd want to do that. First, it wouldn't even solve > the problem (e.g. because of the precision issues you raised before > -- you can have two elements of the same ring with different > precision and hence presumably different hashes, which still compare > equal). Second, I can't even see technically how you would do that > without modifying python in some horrible way.
I was thinking manually, say if you wanted to store information relative to the roots of some polynomial and some were real and others were complex, or they were given to you with different precisions. --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
