Comment by layoutIfNeeded
6 years ago
Yep, also the insertion procedure is retried with increasingly larger arrays until no “collisions” are encountered.
Reminds me of minimal perfect hash construction.
6 years ago
Yep, also the insertion procedure is retried with increasingly larger arrays until no “collisions” are encountered.
Reminds me of minimal perfect hash construction.
Yes, the underlying theory is from a minimal perfect hash function called "BDZ": http://cmph.sourceforge.net/bdz.html . Yes, sometimes a retry is needed, but the array is not made larger; it just retries with a different seed.