Which hashing algorithm is best for uniqueness and speed? Example (good) uses include hash dictionaries. I know there are things like SHA-256 and such, but these algorithms are designed to be secure, which usually means they are slower than algorithms that are less unique. I want a hash algorithm designed to be fast, yet remain fairly unique to avoid collisions.
What this page is This page has a number of tables with the results of a test on several well-known hash functions. It accompanies this article. There's a summary at the bottom if you're just interested in seeing which function scores ‘best’ Longer explanation In a set of values that are uniformly distributed over the total output space, we can state that one half of the output values should have
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く