Absolute fastest container to lookup names

Names are std::string no more than 3 characters in length. What built in container or boost container is fastest at finding a name (Key) in it's container.

Finding a name.
At the name will be a value double.

I need the most efficient at finding and finding/updating the value. Forget out inserts and deletes.

What's the range of those characters? If they aren't full Unicode wide characters, you could simply make a 3D array (boost.multi_array) or a 1D vector indexed with [c1*range*range + c2*range + c3]
I'd imagine std::unordered_map or std::map
Topic archived. No new replies allowed.