Re: [boost] [flat_map] Any interest in a flat_map variant that is much faster on insertion/erase at the price of a slower lookup?

Subject: Re: [boost] [flat_map] Any interest in a flat_map variant that is much faster on insertion/erase at the price of a slower lookup?
From: Giacomo Drago (giacomo_at_[hidden])
Date: 2015-03-13 11:55:06

On 2015-03-13 13:00, Marcelo Zimbres wrote:
> "Hi
> Would it be easy for you to provide benchmarks of std::map with
> boost::container::node_allocator available in latest boost release?
> According to my own benchmarks it can improve performance a lot,
> mainly when memory is likely to be fragmented.

Of course, I will do it ASAP.

Best
Giacomo