On Fri, Apr 12, 2013 at 7:17 AM, Nathan Ridge <zeratul976@hotmail.com> wrote:

In C++11, however, the complexity of std::list::size() is guaranteed
to be constant [1]. Therefore, I think it would be reasonable if in
C++11, Boost.Range provided a specialized version of size() for
std::list that forwarded to std::list::size(). This has not been
implemented yet. If you would like to see it implemented, please file
a Trac ticket. If no one objects to this addition, I will implement
it when I get a chance.

I definitely want to add versions of boost::size that support all of the standard containers and Boost.Containers where they the member size is O(1). I'm convinced this will be an improvement despite the remaining controversy. I believe that the inconvenience to container developers is minor relative to the frequent inconvenience to algorithm developers. If you get to implement this before me then great. The help is welcome.

Regards,
Nate

Thanks,

Neil Groves