Subject: Re: [boost] new proposal: order statistics tree (Szymon Wojciechowski)
From: Leo Goodstadt (leo.goodstadt_at_[hidden])
Date: 2013-01-07 07:37:11
> On Fri, Jan 04, 2013; 4:33am, "Rahul Sr" <srivasrrahul_at_[hidden]> wrote:
> > On Wed, Jan 2, 2013 at 3:46 PM, Szymon Wojciechowski wrote:
> > Briefly, it is container which allows logarithmic inserting, searching
> > erasing as in set, but additionally it permits to access elements via
> > numerical value - key order.
> Will it be like this?
The libstdc++ policy based data structure (pb_ds) order statistic tree only
has "set" behaviour. It takes a certain amount of extra work to use it as a
replacement for multiset and multimap. They recommend using a set (tree) of
lists to use pb_ds::tree like a multiset. However, this obviously doesn't
work for order_statistic tree: each of the duplicates is only counted once
(each list of duplicates is a single element in the tree).
Does your order statistic tree allow duplicates?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk