
15 Sep
2008
15 Sep
'08
10:39 a.m.
joaquin@tid.es skrev:
Thorsten Ottosen escribió:
class stable_vector { unordered_map<index,segment> data; };
The structure you describe is AFAICS equivalent to the usual implementation of std::queue (http://tinyurl.com/68l9e7 ), except that std::queue uses an array for data instead of an unordered_map. So, I don't see how one could provide stability for middle insertions.
You're right: that requires a segment size of 1. Damn. -Thorsten