On 7/23/07, Seth Falcon <[EMAIL PROTECTED]> wrote: > Bill Dunlap <[EMAIL PROTECTED]> writes: > > With environments, if you use a prime number for the size > > you get considerably better results. E.g., > > > Perhaps new.env() should push the requested size up > > to the next prime by default. > > Perhaps. I think we should also investigate other hashing functions > since computing the next prime and doing so for resizes will take > longer than not having to do it and it will add complexity to the > code.
An alternative is to hard-wiring primes within a reasonable range: http://primes.utm.edu/lists/small/millions/ http://www.math.utah.edu/~pa/math/p10000.html Maybe primes close to 2^n are good enough for this problem: http://primes.utm.edu/lists/2small/ Just my $.02 /Henrik > > + seth > > -- > Seth Falcon | Computational Biology | Fred Hutchinson Cancer Research Center > http://bioconductor.org > > ______________________________________________ > R-devel@r-project.org mailing list > https://stat.ethz.ch/mailman/listinfo/r-devel > ______________________________________________ R-devel@r-project.org mailing list https://stat.ethz.ch/mailman/listinfo/r-devel
