New issue
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
Apply the setobject optimizations to dictionaries #63098
Comments
Once http://bugs.python.org/issue18835 is resolved, I would like to see the various set optimizations applied to dictionaries as well:
Collectively, these optimizations can substantially improve dictionary performance. |
+1 This is worth trying. |
I'm still interested in seeing benchmarks that show where this actually improves things and by how much. Also, whether any regressions occur and how serious they are. |
noincref.diff doesn't contain all necessary changes. For example dummy is increfed in dict_pop() and dict_popitem() and may be decrefed at insert. As in sets we can got rid of few comparisons with dummy if set dummy hashes to -1. |
Hi, what's the status of this issue? Is anyone working one it? |
In the present environment, I feel like advancing this work would be an uphill battle and that much of my time investment would be wasted unnecessarily. That's too bad, because significant r&d time has already been invested and it has had nice payoffs with set objects. |
Note: these values reflect the state of the issue at the time it was migrated and might not reflect the current state.
Show more details
GitHub fields:
bugs.python.org fields:
The text was updated successfully, but these errors were encountered: