On Thu, Jan 3, 2013 at 7:46 AM, Szymon Wojciechowski <sw10@interia.pl>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?
Yes, I am interested. What kind of tree did you implement? Did you measured performance of basic container operations and compared with the standard set and/or multiset? Regards, Vadim Stadnik