insert_unique_unchecked operation #293
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.
Sometimes a map is constructed when it is known that all keys are
unique (e. e. if keys are coming from another map or from a
sorted/deduplicated iterator). In this case we can make insertion
faster by skipping a check that a key already exists in the map.
insert_unique_unchecked
is guaranteed to be memory-safe, but doesnot guarantee anything beyond that: if inserted key is not unique,
HashMap
can panic, loop forever, return incorrect entry etc.Added simple benchmark.
insert_unique_unchecked
is about 30%faster than
insert
. Your mileage may vary of course.Similar PR was
added to
indexmap
crateand they asked to discuss the name of the operation with
hashbrown
crate owners to come to the same naming convention (if
hashbrown
is willing to have the same operation).