So, I've got a hash-table whose resizing does not depend on the load factor, but on how crappy the insertion probe goes. It has a capacity of 2^n and a cellar of size n. It resizes on a probe that reaches n steps, meaning that probes never need to wrap-around.
This also means that in the worst possible case I'm always hitting the last slot and probing off the end of the table into the cellar, with the worst load factor of n / 2^n.
Avatar by @u
Flipping bits for a living. Lived all over, currently in Amsterdam. Your license better be copyleft. ML (no, the other kind).
"Time for a little anarchy."
This Mastodon instance is for people interested in technology. Discussions aren't limited to technology, because tech folks shouldn't be limited to technology either! We adhere to an adapted version of the TootCat Code of Conduct and have documented a list of blocked instances. Ash is the admin and is supported by Fuzzface, Brian!, and Daniel Glus as moderators. Hosting costs are largely covered by our generous supporters on Patreon – thanks for all the help!