Fix asymptotic hashing performance #164
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The previous implementation took a single 64-bit hash and split it into 3 21-bit components.
This implementation takes 2 64-bit hashes and splits them into 3 32-bit values, discarding the upper 32 bits on the second hash. For comparison
I didn't use the test data from #132 as I didn't want to include such a large file in the repo; still, this seems to demonstrate a significant reduction in asymptotic behavior with the algorithm.