[EMAIL PROTECTED] wrote: > I just realized that of course the hash is not always going to be > unique, so this wouldn't really work. And it seems a hash table would > still need to store the keys (as strings) so that string comparisons > can be done when a collision occurs.
btw, Python's dictionary type *is* a highly-optimized implementation of a "traditional hash table". </F> -- http://mail.python.org/mailman/listinfo/python-list
