We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Hi,
The readme says that:
When an insert collides, the insert steps through the table using the reprobe stride until a free or dead entry is found.
But reading the code is my understanding correct that deleted entries are only reused if a free slot is not found? If so, I am curious why.
The text was updated successfully, but these errors were encountered:
I think I understand it now, the chain has to be followed until the end, as there could be an entry after a deleted one that matches the key.
Sorry, something went wrong.
No branches or pull requests
Hi,
The readme says that:
But reading the code is my understanding correct that deleted entries are only reused if a free slot is not found?
If so, I am curious why.
The text was updated successfully, but these errors were encountered: