search

martinus / unordered_dense

A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
MIT License
898 stars 72 forks source link

Add extract(key) and extract(it) API #105

Closed martinus closed 9 months ago

martinus commented 9 months ago

Similar to erase(), but the return value is the erased element, moved out. This has practically the same performance behavior as erase(), except for 2 additional moves. (once into a temporary variable), and then out.