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

On 09/14/2015 04:56 AM, Chris Clearwater wrote:

I wonder too how you get constant time push_back/push_front when such an operation requires updating log(n) branch nodes in a typical counted tree implementation.

My mistake, you don't make this claim.