Subject: Re: [boost] Query of Interest in annotated tree extensions to Boost.Intrusive
From: Ion Gaztañaga (igaztanaga_at_[hidden])
Date: 2013-01-18 16:22:11
El 18/01/2013 20:27, Vadim Stadnik escribió:
> Unlike, basic data structures, the augmented data structures can
> efficiently support both copy and move semantics.
> This is why I also wonder why Boost.Intrusive only?
Maybe because Boost.Intrusive algorithms don't require a concrete
data-structure, so anyone could write its own container (even
multi-index one) using Boost.Intrusive utilities.
As Boost.Container is based on Boost.Intrusive creating non-intrusive
augmented trees would be quite easy.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk