具有 32 位整数的低冲突率的快速字符串散列算法

问题描述

我有很多不相关的命名事物，我想对其进行快速搜索.土豚"在任何地方都是土豚"，因此散列字符串并重用整数可以很好地加速比较.整个名称集是未知的(并且随着时间的推移而变化).什么是快速字符串散列算法，它会生成小的(32 或 16)位值并具有低冲突率?

I have lots of unrelated named things that I'd like to do quick searches against. An "aardvark" is always an "aardvark" everywhere, so hashing the string and reusing the integer would work well to speed up comparisons. The entire set of names is unknown (and changes over time). What is a fast string hashing algorithm that will generate small (32 or 16) bit values and have a low collision rate?

我希望看到特定于 C/C++ 的优化实现.

I'd like to see an optimized implementation specific to C/C++.

推荐答案

FNV 变体之一 应该满足您的要求.它们速度很快，并产生相当均匀分布的输出.

One of the FNV variants should meet your requirements. They're fast, and produce fairly evenly distributed outputs.

这篇关于具有 32 位整数的低冲突率的快速字符串散列算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持跟版网！