From: Jens Maurer (Jens.Maurer_at_[hidden])
Date: 2001-01-07 16:58:05
Just to make David's remark more explicit:
deansturtevant_at_[hidden] wrote:
> since what I wanted was a data structure which efficiently
> supported the following operations on a container of elements with a
> comparison defined:
std::set
> insert
insert
> minimum
begin()
> maximum
rbegin()
> remove_minimum
erase(begin())
> remove_maximum
erase(rbegin().base())
> empty
empty()
> count
size()
Jens Maurer