ZeroTriePerfectHash: Increase bounds of p for newly found hard case #4888
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
I ran into this when experimenting with blob3 (#2699).
This might break the serialization form in the theoretical case (which I haven't seen) where
pexceedsP_FAST_MAX, since the size ofpdetermines whether the PHF uses the "fast" or "slow" algorithm. In all my cases I don't have data ofpever exceedingP_FAST_MAX, but it is possible that it could have occurred. I have changed the code now to remove the special case forpso that we can add it back again in the future if we discover a case that needs it.