A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://mail.python.org/pipermail/python-dev/2012-January/115810.html below:

[Python-Dev] Counting collisions for the win

[Python-Dev] Counting collisions for the win [Python-Dev] Counting collisions for the winStephen J. Turnbull stephen at xemacs.org
Mon Jan 23 07:15:54 CET 2012
Lennart Regebro writes:
 > On Mon, Jan 23, 2012 at 06:02, Paul McMillan <paul at mcmillan.ws> wrote:
 > >> We may use a different salt per dictionary.
 > >
 > > If we're willing to re-hash everything on a per-dictionary basis. That
 > > doesn't seem reasonable given our existing usage.
 > 
 > Well, if we get crazy amounts of collisions, re-hashing with a new
 > salt to get rid of those collisions seems quite reasonable to me...

But doesn't the whole idea of a hash table fall flat on its face if
you need to worry about crazy amounts of collisions (outside of
deliberate attacks)?

More information about the Python-Dev mailing list

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4