This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: [C++] Should the complexity of std::list::size() be O(n) or O(1)?
- From: Jonathan Wakely <cow at compsoc dot man dot ac dot uk>
- To: Howard Hinnant <hhinnant at apple dot com>
- Cc: libstdc++ at gcc dot gnu dot org
- Date: Sat, 26 Nov 2005 17:48:51 +0000
- Subject: Re: [C++] Should the complexity of std::list::size() be O(n) or O(1)?
- References: <200511231141.jANBfaLn020308@mprc.mprc.pku.edu.cn> <20051125142833.GA20104@disaster.jaj.com> <24FDD7AE-00C0-48C1-A7DD-14E9AFCE900D@apple.com>
On Fri, Nov 25, 2005 at 01:17:42PM -0500, Howard Hinnant wrote:
> On Nov 25, 2005, at 9:28 AM, Phil Edwards wrote:
>
> >On Wed, Nov 23, 2005 at 07:42:35PM +0800, ?????? wrote:
> >>
> >>Is it a bug?
> >
> >This is a FAQ.
>
> I could not find it here:
>
> http://gcc.gnu.org/onlinedocs/libstdc++/faq/index.html
Good point! It's here:
http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#6
If noone beats me to it I'll link to it from the FAQ when my copyright
assignment is sorted out. It could be under the "things that only look
like bugs" FAQ (hint, hint, someone beat me to it ;-)
jon