Re: [boost] [Containers] Complexity of flat_*::insert(first,last)

Subject: Re: [boost] [Containers] Complexity of flat_*::insert(first,last)
From: Phil Endecott (spam_from_boost_dev_at_[hidden])
Date: 2011-08-04 13:29:30

Hi John,

John Bytheway wrote:
> No; the existing complexity is better.  Let S=size() and N=aS.  You have
>
> N log(S+N)

Sorry, I'm lost already.  What is N log(S+N) supposed to be the 
complexity of?

Regards,  Phil.