gpt4 book ai didi

c++ - 如何计算unordered_set c++中的冲突

转载 作者:行者123 更新时间:2023-12-01 13:40:40 28 4
gpt4 key购买 nike

这个问题在这里已经有了答案:





How to identify whether or not std::unordered_map has experienced hash collisions?

(1 个回答)


去年关闭。




我想计算一些关于我的哈希函数的统计数据(比如最大/平均碰撞量)。我编写了虚拟散列函数(将所有键映射到 1)并等待查看等于键数量的最大/平均冲突数。但是我对不同的功能有相同的数字。有人可以解释一下吗?
代码:

#include <iostream>
#include <unordered_set>

struct DummyHash
{
size_t operator()(int key) const
{
return static_cast<size_t>(1);
}
};

int main()
{
std::unordered_set<int, DummyHash> a;
std::unordered_set<int> b;
int c = 10000;

for (int i = 0; i < c; i++)
{
a.insert(i);
}
std::cout << "a ended" << std::endl;

for (int i = 0; i < c; i++)
{
b.insert(i);
}

std::cout << "b ended" << std::endl;

std::cout << "a = " << a.max_load_factor() << ' ' << a.load_factor() << ' '
<< a.max_size() << ' ' << a.max_bucket_count() << ' ' << a.bucket_count() << '\n';
std::cout << "b = " << b.max_load_factor() << ' ' << b.load_factor() << ' '
<< b.max_size() << ' ' << b.max_bucket_count() << ' ' << b.bucket_count() << '\n';
return 0;
}

结果:
a ended
b ended
a = 1 0.659065 768614336404564650 768614336404564650 15173
b = 1 0.659065 1152921504606846975 1152921504606846975 15173

最佳答案

您使用的函数不提供碰撞计数,您可能想阅读有关 https://en.cppreference.com/w/cpp/container/unordered_set 的文档。

计算桶碰撞统计信息的一种方法是检查每个桶中的元素数量:

struct BucketStats {
size_t occupied = 0;
size_t total_collisions = 0;
size_t max_collisions = 0;

template<class... Args>
BucketStats(std::unordered_set<Args...> const& c)
{
for(auto bucket = c.bucket_count(); bucket--;) {
auto bucket_size = c.bucket_size(bucket);
occupied += bucket_size > 0;
if(bucket_size > 1) {
auto collisions = bucket_size - 1;
total_collisions += collisions;
max_collisions = std::max(max_collisions, collisions);
}
}
}

double avg_collisions() const {
return occupied ? static_cast<double>(total_collisions) / occupied : 0;
}

friend std::ostream& operator<<(std::ostream& s, BucketStats const& b) {
return s
<< "used buckets: " << b.occupied
<< "; total collisions: " << b.total_collisions
<< "; max collisions in a bucket: " << b.max_collisions
<< "; avg collisions per bucket: " << b.avg_collisions()
;
}
};

// ...

std::cout << BucketStats(a) << '\n';
std::cout << BucketStats(b) << '\n';

输出:
used buckets: 1; total collisions: 9999; max collisions in a bucket: 9999; avg collisions per bucket: 9999
used buckets: 10000; total collisions: 0; max collisions in a bucket: 0; avg collisions per bucket: 0

关于c++ - 如何计算unordered_set c++中的冲突,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/60413490/

28 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com