Subject: Re: [boost] new proposal: order statistics tree
From: Szymon Wojciechowski (sw10_at_[hidden])
Date: 2013-01-07 15:57:47
"Gottlob Frege" <gottlobfrege_at_[hidden]> pisze:
> On Wed, Jan 2, 2013 at 4:46 PM, Szymon Wojciechowski wrote:
> > Hi,
> > 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?
> > Best regards,
> > Szymon Wojciechowski
> This should be compared against using boost multi-index. I suspect it has
> significant differences, but might still be enlightening.
Could you explain to me, what do you mean, please?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk