"Rahul Sr" <srivasrrahul@gmail.com> pisze:
Will it be like this? http://stackoverflow.com/questions/11230734/c-stl-order-statistic-tree
http://www.opensource.apple.com/source/llvmgcc42/llvmgcc42-2336.9/libstdc++-...
Regards, Rahul
You are right. Although I haven't implemented it with policies, this is the same data structure as I thought. Best regards, Szymon Wojciechowski
On Thu, Jan 3, 2013 at 8:59 PM, Rene Rivera wrote:
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 <
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2101.html#tr.hierar...
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
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost