I have a lot of issues with this blog post: - Compiler, c++ library, compilation options, and platform are missing - The author doesn't benchmark vector and u

I have a lot of issues with this blog post: - Compiler, c++ library, compilation options, and platform are missing - The author doesn't benchmark vector and unordered_map insertions with reserve() - If I read correctly, the author benchmarks up to 32,768 items. This is way too low. There should be tests with millions of entries. - Random string/numbers isn't a realistic scenario and very favourable to unordered_map. I would use data from real life examples, e.g. list of cities, list of people, etc. - Ordered arrays are missing from the benchmark (e.g. boost::container::flat_set), it's a very powerful data structure. Why just do a sorted vector at the end? - Vector outperforms unordered_set probably because of the hashing function used.