From: John Maddock (john_at_[hidden])
Date: 2006-08-10 12:16:54
Matias Capeletto wrote:
>> * Complexity differences:
>> What are the differences in complexity compared to the std
> Again, the main change is in the insertion functions. But the
> complexity of deletion or modifying is affected too. But as Joaquin
> explained this is because we have to update each view.
> The important thing is that you get the look up complexity guarantee
> equal to the standard containers.
>> However, looking at the reference docs for the list view, I'm
>> confused, for example what is:
>> O(I(n)) ?
> Look at Joaquin post first and then read:
Understood. Perhaps you could link the complexity guarentees to the
explanation? Should just be a regex search and replace job, and it would
save a lot of folks asking the same question :-)
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk