-
Notifications
You must be signed in to change notification settings - Fork 13.4k
hashmap and mutable values and efficiency #2567
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
Comments
Here is a test case for the above
|
Yes I want to refactor the API so that it is based on a |
Ya, that works. |
Seems like this can be closed? @nikomatsakis , if you want to open an issue for your refactoring, please do :-) |
oli-obk
pushed a commit
to oli-obk/rust
that referenced
this issue
Sep 28, 2022
CI: use cargo sparse registry CI spends a few minutes downloading the index so this could help.
RalfJung
pushed a commit
to RalfJung/rust
that referenced
this issue
Oct 4, 2022
CI: use cargo sparse registry CI spends a few minutes downloading the index so this could help.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
As far as I can tell there is no way to efficiently use a hashmap with a mutable value. Consider a type like
How can new elements be efficiently added to the dvec?
The text was updated successfully, but these errors were encountered: