Subject: Re: [boost] new proposal: order statistics tree
From: Szymon Wojciechowski (sw10_at_[hidden])
Date: 2013-01-04 16:39:24
"Rene Rivera" <grafikrobot_at_[hidden]> pisze:
> On Wed, Jan 2, 2013 at 3:46 PM, Szymon Wojciechowski wrote:
> > I would like to propose to add new data structure - order statistics tree.
> > Briefly, it is container which allows logarithmic inserting, searching and
> > erasing as in set, but additionally it permits to access elements via
> > numerical value - key order. I have some ready implementation with all
> > appropriate functions (without their all overloaded forms) with gtest
> > regression list, but the code isn't boostified. The regression passes on
> > gcc 4.6.3 and vs2010.
> > Is there anybody interested in?
> How does it compare to <
> and the half dozen other augmented tree implementations that have appeared
> in the Boost list? (one as recent as last year).
It is exactly, what you have shown in the article. However, is this implementation available somewhere? Generally, I can't find any implementation of this kind of tree except that from Rahul's links.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk