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: Chris Clearwater (chris_at_[hidden])
Date: 2015-09-11 19:10:40

On 09/11/2015 08:02 AM, Christian N. wrote:
>
> Since I haven't found documentation on how this is implemented I have 
> to ask: Is this "segmented tree" a rope[1, 2]? Usabele for text editor 
> and log(n) inserts and erase seem to fit that guess :-).
>
> [1]: https://en.wikipedia.org/wiki/Rope_%28data_structure%29
> [2]: 
> http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.14.9450&rep=rep1&type=pdf
>
My container is implemented using a counted B+Tree, it is not a 
persistent data structure like a Rope. It is intended for the fastest 
possible destructive random access updates.