One interesting variation on double-hashing collision resolution is Robin Hood hashing. The idea is that a new key may displace a key already inserted, if its probe count is larger than that of the key at the current position. The net effect of this is that it reduces worst case search times in the table. This is similar to ordered hash tables exc...
Found on
http://en.wikipedia.org/wiki/Hash_table
An object that maps more-or-less arbitrary keys to values. Dictionaries are the most visible and widely used objects that exhibit this behavior.
Found on
https://wiki.python.org/moin/PythonGlossary
No exact match found.
