|
Boost : |
Subject: Re: [boost] [review] Heaps: size and stability
From: Tim Blechmann (tim_at_[hidden])
Date: 2011-06-02 13:30:31
> > Not strictly true. Even though the requirement is specified for the
> > general container requirements, it's possible for a container to remove
> > that requirement. As "forward_list" does, by removing the "size()"
> > member function.
>
> Ah. Thank you for the clarification.
>
> This makes me wonder how important size() actually is for heaps. Most
> of the algorithms I've seen simply use empty().
if you use priority queues in a scheduler to run different jobs by their
priority, it may be interesting to inform the user, how many jobs are left ...
tim
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk