Subject: Re: [boost] [stl_ext_adv] ] Interest in advanced data structures
From: Vadim Stadnik (vadimstdk_at_[hidden])
Date: 2011-12-03 16:57:14
On Sat, Dec 3, 2011 at 11:25 PM, Joaquin M Lopez Munoz <joaquin_at_[hidden]>wrote:
> My conclusions:
> 1. Augmented data structures (of which efficient indexing
> is just a particular application) are definitely useful and
> worth having in Boost.
> 2. Unless proved otherwise, we should be using RB trees
> (or maybe AVL) rather than B+ trees.
> 3. Depending on the particular needs, some usage scenarios
> can be better served with Boost.MultiIndex (note I'm
> saying "depending on needs", since differences between
> approaches are substantial.)
> 4 To me, rather than providing out of the box containers with
> augmenting we should provide this via two libraries:
> - As an additional capability of Boost.Intrusive associative
> containers (and AVL-tree based containers as well, if
> technically possible.)
> - As an additional capability of Boost.MultiIndex ordered
> Hope this helps,
> Joaquín M López Muñoz
> Telefónica Digital
Thank you very much,
I really appreciate your deep analysis.
Since you asked to add more performance measurements my detailed reply to
all your comments will be a bit delayed.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk