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

Phil Endecott wrote:

I think we discussed this before. My preferred approach is

flat_set S; { flat_set::batch b(S); b.insert(xxx); b.insert(yyy); } // b's dtor does the merge

What do you do when b.insert(yyy) throws?