Question

I need a container that gives me a fast indexer and can also be very efficiency in arbitrary insertion and deletion operations (meaning at any position of the container).

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

Thank you kindly.

Answer 1

You may be looking for some sort of hash map, like boost::unordered_map (soon to be in the C++ standard). There are plenty of other hash implementations out there.