Subject: Re: [boost] [stl_ext_adv] ] Interest in advanced data structures
From: Vadim Stadnik (vadimstdk_at_[hidden])
Date: 2011-11-30 07:30:16
On Wed, Nov 30, 2011 at 10:17 PM, Thijs (M.A.) van den Berg <thijs_at_[hidden]
> > On Wed, Nov 30, 2011 at 9:06 PM, Thijs (M.A.) van den Berg
> > <thijs_at_[hidden]>wrote:
> Thank Vadim. For certain applications your container clearly outperforms
> other. The hierarchical accumulation is particularly interesting if you
> need to calculate many more accumulations than you need to do inserts.
> To get a better view of both pros and potential cons, can you also add a
> comparison for *push_back inserts* (like you did in the multiset) in a
> std::vector besides the worst case 'before the middle'?
> An interesting project!
> Thank you again for useful comments.
I will add the comparison of push_back() performance in standard sequences
(std::list and std::vector) and new sequences that are supported by two
types of augmented B+ trees in this project.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk