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 _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
