Re: [Rd] dict package: dictionary data structure for R

From: Henrik Bengtsson <hb_at_stat.berkeley.edu>
Date: Tue, 24 Jul 2007 18:58:04 +0200

On 7/23/07, Seth Falcon <sfalcon_at_fhcrc.org> wrote:
> Bill Dunlap <bill@insightful.com> 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_at_r-project.org mailing list
> https://stat.ethz.ch/mailman/listinfo/r-devel
>



R-devel_at_r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-devel Received on Tue 24 Jul 2007 - 17:00:50 GMT

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.2.0, at Tue 24 Jul 2007 - 18:37:02 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-devel. Please read the posting guide before posting to the list.