Enjoyment of both worlds: vector insert / erase list efficiency

Question

I need a container that gives me a quick indexer, and can also be very effective with any insert and delete actions (which means at any position of the container).

I remember reading about a container that uses buckets, but I can’t find it or repeat the steps that lead me to it (I will start using bookmarks, I promise!)

Thank you.

Answer 1

Perhaps you are looking for some kind of hash map, for example boost::unordered_map(soon it will be in the C ++ standard). There are many other hash implementations.

Answer 2

std:: deque, std:: list ( ) , , . "" . , - , .

Answer 3

, , map < > ( ).

-. -, .

I still want me to be able to find an efficient vector / list hybrid that is O (1) in random access and at least O (log N) in erase / insert.