From: John Maddock (john_at_[hidden])
Date: 2008-03-17 08:27:16
Marcin Kalicinski wrote:
>> I just remembered this: I think you can make a very well performing
>> linked list using Boost.Intrusive which basically allows you to store
>> the nodes in a vector:
>> AFAICT, this will almost completely remove dynamic allocations,
>> exceptio for growing the vector (a deque might be more appropriate).
> Yes, I thought about it. That was pretty much what I meant when I
> said "custom list implementation".
> But at them moment I think I should skip all further optimization
> efforts and concentrate on getting it into releasable state. This
> means getting some sort of docs pipeline in place. I'll give
> Quickbook another try.
Once you have the toolchain working, it's actually lovely to use:
unfortunately it's the bits we don't maintain like the docbook stylesheets
and XSLT processors that tend to give the most hassle in setting up :-(
If you run into any problems then post a message on the boost-docs list and
someone will try to help I'm sure.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk