From: Marcin Kalicinski (kalita_at_[hidden])
Date: 2008-03-14 10:49:50
> 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
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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk