Trial and error - how else? :)

I believe finding a perfect hash function for
every kind and combination of data is a very
very time consuming operation. Also there is
the common case where the data is online
(ie: stateless) that said it doesn't mean you
can't make assumptions about the kind of data.



Arash Partow
________________________________________________________
Be one who knows what they don't know,
Instead of being one who knows not what they don't know,
Thinking they know everything about all things.
http://www.partow.net


Paul Rubin wrote:
> "Arash Partow" <[EMAIL PROTECTED]> writes:
> > For different data types different hash functions work
> > better/worse aka fewer or more collisions.
>
> But you give no indication of which of those hashes works best for
> what kind of data.  How is the user supposed to figure out which one
> to choose?

-- 
http://mail.python.org/mailman/listinfo/python-list

Reply via email to