Subject: Re: [boost] [move][container] Review Request (new versions of Boost.Move and Boost.Container in sandbox and vault)
From: Gottlob Frege (gottlobfrege_at_[hidden])
Date: 2009-08-24 12:05:27
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
>> stable_vector? (Sorry I haven't dug into the code yet to find out - I
>> it would be nice to mention it in the docs, even if the implementation is
>> suppose to be hidden and separate from the requirements.)
> Joaquín wrote the original stable_vector, read hits post:
> 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.
Any thoughts (from anyone?) on my comments about making flat_map's iterators
stable? Then it would be a complete replacement to std::map.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk