tag/Pool: use a power-of-2 hash table size

This is simpler to calculate and the advantage of using a prime is
negligible anyway.
This commit is contained in:
Max Kellermann 2023-09-11 21:22:54 +02:00
parent c8dc1e0665
commit 75aa08ed6b

View File

@ -77,7 +77,7 @@ TagPoolItem::Create(TagType type,
value); value);
} }
static IntrusiveHashSet<TagPoolItem, 16127, static IntrusiveHashSet<TagPoolItem, 16384,
IntrusiveHashSetOperators<TagPoolKey::Hash, IntrusiveHashSetOperators<TagPoolKey::Hash,
std::equal_to<TagPoolKey>, std::equal_to<TagPoolKey>,
TagPoolItem::GetKey>, TagPoolItem::GetKey>,