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?

El 13/03/2015 a las 8:51, Giacomo Drago escribió:

Hi

My library is not ready for a formal review process, and I'd like to ask whether there is some potential interest first, thus saving everybody a lot of time.

I have been working on a flat_map (http://www.boost.org/doc/libs/1_57_0/doc/html/boost/container/flat_map.html) variant that keeps some of the distinctive features of the original one (contiguous storage/cache friendliness, zero memory overhead/shrink_to_fit support, vector-based representation, etc...) but makes insertion and erasure of the elements much faster, at the price of a slower lookup and in-order traversal.

Just a question. Are your insertions one by one or by range? Best, Ion