WIP faster hash building #6
Draft
Conversation
This file contains hidden or 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
byroot
reviewed
Apr 10, 2023
| hash_buffer_idx--; | ||
| } | ||
|
|
||
| VALUE hash = rb_hash_new_capa(hash_buffer_idx / 2); |
There was a problem hiding this comment.
I added rb_hash_new_capa in 3.2, we'd likely need a fallback for older rubies.
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.
WIP
It's faster to buffer items in a (C) array before creating a hash from them. Partly because this avoids the cost in Ruby of building a
ar_tablebefore it is converted to anst_tableonce the hash goes beyond 8 elements.I don't believe this has been tested sufficiently yet.