I was trying to replace the standard unordered_map in my code with the boost implementation, but I ran into an instability that caused my test to crash.
I was able to find minimal reproduction steps. Notice that by replacing the boost::unordered_map with std::unordered_map at the start, the program succeeds.
I couldn't find any documentation about this, but I was under the impression that Boost's unordered map is a drop-in replacement for the std one.
I was trying to replace the standard unordered_map in my code with the boost implementation, but I ran into an instability that caused my test to crash.
I was able to find minimal reproduction steps. Notice that by replacing the
boost::unordered_map
withstd::unordered_map
at the start, the program succeeds.I couldn't find any documentation about this, but I was under the impression that Boost's unordered map is a drop-in replacement for the std one.