C++ Educational Content Creator | 20 years of Software Engineering experience distilled into digestible daily posts
The standard library provides two unordered containers: std::unordered_map and std::unordered_set (and their multi_ variants that allow multiple instances of the same key). These containers provide average O(1) complexity for find, insert and erase operations. Both containers are node-based, typically providing worse performance than 3rd party flat-hash-map implementations. Compiler Explorer link: https://lnkd.in/emZErMUM #cpp #cplusplus #coding #programming #dailybiteofcpp
Any possibility of flat (map, hashmap) in upcoming standards (23, 26..)?
It could be O(N) if there is a collision in the hash right?
Šimon Tóth any recommendation for the 3rd party flat hash maps? Boost, any other?