3 ms·
[Ordered] Minimal Perfect Hash Functions with O(N) construction time. They have been around for 30 years and I don't see them used in practice.
by icsa 4y ago
[Ordered] Minimal Perfect Hash Functions with O(N) construction time.
They have been around for 30 years and I don't see them used in practice.
- HelloNurse 4y agoFixed key sets are uncommon.
- icsa 4y agoMany assets associated with a program or system are fixed/readonly/constant data. Slowly changing key sets can also take advantage of Minimal Perfect Hashing.