Boost logo

Boost :

Subject: Re: [boost] new proposal: order statistics tree
From: Rene Rivera (grafikrobot_at_[hidden])
Date: 2013-01-03 10:29:20


On Wed, Jan 2, 2013 at 3:46 PM, Szymon Wojciechowski <sw10_at_[hidden]>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 <
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2101.html#tr.hierarchy.augment>
and the half dozen other augmented tree implementations that have appeared
in the Boost list? (one as recent as last year).

-- 
-- 
-- Grafik - Don't Assume Anything
-- Redshift Software, Inc. - http://redshift-software.com
-- rrivera/acm.org - grafik/redshift-software.com
-- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk