On Tue, Jan 21, 2025 at 9:08 AM Joaquin M López Muñoz via Boost < boost@lists.boost.org> wrote:
El 20/01/2025 a las 22:48, Ivan Matek via Boost escribió:
As for Unordered: My history knowledge is bad, but was not Unordered the library that originally inspired C++11 unordered_map? *First Release 1.36.0*
No, Boost.Unordered first appeared in 2008, whereas the seminal paper for C++ unordered associative containers is from 2003:
https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1456.html
Are you talking about speed compared to antique Google hash map implementations like google::dense_hash_map and google::sparse_hash_map?
No, as compared to the latest Abseil flat_hash_map. You can find some benchmarks here:
https://www.boost.org/doc/libs/1_87_0/libs/unordered/doc/html/unordered.html... https://jacksonallan.github.io/c_cpp_hash_tables_benchmark/
Joaquin M Lopez Munoz
Thank you for correcting me. I remembered many boost libraries got merged into C++11 and that probably caused me to mix up this. For interested in history here is a list of libaries that made it into C++11 https://bannalia.blogspot.com/2024/05/wg21-boost-and-ways-of-standardization...