Re: [boost] Boost.Bimap - Informal Review Request

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
>> counterpart?
>
> 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:
>
> http://cablemodem.fibertel.com.ar/mcape/boost/libs/bimap/boost_bimap/reference/bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature
>

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 :-)

John.