Question

so my applications has containers with 100 million and more elements.

I’m on the hunt for a container which behaves – time-wise – better than std::deque (let alone std::vector) with respect to frequent insertions and deletions all over the container … including near the middle. Access time to the n-th element does not need to be as fast as vector, but should definetely be better than full traversal like in std::list (which has a huge memory overhead per element anyway).

Elements should be treated ordered by index (like vector, deque, list), so std::set or std::unordered_set also do not work well.

Before I sit down and code such a container myself: has anyone seen such a beast already? I’m pretty sure the STL hasn’t anything like this, looking to BOOST I did not find something I could use but I may be wrong.

Any hints?

Answer 1

I think you can get the performance characteristics that you want with a skip list:

https://en.wikipedia.org/wiki/Skip_list#Indexable_skiplist

It’s the “indexable” part that you’re interested in, of course — you don’t actually want the items to be sorted. So some modification is needed that I leave as an exercise.

You might find that 100 million list nodes begins to strain a 32 bit address space, but probably not an issue in 64 bits.