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: Glen Fernandes (glen.fernandes_at_[hidden])
Date: 2015-09-11 19:10:36

On Fri, Sep 11, 2015 at 6:10 AM, Chris Clearwater wrote:
> Greetings,
>
> I have written a library with the intention of submitting it to
> Boost.Container. My container implements O(log n) random access insert/erase
> and has a strong focus on performance while supporting the interfaces of the
> standard library sequence types. An example application would be the
> character buffer of a text editor.
>
> Useful links:
>  - Source code: https://github.com/det/segmented_tree_seq
>  - Documentation: http://det.github.io/segmented_tree_seq/
>  - Benchmarks: https://github.com/det/segmented_tree_seq/tree/benchmarks
>
> Any feedback is greatly appreciated.

The benchmarks are impressive. I hope to take a deeper look this
weekend, but from my cursory glance: the implementation looks very
clean too.

Ion: Is this something you would be interested in reviewing?

Glen