On 7/20/07, Andrew Sutton <[EMAIL PROTECTED]> wrote:
> Having an "Official" Boost reference document for the standard library
> would be great. Assuming it'd be in quickbook or similar, it might
> even be turnable into a treeware version.
>
> It's nowhere near everything that's needed, but I can offer under some
> appropriate license some articles I've been writing that might make an
> acceptable starting point:
> http://gpwiki.org/index.php/C_plus_plus:Modern_C_plus_plus
This is more tutorial-style documentation - which isn't really my
priority at the moment. Also - this will sound condescending - I am
continually unimpressed by the software quality in the gaming
industry so I'm a little reluctant to borrow examples from the
domain. Not to say that there isn't some good stuff (or good people)
out there, but I don't see many shining examples coming from the domain.
> P.S. Isn't list's size only O(n), since some implementations make
> it theta(1)?
I'm not sure if there are any implementations that implement it in
theta(1) - somebody would have to check individual implementations.
My gut feeling is that list.size() is generally theta(n) everywhere
so that list.splice() can be theta(1). I could very well be wrong.
According to sgi.com, the STL has complexity guarantees in the specification
<http://www.sgi.com/tech/stl/complexity.html>
So I think we should use these.
Jake
P.S. Sorry, Matias, for not continuing the discussion on the blog, but I
didn't want to have two branches of the same conversation. We can post a
summary of the decisions reached later.
-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2005.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
Boost-docs mailing list
[email protected]
Unsubscribe and other administrative requests:
https://lists.sourceforge.net/lists/listinfo/boost-docs
