mirrors/yosys
3
0
Fork 0
mirror of https://github.com/YosysHQ/yosys synced 2025-08-22 11:07:52 +00:00
Code Activity

hashlib: extend unit test with subset collisions, shorten runtime

Browse source
This commit is contained in:
Emil J. Tywoniak 2025-08-19 16:35:34 +02:00
parent 3a5742ffd2
commit 01de9fb453
1 changed files with 25 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

28
tests/unit/kernel/hashTest.cc
View file

@ -27,8 +27,8 @@ TEST(PoolHashTest, collisions)
{ {
uint64_t collisions = 0; uint64_t collisions = 0;
std::unordered_set<Hasher::hash_t> hashes; std::unordered_set<Hasher::hash_t> hashes;
for (int i = 0; i < 10000; ++i) { for (int i = 0; i < 1000; ++i) {
for (int j = i + 1; j < 10000; ++j) { for (int j = i + 1; j < 1000; ++j) {
pool<int> p1; pool<int> p1;
p1.insert(i); p1.insert(i);
p1.insert(j); p1.insert(j);
@ -39,7 +39,29 @@ TEST(PoolHashTest, collisions)
} }
} }
std::cout << "pool<int> collisions: " << collisions << std::endl; std::cout << "pool<int> collisions: " << collisions << std::endl;
EXPECT_LT(collisions, 1000000); EXPECT_LT(collisions, 10'000);
}
TEST(PoolHashTest, subset_collisions)
{
uint64_t collisions = 0;
std::unordered_set<Hasher::hash_t> hashes;
for (int i = 0; i < 1000 * 1000; ++i) {
pool<int> p1;
for (int b = 0; i >> b; ++b) {
if ((i >> b) & 1) {
p1.insert(b);
}
}
auto h = p1.hash_into(Hasher()).yield();
if (!hashes.insert(h).second) {
++collisions;
}
}
std::cout << "pool<int> subset collisions: " << collisions << std::endl;
EXPECT_LT(collisions, 100);
} }
YOSYS_NAMESPACE_END YOSYS_NAMESPACE_END