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

Subject: Re: [boost] Determining interest in container with efficient random access insert and erase
From: Thorsten Ottosen (tottosen_at_[hidden])
Date: 2015-09-14 09:13:29

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