What’s wrong with STL?
Often cited example is `std::unordered_map`, whose spec necessitates an implementation using separate chaining (or similar). Depending on the use case, in high performance applications, a different implementation can be much faster.
Although I don't understand why some people hate all of STL so much. Like sure, use your custom hash map, makes sense. But is anyone really replacing basics like `std::find` or `std::sort`?
I work isolated. I didn’t learn about STL until years later,
Case in point when using a std::deque with MS STL it's not really efficient because it has a very small buffer size, so it pretty much degrades into a linked list if the element is big enough. See: https://devblogs.microsoft.com/oldnewthing/20230810-00/?p=10...
Then there's the case of std::unordered_map which has been benchmarked recently, and for all the flak that boost gets I am considering using it for its hash map. https://jacksonallan.github.io/c_cpp_hash_tables_benchmark/