2009/8/24 Ion Gaztañaga <igaztanaga@gmail.com>
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