David Abrahams wrote:
Vladimir Prus <[EMAIL PROTECTED]> 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 writi
Vladimir Prus <[EMAIL PROTECTED]> 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 w
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 star
