Re: [boost] Determining interest in container with efficient random access insert and erase

Rene Rivera writes:

I say that because I was trying to figure out how your container attains the O9log n) you claim. And AFAICT, because of this < https://github.com/det/segmented_tree_seq/ blob/master/include/boost/container/segmented_tree_seq.hpp#L1278>, that your container is just another implementation of an order statistic tree https://en.wikipedia.org/wiki/Order_statistic_tree. Which is a data structure that has been proposed for Boost (and standardization) at various times.

FWIW, as of Boost 1.59 Boost.MultiIndex sports ranked indices: http://www.boost.org/doc/libs/1_59_0/libs/multi_index/doc/tutorial/indices.h... whose inplementation is basically an order statistic tree. Joaquín M López Muñoz Telefónica