问题描述
我需要将原始键(int，可能是 long)映射到高性能哈希映射数据结构中的结构值.
I need to map primitive keys (int, maybe long) to struct values in a high-performance hash map data structure.
我的程序将有几百个这样的地图，每个地图通常最多有几千个条目.但是，地图会不断刷新"或搅动"；想象一下每秒处理数百万条 add 和 delete 消息.
My program will have a few hundred of these maps, and each map will generally have at most a few thousand entries. However, the maps will be "refreshing" or "churning" constantly; imagine processing millions of add and delete messages a second.
C 或 C++ 中的哪些库具有适合此用例的数据结构?或者，您会如何建议自己构建?谢谢！
What libraries in C or C++ have a data structure that fits this use case? Or, how would you recommend building your own? Thanks!
推荐答案
我建议你试试 Google SparseHash(或 C11 版本 Google SparseHash-c11)，看看它是否适合您的需求.它们具有内存高效的实现以及针对速度进行优化的实现.我很久以前做过一个基准测试，就速度而言，它是最好的哈希表实现(但也有缺点).
I would recommend you to try Google SparseHash (or the C11 version Google SparseHash-c11) and see if it suits your needs. They have a memory efficient implementation as well as one optimized for speed. I did a benchmark a long time ago, it was the best hashtable implementation available in terms of speed (however with drawbacks).
这篇关于超高性能C/C++哈希图(表、字典)的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持编程学习网！