Sergio Dominguez wrote:
> I am developing an accounting app on linux that does extensive
> memory searchs ( about 3 000 000 searchs over a 1000 registers
> table ) so I want to do things a lil bit faster.
>
> Any URL, any advice?
There is no such thing as a perfect hash. Some are better than
others, but only in specific cases. Usually the best way to go
is to invent your own and refine it as necessary.
For large amounts of data you likely don't want a hash, as they
are only really effective on sparse tables (preferably under 50%
occupancy). You might consider a sorted or balanced tree
structure instead.
--
Andrew E. Mileski - Software Engineer
Rebel.com http://www.rebel.com/
--
To unsubscribe:
mail -s unsubscribe [EMAIL PROTECTED] < /dev/null
