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

On 14-09-2015 13:20, Francisco José Tapia wrote:

You have these characteristic in the Countertree library ( https://github.com/fjtapia/countertree_2.0)

You have Random access iterators with access time O(logN) ( you can run a std::sort over the data structure with good results).

Does this imply an O( N lg N lg N ) sort running time? -Thorsten