smoke: robin hood hashtables

bespoke: semiperfect hashtables with SHA256 keys

in principle, with a semiperfect hash function, it should be possible to handle collisions simply by expanding the table until the two entries no longer fall on the same slot

Sign in to participate in the conversation
Gamedev Mastodon

Mastodon server focused on game development and related topics.