Re: [boost] Questions about incorporating my library into a new library within Boost

On 25.07.22 05:45, Jooseong Lee via Boost wrote:

I recently wrote a general-purpose STL-like ordered associative B-Tree based container in C++. . Its API and usage is very similar to std::set, std::map, std::multiset, std::multimap, and when the number of elements is relatively large, my benchmark shows that it is 2.5~3 times faster than std::set and its friends.

I've pretty much stopped using std::set and co. What I do use is boost::unordered_map when order doesn't matter and boost::flat_map (from Boost.Container) when it does. How does your container compare to these, performance-wise? -- Rainer Deyke (rainerd@eldwood.com)