[boost] bounded multiset

From: Vladimir Prus (ghost_at_[hidden])
Date: 2003-01-05 08:32:57

I'm in a need of a container, which:

- is sorted
- has iterators which are not invalidated on
   'insert'
- keeps no more than k elements. If more elements are
   inserted, the smallest ones should be erased.

I'm considering writing a wrapper over std::multiset for this purpose.
But before I start, I wanted to ask if anybody knows existing solution.

TIA,
Volodya