Re: [boost] bounded multiset

From: David Abrahams (dave_at_[hidden])
Date: 2003-01-05 09:00:30

Vladimir Prus <ghost_at_[hidden]> writes:

> 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.

If you don't really need iterator stability, and pointer/reference
stability works instead, you might use a bounded heap of pointers to
items stored in a deque.

-- 
                       David Abrahams
   dave_at_[hidden] * http://www.boost-consulting.com
Boost support, enhancements, training, and commercial distribution