We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
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
1.Very similar to #23
hash.remove('Jonathan') hash.remove('Jamie')
As the position Jonathan being undefined, Jamie cannot be removed.
2.There is an endless loop in testcase 08-UsingHashCollisionLinearProbing.js
08-UsingHashCollisionLinearProbing.js
hashLinearProbing.remove('Gandalf'); hashLinearProbing.get('Gandalf')
The position of Gandalf was undefined, but the loop will continue till find Gandalf.
The text was updated successfully, but these errors were encountered:
Thanks! I'll take a look and get back to you. I need to rewrite this algorithm with a cache approach.
Sorry, something went wrong.
Hi, Added 2 versions of this algorithm with the fixes:
Also added some tests with Mocha to make sure different scenarios were covered:
chapter 07: [Dictionaries and Hashes]
5ec1287
No branches or pull requests
1.Very similar to #23
As the position Jonathan being undefined, Jamie cannot be removed.
2.There is an endless loop in testcase
08-UsingHashCollisionLinearProbing.js
The position of Gandalf was undefined, but the loop will continue till find Gandalf.
The text was updated successfully, but these errors were encountered: