[Boost-users] Flat multi set operation costs

Dear list, In a project of mine I am using a sorted vector as a multimap. The point was that insert, delete and retrieval operations arrived in batches (lots of inserts, lots of retrieval, lots of deletes...) so I essentially saved time sorting the vector when a new kind of operation arrived. I recently noticed boost has the flat multiset implementation, so I was wondering do it follows the same idea? If it does I would be nice to kick-out some code and use the library for ease of maintenance. Your faithfully, Paolo