Re: [boost] [move][container] Review Request (new versions of Boost.Move and Boost.Container in sandbox and vault)

Subject: Re: [boost] [move][container] Review Request (new versions of Boost.Move and Boost.Container in sandbox and vault)
From: Ion Gaztañaga (igaztanaga_at_[hidden])
Date: 2009-08-24 12:31:04

Gottlob Frege escribió:
> 2009/8/24 Ion Gaztañaga <igaztanaga_at_[hidden]>
> 
>> Gottlob Frege escribió:
>>
>>> Is stable_vector somewhat similar to that?  Or what is the data structure
>>> of
>>> stable_vector?  (Sorry I haven't dug into the code yet to find out - I
>>> think
>>> it would be nice to mention it in the docs, even if the implementation is
>>> suppose to be hidden and separate from the requirements.)
>>> Tony
>>>
>> Joaquín wrote the original stable_vector, read hits post:
>>
>> http://bannalia.blogspot.com/2008/09/introducing-stablevector.html
>>
>> the internal structure is a vector of pointers pointing to heap-allocated
>> nodes. The advantage is that iterator are stable (it's a node-based
>> container) and you get random-access using the auxiliar pointer array.
>>
>> Best,
>>
>> Ion
>>
> Any thoughts (from anyone?) on my comments about making flat_map's iterators
> stable?  Then it would be a complete replacement to std::map.
> Tony

Making flat_xxx a template adaptor (like stack or similar) and using 
stable_vector as the underlying type would make flat_stable_vector a 
replacement for std::map.

Best,

Ion