On Thu, 08 Jan 2009 01:08:12 +0100, Michael Neumann wrote: > Am 06.01.2009 00:48, schrieb Simon 'corecode' Schubert: > > > > I'd like to see a non-ugly template implementation that can be used > > like our current queue.h/tree.h macros. I don't like C++, but I'd be > > positively surprised it this could be solved elegantly. > > Hm, it's very hard to accomplish exactly the same as our queue.h macros. > It's easy to implement a regular list (or in general any regular data > structure). But it's harder when it's embedded in the struct itself. >
Take a look at Boost.Intrusive http://www.boost.org/doc/libs/1_37_0/doc/html/intrusive.html
