"Robert W. Cunningham" wrote:
> The range of N is important! Will it be 5 or 5,000,000? There are some
> bit-twiddling hash algorithms that work well for 1K entries that generate too
> much overhead by the time you reach 10K, and are useless at 100K.
I'm writing up a doc complete with graphics on the issues,
and proposing an implementation.
When I'm done with the doc, have a look at it. It should
explain what you need to form an appropriate strategy. There
are some other issues and design goals which will dictate
some things about the hashing strategy. I'll outline them.
-Kevin
--
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
Kevin Lawton [EMAIL PROTECTED]
MandrakeSoft, Inc. Plex86 developer
http://www.linux-mandrake.com/ http://www.plex86.org/
